Query optimization for sequential execution of non-recursive queries has reached a high level of sophistication in commercial DBMS. The successful application of parallel processing for the evaluation of recursive queries will require a query optimizer of comparable sophistication. The groundwork for creating this new breed of query optimizer will consist of a combination of theoretical insight and empirical investigation. Restricting our attention to linear recursive queries, we illustrate this process by developing a family of query processing strategies and, through experiments on a parallel computer, obtaining the basic information needed for an optimizer's heuristics. 1
|
936
|
Principles of Database and Knowledge-Base Systems, Volume 1
– Ullman
- 1988
|
|
193
|
The universality of data retrieval languages
– Aho, Ullman
- 1979
|
|
186
|
An amateur's introduction to recursive query processing strategies
– Bancilhon, Ramakrishnan
- 1989
|
|
157
|
The Design and Analysis of Parallel Algorithms
– Akl
- 1989
|
|
79
|
Optimizing datalog programs
– SAGIV
- 1988
|
|
78
|
The Art of Computer Programming: Sorting and Searching, volume 3
– Knuth
- 1973
|
|
62
|
A Taxonomy and Performance Model of Data Skew Effects
– Walton, Dale, et al.
- 1991
|
|
56
|
Alfia: An Extension of Relational Algebra to Express a Class of Recmive Queries
– Agrawal
- 1988
|
|
39
|
Direct transitive closure algorithms: Design and performance evaluation
– Agrawal, Dar, et al.
- 1990
|
|
39
|
Multiprocessor transitive closure algorithms
– Agrawal, Jagadish
- 1989
|
|
37
|
Bucket Spreading Parallel Hash: A New, Robust, Parallel Hash Join Method for Data Skew
– Kitsuregawa, Ogawa
- 1990
|
|
28
|
A study of transitive closure as a recursion mechanism
– Jagadish, Agrawal, et al.
- 1987
|
|
23
|
Expressiveness of restricted recursive queries
– Afrati, Cosmodakis
- 1989
|
|
21
|
Evaluation of recursive queries using join indices
– Valduriez, Boral
- 1986
|
|
21
|
Parallel evaluation of the transitive closure of a database relation
– Valduriez, Khoshafian
- 1988
|
|
20
|
Estimating the size of generalized transitive closures
– Lipton, Naughton
- 1989
|
|
18
|
Towards an algebraic theory of recursion
– Ioannidis, Wong
|
|
17
|
A Performance Study of Transitive Closure Algorithms
– Dar, Ramakirishnan
- 1994
|
|
11
|
Why a single parallelization strategy is not enough in knowledge bases
– Cohen, Wolfson
- 1989
|
|
10
|
One-sided recursions
– Naughton
- 1987
|
|
10
|
A Parallel Sort Merge Join Algorithm for Managing Data Skew
– Wolf, Dias, et al.
- 1993
|
|
9
|
An Overview of Parallel Strategies for Transitive Closure on Algebraic Machines
– Cacace, Ceri, et al.
- 1990
|
|
5
|
Transitive Closure of Transitively Closed Relations
– Valduriez, Khoshafian
- 1988
|
|
4
|
Data Skew and the Scalability of Parallel Joins
– Walton, Dale
- 1991
|
|
3
|
Classification and Compilation of Linear Recursive Queries in Deductive Databases
– Youn, Kim, et al.
- 1992
|
|
2
|
Processing Linear Recursive Database Queries on the Connection Machine
– Zurek, Thanisch
- 1993
|
|
2
|
A Parallel Transitive Closure Algorithm for SIMD Meshes
– Zhou, Zhang, et al.
- 1993
|
|
1
|
An Algorithm for a Data Parallel Hash Join on the Connection Machine
– Minty
- 1993
|
|
