{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:01:47Z","timestamp":1759683707258},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253341"},{"type":"electronic","value":"9783540320050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11408079_36","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:38:10Z","timestamp":1292877490000},"page":"398-409","source":"Crossref","is-referenced-by-count":13,"title":["BM\u2009+\u2009-Tree: A Hyperplane-Based Index Method for High-Dimensional Metric Spaces"],"prefix":"10.1007","author":[{"given":"Xiangmin","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Berkmann, N., Krigel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In: ACM SIGMOD 1990, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: an Index Structure for High-dimensional Nearest Neighbor Queries. In: ACM SIGMOD 1997, pp. 369\u2013380 (1997)","DOI":"10.1145\/253260.253347"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity Indexing with the SS-tree. In: ICDE 1996, pp. 516\u2013523 (1996)","DOI":"10.1109\/ICDE.1996.492202"},{"issue":"4","key":"36_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"Lin, K.-I., Jagadish, H.V., Faloutsos, C.: The TV-tree: An Index Structure for High-Dimensional Data. VLDB Journal\u00a03(4), 517\u2013542 (1994)","journal-title":"VLDB Journal"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying General Proximity\/ Similarity Queries with Metric Trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"36_CR6","unstructured":"Zezula, P., Ciaccia, P., Rabitti, F.: M-tree: A Dynamic Index for Similarity Queries in Multimedia Databases. TR 7, HERMES ESPRIT LTR Project (1996)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based Indexing for High-dimensional Metric Spaces. In: ACM SIGMOD 1997, pp. 357\u2013368 (1997)","DOI":"10.1145\/253260.253345"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: VLDB 1997, Greece (1997)","DOI":"10.1145\/275487.275495"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-45151-X_34","volume-title":"Web-Age Information Management","author":"M. Ishikawa","year":"2000","unstructured":"Ishikawa, M., Chen, H., Furuse, K., Yu, J.X., Ohbo, N.: MB\u2009+\u2009tree: a Dynamically Updatable Metric Index for Similarity Search. In: Lu, H., Zhou, A. (eds.) WAIM 2000. LNCS, vol.\u00a01846, pp. 356\u2013366. Springer, Heidelberg (2000)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-46439-5_4","volume-title":"Advances in Database Technology - EDBT 2000","author":"C. Traina Jr.","year":"2000","unstructured":"Traina Jr., C., Traina, A., Seeger, B., Faloutsos, C.: Slim-trees: High Performance Metric Trees Minimizing Overlap Between Nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 51\u201365. Springer, Heidelberg (2000)"},{"key":"36_CR11","unstructured":"Zhou, X., Wang, G., Yu, J.X., Yu, G.: M\u2009+\u2009-tree: A New Dynamical Multidimensional Index for Metric Spaces. In: Proc. of 14th Australasian Database Conference (ADC 2003), pp. 161\u2013168 (2003)"},{"issue":"3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF02948912","volume":"18","author":"G. Wang","year":"2003","unstructured":"Wang, G., Lu, H., Yu, G., Bao, Y.: Managing Very Large Document Collections Using Semantics. Journal of Computer Science and Technology\u00a018(3), 403\u2013406 (2003)","journal-title":"Journal of Computer Science and Technology"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: High-dimensional Spaces - Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys (2002)","DOI":"10.1145\/502807.502809"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11408079_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T00:01:36Z","timestamp":1637020896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11408079_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253341","9783540320050"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11408079_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}