DocumentCode :
2277198
Title :
A bottom-up query evaluation method for stratified databases
Author :
Chen, Yangjun
Author_Institution :
Dept. of Comput. Sci., Kaiserlautern Univ., Germany
fYear :
1993
fDate :
19-23 Apr 1993
Firstpage :
568
Lastpage :
575
Abstract :
A labeling algorithm for stratified databases is presented. The algorithm that is performed prior to the magic-set algorithm can be used to distinguish the context for constructing magic sets. It is shown that the culprit cycles cause the destratification of a database. Based on this analysis, three subprocedures are developed to remove the different kinds of culprit cycles. The negnumber procedure numbers the different occurrences of a negative literal in a rule. The dynlabel procedure gives each negative body literal a dynamic subscript when it appears in a recursive rule. The label procedure labels each body literal p when there exists a sequence of paths connecting it to a negative body literal-q in the same rule, or a sequence of paths with at least one path being negative connecting it to a positive body literal q in the same rule and there is an arc of the form Nr in the sideways information-passing strategy (SIPS) such that qN and p=r
Keywords :
database management systems; database theory; query processing; recursive functions; bottom-up query evaluation method; culprit cycles; destratification; dynamic subscript; dynlabel procedure; labeling algorithm; magic-set algorithm; negative literal; negnumber procedure; positive body literal; recursive rule; rule; sideways information-passing strategy; stratified databases; subprocedures; Algorithm design and analysis; Computer science; Deductive databases; Labeling; Query processing; Relational databases; Termination of employment;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering, 1993. Proceedings. Ninth International Conference on
Conference_Location :
Vienna
Print_ISBN :
0-8186-3570-3
Type :
conf
DOI :
10.1109/ICDE.1993.344023
Filename :
344023
Link To Document :
بازگشت