A study of optimization and Rule/Goal Graph for a logical query
- 18 Downloads
Static optimization of logical queries is, in substance, to move selections down as far as possible in evaluating logical queries. This paper extends Ullman's RGG (Rule/Goal Graph) and introduces P-graph, with which a wide range of recursive logical queries can be statically optimized top-down and evaluated bottom-up, some of which are usually optimized by dynamic approaches. The paper also shows that for some logical queries the complexity of pushing selections down and computing bottom-up is related to the complexity of base relation in the queries.
KeywordsCompatible Condition Sequential Machine Logical Query State Subset Recursive Rule
Unable to display preview. Download preview PDF.
- Agawal R. and Devonbu, Moving selections into linear fixpoint queries. IEEE Proc. 4th Int. Conf. Data Engineering Los Angeles, 1988, 452–461.Google Scholar
- Aho A. V. and Ullman J. D., Universality of data retrieval languages. Proc. 6th ACM Symp. Principle of Programming Languages, 1979, 110–120.Google Scholar
- Bancilhon F. and Ramakrishman R., An amateur's introduction to recursive query processing strategies. InA Reading in Database Systems, Ed. by M. Stonebraker, 1988.Google Scholar
- Gallaire H. and Minker J., Logic and Database. 1978.Google Scholar
- Kifer M. and Lozinskii E. L., SYGRAF: Implementing logic programs in a database style.IEEE Trans. on Software Engineering, 1988, 14(7).Google Scholar
- Ullman J. D., Principle of Database Systems. 2nd edition, Computer Science Press, 1982.Google Scholar
- Ullman J. D., Parinciple of Database System and Knowledge Base System. Vol. II. Computer Science Press, 1989.Google Scholar
- Guntzer U. and Bayer W. K. A. R., On evaluation of recursions in deductive database systems by differential fixpoint iteration. IEEE Proc. 3rd Int. Conf. Data Engineering, 1987, 120–129.Google Scholar