Projection pushing revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2992, Issue , 2004, Pages 441-458

  McMahan, Benjamin J ^a   Pan, Guoqiang ^a   Porter, Patrick ^b   Vardi, Moshe Y ^a  

^a Rice University   (United States)

^b Scalable Software ^*

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; DATABASE SYSTEMS; OPTIMIZATION; QUERY LANGUAGES; STRUCTURAL OPTIMIZATION; TREES (MATHEMATICS);

BUCKET ELIMINATIONS; CONSTRAINT SATISFACTION; INTERMEDIATE RESULTS; MINIMIZING THE NUMBER OF; QUERY EVALUATION; QUERY EXECUTION TIME; QUERY OPTIMIZATION; STRUCTURAL TECHNIQUES;

QUERY PROCESSING;

EID: 35048829862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_26     Document Type: Article

References (36)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of databases. Addison-Wesley, 1995.
2. A. Aho, Y. Sagiv, and J.D. Ullman. Efficient optimization of a class of relational expressions. ACM Trans, on Database Systems, 4:435-454,1979.
3. A. Aho, Y. Sagiv, and J.D. Ullman. Equivalence of relational expressions. SIAM Journal on Computing, 8:218-246,1979.
4. P. Apers, A. Hevner, and S. Yao. Optimization algorithms for distributed queries. IEEE Trans. Software Engineering, 9(l):57-68,1983.
5. Arnborg, Comeil, and Proskurowski. Complexity of finding embeddings in a k-tree. SIAM Journal of Algebraic and Discrete Methods, 8(2):277-284, 1987.
6. H.L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-21,1993.
7. F. Bouquet. Gestion de la dynamicité et énumération d'implicants premiers: une approche fondée sur les Diagrammes de Décision Binaire. PhD thesis, Université de Provence, France, 1999.
8. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th ACM Symp. on Theory of Computing, pages 77-90.-1977.
9. P. Chauhan, E.M. Clarke, S. Jha, J.H. Kukula, H. Veith, and Dong Wang. Using combinatorial optimization methods for quantification scheduling. In Proc. 11th Conf. on Correct Hardware Design and Verification Methods, pages 293-309,2001.
10. C. Chekuri and A. Ramajaran. Conjunctive query containment revisited. Technical report, Stanford University, November 1998.
11. V. Dalmau, P.G. Kolaitis, and M.Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Proc. Principles and Practice of Constraint Programming (CP '2002), pages 311-326,2002.
12. R. Dechter. Mini-buckets: A general scheme for generating approximations in automated reasoning. In International Joint Conference on Artificial Intelligence, pages 1297-1303, 1997.
13. R. Dechter. Bucket elimination: a unifying framework for reasoning. Artificial Intelligence, 113(1-2):41-85,1999.
14. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
15. R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1-38,1987.
16. R.G. Downey and M.R. Fellows. Parametrized Complexity. Springer-Verlag, 1999.
17. E.C Freuder. Complexity of k-tree structured constraint satisfaction problems. In Proc. AAAI-90, pages 4-9,1990.
18. J.C. Freytag. A rule-based view of query optimization. In Proceedings of the 1987 ACM SIGMOD international conference on Management of data, pages 173-180, 1987.
19. H. Garcia-Molina, J.D. Ullman, and J. Widom. Database System Implementation. Prentice Hall, 2000.
20. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
21. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Proc. 18th ACM Symp. on Principles of Database Systems, pages 21-32, 1999.
22. P.P. Griffiths, M.M. Astrahan, D.D. Chamberlin, R.A. Lone, and T.G. Price. Access path selection in a relational database management system. In ACM SIGMOD International Conference on Management of Data, pages 23-34, 1979.
23. A. Halevy. Answering queries using views: A survey. VLDB Journal, pages 270-294, 2001.
24. R. Hojati, S. C. Krishnan, and R. K. Brayton. Early quantification and partitioned transition relations. In Proc. 1996 Int'l Conf. on Computer Design, pages 12-19,1996.
25. Y. Ioannidis and E. Wong. Query optimization by simulated annealing. In ACM SIGMOD International Conference on Management of Data, pages 9-22,1987.
26. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, pages 302-332, 2000. Earlier version in: Proc. 17th ACM Symp. on Principles of Database Systems (PODS '98).
27. I.K. Kunen and D. Suciu. A scalable algorithm for query minimization. Technical report, University of Washington, 2002.
28. R. Ramakrishnan, C. Beeri, and R. Krishnamurthi. Optimizing existential datalog queries. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 89-102, 1988.
29. I. Rish and R. Dechter. Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning, 24(l/2):225-275, 2000.
30. A. San Miguel Aguirre and M.Y. Vardi. Random 3-SAT and BDDs - the plot thickens further. In Proc. Principles and Practice of Constraint Programming (CP'2001), pages 121-136, 2001.
31. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to tests chordality of graphs, tests acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. on Computing, 13(3):566-579,1984.
32. J. D. Ullman. Database and Knowledge-Base Systems, Volumes I and II. Computer Science Press, 1989.
33. M.Y. Vardi. On the complexity of bounded-variable queries. In Proc. 14th ACM Symp. on Principles of Database Systems, pages 266-276,1995.
34. E. Wong and K. Youssefi. Decomposition - a strategy for query processing. ACM Trans, on Database Systems, 1(3):223-241, 1976.
35. M. Yannakakis. Algorithms for acyclic database schemes. InProc. 7Int'l Conf. on Very Large Data Bases, pages 82-94,1981.
36. R. Yemeni, C. Li, J.D. Ullman, and H. Garcia-Molina. Optimizing large join queries in mediation systems. Lecture Notes in Computer Science, 1540:348-364, 1999.