{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:00:20Z","timestamp":1725890420633},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676270"},{"type":"electronic","value":"9783540451518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45151-x_24","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:14:10Z","timestamp":1187262850000},"page":"247-258","source":"Crossref","is-referenced-by-count":3,"title":["Extending Rectangle Join Algorithms for Rectilinear Polygons"],"prefix":"10.1007","author":[{"given":"Hongjun","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwen","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,7]]},"reference":[{"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.","key":"24_CR1","DOI":"10.1007\/3-540-60220-8_74"},{"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":"24_CR2"},{"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, 1993.","key":"24_CR3","DOI":"10.1109\/ICDE.1993.344063"},{"doi-asserted-by":"crossref","unstructured":"N. Beckmann, H-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1990.","key":"24_CR4","DOI":"10.1145\/93597.98741"},{"unstructured":"J. L. Bentley. Algorithms for Klee\u2019s rectangle problems. Technical report, Carnegie-Mellon University, 1977.","key":"24_CR5"},{"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.","key":"24_CR6","DOI":"10.1145\/191839.191880"},{"doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H-P. Kriegel, and B. Seeger. Efficient processing of spatial join using R-trees. In Proc. Int. Conf. on Data Engineering, 1993.","key":"24_CR7","DOI":"10.1145\/170035.170075"},{"unstructured":"L. Ferarri, P. V. Sankar, and J. Sklansky. Minimal rectangular partitions of digital blobs. In Proc. 5th Int. Conf. on Pattern Recogonition, 1980.","key":"24_CR8"},{"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, 1993.","key":"24_CR9","DOI":"10.1109\/SFCS.1993.366816"},{"doi-asserted-by":"crossref","unstructured":"O. G\u00fcnther. Efficient computation of spatial joins. In Proc. Int. Conf. on Data Engineering, 1993.","key":"24_CR10","DOI":"10.1109\/ICDE.1993.344078"},{"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":"24_CR11"},{"unstructured":"M. Kreveld, editor. Geographic Information systems. Utrecht University, 1995.","key":"24_CR12"},{"doi-asserted-by":"crossref","unstructured":"G. Kuper, L. Libkin, and J. Paredaens, editors. Constraint Databases. Springer, 1999.","key":"24_CR13","DOI":"10.1007\/978-3-662-04031-7"},{"doi-asserted-by":"crossref","unstructured":"R. Laurini and A. D. Thompson, editors. Fundamentals of Spatial Information Systems. Acedemic Press, 1992.","key":"24_CR14","DOI":"10.1016\/B978-0-08-092420-5.50014-1"},{"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.","key":"24_CR15","DOI":"10.1145\/233269.233337"},{"doi-asserted-by":"crossref","unstructured":"J. A. Orenstein. Spatial query processing in an object-oriented database system. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1986.","key":"24_CR16","DOI":"10.1145\/16894.16886"},{"doi-asserted-by":"crossref","unstructured":"J. A. Orenstein. Redundancy in spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1989.","key":"24_CR17","DOI":"10.1145\/67544.66954"},{"issue":"5","key":"24_CR18","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/32.6139","volume":"14","author":"J. A. Orenstein","year":"1988","unstructured":"J. A. Orenstein and F. A. Manola. PROBE spatial data modeling and query processing in an image datebase application. IEEE Trans. on Software Engineering, 14(5):611\u2013629, 1988.","journal-title":"IEEE Trans. on Software Engineering"},{"doi-asserted-by":"crossref","unstructured":"J. M. Patel and D. J. DeWitt. Partition based spatial-merge joins. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1996.","key":"24_CR19","DOI":"10.1145\/233269.233338"},{"doi-asserted-by":"crossref","unstructured":"D. Rotem. Spatial join indices. In Proc. Int. Conf. on Data Engineering, 1991.","key":"24_CR20","DOI":"10.1109\/ICDE.1991.131499"},{"issue":"4","key":"24_CR21","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1145\/50020.50021","volume":"20","author":"H. Samet","year":"1988","unstructured":"H. Samet. Hierarchical representations of collections of small rectangles. ACM Computing Surveys, 20(4):271\u2013309, 1988.","journal-title":"ACM Computing Surveys"},{"unstructured":"K. C. Sevcik and N. Koudas. Filter trees for managing spatial data over a range of size granularities. In Proc. Int. Conf. on Very Large Data Bases, 1996.","key":"24_CR22"},{"doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey. Geometric intersection problems. In Proc. IEEE Symp. on Foundations of Computer Science, 1976.","key":"24_CR23","DOI":"10.1109\/SFCS.1976.16"},{"issue":"2","key":"24_CR24","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/22952.22955","volume":"12","author":"P. Valduriez","year":"1987","unstructured":"P. Valduriez. Join indices. ACM Trans. on Database Systems, 12(2):218\u2013246, 1987.","journal-title":"ACM Trans. on Database Systems"},{"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":"24_CR25"},{"unstructured":"H. Zhu, J. Su, and O. H. Ibarra. Toward spatial joins for general polygons. Technical report, Dept. of Computer Science, U C Santa Barbara, 2000.","key":"24_CR26"},{"unstructured":"G. Zimbrao and J. M. Souza. A raster approximation for the processing of spatial joins. In Proc. Int. Conf. on Very Large Data Bases, 1998.","key":"24_CR27"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45151-X_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:30:20Z","timestamp":1556771420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45151-X_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676270","9783540451518"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45151-x_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}