Proceedings Article10.1109/ICDE.1989.47237
Synchronized counting method
H. Aly,Z.M. Ozsoyoglu +1 more
- 06 Feb 1989
- pp 366-373
18
TL;DR: A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations and is shown to be sound and complete, and a comparison with other methods in the literature is included.
read more
Abstract: A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n/sup 2/ semijoin operations are required, where n is the number of nodes in the graph representing the relevant part of the input relations. The algorithm is shown to be sound and complete, and a comparison with other methods in the literature is included. >
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
Synchronized counting method
H. Aly,Z.M. Ozsoyoglu +1 more
- 06 Feb 1989
TL;DR: A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations and is shown to be sound and complete, and a comparison with other methods in the literature is included.
18
The Level-Cycle Merging Method.
Jiawei Han,Lawrence J. Henschen +1 more
- 01 Jan 1989
TL;DR: Level-Cycle Merging (LCM) as discussed by the authors is an extension of the counting method to process linear recursive queries in both cyclic and acyclic databases, which precompiles databases to extract self level-cycle information, uses levelcycle sets to register level recurrence sequences in both up-chain and down-chain processing, and extracts answers by level matching analysis.
15
The Level-Cycle Merging Method
Jiawei Han,Lawrence J. Henschen +1 more
- 01 Jan 1990
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.
14
Optimization of Linear Logic Programs Using Counting Methods
Sergio Greco,Carlo Zaniolo +1 more
- 23 Mar 1992
TL;DR: A simple and unified framework is presented, where limitations of the classical counting method are removed, and the counting method thus become applicable to all programs with linear rules.
13
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.
References
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.
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
Handling redundancy in the processing of recursive database queries
Jiawei Han,Lawrence J. Henschen +1 more
- 01 Dec 1987
TL;DR: It is concluded that even for complex recursion, redundant database processing can be considerably reduced or eliminated by developing appropriate algorithms.
38
Counting methods for cyclic relations
Ramsey W. Haddad,Jeffrey F. Naughton +1 more
- 01 Mar 1988
TL;DR: An algorithm is presented in the spirit of counting methods that correctly deals with cyclic data and has the same asymptotic running time as counting methods.
37