{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:16Z","timestamp":1742598616990,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587958"},{"type":"electronic","value":"9783540491057"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58795-0_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:46:24Z","timestamp":1330274784000},"page":"259-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A hybrid pointerless representation of quadtrees for efficient processing of window queries"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Nardelli","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0734-189X(84)90079-3","volume":"27","author":"D.J. Abel","year":"1984","unstructured":"D.J. Abel, A B+-tree Structure for Large Quadtrees, in Computer Vision, Graphics and Image Processing 27, 1 (July 1984), pp. 19\u201331.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"W.G. Aref and H.Samet, Efficient processing of Window Queries in the Pyramid Data Structure, in Proc. of the Ninth ACM-SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Nashville, TN, April 1990, pp.265\u2013272.","DOI":"10.1145\/298514.298579"},{"key":"25_CR3","unstructured":"W.G. Aref and H.Samet, An Efficient Window Retrieval Algorithm for Spatial Query Processing, Technical Report n\u2218 2866 of Computer Science Department, University of Maryland, March 1992."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H. Kriegel, R. Schneider and B. Seeger, The R*-tree: an Efficient and Robust Access Method for Points and Rectangles, in Proc. of the ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, 1990, pp. 322\u2013331.","DOI":"10.1145\/93605.98741"},{"issue":"4","key":"25_CR5","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"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"M.J. Egenhofer, What's special about Spatial: Database Requirements for Vehicle Navigation in Geographic Space, Session on Database Challenges in Proc. of ACM Sigmod Int. Conf. on Management of Data, Washington DC, 1993,pp.398\u2013402.","DOI":"10.1145\/170036.170096"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, T. Sellis and N. Roussopoulos, Analysis of Object Oriented Spatial Access Methods, in Proc. of the SIGMOD Conf., San Francisco, May 1987, pp. 426\u2013439.","DOI":"10.1145\/38714.38758"},{"issue":"No.12","key":"25_CR8","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, Comm. of the ACM, Vol. 25, No. 12, 1982, pp. 905\u2013910.","journal-title":"Comm. of the ACM"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"O. G\u00fcnther, The Design of the Cell Tree: An Object Oriented Index Structure for Geometric Databases, in Proc. of the Fifth IEEE Int. Conf. on Data Engineering, Los Angeles, CA, February 1989, pp. 598\u2013605.","DOI":"10.1109\/ICDE.1989.47267"},{"issue":"No.4","key":"25_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/122058.122065","volume":"19","author":"O. Gunther","year":"1990","unstructured":"O. Gunther, O. Buchmann and A. Buchmann, Research Issues in Spatial Databases, SIGMOD RECORD, Vol. 19, No. 4, December 1990, pp. 61\u201368.","journal-title":"SIGMOD RECORD"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"A. Guttman, R-Trees: a Dynamic Index Structure for Spatial Searching, in Proc. of the SIGMOD Conf., Boston, June 1984, pp. 47\u201357.","DOI":"10.1145\/971697.602266"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"P. Kanellakis, S. Ramaswamy, D. Vengroff and J. Vitter, Indexing for Data Models with Constraints and Classes, in Proc. of the 12th ACM Symp. on Principles of Database Systems, Washington, DC, May 1993, pp. 233\u2013243","DOI":"10.1145\/153850.153884"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"E. Kawaguchi, T. Endo and M Yokota, Depth-first Expression Viewed from Digital Picture Processing, in IEEE Trans. on Pattern Analysis and Machine Intelligence, July 1983, pp. 373\u2013384.","DOI":"10.1109\/TPAMI.1983.4767407"},{"key":"25_CR14","volume-title":"The art of computer programming, Vol.3: sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"D.E.Knuth, The art of computer programming, Vol.3: sorting and searching, Addison-Wesley, Reading, MA, 1973."},{"key":"25_CR15","unstructured":"E. Nardelli and G. Proietti, Efficient Secondary Memory Processing of Window Queries on Spatial Data, in Eigth Int. Symposium on Computer and Information Sciences, Antalya, Turkey, November 1993."},{"key":"25_CR16","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 Trans. on Database Systems 9, March 1984, pp. 38\u201371.","journal-title":"ACM Trans. on Database Systems"},{"issue":"No.2","key":"25_CR17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"H. Samet, The Quadtree and Related Hierarchical Data Structures, in Computing Surveys, Vol. 16, No. 2, June 1984, pp. 187\u2013260.","journal-title":"Computing Surveys"},{"key":"25_CR18","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1989","unstructured":"H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1989."},{"issue":"1","key":"25_CR19","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":["Lecture Notes in Computer Science","IGIS '94: Geographic Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58795-0_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:39:07Z","timestamp":1742596747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58795-0_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587958","9783540491057"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-58795-0_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}