Scalable computation of acyclic joins

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 225-232

  Pagh, Anna ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Acyclic join; Algorithm; External memory; Relational algebra

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER GRAPHICS; DATA REDUCTION; DATABASE SYSTEMS;

ACYCLIC JOIN; EXTERNAL MEMORY; RELATIONAL ALGEBRA; TRACTABLE;

SCALABILITY;

EID: 34250657699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142384     Document Type: Conference Paper

References (16)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Comm. ACM, 31(9):1116-1127, 1988.
2. I. Baran, E. D. Demaine, and M. Patrascu. Subquadratic algorithms for 3SUM. In Proceedings of WADS, volume 3608 of Lecture Notes in Computer Science, pages 409-421, 2005.
3. E. F. Codd. A relational model of data for large shared data banks. Comm. of the ACM, 13(6):377-387, 1970.
4. A. Dobra, M. Garofalakis, J. Gehrke, and R. Rastogi. Processing complex aggregate queries over data streams. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 61-72. ACM Press, 2002.
5. J. M. Hellerstein and M. Stonebraker. Readings in Database Systems. MIT Press, 4th edition, 2005.
6. T. Ibaraki and T. Kameda. On the optimal nesting for computing N-relational joins. A CM Transactions on Database Systems, 9(3):482-502, 1984.
7. Y. E Ioannidis. Query optimization. In Computer Science Handbook, Second Edition, chapter 55. Chapman & Hall/CRC, 2004.
8. Y. E. Ioannidis and S. Christodoulakis. On the propagation of errors in the size of join results. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 268-277, 1991.
9. Y. E. Ioannidis and Y. C. Kang. Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 168-177. ACM Press, 1991.
10. D. Maier, Y. Sagiv, and M. Yannakakis. On the complexity of testing implications of functional and join dependencies. J. Assoc. Comput. Mach., 28(4):680-695, 1981.
11. S. Pramanik and D. Vineyard. Optimizing join queries in distributed databases. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 287 of Lecture Notes in Computer Science, pages 282-304. Springer, 1987.
12. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 23-34. ACM Press, 1979.
13. J. D. Ullman. Principles of Database and Knowledge-based Systems, volume 2. Computer Science Press, 1989.
14. D. E. Willard. An algorithm for handling many relational calculus queries efficiently. J. Comput. System Sci., 65(2):295-331, 2002.
15. M. Yannakakis. Algorithms for acyclic database schemes. In 7th International Conference on Very Large Data Bases (VLDB), pages 82-94. IEEE, 1981.
16. C. T. Yu and M. Z. Ozsoyoglu. An algorithm for tree-query membership of a distributed query. In Proceedings of Computer Software and Applications Conference, pages 306-312. IEEE, 1979.