{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:32:45Z","timestamp":1743100365713,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_356","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:05:42Z","timestamp":1253088342000},"page":"2707-2714","source":"Crossref","is-referenced-by-count":3,"title":["Spatial Join"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Mamoulis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"356_CR1_356","unstructured":"Arge L., Procopiuc O., Ramaswamy S., Suel T., and Vitter J.S. Scalable sweeping-based spatial join. In Proc. 24th Int. Conf. on Very Large Data Bases, 1998, pp. 570\u2013581."},{"key":"356_CR2_356","doi-asserted-by":"crossref","unstructured":"Brinkhoff T., Kriegel H.-P., and Seeger B. Efficient processing of spatial joins using r-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1993, pp. 237\u2013246.","DOI":"10.1145\/170036.170075"},{"key":"356_CR3_356","doi-asserted-by":"crossref","unstructured":"Corral A., Manolopoulos Y., Theodoridis Y., and Vassilakopoulos M. Closest pair queries in spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2000, pp. 189\u2013200.","DOI":"10.1145\/335191.335414"},{"issue":"4","key":"356_CR4_356","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01231602","volume":"3","author":"R.H. G\u00fcting","year":"1994","unstructured":"G\u00fcting R.H. An introduction to spatial database systems. VLDB J., 3(4):357\u2013399, 1994.","journal-title":"VLDB J."},{"key":"356_CR5_356","doi-asserted-by":"crossref","unstructured":"Guttman A. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1984, pp. 47\u201357.","DOI":"10.1145\/971697.602266"},{"key":"356_CR6_356","doi-asserted-by":"crossref","unstructured":"Koudas N. and Sevcik K.C. Size separation spatial join. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, pp. 324\u2013335.","DOI":"10.1145\/253262.253340"},{"issue":"1","key":"356_CR7_356","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/69.842246","volume":"12","author":"N. Koudas","year":"2000","unstructured":"Koudas N. and Sevcik K.C. High dimensional similarity joins: algorithms and performance evaluation. IEEE Trans. Knowl. Data Eng., 12(1):3\u201318, 2000.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"356_CR8_356","unstructured":"Leutenegger S.T., Edgington J.M., and Lopez M.A. Str: a simple and efficient algorithm for R-tree packing. In Proc. 13th Int. Conf. on Data Engineering, 1997, pp. 497\u2013506."},{"key":"356_CR9_356","doi-asserted-by":"crossref","unstructured":"Lo M.-L. and Ravishankar C.V. Spatial hash-joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1996, pp. 247\u2013258.","DOI":"10.1145\/235968.233337"},{"issue":"1","key":"356_CR10_356","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/69.667097","volume":"10","author":"M.-L. Lo","year":"1998","unstructured":"Lo M.-L. and Ravishankar C.V. The design and implementation of seeded trees: An efficient method for spatial joins. IEEE Trans. Knowl. Data Eng., 10(1):136\u2013152, 1998.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"356_CR11_356","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TKDE.2003.1161591","volume":"15","author":"N. Mamoulis","year":"2003","unstructured":"Mamoulis N. and Papadias D. Slot index spatial join. IEEE Trans. Knowl. Data Eng., 15(1):211\u2013231, 2003.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"356_CR12_356","doi-asserted-by":"crossref","unstructured":"Orenstein J.A. Spatial query processing in an object-oriented database system. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1986, pp. 326\u2013336.","DOI":"10.1145\/16856.16886"},{"key":"356_CR13_356","doi-asserted-by":"crossref","unstructured":"Papadopoulos A., Rigaux P., and Scholl M. A performance evaluation of spatial join processing strategies. In Proc. 6th Int. Symp. Advances in Spatial Databases, 1999, pp. 286\u2013307.","DOI":"10.1007\/3-540-48482-5_18"},{"key":"356_CR14_356","doi-asserted-by":"crossref","unstructured":"Patel J.M. and DeWitt D.J. Partition based spatial-merge join. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1996, pp. 259\u2013270.","DOI":"10.1145\/235968.233338"},{"key":"356_CR15_356","doi-asserted-by":"crossref","unstructured":"Preparata F.P. and Shamos M.I. Computational Geometry - An Introduction. Springer, 1985.","DOI":"10.1007\/978-1-4612-1098-6"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T04:31:56Z","timestamp":1590985916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_356","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}