On Producing Join Results Early

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

Volumn 22, Issue , 2003, Pages 134-142

  Dittrich, Jens Peter ^a   Seeger, Bernhard ^a   Taylor, David Scot ^b,c   Widmayer, Peter ^b  

^a PHILIPPS UNIVERSITY MARBURG   (Germany)

^b ETH ZURICH   (Switzerland)

^c SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

Join Processing; Non Blocking

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; INFORMATION RETRIEVAL; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY;

QUERY PROCESSING; SPATIAL DATA;

DATABASE SYSTEMS;

EID: 1142275488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773167     Document Type: Conference Paper

References (25)

1. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Scalable Sweeping-Based Spatial Join. In International Conference on Very Large Data Bases, pages 570-581, 1998.
2. M. W. Blasgen and K. P. Eswaran. Storage and access in relational data bases. IBM Systems Journal, 16(4):362-377, 1977.
3. C. Böhm, B. Braunmüller, F. Krebs, and H.-P. Kriegel. Epsilon Grid Order: An algorithm for the similarity join on massive high-dimensional data. In ACM SIGMOD International Conference on Management of Data, pages 379-388, 2001.
4. S. Chaudhuri, R. Motwani, and V. R. Narasayya. On random sampling over joins. In ACM SIGMOD International Conference on Management of Data, pages 263-274, 1999.
5. J.-P. Dittrich and B. Seeger. Data redundancy and duplicate detection in spatial join processing. In International Conference on Data Engineering, pages 535-546, 2000.
6. J.-P. Dittrich and B. Seeger. GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces. In ACM SIGKDD International Converence on Knowledge Discover and Data Mining, pages 47-56, 2001.
7. J.-P. Dittrich, B. Seeger, D. S. Taylor, and P. Widmayer. Progressive Merge Join: A generic and non-blocking sort-based join algorithm. In International Conference on Very Large Data Bases, pages 299-310, 2002.
8. G. Graefe. Heap-Filter Merge Join: A new algorithm for joining medium-size inputs. IEEE Transactions on Software Engineering, 17(9):979-982, 1991.
9. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-170, 1993.
10. G. Graefe. Sort-Merge-Join: An idea whose time has(h) passed? In International Conference on Data Engineering, pages 406-417, 1994.
11. P. J. Haas and J. M. Hellerstein. Ripple Joins for online aggregation. In ACM SIGMOD International Conference on Management of Data, pages 287-298, 1999.
12. Z. G. Ives, D. Florescu, M. Friedman, A. Y. Levy, and D. S. Weld. An adaptive query execution system for data integration. In ACM SIGMOD International Conference on Management of Data, pages 299-310, 1999.
13. D. Knuth. The Art of Computer Programming, Volume III: Searching and Sorting. Addison Wesley, second edition, 1998.
14. R. E. Korf. Depth-First Iterative-Deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):35-77, 1985.
15. R. A. Kyuseok Shim, Ramakrishnan Srikant. High-dimensional similarity joins. In International Conference on Data Engineering, pages 301-313, 1997.
16. W. Li, D. Gao, and R. T. Snodgrass. Skew handling techniques in sort-merge join. In ACM SIGMOD International Conference on Management of Data, pages 169-180, 2002.
17. G. Luo, J. F. Naughton, and C. Ellmann. A non-blocking parallel spatial join algorithm. In International Conference on Data Engineering, pages 697-705, 2002.
18. M. Negri and G. Pelagatti. Join During Merge: An improved sort based algorithm. Information Processing Letters, 21(1):11-16, 1985.
19. J. A. Orenstein. Spatial query processing in an object-oriented database system. In ACM SIGMOD International Conference on Management of Data, pages 326-336, 1986.
20. J. A. Orenstein. An algorithm for computing the overlay of k-dimensional spaces. In International Symposium on Advances in Spacial Databases, pages 381-400, 1991.
21. J. M. Patel and D. J. DeWitt. Partition Based Spatial-Merge Join. In ACM SIGMOD International Conference on Management of Data, pages 259-270, 1996.
22. L. Raschid and S. Y. W. Su. A parallel processing strategy for evaluating recursive queries. In International Conference on Very Large Data Bases, pages 412-419, 1986.
23. 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 ACM SIGMOD International Conference on Management of Data, pages 23-34, 1979.
24. T. Urban and M. J. Franklin. XJoin: A reactively-scheduled pipelined join operator. Data Engineering Bulletin, 23(2):27-33, 2000.
25. A. N. Wilschut and P. M. G. Apers. Pipelining in query execution. In Conference on Databases, Parallel Architectures and their Applications, pages 68-77, 1991.