{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:29:56Z","timestamp":1725892196995},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540362975"},{"type":"electronic","value":"9783540362999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795131_64","type":"book-chapter","created":{"date-parts":[[2006,9,26]],"date-time":"2006-09-26T11:48:02Z","timestamp":1159271282000},"page":"442-449","source":"Crossref","is-referenced-by-count":2,"title":["A Bottom-Up Distance-Based Index Tree for Metric Space"],"prefix":"10.1007","author":[{"given":"Bing","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhihui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baile","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"20","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., Gunther, O.: Multidimensional access methods. ACM Computing Surverys\u00a020, 170\u2013231 (1998)","journal-title":"ACM Computing Surverys"},{"key":"64_CR2","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-tree: a dynamic index structure for spatial searching. In: Proceedings of ACM Conference on Management of Data, Boston, MA, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM Transactions on Database Systems\u00a028, 517\u2013580 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"64_CR4","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, pp. 311\u2013321 (1993)"},{"key":"64_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":"64_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G. Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. VLDB Journal\u00a011, 28\u201346 (2002)","journal-title":"VLDB Journal"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795131_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:10:37Z","timestamp":1605625837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795131_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540362975","9783540362999"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11795131_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}