{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:24Z","timestamp":1750307424194,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,26]]},"DOI":"10.1145\/1871437.1871622","type":"proceedings-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T12:36:11Z","timestamp":1288096571000},"page":"1365-1368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["BP-tree"],"prefix":"10.1145","author":[{"given":"Jurandy","family":"Almeida","sequence":"first","affiliation":[{"name":"University of Campinas, Campinas, Brazil"}]},{"given":"Ricardo da S.","family":"Torres","sequence":"additional","affiliation":[{"name":"University of Campinas, Campinas, Brazil"}]},{"given":"Neucimar J.","family":"Leite","sequence":"additional","affiliation":[{"name":"University of Campinas, Campinas, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"Bishop C. M.","year":"2006","unstructured":"C. M. Bishop . Pattern Recognition and Machine Learning (Information Science and Statistics) . Springer-Verlag, Inc. , 2006 . C. M. Bishop. Pattern Recognition and Machine Learning (Information Science and Statistics). Springer-Verlag, Inc., 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/328939.328959"},{"key":"e_1_3_2_1_3_1","first-page":"574","volume-title":"VLDB","author":"Brin S.","year":"1995","unstructured":"S. Brin . Near neighbor search in large metric spaces . In VLDB , pages 574 -- 584 , 1995 . S. Brin. Near neighbor search in large metric spaces. In VLDB, pages 574--584, 1995."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.11.014"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_3_2_1_7_1","first-page":"426","volume-title":"VLDB","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In VLDB , pages 426 -- 435 , 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426--435, 1997."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000042993.50813.60"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/794189.794514"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88458-3_8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00130487"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.991715"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1590\/S0104-65002006000100004"},{"key":"e_1_3_2_1_17_1","first-page":"311","volume-title":"SODA","author":"Yianilos P. N.","year":"1993","unstructured":"P. N. Yianilos . Data structures and algorithms for nearest neighbor search in general metric spaces . In SODA , pages 311 -- 321 , 1993 . P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA, pages 311--321, 1993."}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Toronto ON Canada","acronym":"CIKM '10"},"container-title":["Proceedings of the 19th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871622","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871437.1871622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:47Z","timestamp":1750246787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871622"}},"subtitle":["an efficient index for similarity search in high-dimensional metric spaces"],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":16,"alternative-id":["10.1145\/1871437.1871622","10.1145\/1871437"],"URL":"https:\/\/doi.org\/10.1145\/1871437.1871622","relation":{},"subject":[],"published":{"date-parts":[[2010,10,26]]},"assertion":[{"value":"2010-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}