{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:24:09Z","timestamp":1725665049465},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632382"},{"type":"electronic","value":"9783540692409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63238-7_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:21:35Z","timestamp":1330280495000},"page":"178-196","source":"Crossref","is-referenced-by-count":11,"title":["Data partitioning for parallel spatial join processing"],"prefix":"10.1007","author":[{"given":"Xiaofang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"David J.","family":"Abel","sequence":"additional","affiliation":[]},{"given":"David","family":"Truffet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"10_CR1","unstructured":"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."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013367. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60159-7_21"},{"issue":"1","key":"10_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(83)90017-8","volume":"24","author":"D. J. Abel","year":"1983","unstructured":"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\u201313, 1983.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013246, 1993.","DOI":"10.1145\/170035.170075"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/ICDE.1996.492114"},{"issue":"6","key":"10_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/129888.129894","volume":"35","author":"D. J. DeWitt","year":"1992","unstructured":"D. J. DeWitt and J. Gray. Parallel database systems: the future of database processing. C. ACM, 35(6):85\u201398, 1992.","journal-title":"C. ACM"},{"key":"10_CR7","unstructured":"D. J. DeWitt et al. Practical skew handling in parallel join. In Proc. 18th Int. Conf. on Very Large Data Bases, pages 27\u201340, Vancouver, Canada, 1992."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"O. G\u00fcnther. Efficient computation of spatial joins. In Proceedings of 9th International Conference on Data Engineering, pages 50\u201359, Vienna, Austria, 1993.","DOI":"10.1109\/ICDE.1993.344078"},{"issue":"4","key":"10_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01231602","volume":"3","author":"R. H. G\u00fcting","year":"1994","unstructured":"R. H. G\u00fcting. An introduction to spatial database systems. VLDB Journal, 3(4):357\u2013399, 1994.","journal-title":"VLDB Journal"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47\u201354, 1984.","DOI":"10.1145\/602259.602266"},{"key":"10_CR11","unstructured":"E. G. Hoel and H. Samet. Performance of data-parallel spatial operations. In Proc. 20th Int. Conf. on Very Large Data Bases, pages 156\u2013167, 1995."},{"key":"10_CR12","unstructured":"E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978."},{"key":"10_CR13","unstructured":"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\u2013535, Barcelona, 1991."},{"key":"10_CR14","unstructured":"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\u2013221, 1990."},{"issue":"1","key":"10_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/BF03037022","volume":"1","author":"M. Kitsuregawa","year":"1983","unstructured":"M. Kitsuregawa, H. Tanaka, and T. Motooka. Application of hash to database machine and its architecture. New Generation Computing, 1(1):66\u201374, 1983.","journal-title":"New Generation Computing"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"M. L. Lo and C. V. Ravishankar. Spatial joins using seeded trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 209\u2013220, 1994.","DOI":"10.1145\/191839.191881"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"M. L. Lo and C. V. Ravishankar. Spatial hash-join. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 247\u2013258, Montreal, Canada, 1996.","DOI":"10.1145\/233269.233337"},{"key":"10_CR18","unstructured":"H. J. Lu, B. C. Ooi, and K. L. Tan. Query Processing in Parallel Relational Database Systems. IEEE Computer Society Press, 1994."},{"issue":"5","key":"10_CR19","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/32.6139","volume":"14","author":"J. Orenstein","year":"1988","unstructured":"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\u2013629, 1988.","journal-title":"IEEE Trans. Software Eng."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"J. M. Patel and D. J. DeWitt. Partition based spatial-merge join. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 259\u2013270, Montreal, Canada, 1996.","DOI":"10.1145\/233269.233338"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: on introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"10_CR22","unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: a dynamic index for multi-dimensional objects. In Proc. 13th Int. Conf. on Very Large Data Bases, pages 3\u201311, 1987."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"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\u201311, Washington, DC, 1993.","DOI":"10.1145\/170035.170038"},{"key":"10_CR24","unstructured":"X. Zhou. Parallel Processing in Relational Database Systems. PhD thesis, University of Queensland, 1994."}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63238-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:43:11Z","timestamp":1619559791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63238-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632382","9783540692409"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-63238-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}