{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:43:48Z","timestamp":1742399028579},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge and Information Systems"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1007\/bf03325102","type":"journal-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T22:40:14Z","timestamp":1374792014000},"page":"309-336","source":"Crossref","is-referenced-by-count":5,"title":["Using Unbalanced Trees for Indexing Multidimensional Objects"],"prefix":"10.1007","volume":"1","author":[{"given":"Charu","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Joel","family":"Wolf","sequence":"additional","affiliation":[]},{"given":"Philip","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Marina","family":"Epelman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,13]]},"reference":[{"key":"BF03325102_CR1","first-page":"81","volume-title":"Optimization strategies for spatial query processing","author":"W Aref","year":"1991","unstructured":"W. Aref, H. Samet. Optimization strategies for spatial query processing. In: Proc. VLDB Conference, 1991, pp. 81\u201390."},{"key":"BF03325102_CR2","first-page":"322","volume-title":"The R*-tree: An efficient and robust method for points and rectangles","author":"N Beckman","year":"1990","unstructured":"N. Beckman, H. Kriegel, R. Schneider, B. Seeger. The R*-tree: An efficient and robust method for points and rectangles. In: Proc. ACM SIGMOD Conference, 1990, pp. 322\u2013331."},{"issue":"9","key":"BF03325102_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J Bentley","year":"1975","unstructured":"J. Bentley. Multidimensional binary search trees used for associative searching, Communications of the ACM, 18(9), 509\u2013517, 1975.","journal-title":"Communications of the ACM"},{"key":"BF03325102_CR4","first-page":"4","volume-title":"Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension","author":"C Faloutsos","year":"1994","unstructured":"C. Faloutsos, I. Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In: Proc. ACM PODS Conference, 1994, pp. 4\u201319."},{"key":"BF03325102_CR5","first-page":"247","volume-title":"Fractals for secondary key retrieval","author":"C Faloutsos","year":"1989","unstructured":"C. Faloutsos, S. Roseman. Fractals for secondary key retrieval. In: Proc. ACM PODS Conference, 1989, pp. 247\u2013252."},{"issue":"12","key":"BF03325102_CR6","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 quad trees, Communications of the ACM, 25(12), 905\u2013910, 1982.","journal-title":"Communications of the ACM"},{"issue":"3","key":"BF03325102_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1109\/69.91064","volume":"3","author":"O Gunther","year":"1991","unstructured":"O. Gunther, J. Bilmes. Tree based access methods for spatial databases: Implementation and performance evaluation, IEEE Trans. Knowledge and Data Engineering, 3(3), 342\u2013356, 1991.","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"BF03325102_CR8","first-page":"47","volume-title":"A dynamic index structure for spatial searching","author":"A Guttman","year":"1984","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Conference, 1984, pp. 47\u201357."},{"key":"BF03325102_CR9","first-page":"100","volume":"83","author":"K Hinrichs","year":"1983","unstructured":"K. Hinrichs, J. Nievergelt. The grid file: A data structure to support proximity queries on spatial objects. In: Proc. WG\u201983, 1983, pp. 100\u2013113.","journal-title":"Proc. WG\u2019"},{"key":"BF03325102_CR10","first-page":"332","volume-title":"Linear clustering of objects with multiple attributes","author":"H Jagadish","year":"1990","unstructured":"H. Jagadish. Linear clustering of objects with multiple attributes. In: Proc. ACM SIGMOD Conference, 1990, pp. 332\u2013342."},{"key":"BF03325102_CR11","first-page":"500","volume-title":"Hilbert R-tree: An improved R-tree using fractals","author":"I Kamel","year":"1994","unstructured":"I. Kamel, C. Faloutsos. Hilbert R-tree: An improved R-tree using fractals. In: Proc. VLDB Conference, 1994, pp. 500\u2013509."},{"key":"BF03325102_CR12","first-page":"490","volume-title":"On packing R-trees","author":"I Kamel","year":"1993","unstructured":"I. Kamel, C. Faloutsos. On packing R-trees. In: Proc. 2nd International Conference on Information and Knowledge Management, 1993, pp. 490\u2013499."},{"key":"BF03325102_CR13","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"D Knuth","year":"1973","unstructured":"D. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison Wesley: Reading MA, USA, 1973."},{"issue":"4","key":"BF03325102_CR14","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1145\/99935.99949","volume":"15","author":"D Lomet","year":"1990","unstructured":"D. Lomet, B. Salzberg, The hB-tree: A multiattribute indexing method with good guaranteed performance, ACM TODS, 15(4), 625\u2013658, 1990.","journal-title":"ACM TODS"},{"key":"BF03325102_CR15","first-page":"326","volume-title":"Spatial query processing in an object-oriented database system","author":"J Orenstein","year":"1986","unstructured":"J. Orenstein. Spatial query processing in an object-oriented database system. In: Proc. ACM SIGMOD Conference, 1986, pp. 326\u2013336."},{"key":"BF03325102_CR16","first-page":"10","volume-title":"The K-D-B tree: A search structure for large multidimensional dynamic indexes","author":"J Robinson","year":"1981","unstructured":"J. Robinson. The K-D-B tree: A search structure for large multidimensional dynamic indexes. In: Proc. ACM SIGMOD Conference, 1981, pp. 10\u201318."},{"key":"BF03325102_CR17","volume-title":"Direct spatial search on pictorial databases using packed R-trees","author":"N Roussopoulos","year":"1985","unstructured":"N. Roussopoulos, D. Leifker. Direct spatial search on pictorial databases using packed R-trees. In: Proc. ACM SIGMOD Conference, 1985."},{"key":"BF03325102_CR18","doi-asserted-by":"crossref","unstructured":"H.Samet. The Design and Analysis of Spatial Data Structures, Addison Wesley, 1989.","DOI":"10.1007\/3-540-52208-5_28"},{"key":"BF03325102_CR19","first-page":"507","volume-title":"The R+ tree: A dynamic index structure for multi-dimensional objects","author":"T Sellis","year":"1987","unstructured":"T. Sellis, N. Roussopoulos, C. Faloutsos. The R+ tree: A dynamic index structure for multi-dimensional objects. In: Proc. VLDB Conference, 1987, pp. 507\u2013518."}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03325102.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03325102\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03325102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T16:22:50Z","timestamp":1563553370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03325102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["BF03325102"],"URL":"https:\/\/doi.org\/10.1007\/bf03325102","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}