Name
Abstract | ||
|---|---|---|
Redundancy may exist in the processing of recursive database queries at four different levels precompilation level, iteration level, tuple processing level and file accessing level. Techniques for reducing redundant work at each level are studied. In the precompilation level, the optimization techniques include removing redundant parts in a rule cluster, simplifying recursive clusters and sharing common subexpressions among rules. At the iteration level, the techniques discussed are the use of frontier relations and the counting method. At the tuple processing level, we use merging and filtering methods to exclude processed drivers from database reaccessing. Finally, at the file accessing level, I/O cost can be further reduced by level relaxation. We conclude that even for complex recursion, redundant database processing can be considerably reduced or eliminated by developing appropriate algorithms. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1145/38713.38727 | SIGMOD Conference |
Field | DocType | Volume |
Cluster (physics),Data mining,Tuple,Computer science,Filter (signal processing),Theoretical computer science,Redundancy (engineering),Merge (version control),Recursion,Database | Conference | 16 |
Issue | ISSN | ISBN |
3 | 0163-5808 | 0-89791-236-5 |
Citations | PageRank | References |
29 | 16.42 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiawei Han | 1 | 43085 | 3824.48 |
| Lawrence J. Henschen | 2 | 478 | 280.94 |