Full Disjunctions: Polynomial-Delay Iterators in Action

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 739-750

  Cohen, Sara ^a   Fadida, Itzhak ^a   Kanza, Yaron ^b   Kimelfeld, Benny ^c   Sagiv, Yehoshua ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NUMBER; BICONNECTED COMPONENTS; ITERATOR; OPTIMISATIONS; POLYNOMIAL DELAYS; PROCESSING APPLICATIONS; RUNTIMES; STATE OF THE ART; WEB APPLICATION; WEB APPLICATIONS;

EID: 33947325356     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, 1977.
2. S. Cohen and Y. Sagiv. An incremental algorithm for computing ranked full disjunctions. In PODS, 2005.
3. T. Corman, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
4. C. J. Date. The outer join. In ICOD, 1983.
5. C. J. Date. Relational Database: Selected Writings. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1986.
6. R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM, 30(3), 1983.
7. C. Galindo-Legaria. Outerjoins as disjunctions. In SIGMOD, 1994.
8. C. A. Galindo-Legaria and A. Rosenthal. How to extend a conventional optimizer to handle one- and two-sided outerjoin. In ICDE, 1992.
9. C. A. Galindo-Legaria and A. Rosenthal. Outerjoin simplification and reordering for query optimization. ACM Trans. Database Systems., 22(1), 1997.
10. H. Garcia-Molina, J. D. Ullman, and J. Widom. “Database Systems—The Complete Book”. Prentice Hall, 2002.
11. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27, March 1988.
12. Y. Kanza and Y. Sagiv. Computing full disjunctions. In PODS, 2003.
13. A. Rajaraman and J. D. Ullman. Integrating information by outerjoins and full disjunctions. In PODS, 1996.
14. J. Rao, H. Pirahesh, and C. Zuzarte. Canonical abstraction for outerjoin optimization. In SIGMOD, 2004.
15. A. Rosenthal and C. A. Galindo-Legaria. Query graphs, implementing trees, and freely-reorderable outerjoins. In SIGMOD, 1990.