{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:12:59Z","timestamp":1725487979010},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423010"},{"type":"electronic","value":"9783540477242"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47724-1_12","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T19:51:52Z","timestamp":1185911512000},"page":"217-235","source":"Crossref","is-referenced-by-count":3,"title":["On Multi-Way Spatial Joins with Direction Predicates"],"prefix":"10.1007","author":[{"given":"Hongjun","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Jianwen","family":"Su","sequence":"additional","affiliation":[]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"12_CR1","unstructured":"L. Arge, O Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter. Scalable sweeping-based spatial join. In Proc. Int. Conf. on Very Large Data Bases, 1998."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"L. Arge. The buffer tree: A new technique for optimal I\/O-algorithms. In Proc. Workshop on Algorithms and Data structures, 1995.","DOI":"10.1007\/3-540-60220-8_74"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexibility and optimal range search indexing. In Proc. ACM Symp. on Principles of Database Systems, 1999.","DOI":"10.1145\/303976.304010"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In Proc. IEEE Symp. on Foundations of Computer Science, 1996.","DOI":"10.1109\/SFCS.1996.548515"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"L. Becker, K. Hinriches, and U. Finke. A new algorithm for computing joins with grid files. In Proc. Int. Conf. on Data Engineering, pages 190\u2013197, 1993.","DOI":"10.1109\/ICDE.1993.344063"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H-P. Kriegel, and B. Seeger. Efficient processing of spatial join using R-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1993.","DOI":"10.1145\/170035.170075"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H-P. Kriegel, R. Schneider, and B. Seeger. Multi-step processing of spatial joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1994.","DOI":"10.1145\/191839.191880"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"S. Dutta. Qualitative spatial reasoning: a semi-qualitative approach using fuzzy logic. In Proc. Symp. on Large Spatial Databases, 1989.","DOI":"10.1007\/3-540-52208-5_36"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/1045-926X(92)90007-9","volume":"3","author":"A. U. Frank","year":"1992","unstructured":"A. U. Frank. Qualitative spatial reasoning about distances and directions in geographic space. Journal of Visual Languages and Computing, 3:343\u2013371, 1992.","journal-title":"Journal of Visual Languages and Computing"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symp. on Foundations of Computer Science, pages 714\u2013723, 1993.","DOI":"10.1109\/SFCS.1993.366816"},{"key":"12_CR11","unstructured":"O. G\u00fcnther. Efficient computation of spatial joins. In Proc. Int. Conf. on Data Engineering, pages 50\u201359, 1993."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"D. Hernandez. Mantaining qualitative spatial knowledge. In Proceedings of the European Conference on Spatial Information Theory, 1993.","DOI":"10.1007\/3-540-57207-4_4"},{"key":"12_CR13","unstructured":"Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Spatial joins using R-trees: Breadth-first traversal with global optimizations. In Proc. Int. Conf. on Very Large Data Bases, 1997."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 237\u2013248, 1998.","DOI":"10.1145\/276304.276326"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"M-L. Lo and C. V. Ravishankar. Spatial hash-joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1996.","DOI":"10.1145\/233269.233337"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E. M. McCreight","year":"1985","unstructured":"E. M. McCreight. Priority search trees. SIAM Journal of COmputing, 14:257\u2013276, 1985.","journal-title":"SIAM Journal of COmputing"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"N. Mamoulis and D. Papadias. Constraint-based algorithms for computing clique intersection joins. In Proc. ACM Symp. on Advances in Geographic Information Systems, 1998.","DOI":"10.1145\/288692.288714"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"N. Mamoulis and D. Papadias. Integration of spatial join algorithms for processing multiple inputs. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1999.","DOI":"10.1145\/304182.304183"},{"key":"12_CR19","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, 1996.","DOI":"10.1145\/233269.233338"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"D. Papadias, N. Mamoulis, and Y. Theodoridis. Processing and optimization of multiway spatial joins using R-trees. In Proc. ACM Symp. on Principles of Database Systems, 1999.","DOI":"10.1145\/303976.303981"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"A. Papadopoulos, P. Rigaux, and M. Scholl. A performance evaluation of spatial join processing strategies. In Proc. Symp. on Large Spatial Databases, pages 286\u2013307, 1999.","DOI":"10.1007\/3-540-48482-5_18"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"D. Papadias and T. Sellis. The semantics of relations in 2D space using represectative points: spatial indexes. In Proceedings of the European Conference on Spatial Information Theory, 1993.","DOI":"10.1007\/3-540-57207-4_16"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"D. Papadias, Y. Theodoridis, and T. Sellis. The retrieval of direction relations using r-trees. In Proc. 5th Int. Conf. Database and Expert Systems Applications, pages 173\u2013182, 1994.","DOI":"10.1007\/3-540-58435-8_182"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"D. Rotem. Spatial join indices. In Proc. Int. Conf. on Data Engineering, pages 500\u2013509, 1991.","DOI":"10.1109\/ICDE.1991.131499"},{"key":"12_CR25","unstructured":"J. C. Shafer and R. Agrawal. Parallel algorithms for high dimensional similarity joins for data mining applications. In Proc. Int. Conf. on Very Large Data Bases, pages 176\u2013185, 1997."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey. Geometric intersection problems. In Proc. IEEE Symp. on Foundations of Computer Science, pages 208\u2013215, 1976.","DOI":"10.1109\/SFCS.1976.16"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"J. Vitter. External memory algorithms: Dealing with massive data. In Proc. ACM Symp. on Principles of Database Systems, pages 233\u2013243, 1998.","DOI":"10.1145\/275487.275501"},{"key":"12_CR28","unstructured":"G. Zimbrao and J. M. Souza. A raster approximation for processing of spatial joins. In Proc. Int. Conf. on Very Large Data Bases, pages 558\u2013569, 1998."},{"key":"12_CR29","unstructured":"H. Zhu, J. Su, and O.H. Ibarra. An index structure for spatial joins in linear constraint databases. In Proc. Int. Conf. on Data Engineering, 1999."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"H. Zhu, J. Su, and O. H. Ibarra. Extending rectangle join algorithms for rectilinear polygons. In Proc. Int. Conf. on WebInformation Management, 2000.","DOI":"10.1007\/3-540-45151-X_24"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"H. Zhu, J. Su, and O. H. Ibarra. Towards spatial joins for polygons. In Proc. Int. Conf. on Statistical and Scientific Database Management, 2000.","DOI":"10.1109\/SSDM.2000.869791"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47724-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:22:16Z","timestamp":1556713336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47724-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423010","9783540477242"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-47724-1_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}