J. D. Ullman
ABSTRACT
We show that for any safe datalog program P1 and any query Q (predicate of P1 with some bound arguments), there is another safe datalog program P2 that produces the answer to Q and takes no more time when evaluated by semi-naive evaluation than when P1 is evaluated topdown.
- Beeri, C. and R. Ramakrishnan {1987}. "On the power of magic," Proc. Sixth A CM Symposium on Principles of Database Systems, pp. 269-283. Google Scholar
Digital Library
- Dietrich, S. W. {1987}. "Extension tables: memo relations in logic programming," Proc. IEEE Syrup. on Logic Programming, pp. 264-272.Google Scholar
- Lozinskii, E. L. {1985}. "Evaluating queries in a deductive database by generating," Proc. Ninth ICJAI, pp. 173-177.Google Scholar
- McKay, D. and S. Shapiro {1981}. "Using active connection graphs to reason with recursive rules," Proc. Seventh IJCAI, pp. 368-374.Google Scholar
- Neiman, V. S. {1986}. "Deduction search with single consideration of subgoals," Dokl. Akad. Nauk SSSR, pp. 251-254.Google Scholar
- Pereira, F. C. N. and D. H. D. Warren {1983}. "Parsing as deduction," Proc. Twenty-first Annl. Meeting of the Google ScholarDigital Library
- Assn. for Computational Linguistics, pp. 137-144. Porter, H. H. Ill {1986}. "Earley deduction," TR CS/E- 86-002, Oregon Grad. Center, Beaverton, OR.Google Scholar
- Ramakrishnan, R. {1988}. "Magic templates: a spellbinding approach to logic programs," Proc. Fifth Intl. Syrup. on Logic Programming, pp. 140-159.Google Scholar
- Seki, H. {1988}. "On the power of continuation passing, Part I" an analysis of recursive query processing methods," unpublished manuscript, ICOT, Tokyo.Google Scholar
- Tamaki H. and T. Sato {1086}. "OLD resolution with tabulation," Proc. Third Intl. Conf. on Logic Programming, pp. 84-98. Google ScholarDigital Library
- Ullman, 3. D. {1985}. "Implementation of logical query languages for databases," A CM Trans. on Database Systems 10:3, pp. 289-321. Google ScholarDigital Library
- Ullman, }. D. {1088}. Principles of Database and Knowledge-Base Systems, Volume I, Gomputer Science Press, Rockville, Md. Google ScholarDigital Library
- Ullman, 3. D. {1980}. Principles of Database and Knowledge-Base Systems, Volume Ii, Computer Science Press, Rockville, Md. Google ScholarDigital Library
- Van Gelder, A. {1086}. "A message-passing framework for logical query evaluation," ACM SIGMOD International Conf. on Management of Data, pp. 155-165. Google ScholarDigital Library
- Vielle, L. {1087}. "Recursive axioms in deductive databases: the query/subquery approach," in Kerschberg, L. (ed.) Expert Database Systems, Benjamin- Cummings, Menlo Park, CA, pp. 253-268.Google Scholar
- Vielle, L. {1988}. "From QSQ towards QoSaQ: global optimization of recursive queries," Proc. Second Intl. Con~ on Expert Database Systems.Google Scholar
Index Terms
- Bottom-up beats top-down for datalog
Recommendations
Hybrid top-down and bottom-up interprocedural analysis
PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and ImplementationInterprocedural static analyses are broadly classified into top-down and bottom-up, depending upon how they compute, instantiate, and reuse procedure summaries. Both kinds of analyses are challenging to scale: top-down analyses are hindered by ...
Precise complexity analysis for efficient datalog queries
PPDP '10: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programmingGiven a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answering the query, top-down evaluation is extended with tabling that stores ...
More efficient datalog queries: subsumptive tabling beats magic sets
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of dataGiven a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. The dominant strategies to improve the performance of answering queries are reusing answers to ...
Comments