{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:18:55Z","timestamp":1740028735419,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441267"},{"type":"electronic","value":"9783540461463"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46146-9_92","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:14:30Z","timestamp":1269897270000},"page":"935-944","source":"Crossref","is-referenced-by-count":3,"title":["Clustered Indexing Technique for Multidimensional Index Structures"],"prefix":"10.1007","author":[{"given":"Guang-Ho","family":"Cha","sequence":"first","affiliation":[]},{"given":"Yong-Ik","family":"Yoon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"92_CR1","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 Proc. of ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331, 1990.","DOI":"10.1145\/93597.98741"},{"key":"92_CR2","unstructured":"S. Berchtold, D.A. Keim, H.-P. Kriegel, \u201cThe X-tree: An Index Structure for High-Dimensional Data,\u201d Proc. of the 22nd International Conference on Very Large Data Bases, pp. 28\u201339, 1996."},{"key":"92_CR3","unstructured":"J.v.d. Bercken, B. Seeger, and P. Widmayer, \u201cA Generic Approach to Bulk Loading Multidimensional Index Structures,\u201d Proc. of the International Conference on Very Large Data Bases, pp. 406\u2013415, 1997."},{"key":"92_CR4","unstructured":"P. Ciaccia, M. Patella, and P. Zezula, \u201cM-tree: An Efficient Access Method for Similarity Search in Metric Space,\u201d Proc. of the International Conference on Very Large Data Bases, pp. 426\u2013435, 1997."},{"key":"92_CR5","doi-asserted-by":"crossref","unstructured":"M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, \u201cQuery by image and video content: the QBIC system,\u201d IEEE Computer, Vol. 28, pp. 23\u201332, Sep. 1995.","DOI":"10.1109\/2.410146"},{"key":"92_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/271074.271094","volume":"26","author":"Gray","year":"1997","unstructured":"Gray and G. Graefe, \u201cThe Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb,\u201d ACM SIGMOD Record, Vol 26, No. 4, pp. 63\u201368, Dec. 1997.","journal-title":"ACM SIGMOD Record"},{"key":"92_CR7","doi-asserted-by":"crossref","unstructured":"Guttman, \u201cR-Trees: A Dynamic Index Structure for Spatial Searching,\u201d Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 47\u201357, 1984.","DOI":"10.1145\/971697.602266"},{"key":"92_CR8","doi-asserted-by":"crossref","unstructured":"Henrich, \u201cThe LSDh-tree: An Access Structure for Feature Vectors\u201d, Proc. of the 14th International Conference on Data Engineering, pp. 362\u2013369, 1998.","DOI":"10.1109\/ICDE.1998.655799"},{"key":"92_CR9","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, 1973."},{"key":"92_CR10","doi-asserted-by":"crossref","unstructured":"J.-H. Lee, D.-H. Kim, and C.-W. Chung, \u201cMultidimensional Selectivity Estimation Using Compressed Histogram Information,\u201d Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 205\u2013214, 1999.","DOI":"10.1145\/304182.304200"},{"key":"92_CR11","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"K.-I. Lin, H.V. Jagadish, and C. Faloutsos, \u201cThe TV-tree: An Index Structure for High-Dimensional Data,\u201d VLDB Journal, Vol. 3, No. 4, pp. 517\u2013542, 1994.","journal-title":"VLDB Journal"},{"key":"92_CR12","doi-asserted-by":"crossref","unstructured":"W. Litwin and D.B. Lomet, \u201cThe Bounded Disorder Access Method,\u201d Proc. of the IEEE International Conference on Data Engineering, pp. 38\u201348, 1986.","DOI":"10.1109\/ICDE.1986.7266204"},{"key":"92_CR13","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1145\/49346.50067","volume":"13","author":"D.B. Lomet","year":"1988","unstructured":"D.B. Lomet, \u201cA Simple Bounded Disorder File Organization with Good Performance,\u201d ACM Transactions on Database Systems, Vol. 13, No. 4, pp. 525\u2013551, Dec. 1988.","journal-title":"ACM Transactions on Database Systems"},{"issue":"1","key":"92_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K.C. Sevcik, \u201cThe grid file: an adaptable, symmetric multikey file structure,\u201d ACM Transactions on Database Systems, Vol. 9, No.1, pp. 38\u201371, 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"92_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01185680","volume":"29","author":"P.E. O\u2019Neil","year":"1992","unstructured":"P.E. O\u2019Neil, \u201cThe SB-tree: An Index-Sequential Structure for High-Performance Sequential Access,\u201d Acta Informatica, Vol. 29, pp. 241\u2013265, 1992.","journal-title":"Acta Informatica"},{"key":"92_CR16","unstructured":"Seeger and H.-P. Kriegel, \u201cThe Buddy-tree: An Efficient and Robust Access Method for Spatial Data Base Systems,\u201d Proc. of the 16th International Conference on Very Large Data Bases, pp. 590\u2013601, 1990."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46146-9_92","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:17:37Z","timestamp":1739992657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46146-9_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441267","9783540461463"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46146-9_92","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}