{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:30:17Z","timestamp":1755217817740,"version":"3.43.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1023\/a:1011494316133","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T05:16:33Z","timestamp":1040620593000},"page":"181-207","source":"Crossref","is-referenced-by-count":5,"title":["The DR-tree: A Main Memory Data Structure for Complex Multi-dimensional Objects"],"prefix":"10.1007","volume":"5","author":[{"given":"Yong-Ju","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Wan","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"350936_CR1","unstructured":"A. Henrich, H.W. Six, and P. Widmayer. \u201cThe LSD Tree: Spatial access to multi-dimensional point and non-point objects,\u201d Proceedings of the 15th International Conference on Very Large Data Bases, 45-53, 1989."},{"key":"350936_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. \u201cThe R*-tree: An efficient and robust access method for points and rectangles,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 322-331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"350936_CR3","unstructured":"S. Berchtold, D.A. Keim, and H.P. Kriegel. \u201cThe X-tree: An index structure for high-dimensional data,\u201d Proceedings of the 22nd International Conference on Very Large Data Bases, 45-53, 1996."},{"key":"350936_CR4","doi-asserted-by":"crossref","unstructured":"H. Samet. The design and analysis of spatial data structures. Addison-Wesley, 1990.","DOI":"10.1007\/3-540-52208-5_28"},{"key":"350936_CR5","doi-asserted-by":"crossref","unstructured":"J.A. Orenstein. \u201cSpatial query processing in an object-oriented database system,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 326-336, 1986.","DOI":"10.1145\/16894.16886"},{"key":"350936_CR6","doi-asserted-by":"crossref","unstructured":"R. Schneider and H.P. Kriegel. \u201cThe TR*-tree: A new representation of polygonal objects supporting spatial queries and operations,\u201d Proceedings of the 7th Workshop on Computational Geometry. Lecture Notes in Computer Science 553, Springer-Verlag, 249-264, 1991.","DOI":"10.1007\/3-540-54891-2_19"},{"key":"350936_CR7","doi-asserted-by":"crossref","unstructured":"J.A. Orenstein. \u201cRedundancy in spatial databases,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 294-305, 1989.","DOI":"10.1145\/67544.66954"},{"key":"350936_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0034682","volume-title":"Proceedings of the 7th International Conference on Database and Expert Systems Applications (DEXA)","author":"Y.J. Lee","year":"1996","unstructured":"Y.J. Lee, D.M. Lee, S.J. Ryu, and C.W. Chung. \u201cControlled decomposition strategy for complex spatial objects,\u201d Proceedings of the 7th International Conference on Database and Expert Systems Applications (DEXA), Lecture Notes in Computer Science 1134, Springer-Verlag: Zurich Switzerland, 207-223, 1996."},{"key":"350936_CR9","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H.P. Kriegel, R. Schneider, and B. Seeger. \u201cGeneSys: A system for efficient spatial query processing,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 519-519, 1994.","DOI":"10.1145\/191839.191988"},{"key":"350936_CR10","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H.P. Kriegel, R. Schneider, and B. Seeger. \u201cMulti-step processing of spatial joins,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 197-208, 1994.","DOI":"10.1145\/191839.191880"},{"key":"350936_CR11","doi-asserted-by":"crossref","unstructured":"A. Guttman. \u201cR-Trees: A dynamic index structure for spatial searching,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 47-57, 1984.","DOI":"10.1145\/971697.602266"},{"key":"350936_CR12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-1-4612-1098-6_2","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag: Germany, 36-88, 1985."},{"issue":"1","key":"350936_CR13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt and H. Hinterberger. \u201cThe grid file: An adaptable, symmetric multikey file structure,\u201d ACM Transactions on Database Systems, Vol. 9(1):38-71, 1984.","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"350936_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"H. Samet. \u201cThe quadtree and related hierarchical data structures,\u201d ACM Computing Surveys, Vol. 16(2):187-260, 1984.","journal-title":"ACM Computing Surveys"},{"key":"350936_CR15","doi-asserted-by":"crossref","unstructured":"A. Hutflesz, H.W. Six, and P. Widmayer. \u201cThe R-file: An efficient access structure for proximity queries,\u201d Proc. of 6th Int. Conf. on Data Engineering, 372-379, 1990.","DOI":"10.1109\/ICDE.1990.113490"},{"key":"350936_CR16","doi-asserted-by":"crossref","unstructured":"M.J. Carey, D.J. Dewitt, M.J. Franklin, N.E. Hall, M. McAuliffe, J.F. Naughton, D.T. Schuh, M.H. Solomon, C.K. Tan, O. Tsatalos, S. White and M.J. Zwilling. \u201cShoring up persistent applications,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 383-394, 1994.","DOI":"10.1145\/191839.191915"},{"key":"350936_CR17","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H.P. Kriegel, and B. Seeger. \u201cEfficient processing of spatial joins using R-trees,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 237-246, 1993.","DOI":"10.1145\/170035.170075"},{"key":"350936_CR18","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis and T. Sellis. \u201cA model for the prediction of R-tree performance,\u201d Proceedings of the 15th ACM Symposium on Principles of Database Systems (PODS), 161-171, 1996.","DOI":"10.1145\/237661.237705"},{"key":"350936_CR19","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, T. Sellis, and N. Roussopoulos. \u201cAnalysis of object oriented spatial access methods,\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, 426-439, May 1987.","DOI":"10.1145\/38713.38758"},{"key":"350936_CR20","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos. \u201cOn packing R-trees,\u201d Proceedings of the 2nd international conference of information and knowledge management (CIKM), 490-499, 1993.","DOI":"10.1145\/170088.170403"},{"key":"350936_CR21","unstructured":"Y.W. Huang, N. Jing, and E.A. Rundensteiner. \u201cA cost model for estimating the performance of spatial joins using R-trees,\u201d Proceedings of the 9th International Conference on Scientific and Statistical Database Management, 30-38, 1997."},{"key":"350936_CR22","doi-asserted-by":"crossref","unstructured":"Y. Theodoridis, E. Stefanakis, and T. Sellis. \u201cCost models for join queries in spatial databases,\u201d Proceedings of the 14th International Conference on Data Engineering, 476-483, 1998.","DOI":"10.1109\/ICDE.1998.655810"},{"key":"350936_CR23","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, Addition-Wesley: Reading, MA, 1973."}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011494316133.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011494316133\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011494316133.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:31:49Z","timestamp":1754425909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011494316133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["350936"],"URL":"https:\/\/doi.org\/10.1023\/a:1011494316133","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}