{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:57:53Z","timestamp":1725818273822},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155531"},{"type":"electronic","value":"9783319155548"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15554-8_68","type":"book-chapter","created":{"date-parts":[[2015,3,3]],"date-time":"2015-03-03T12:12:48Z","timestamp":1425384768000},"page":"777-783","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Inclusion Rule for Vantage Point Tree Range Query Processing"],"prefix":"10.1007","author":[{"given":"Guohang","family":"Zeng","sequence":"first","affiliation":[]},{"given":"Qiaozhi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Huiming","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Xingliang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yadi","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Mao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,4]]},"reference":[{"key":"68_CR1","unstructured":"MoBIos Test Suit. http:\/\/aug.csres.utexas.edu\/mobios-workload"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: ACM SIGMOD Record, pp. 357\u2013368. ACM (1997)","DOI":"10.1145\/253262.253345"},{"key":"68_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Information processing letters 40, 175\u2013179 (1991)","journal-title":"Information processing letters"},{"key":"68_CR4","series-title":"Advances in Database Systems","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search: the metric space approach","author":"P Zezula","year":"2006","unstructured":"Zezula, P., Amato, G., Dohnal, V., et al.: Similarity search: the metric space approach. Advances in Database Systems, vol. 32. Springer, Boston (2006)"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Shmoys, D.B.: In: A best possible heuristic for the k-center problem, pp. 180\u2013184. Mathematics of operations research (1985)","DOI":"10.1287\/moor.10.2.180"},{"key":"68_CR6","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321. Society for Industrial and Applied Mathematics (1993)"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Chvez, E., Navarro, G., Baeza-Yates, R. et al.: Searching in metric spaces. In: ACM computing surveys (CSUR), pp. 273\u2013321. ACM (2001)","DOI":"10.1145\/502807.502808"},{"key":"68_CR8","doi-asserted-by":"crossref","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. In: IEEE Transactions on Software Engineering, pp. 631\u2013634. IEEE (1983)","DOI":"10.1109\/TSE.1983.235263"},{"issue":"14","key":"68_CR9","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G., Chvez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters 24(14), 2357\u20132366 (2003)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Human Centered Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15554-8_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:36:17Z","timestamp":1676932577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15554-8_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155531","9783319155548"],"references-count":9,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-319-15554-8_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}
