{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:30:08Z","timestamp":1755217808833,"version":"3.43.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["GeoInformatica"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1023\/a:1009760201355","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T17:50:41Z","timestamp":1040579441000},"page":"59-91","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Window Block Retrieval in Quadtree-Based Spatial Databases"],"prefix":"10.1007","volume":"1","author":[{"given":"WALID G","family":"AREF","sequence":"first","affiliation":[]},{"given":"HANAN","family":"SAMET","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"131780_CR1","volume-title":"An algorithm and a cost model for window queries in spatial databases","author":"A. Aboulnaga","year":"1996","unstructured":"A. Aboulnaga. An algorithm and a cost model for window queries in spatial databases. Master's thesis, Department of Computer Science and Automatic Control, Alexandria University, Alexandria, Egypt, 1996."},{"key":"131780_CR2","unstructured":"W.G. Aref and H. Samet. Uniquely reporting spatial objects: yet another operation for comparing spatial data structures. In Proceedings of the Fifth International Symposium on Spatial Data Handling, pages 178\u2013189, Charleston, South Carolina, August 1992."},{"key":"131780_CR3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01210594","volume":"30","author":"W.G. Aref","year":"1993","unstructured":"W.G. Aref and H. Samet. Decomposing a window into maximal quadtree blocks. Acta Informatica, 30:425\u2013439, 1993 (also University of Maryland Computer Science TR-2771).","journal-title":"Acta Informatica"},{"key":"131780_CR4","doi-asserted-by":"crossref","unstructured":"W.G. Aref and H. Samet. Hashing by proximity to process duplicates in spatial databases. In Proceedings of the Third International Conference on Information and Knowledge Management, pages 347\u2013354, Gaithersburg, Maryland, December 1994. ACM Press.","DOI":"10.1145\/191246.191307"},{"key":"131780_CR5","series-title":"Technical Report","volume-title":"Multidimensional window retrieval in large spatial databases","author":"W.G. Aref","year":"1996","unstructured":"W.G. Aref and H. Samet. Multidimensional window retrieval in large spatial databases Technical Report CS-TR-3716, UMIACS-TR-96-86, The University of Maryland Institute for Advanced Computer Studies (UMIACS), College Park, MD, November 1996."},{"key":"131780_CR6","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 Proceedings of the SIGMOD Conference, pages 322\u2013331, Atlantic City, NJ, June 1990.","DOI":"10.1145\/93597.98741"},{"issue":"2","key":"131780_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121\u2013137, June 1979.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"131780_CR8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0146-664X(82)90020-X","volume":"19","author":"C.R. Dyer","year":"1982","unstructured":"C.R. Dyer. The space efficiency of quadtrees. Computer Graphics and Image Processing, 19(4):335\u2013348, August 1982.","journal-title":"Computer Graphics and Image Processing"},{"volume-title":"Advances in Spatial Databases\u2014Fourth International Symposium, SSD'95","year":"1995","key":"131780_CR9","unstructured":"M.J. Egenhofer and J.R. Herring, editors. Advances in Spatial Databases\u2014Fourth International Symposium, SSD'95. Springer-Verlag, Berlin, 1995. (also Lecture Notes in Computer Science 951)."},{"key":"131780_CR10","volume-title":"Fundamentals of Database Systems","author":"R. Elmasri","year":"1989","unstructured":"R. Elmasri and S.B. Navathe. Fundamentals of Database Systems. Benjamin Cummings, Redwood City, CA, 1989."},{"key":"131780_CR11","volume-title":"Analytical results on the quadtree decomposition of arbitrary rectangles","author":"C. Faloutsos","year":"1989","unstructured":"C. Faloutsos. Analytical results on the quadtree decomposition of arbitrary rectangles. Department of Computer Science UMIACS-TR-89-115\/CS-TR-2354, University of Maryland, College Park, MD, November 1989."},{"issue":"2","key":"131780_CR12","doi-asserted-by":"crossref","first-page":"160","DOI":"10.3138\/Q722-7681-3K17-JR08","volume":"21","author":"W.R. Franklin","year":"1984","unstructured":"W.R. Franklin. Adaptive grids for geometric operations. Cartographica, 21(2&3):160\u2013167, Summer & Autumn 1984.","journal-title":"Cartographica"},{"key":"131780_CR13","doi-asserted-by":"crossref","unstructured":"M. Freeston. The BANG file: a new kind of gird file. In Proceedings of the SIGMOD Conference, pages 260\u2013269, San Francisco, May 1987.","DOI":"10.1145\/38714.38743"},{"issue":"12","key":"131780_CR14","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","volume":"25","author":"I. Gargantini","year":"1982","unstructured":"I. Gargantini. An effective way to represent quadtrees. Communications of the ACM, 25(12):905\u2013910, December 1982.","journal-title":"Communications of the ACM"},{"key":"131780_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Efficient structures for geometric data management","author":"O. G\u00fcnther","year":"1987","unstructured":"O. G\u00fcnther. Efficient structures for geometric data management. PhD thesis, University of California at Berkeley, Berkeley, CA, 1987. (Lecture Notes in Computer Science 337, Springer-Verlag, Berlin, 1988)."},{"key":"131780_CR16","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the SIGMOD Conference, pages 47\u201357, Boston, MA, June 1984.","DOI":"10.1145\/971697.602266"},{"key":"131780_CR17","unstructured":"A. Henrich, H.W. Six, and P. Widmayer. The LSD tree: spatial access to multidimensional point and nonpoint data. In P.M.G. Apers and G. Wiederhold, editors, Proceedings of the Fifteenth International Conference on Very Large Data Bases (VLDB), pages 45\u201353, Amsterdam, August 1989."},{"issue":"4","key":"131780_CR18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/15886.15908","volume":"20","author":"R.C. Nelson","year":"1986","unstructured":"R.C. Nelson and H. Samet. A consistent hierarchical representation for vector data. Computer Graphics, 20(4):197\u2013206, August 1986. (also Proceedings of the SIGGRAPH'86 Conference, Dallas, August 1986).","journal-title":"Computer Graphics"},{"issue":"1","key":"131780_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems, 9(1):38\u201371, March 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"131780_CR20","volume-title":"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS","author":"H. Samet","year":"1990","unstructured":"H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990."},{"key":"131780_CR21","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990."},{"key":"131780_CR22","first-page":"338","volume-title":"Modern Database Systems, The Object Model, Interoperability and Beyond","author":"H. Samet","year":"1995","unstructured":"H. Samet and W.G. Aref. Spatial data models and query processing. In W. Kim, editor, Modern Database Systems, The Object Model, Interoperability and Beyond, pages 338\u2013360. ACM Press and Addison-Wesley, New York, 1995."},{"issue":"2","key":"131780_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TPAMI.1985.4767646","volume":"7","author":"H. Samet","year":"1985","unstructured":"H. Samet and M. Tamminen. Computing geometric properties of images represented by linear quadtrees. IEEE Transactions on Pattern Analysis and Machine intelligence, 7(2):229\u2013240, March 1985. (also University of Maryland Computer Science TR-1359).","journal-title":"IEEE Transactions on Pattern Analysis and Machine intelligence"},{"issue":"3","key":"131780_CR24","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/282957.282966","volume":"4","author":"H. Samet","year":"1985","unstructured":"H. Samet and R.E. Webber. Storing a collection of polygons using quadtrees. ACM Transactions on Graphics, 4(3):182\u2013222, July 1985. (Also Proceedings of Computer Vision and Pattern Recognition 83, Washington, DC, June 1983, 127\u2013132; and University of Maryland Computer Science TR-1372).","journal-title":"ACM Transactions on Graphics"},{"key":"131780_CR25","unstructured":"B. Seeger and H.P. Kriegel. The buddy-tree: an efficient and robust access method for spatial data base systems. In D. McLeod, R. Sacks-Davis, and H. Schek, editors, Proceedings of the Sixteenth International Conference on Very Large Data Bases (VLDB), pages 590\u2013601, Brisbane, Australia, August 1990."},{"key":"131780_CR26","unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: a dynamic index for multi-dimensional objects. In P.M. Stocker and W. Kent, editors, Proceedings of the 13th International Conference on Very Large Databases (VLDB), pages 71\u201379, Brighton, England, September 1987."},{"issue":"1","key":"131780_CR27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-8655(88)90043-8","volume":"7","author":"C.A. Shaffer","year":"1988","unstructured":"C.A. Shaffer. A formula for computing the number of quadtree node fragments created by a shift. Pattern Recognition Letters, 7(1):45\u201349, January 1988.","journal-title":"Pattern Recognition Letters"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009760201355.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009760201355\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009760201355.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:05:58Z","timestamp":1754424358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009760201355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["131780"],"URL":"https:\/\/doi.org\/10.1023\/a:1009760201355","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}