Title :
Synchronized counting method
Author :
Aly, Hussien ; Ozsoyoglu, Z. Meral
Author_Institution :
Dept. of Comput. Eng. & Sci., Case Western Reserve Univ., Cleveland, OH, USA
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 n2 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
Keywords :
Petri nets; database management systems; database theory; synchronisation; Petri net model; acyclic relations; counting method; cyclic relations; graph; input relations; recursive queries; semijoin operations; synchronized counting method; worst case analysis; Deductive databases; Government; Logic; Scholarships; Terminology;
Conference_Titel :
Data Engineering, 1989. Proceedings. Fifth International Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
0-8186-1915-5
DOI :
10.1109/ICDE.1989.47237
