{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:25:01Z","timestamp":1778300701451,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":["Information Systems"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0306-4379(97)00029-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:15:37Z","timestamp":1027595737000},"page":"465-481","source":"Crossref","is-referenced-by-count":6,"title":["MOF-tree: A spatial access method to manipulate multiple overlapping features"],"prefix":"10.1016","volume":"22","author":[{"given":"Yannis","family":"Manolopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Nardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apostolos","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0306-4379(97)00029-X_BIB1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0734-189X(84)90079-3","article-title":"A B+-tree structure for large quadtrees","volume":"27","author":"Abel","year":"1984","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB2","series-title":"Proceedings of the 4th International Symposium on Computer and Information Sciences","article-title":"A data structure for the efficient treatment of topological join","author":"Arcieri","year":"1989"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB3","series-title":"Proceedings of the 9th ACM Symposium on Principles of Database Systems (PODS)","first-page":"265","article-title":"Efficient processing of window queries in the pyramid data structure","author":"Aref","year":"1990"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01210594","article-title":"Decomposing a window into maximal quadtree blocks","volume":"30","author":"Aref","year":"1993","journal-title":"Acta Informatica"},{"issue":"1","key":"10.1016\/S0306-4379(97)00029-X_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0167-8655(92)90112-D","article-title":"Analytical results on the quadtree decomposition of arbitrary rectangles","volume":"13","author":"Faloutsos","year":"1992","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"10.1016\/S0306-4379(97)00029-X_BIB6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1109\/69.599927","article-title":"Analysis of n-dimensional quadtree decomposition of arbitrary rectangles","volume":"9","author":"Faloutsos","year":"1997","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB7","doi-asserted-by":"crossref","unstructured":"V. Gaede. Multidimensional access methods. ACM Computing Surveys, to appear.","DOI":"10.1145\/280277.280279"},{"issue":"12","key":"10.1016\/S0306-4379(97)00029-X_BIB8","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","article-title":"An effective way to represent quadtrees","volume":"25","author":"Gargantini","year":"1982","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0046097","article-title":"Efficient Structures for Geometric Data Management","author":"Guenther","year":"1988"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1109\/TPAMI.1983.4767407","article-title":"Depth-first expression viewed from digital picture processing","volume":"5","author":"Kawaguchi","year":"1983","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"10.1016\/S0306-4379(97)00029-X_BIB11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0262-8856(95)01059-9","article-title":"On the creation of quadtrees by using a branching process","volume":"14","author":"Manolopoulos","year":"1996","journal-title":"Image Vision and Computing"},{"issue":"2","key":"10.1016\/S0306-4379(97)00029-X_BIB12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(87)90043-3","article-title":"Average efficiency of data structures for binary image processing","volume":"26","author":"Mathieu","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB13","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"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB14","first-page":"385","article-title":"An optimal resolution sensitive pyramid representation for hierarchical memory models","volume":"1","author":"Nardelli","year":"1994","journal-title":"Journal of Computing and Information"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB15","article-title":"Probabilistic models for images and quadtrees: Differences and equivalences","author":"Nardelli","year":"1995"},{"issue":"1","key":"10.1016\/S0306-4379(97)00029-X_BIB16","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\/S0306-4379(97)00029-X_BIB17","series-title":"Proceedings of the Symposium on Computational Geometry","first-page":"272","article-title":"Quadtrees, Octrees, Hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing","author":"Puech","year":"1985"},{"issue":"6","key":"10.1016\/S0306-4379(97)00029-X_BIB18","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/TPAMI.1981.4767171","article-title":"Computing perimeters of images represented by quadtrees","volume":"3","author":"Samet","year":"1981","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB19","author":"Samet","year":"1990"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB20","series-title":"Proceedings of the 3rd International Symposium on Spatial Databases (SSD)","first-page":"89","article-title":"A paging scheme for pointer-based quadtrees","author":"Shaffer","year":"1993"},{"issue":"2","key":"10.1016\/S0306-4379(97)00029-X_BIB21","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0146-664X(75)80003-7","article-title":"A hierarchical data structure for picture processing","volume":"4","author":"Tanimoto","year":"1975","journal-title":"Computer Graphics and Image Processing"},{"issue":"7","key":"10.1016\/S0306-4379(97)00029-X_BIB22","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0306-4379(94)90015-9","article-title":"Analytical comparison of two spatial data structures","volume":"19","author":"Vassilakopoulos","year":"1994","journal-title":"Information Systems"},{"key":"10.1016\/S0306-4379(97)00029-X_BIB23","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1016\/0167-8655(95)00072-O","article-title":"A random model for analyzing region quadtrees","volume":"16","author":"Vassilakopoulos","year":"1995","journal-title":"Pattern Recognition Letters"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030643799700029X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030643799700029X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T06:56:44Z","timestamp":1556348204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030643799700029X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S030643799700029X"],"URL":"https:\/\/doi.org\/10.1016\/s0306-4379(97)00029-x","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}