Spatial Hash-Joins

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 25, Issue 2, 1996, Pages 247-258

  Lo, Ming Ling ^a   Ravishankar, Chinya V ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; FUNCTIONS; RELATIONAL DATABASE SYSTEMS; TREES (MATHEMATICS);

ASSIGNMENT FUNCTIONS; BUCKET EXTENTS; HASH JOIN PARADIGM; SPATIAL HASH JOIN METHOD; SPATIAL PARTITION FUNCTIONS;

ALGORITHMS;

EID: 0030156982     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/235968.233337     Document Type: Article

References (25)

1. M. Kitsuregawa, H. Tanaka, and T. Moto-Oka, "Application of hash to data base machine and its architecture," New Generation Computing, vol. 1, no. 1, pp. 66-74, 1983.
2. D. J. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, M. R. Stonebraker, and D. Wood, "Implementation techniques for main memory database systems," in Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 1-8, 1984.
3. D. J. DeWitt and R. Gerber, "Multiprocessor hash-based join algorithms," in Proceedings of VLDB 85, pp. 151-164, Stockholm, 1985.
4. M. Nakayama, M. Kitsuregawa, and M. Takagi, "Hash-partitioned join method using dynamic destaging strategy," in Proceedings of the 14th VLDB Conference, pp. 468-478, 1988.
5. M. Kitsuregawa, M. Nakayama, and M. Takagi, "The effect of bucket size tuning in the dynamic hybrid grace hash join method," in Proceedings of the Fifteenth International Conference on Very Large Data Bases, pp. 257-266, Amsterdam, 1989.
6. L. D. Shapiro, "Join processing in database systems with large main memories," ACM Transactions on Database Systems, vol. 11, no. 3, pp. 239-264, September 1986.
7. P. Mishra and M. H. Eich, "Join processing in relational databases," ACM Computing Surveys, vol. 24, no. 1, pp. 64-113, March 1992.
8. M.-L. Lo and C. V. Ravishankar, "Spatial joins using seeded trees," in Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 209-220, Minneapolis, MN, May 1994.
9. M.-L. Lo and C. V. Ravishankar, "Generating seeded trees from data sets," in The Fourth International Symposium on Large Spatial Databases (Advances in Spatial Databases: SSD '95), Portland, Maine, August 26-29 1995, Springer-Verlag.
10. J. Orenstein, "A comparison of spatial query processing techniques for native and parameter spaces," in Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 343-352, 1990.
11. D. Rotem, "Spatial join indices," in Proceedings of International Conference on Data Engineering, pp. 500-509, Kobe, Japan 1991.
12. W. Lu and J. Han, "Distance-associated join indices for spatial range search," in Proceedings of International Conference on Data Engineering, pp. 284-292, 1992.
13. J. A. Orenstein, "Redundancy in spatial databases," in Proceedings of ACM SIGMOD International Conference on Management of Data, Portland, OR, 1989.
14. J. Orenstein, "An algorithm for computing the overlay of k-dimensional spaces," in Advances in Spatial Databases (SSD '91), O. Gunther and H.-J. Schek, editors, pp. 381-400, Zurich, Switzerland, August 28-30 1991, Springer-Verlag.
15. O. Gunther, "Efficient computation of spatial joins," Proceedings of International Conference on Data Engineering, pp. 50-59, 1993.
16. R. H. Guting and W. Schilling, "A practical divide-and-conquer algorithm for the rectangle intersection problem," Information Sciences, vol. 42, no. 2, pp. 95-112, July 1987.
17. A. Guttman, "R-trees: A dynamic index structure for spatial searching," Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 47-57, Aug. 1984.
18. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: An efficient and robust access method for points and rectangles," Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 322-332, May 1990.
19. C. Faloutsos, T. Sellis, and N. Roussopoulos, "Analysis of object oriented spatial access methods," Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 427-439, 1987.
20. +-tree: A dynamic index for multi-dimensional objects," in Proceedings of Very Large Data Bases, pp. 3-11, Brighton, England, 1987.
21. T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient processing of spatial joins using R-trees," Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 237-246, May 1993.
22. J. M.Patel and D. DeWitt, "Partition based spatial-merge join," in Proceedings of the 1996 ACM-SIGMOD conference, Montreal, Canada, 3-6 June 1996.
23. C. Faloutsos and Y. Rong, "Dot: A spatial access method using fractals," in Proceedings of International Conference on Data Engineering, pp. 152-159, 1991.
24. B. of Census, "Tiger/lines precensus files: 1990 technical documentation," Technical report, Bureau of Census, Washington, DC, 1989.
25. D. J. DeWitt, N. Kabra, J. Luo, J. M. Patel, and J. Yu, "Client-server paradise," in Proceedings of the 20th VLDB Conference, Santiage, Chile, September 1994.