{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:11Z","timestamp":1725490271860},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664857"},{"type":"electronic","value":"9783540482529"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48252-0_12","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T04:51:20Z","timestamp":1188190280000},"page":"156-168","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["S*-Tree: An Improved S+-Tree for Coloured Images"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Nardelli","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0734-189X(84)90079-3","volume":"27","author":"W.G. Aref","year":"1984","unstructured":"W.G. Aref and H. Samet. A B+-tree structure for large quadtrees. Computer Vision, Graphics and Image Processing, 27(1):19\u201331, July 1984.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"W.G. Aref and H. Samet. Efficient processing of window queries in the pyramid data In Proc. of the 9th ACM-SIGMOD Symposium on Principles of Database Systems, pages 265\u2013272, Nashville, TN, 1990.","DOI":"10.1145\/298514.298579"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/cviu.1994.1022","volume":"59","author":"W. Jonge de","year":"1994","unstructured":"W. de Jonge, P. Scheuermann, and A. Schijf. S+-trees: an efficient structure for the representation of large pictures. Computer Vision, Graphics and Image Processing: Image Understanding, 59(3):265\u2013280, May 1994.","journal-title":"Computer Vision, Graphics and Image Processing: Image Understanding"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/69.599927","volume":"9","author":"C. Faloutsos","year":"1997","unstructured":"C. Faloutsos, H.V. Jagadish, and Y. Manolopoulos. Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles. IEEE Transactions on Knowledge and Data Engineering, 9(3):373\u2013383, 1997.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"12","key":"12_CR5","first-page":"905","volume":"25","author":"I. Gargantini","year":"1982","unstructured":"I. Gargantini. An effective way to represent quadtrees. IEEE Trans. on Pattern Analysis and Machine Intelligence, 25(12):905\u2013910, 1982.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"E. Kawaguchi, T. Endo, and M. Yokota. Depth-first expression viewed from digital picture processing. IEEE Trans. on Pattern Analysis and Machine Intelligence, pages 373\u2013384, July 1983.","DOI":"10.1109\/TPAMI.1983.4767407"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(97)00002-1","volume":"22","author":"E. Nardelli","year":"1997","unstructured":"E. Nardelli and G. Proietti. Time and space efficient secondary memory representation of quadtrees. Information Systems, 22(1):25\u201337, 1997.","journal-title":"Information Systems"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"G. Proietti. An optimal algorithm for decomposing a window into maximal quadtree blocks. Acta Informatica, 1999. To appear.","DOI":"10.1007\/s002360050160"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","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. Computing Surveys, 16(2):187\u2013260, June 1984.","journal-title":"Computing Surveys"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01999102","volume":"5","author":"H. Samet","year":"1989","unstructured":"H. Samet and R.E. Webber. A comparison of the space requirements of multi-dimensional quadtree-based file structures. Visual Computer, 5(6):349\u2013359, December 1989.","journal-title":"Visual Computer"},{"key":"12_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-56869-7_6","volume-title":"Advances in Spatial Databases","author":"C.A. Shaffer","year":"1993","unstructured":"C.A. Shaffer and P.R. Brown. A paging scheme for pointer-based quadtrees. In D. Abel and B.C. Ooi, editors, Advances in Spatial Databases, pages 89\u2013104. Lecture Notes in Computer Science 692, Springer Verlag, 1993."},{"key":"12_CR12","first-page":"174","volume":"2","author":"M. Tamminen","year":"1984","unstructured":"M. Tamminen. Encoding pixel trees. Computer Vision, Graphics and Image Processing, 2:174\u2013196, 1984.","journal-title":"Computer Vision, Graphics and Image Processing"},{"issue":"7","key":"12_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0306-4379(94)90015-9","volume":"19","author":"M. Vassilakopoulos","year":"1994","unstructured":"M. Vassilakopoulos and Y. Manolopoulos. Analytical comparison of two spatial data structures. Information Systems, 19(7):269\u2013282, 1994.","journal-title":"Information Systems"},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0262-8856(93)90002-X","volume":"11","author":"M. Vassilakopoulos","year":"1993","unstructured":"M. Vassilakopoulos, Y. Manolopoulos, and K. Economou. Overlapping quadtrees for the representation of similar images. Image and Vision Computing, 11(5):257\u2013262, 1993.","journal-title":"Image and Vision Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48252-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T11:03:05Z","timestamp":1585998185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48252-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664857","9783540482529"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48252-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"29 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}