Book Chapter10.1016/B978-0-444-88433-6.50012-5
The Level-Cycle Merging Method
Jiawei Han,Lawrence J. Henschen +1 more
- 01 Jan 1990
- pp 65-81
14
TL;DR: Level-Cycle Merging method is an extension of the counting method to process linear recursive queries in both cyclic and acyclic databases and shows that it compares favorably with other recently developed cyclic counting techniques.
read more
Abstract: Counting method is an efficient algorithm in the processing of linear recursive queries in acyclic databases. Level-Cycle Merging (LCM) method is an extension of the counting method to process linear recursive queries in both cyclic and acyclic databases. The method precompiles databases to extract self level-cycle information, uses level-cycle sets to register level recurrence sequences in both up-chain and down-chain processing, and extracts answers by level matching analysis. To improve performance, golden cycle optimization is also proposed. Our analysis shows that the method has the same asymptotic running time as the counting method and a reasonable cost on EDB compilation and updates. Our study shows that Level-Cycle Merging compares favorably with other recently developed cyclic counting techniques.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On the graph traversal and linear binary-chain programs
TL;DR: A new algorithm which requires less time and achieves a linear time complexity for both acyclic and cyclic data by generating most answers directly in terms of the answers already found and the associated "path information" instead of traversing the corresponding paths as usual.
Chain-split evaluation in deductive databases
TL;DR: This study shows that chain-split evaluation is a primitive recursive query Evaluation technique for different kinds of recursions, and it can be implemented efficiently in deductive databases by extensions to the existing recursive query evaluation methods.
8
An optimal graph traversal algorithm for evaluating linear binary-chain programs
Yangjun Chen,Theo Härder +1 more
- 29 Nov 1994
TL;DR: A new algorithm is described which requires less time than the algorithm of Grahne et al. and achieves a linear time complexity for both cyclic and non-cyclic data.
6
Chain-split evaluation in deductive databases
Jiawei Han
- 03 Feb 1992
TL;DR: Three chain-split evaluation techniques: magic sets, buffered evaluation, and partial evaluation, are developed and the first one is applicable to the evaluation of function-free recursions.
6
A study on the structure of linear recursion
Wenyu Lu,Dik Lun Lee,Jiawei Han +2 more
- 01 Oct 1994
TL;DR: It is concluded that a single linear recursion under the authors' assumptions either is bounded or can be expressed as chain recursions.
4
References
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
6.9K
An amateur's introduction to recursive query processing strategies
François Bancilhon,Raghu Ramakrishnan +1 more
- 15 Jun 1986
TL;DR: In this article, the authors present a survey and comparison of various strategies for processing logic queries in relational databases, focusing on Horn Clauses with evaluable predicates but without function symbols.
Magic sets and other strange ways to implement logic programs (extended abstract)
François Bancilhon,David Maier,Yehoshua Sagiv,Jeffrey D. Ullman +3 more
- 01 Jun 1985
TL;DR: Several methods for implementing database queries expressed as logical rules are given and they are compared for efficiency as mentioned in this paper, and one method, called "magic sets", is a general algorithm for rewriting logical rules so that they may be implemented bottom-UP in a way that cuts down on the irrelevant facts that are generated.
545
On compiling queries in recursive first-order databases
TL;DR: The solution uses resolution-proof techmques over connection graphs to derive a program of relational database operations that gives all the answers to a query and has a welldefined termmatton condiUon.
316
Related Papers (5)
H. Aly,Z.M. Ozsoyoglu +1 more
- 06 Feb 1989
François Bancilhon,Raghu Ramakrishnan +1 more
- 15 Jun 1986