{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T07:12:01Z","timestamp":1712905921833},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0169-023x(01)00033-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:11:55Z","timestamp":1027588315000},"page":"1-31","source":"Crossref","is-referenced-by-count":3,"title":["Using spatial data access structures for filtering nearest neighbor queries"],"prefix":"10.1016","volume":"40","author":[{"given":"A.","family":"Belussi","sequence":"first","affiliation":[]},{"given":"E.","family":"Bertino","sequence":"additional","affiliation":[]},{"given":"B.","family":"Catania","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(01)00033-7_BIB1","series-title":"Proceedings of the International Conference on Very Large Data Bases","first-page":"81","article-title":"Optimization strategies for spatial query processing","author":"Aref","year":"1991"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB2","series-title":"Proceedings of the 5th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"573","article-title":"An optimal algorithm for approximating nearest neighbor searching","author":"Arya","year":"1994"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB3","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"322","article-title":"The R*_-tree: an efficient and robust access method for point and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB4","series-title":"Multimedia Database Systems","first-page":"185","article-title":"A data access structure for filtering distance queries in image retrieval","author":"Belussi","year":"1996"},{"issue":"4","key":"10.1016\/S0169-023X(01)00033-7_BIB5","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","article-title":"Optimal expected-time algorithms for closest point problems","volume":"6","author":"Bentley","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB6","series-title":"CIKM 93, Proceedings of the Second International Conference on Information and Knowledge Management, Washington, DC, USA","first-page":"490","article-title":"On packing R-trees","author":"Kamel","year":"1993"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB7","series-title":"Proceedings of the 8th ACM SIGACT\u2013SIGMOD\u2013SIGART Symposium on Principles of Database Systems (PODS)","first-page":"247","article-title":"Fractals for secondary key retrieval","author":"Faloutsos","year":"1989"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB8","series-title":"File Structures","author":"Folk","year":"1992"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding the best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Math. Software"},{"issue":"2","key":"10.1016\/S0169-023X(01)00033-7_BIB10","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","article-title":"Multidimensional access methods","volume":"30","author":"Gaede","year":"1998","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/S0169-023X(01)00033-7_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/spe.4380110106","article-title":"Short algorithms for space-filling curves","volume":"11","author":"Goldschlager","year":"1981","journal-title":"Software Pract. Exper."},{"key":"10.1016\/S0169-023X(01)00033-7_BIB12","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"47","article-title":"R-tree: a dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB13","series-title":"Advances in Spatial Databases \u2013 4th Symposium, SSD'95","first-page":"83","article-title":"Ranking in spatial databases","volume":"vol. 951","author":"Hjaltason","year":"1995"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB14","series-title":"Advances in Spatial Databases \u2013 2nd Symposium, SSD'91","first-page":"237","article-title":"Efficient processing of spatial queries in line segment databases","volume":"vol. 525","author":"Hoel","year":"1991"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB15","series-title":"Proceedings of the International Workshop on DBMS's for Geographical Applications","article-title":"An access method based query processor for spatial database systems","author":"Kriegel","year":"1991"},{"issue":"3","key":"10.1016\/S0169-023X(01)00033-7_BIB16","first-page":"10","article-title":"Efficient spatial query processing in geographic database systems","volume":"16","author":"Kriegel","year":"1993","journal-title":"Bull. Tech. Comm. Data Eng."},{"issue":"3","key":"10.1016\/S0169-023X(01)00033-7_BIB17","first-page":"16","article-title":"Spatial indexing: past and future","volume":"16","author":"Lu","year":"1993","journal-title":"Bull. Tech. Comm. Data Eng."},{"key":"10.1016\/S0169-023X(01)00033-7_BIB18","series-title":"A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing","author":"Morton","year":"1966"},{"issue":"1","key":"10.1016\/S0169-023X(01)00033-7_BIB19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","article-title":"The grid file: an adaptable, symmetric multikey file structure","volume":"9","author":"Nievergelt","year":"1984","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S0169-023X(01)00033-7_BIB20","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"326","article-title":"Spatial query processing in an object-oriented database system","author":"Orenstein","year":"1986"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB21","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"294","article-title":"Redundancy in spatial databases","author":"Orenstein","year":"1989"},{"issue":"3","key":"10.1016\/S0169-023X(01)00033-7_BIB22","first-page":"87","article-title":"Corner stitching. A data structuring technique for VLSI layout tools","volume":"1","author":"Ousterhout","year":"1984","journal-title":"IEEE Trans. CAD\/ICAS"},{"issue":"February","key":"10.1016\/S0169-023X(01)00033-7_BIB23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/MDT.1985.294681","article-title":"The magic VLSI layout system","author":"Ousterhout","year":"1985","journal-title":"IEEE Trans. Des. Test"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB24","series-title":"Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data","article-title":"Nearest neighbor queries","author":"Roussopoulos","year":"1995"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB25","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1989"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB26","series-title":"Applications of Spatial Data Structures, Computer Graphics, Image Processing and GIS","author":"Samet","year":"1990"},{"key":"10.1016\/S0169-023X(01)00033-7_BIB27","series-title":"Proceedings of the 13th VLDB Conference","first-page":"507","article-title":"The R+-tree: a dynamic index for multi-dimensional objects","author":"Sellis","year":"1997"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X01000337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X01000337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T16:22:30Z","timestamp":1556554950000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X01000337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0169023X01000337"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(01)00033-7","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}