Data partitioning for parallel spatial join processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1262 LNCS, Issue , 1997, Pages 178-196

  Zhou, Xiaofang ^a   Abel, David J ^a   Truffet, David ^b  

^a CSIRO   (Australia)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COST; DATA PARTITIONING; PARALLEL PROCESSING; RELATIONAL DATABASE; SPATIAL LOCALITY; SPATIAL OBJECTS; SPATIAL OPERATIONS; TASK DECOMPOSITION;

ALGORITHMS;

COSTS;

EID: 77952591806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63238-7_30     Document Type: Conference Paper

References (24)

1. D. J. Abel, V. Gaede, R. A. Power, and X. Zhou. Resequencing and clustering to improve the performance of spatial join. Technical report, CSIRO Mathematical and Information Sciences, Australia, 1997.
2. D. J. Abel, B. C. Ooi, K.-L. Tan, R. Power, and J. X. Yu. Spatial join strategies in distributed spatial dbms. In LNCS 951: Proceedings of 4th Int. Symp. on Large Spatial Databases (SSD'95), pages 346-367. Springer-Verlag, 1995.
3. D. J. Abel and J. L. Smith. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Computer Vision, Graphics and Image Processing, 24(1):1-13, 1983.
4. T. Brinkhoff, H. P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 237-246, 1993.
5. T. Brinkhoff, H. P. Kriegel, and B. Seeger. Parallel processing of spatial joins using R-trees. In Proceedings of 12th International Conference on Data Engineering, 1996.
6. D. J. DeWitt and J. Gray. Parallel database systems: the future of database processing. C. ACM, 35(6):85-98, 1992.
7. D. J. DeWitt et al. Practical skew handling in parallel join. In Proc. 18th Int. Conf. on Very Large Data Bases, pages 27-40, Vancouver, Canada, 1992.
8. O. Günther. Efficient computation of spatial joins. In Proceedings of 9th International Conference on Data Engineering, pages 50-59, Vienna, Austria, 1993.
9. R. H. Girting. An introduction to spatial database systems. VIDB Journal, 3(4):357-399, 1994.
10. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47-54, 1984.
11. E. G. Hoel and H. Samet. Performance of data-parallel spatial operations. In Proc. 20th Int. Conf. on Very Large Data Bases, pages 156-167, 1995.
12. E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.
13. K. A. Hua and C. Lee. Handling data skew in multiprocessor database computers using partition tuning. In Proceedings of 17th International Conference on Very Large Data Bases, pages 523-535, Barcelona, 1991.
14. M. Kitsuregawa and Y. Ogawa. Bucket spreading parallel hash: A new, robust, parallel hash join method for data skew in the super database computer (SDC). In Proc. 16th Int. Conf. on Very Large Data Bases, pages 210-221, 1990.
15. M. Kitsuregawa, H. Tanaka, and T. Motooka. Application of hash to database machine and its architecture. New Generation Computing, 1(1):66-74, 1983.
16. M. L. Lo and C. V. Ravishankar. Spatial joins using seeded trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 209-220, 1994.
17. M. L. Lo and C. V. Ravishankar. Spatial hash-join. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 247-258, Montreal, Canada, 1996.
18. H. J. Lu, B. C. Ooi, and K. L. Tan. Query Processing in Parallel Relational Database Systems. IEEE Computer Society Press, 1994.
19. J. Orenstein and F. A. Manola. Probe spatial data modeling and query processing in an image database application. IEEE Trans. Software Eng., 14(5):611-629, 1988.
20. J. M. Patel and D. J. DeWitt. Partition based spatial-merge join. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 259-270, Montreal, Canada, 1996.
21. F. P. Preparata and M. I. Shamos. Computational Geometry: an introduction. Springer-Verlag, 1985.
22. +-tree: a dynamic index for multi-dimensional objects. In Proc. 13th Int. Conf. on Very Large Data Bases, pages 3-11, 1987.
23. M. Stonebraker, J. Frew, K. Gardels, and J. Meredith. The SEQUOIA 2000 storage benchmark. In Proceedings of ACM SIGMOD Int. Conf. on Management of Data, pages 2-11, Washington, DC, 1993.
24. X. Zhou. Parallel Processing in Relational Database Systems. PhD thesis, University of Queensland, 1994.