Generalized recursive data structures
โ Scribed by Warren Burton
- Publisher
- Springer-Verlag
- Year
- 1979
- Tongue
- English
- Weight
- 594 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A fundamental problem in parallel computing is partitioning data structures in such a way as to minimize communication between processes while keeping the loads balanced. The problem is particularly acute when the underlying data structures are irregular, pointer-based structures. Here we present a
Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r.e. Here we generalize this to arbitrary levels in Ershov's hierarchy of A: sets, giving conditions under which a relation is intrinsically a-r. e.
We consider infinite recursive (i.e., computable) relational data bases. Since the set of computable queries on such data bases is not closed under even simple relational operations, one must either make do with a very modest class of queries or considerably restrict the class of allowed data bases.
Generating query-answering plans for data integration systems requires to translate a user query, formulated in terms of a mediated schema, to a query that uses relations that are actually stored in data sources. Previous solutions to the translation problem produced sets of conjunctive plans, and w