Evaluation of main memory join algorithms for joins with subset join predicates

Proceedings of the 23rd International Conference on Very Large Databases, VLDB 1997

Volumn , Issue , 1997, Pages 386-395

  Helmer, Sven ^a   Moerkotte, Guido ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CURRENT DATA; JOIN ALGORITHM; MAIN MEMORY; NOCV1; OBJECT ORIENTED MODEL; SET-VALUED ATTRIBUTES;

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

References (42)

1. M. \V Blasien and K. P. Eswaran. On the evaluation of queries in a relational database system. Technical Report IBM Research Report RJ1745, IBM, 1976.
2. K. Bratbergsengen. Hashing methods and relational algebra operations. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 323-333, 1984.
3. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 237-246, 1993.
4. R. Cattell. editor. The Object. Database Standard: ODMG-93. Morgan Kaufmann, 1996. Release 1.2.
5. S. Cluet, and G. Moerkotte. Efficient evaluation of aggregates on bulk types. In Proc. Int. Workshop on Database Programming Languages, 1995.
6. D. DeWitt and R. Gerber. Multiprocessor hash-based join algorithms. In Proc. Int. Conf. ' on Very Large Data Bases (VLDB), pages 151-164, Stockholm, Sweden, 1985.
7. D. DeWitt, R. Katz, F. Ohlken, L. Shapiro, M. Stone-braker, and D. Wood. Implementation techniques for main memory database systems. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 1-8, 1984.
8. D. DeWitt, D. Lieuwen, and M. Mehta. Pointer-based join techniques for object-oriented databases. In PDIS, 1993.
9. D. DeWitt, J. Naughton, and D. Schneider. An evaluation of non-equijoin algorithms. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 443-452, Barcelona, Spain, 1991.
10. D. DeWitt, J. Naughton, and D. Schneider. Parallel sorting on a shared-nothing architecture using probabilistic splitting. In Int. Conf. on Parallel and Distributed Information Systems, Miami Beach, Fl, 1991.
11. C. Faloutsos and S. Christodoulakis. Signature files: An access method for documents and its analytical performance evaluation. ACM Transactions on Office Informations Systems, 2(4):267-288, October 1984.
12. S. Fushimi, M. Kitsuregawa, and H. Tanaka. An overview of the systems software of a parallel relational database machine: GRACE. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 209-219, 1986.
13. G. Graefe. Sort-merge-join: An idea whose time has(h) passed? In Proc. IEEE Conference on Data Engineering, pages 406-417, Houston, TX, 1994.
14. G. Graefe, A. Linville, and L. Shapiro. Sort versus hash revisited. IEEE Trans, on Data and Knowledge Eng., 6(6):934-944, Dec. 1994.
15. O.Günther. Efficient computation of spatial joins. In Proc. IEEE Conference on Data Engineering, pages 50-59, Vienna, Austria, Apr. 1993.
16. T. Härder. Implementing a generalized access path structure for a relational database system. ACM Trans, on Database Systems, 3(3):285-298, 1978.
17. S. Helmer and G. Moerkotte. Evaluation of main memory join algorithms for joins with set comparison join predicates. Technical Report 13/96, University of Mannheim, Mannheim, Germany, 1996.
18. E. Hoel and H. Samet. Benchmarking spatial join operations with spatial output. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 606-618, Zurich, 1995.
19. Y. Ishikawa, H. Kitagawa, and N. Ohbo. Evaluation of signature files as set access facilities in oodbs. In Proc. of the 1993 ACM SIGMOD, pages 247-256, Washington D.C., 1993.
20. M. Kamath and K. Ramamritham. Bucket skip merge join: A scalable algorithm for join processing in very large databases using indexes. Technical Report 20, University of Massachusetts at Amherst, Amherst, MA, 1996.
21. C. Kilger and G. Moerkotte. Indexing multiple sets. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 180-191, Santiago, Chile, Sept. 1994.
22. W. Kim, K. C. Kim, and A. Dale. Indexing techniques for object-oriented databases. In W. Kim and F. H. Lochovsky, editors, Object-Oriented Concepts, Databases, and Applications, pages 371-394, Massachusetts, 1989. Addison Wesley.
23. M. Kitsuregawa, M.Nakayama, and M. Takagi. The effect of bucket size tuning in the dynamic hybrid GRACE hash join method. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 257-266, 1989.
24. M.-L. Lo and C. Ravishankar. Spatial hash-joins. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 247-258, Montreal, Canada, Jun 1996.
25. R. Lorie and H. Young. A low communication sort algorithm for a parallel database machine. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 135-144, 1989. also published as: IBM TR RJ 6669, Feb. 1989.
26. J. Menon. A study of sort algorithms for multiprocessor DB machines. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 197-206, Kyoto, 1986.
27. P. Mishra and M. H. Eich. Join processing in relational databases. ACM Computing Surveys. 24( 1 ):63 113, 1992.
28. M. Nakayama, M. Kitsuregawa, and M. Takagi. Hash-partitioned join method using dynamic destaging strategy. In Proc. Int. Con}, on Very Large Data Bases (VLDB), pages 468-478, 1988.
29. P. O'Neil and G. Graefe. Multi-table joins through bitmapped join indices. SIGMOD Record, 24(3):8-ll, Sep 1995.
30. J. Patel and D. De Witt. Partition based spatial-merge join. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 259 270, Montreal, Canada, .Jim 1996.
31. CS Roberts. Partial-match retrieval via the method of superimposed codes. Proc. of the IEEE, 67(12):1624-1642, December 1979.
32. M. Roth, H. Korth, and A. Silberschatz. Extending relational algebra and calculus for nested relational databases. ACM Trans, on Database Systems, 13(4):389-417, Dec 1988.
33. R. Sacks-Davis and K. Ramamohanarao. A two level superimposed coding scheme for partial match retrieval. Information Systems, 8(4):273-280. 1983.
34. B. Salzberg, A. Tsukermaii, .1. Gray, M. Stewart, S. I'rcn. and B. Vaughan. FastSort: an distributed single-input single-output external sort. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 94-101, 1990.
35. H.-J. Schek and M. H. Scholl. The relational model with relation-valued attributes. Information Systems, 11(2):137-147, 1986.
36. D. Schneider and D. De Witt. Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 469-480, Brisbane, 1990.
37. L. D. Shapiro. Join processing in database systems with large main memories. A CM Trans, on Database Systems, ll(3):239-264, 1986.
38. E. J. Shekita and M. J. Carey. A performance evaluation of pointer-based joins. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 300311, 1990.
39. D. Shin and A. Meitzer. A new join algorithm. SIGMOD Record, 23(4): 13-18, Dec. 1994.
40. P. Valduriez. Join indices. ACM Trans, on Database Systems, 12(2):218 246, 1987.
41. B. Vance and D. Maier. Rapid bushy join-order optimization with cartesian products. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 35-46, Toronto, Canada, 1996.
42. Z. Xie and J. Han. Join index hierarchies for supporting efficient navigation in object-oriented databases. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 522-533, 1994.