{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:12:53Z","timestamp":1754485973819},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601005"},{"type":"electronic","value":"9783540494270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0000545","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T08:46:59Z","timestamp":1128502019000},"page":"136-154","source":"Crossref","is-referenced-by-count":2,"title":["Optimization of spatial joins using filters"],"prefix":"10.1007","author":[{"given":"Hein M.","family":"Veenhof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter M. G.","family":"Apers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice A. W.","family":"Houtsma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,9]]},"reference":[{"key":"9_CR1","volume-title":"Technical Report GCG53","author":"C.B. Bradford","year":"1993","unstructured":"Bradford, C.B., Dobkin, D.P., Huhdanpaa, H.: The Quickhull Algorithm for Convex Hull. Technical Report GCG53, The Geometry Center, University of Minnesota, Minneapolis, USA, July 30, 1993."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H-.P., Seeger, B.: Efficient Processing of Spatial Joins Using R-trees. Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, D.C., USA, 1993.","DOI":"10.1145\/170035.170075"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H-.P., Schneider, R.: Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems. Proc. 9th Int. Conf. on Data Engineering, Vienna, Austria, 1993.","DOI":"10.1109\/ICDE.1993.344079"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H-.P., Schneider, R., Seeger, B.: Multi-Step Processing of Spatial Joins. Proc. ACM SIGMOD Int. Conf. on Management of Data, Minneapolis, Minnesota, USA, 1994.","DOI":"10.1145\/191839.191880"},{"key":"9_CR5","unstructured":"Ceri, S., Pelagatti, G.: Distributed databases. McGrawHill, 1984."},{"issue":"1983","key":"9_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(83)90040-3","volume":"24","author":"D. Dori","year":"1983","unstructured":"Dori, D., Ben-Bassat, M.: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition. Computer Vision, Graphics and Image Processing, 24(1983):131\u2013159, 1983.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Frank, A.U.: Properties of Geographic Data: Requirements for Spatial Access Methods. Proc. Advances in Spatial Databases, SSD'91, Z\u00fcrich, Switzerland, 1991.","DOI":"10.1007\/3-540-54414-3_40"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, Massachusetts, USA, 1984.","DOI":"10.1145\/602259.602266"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V.: Spatial search with Polyhedra. Proc. 6th. Int Conf. on Data Engineering, Los Angeles, California, USA, 1990.","DOI":"10.1109\/ICDE.1990.113483"},{"issue":"2","key":"9_CR10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/356924.356928","volume":"16","author":"M. Jarke","year":"1984","unstructured":"Jarke, M., Koch, J.: Query optimization in database systems. Computing Surveys, 16(2):111\u2013152, June 1984.","journal-title":"Computing Surveys"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Laurini, R., Thompson, D.: Fundamentals of spatial information systems. Academic Press, 1992.","DOI":"10.1016\/B978-0-08-092420-5.50014-1"},{"key":"9_CR12","unstructured":"N\u00e4her, S.: LEDA User Manual, version 3.0. Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Lo, M.L., Ravishankar C.V.: Spatial joins using seeded trees. Proc. ACM SIGMOD Int. Conf. on Management of Data, Mineapolis, Minnesota, USA, 1994.","DOI":"10.1145\/191839.191881"},{"issue":"3","key":"9_CR14","first-page":"16","volume":"16","author":"H. Lu","year":"1993","unstructured":"Lu, H., Ooi, B.: Spatial Indexing: Past and Future. Data Engineering Bulletin, 16(3):16\u201321, Sept 1993.","journal-title":"Data Engineering Bulletin"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Orenstein, J.A.: Redundancy in spatial databases. Proc. ACM SIGMOD Int. Conf. on Management of Data, Portland, Oregon, USA, 1989.","DOI":"10.1145\/67544.66954"},{"key":"9_CR16","unstructured":"Oosterom, van P., Claassen, E.: Orientation insensitive indexing methods for Geometric Objects, 4th Int. Symp. on Spatial Data Handling, Z\u00fcrich, Switzerland, July 1990."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry; an introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"9_CR18","volume-title":"Database Challenges in the 1990's","author":"H. Samet","year":"1994","unstructured":"Samet, H.: Spatial Data Structures. To appear in Database Challenges in the 1990's, W. Kim, ed., Addison Wesley\/ACM Press, Reading, MA, USA, 1994."},{"key":"9_CR19","unstructured":"Seeger, B., Kriegel, H.-P.: Techniques for Design and Implementation of Efficient Spatial Access Methods. Proc. 14th Int. Conf. on Very Large Data Bases, Los Angeles, California, USA, 1988."},{"issue":"1991","key":"9_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(91)90030-L","volume":"37","author":"S. Skyum","year":"1991","unstructured":"Skyum, S.: A simple algorithm for computing the smallest enclosing circle. Information Processing Letters, 37(1991):121\u2013125, February 1991.","journal-title":"Information Processing Letters"},{"key":"9_CR21","unstructured":"Welzl, E.: Smallest Enclosing Disks (Balls and Ellipsoids). Paper B91-09, Freie University of Berlin, 1991."}],"container-title":["Lecture Notes in Computer Science","Advances in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T02:10:03Z","timestamp":1586484603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601005","9783540494270"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0000545","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}