{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:10:48Z","timestamp":1648746648125},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":[[2001,4]]},"DOI":"10.1016\/s0169-023x(00)00045-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:58:13Z","timestamp":1027612693000},"page":"1-23","source":"Crossref","is-referenced-by-count":4,"title":["A generalized comparison of linear representations of thematic layers"],"prefix":"10.1016","volume":"37","author":[{"given":"Y.","family":"Manolopoulos","sequence":"first","affiliation":[]},{"given":"E.","family":"Nardelli","sequence":"additional","affiliation":[]},{"given":"G.","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"E.","family":"Tousidou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0169-023X(00)00045-8_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/320521.320530","article-title":"Prefix-B trees","volume":"2","author":"Bayer","year":"1977","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"10.1016\/S0169-023X(00)00045-8_BIB2","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 Computing Surveys"},{"issue":"12","key":"10.1016\/S0169-023X(00)00045-8_BIB3","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","article-title":"An effective way to represent quadtree","volume":"25","author":"Gargantini","year":"1982","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0169-023X(00)00045-8_BIB4","doi-asserted-by":"crossref","unstructured":"O. G\u00fcenther, Efficient structures for geometric data management, Lecture Notes in Computer Science, vol. 337, Springer, Berlin, 1988","DOI":"10.1007\/BFb0046097"},{"issue":"3","key":"10.1016\/S0169-023X(00)00045-8_BIB5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/cviu.1994.1022","article-title":"S+-trees: an efficient structure for the representation of large pictures","volume":"59","author":"de Jonge","year":"1994","journal-title":"Computer Vision, Graphics and Image Processing: Image Understanding"},{"key":"10.1016\/S0169-023X(00)00045-8_BIB6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1109\/TPAMI.1983.4767407","article-title":"Depth-first expression viewed from digital picture processing","author":"Kawaguchi","year":"1983","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"8","key":"10.1016\/S0169-023X(00)00045-8_BIB7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0306-4379(97)00029-X","article-title":"MOF-tree: a spatial access method to manipulate multiple overlapping features","volume":"22","author":"Manolopoulos","year":"1997","journal-title":"Information Systems"},{"key":"10.1016\/S0169-023X(00)00045-8_BIB8","series-title":"Advanced Database Indexing","author":"Manolopoulos","year":"1999"},{"key":"10.1016\/S0169-023X(00)00045-8_BIB9","first-page":"1","article-title":"Efficient secondary memory processing of window queries on spatial data","volume":"80","author":"Nardelli","year":"1994","journal-title":"Information Sciences"},{"issue":"1","key":"10.1016\/S0169-023X(00)00045-8_BIB10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(97)00002-1","article-title":"Time and space efficient secondary memory representation of quadtrees","volume":"22","author":"Nardelli","year":"1997","journal-title":"Information Systems"},{"key":"10.1016\/S0169-023X(00)00045-8_BIB11","doi-asserted-by":"crossref","unstructured":"E. Nardelli, G. Proietti, S*-tree: an improved S+-tree for colored images, in: Proceedings of the Third East European Conference on Advances in Databases and Information Systems (ADBIS'99), vol. 1691, Springer, LNCS, Maribor, Slovenia, 1999, pp. 156\u2013167","DOI":"10.1007\/3-540-48252-0_12"},{"issue":"4","key":"10.1016\/S0169-023X(00)00045-8_BIB12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s002360050160","article-title":"An optimal algorithm for decomposing a window into maximal quadtree blocks","volume":"36","author":"Proietti","year":"1999","journal-title":"Acta Informatica"},{"key":"10.1016\/S0169-023X(00)00045-8_BIB13","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/S0169-023X(00)00045-8_BIB14","series-title":"Applications of Spatial Data Structures","author":"Samet","year":"1990"},{"issue":"7","key":"10.1016\/S0169-023X(00)00045-8_BIB15","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/0306-4379(94)90015-9","article-title":"Analytical comparisons of two spatial data structures","volume":"19","author":"Vassilakopoulos","year":"1994","journal-title":"Information Systems"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X00000458?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X00000458?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T22:25:49Z","timestamp":1555885549000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X00000458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0169023X00000458"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(00)00045-8","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}