{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002735},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142451"},{"type":"electronic","value":"9783642142468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14246-8_34","type":"book-chapter","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T10:09:26Z","timestamp":1278410966000},"page":"345-356","source":"Crossref","is-referenced-by-count":4,"title":["iPoc: A Polar Coordinate Based Indexing Method for Nearest Neighbor Search in High Dimensional Space"],"prefix":"10.1007","author":[{"given":"Zhang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaokun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"34_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TSE.1979.234200","volume":"5","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Multidimensional binary search trees in database applications. IEEE Trans. Software Eng.\u00a05(4), 333\u2013340 (1979)","journal-title":"IEEE Trans. Software Eng."},{"key":"34_CR2","unstructured":"Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, pp. 194\u2013205 (1998)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: ACM SIGMOD, pp. 563\u2013576 (2009)","DOI":"10.1145\/1559845.1559905"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM\u00a051(1), 117\u2013122 (2008)","journal-title":"Communications of the ACM"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Shen, H., Ooi, B., Zhou, X.: Towards effective indexing for very large video sequence database. In: ACM SIGMOD, p. 741 (2005)","DOI":"10.1145\/1066157.1066240"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cui, B., Ooi, B.C., Su, J., Tan, K.L.: Contorting high dimensional data for efficient main memory processing. In: ACM SIGMOD, pp. 479\u2013490 (2003)","DOI":"10.1145\/872757.872815"},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/6046.985556","volume":"4","author":"G. Cha","year":"2002","unstructured":"Cha, G., Zhu, X., Petkovic, D., Chung, C.: An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Transactions on Multimedia\u00a04(1), 76\u201387 (2002)","journal-title":"IEEE Transactions on Multimedia"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegal, H.: The pyramid-technique: towards breaking the curse of dimensionality. In: ACM SIGMOD, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Apaydin, T., Ferhatosmanoglu, H.: Access structures for angular similarity queries. IEEE Transactions on Knowledge and Data Engineering, 1512\u20131525 (2006)","DOI":"10.1109\/TKDE.2006.165"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H. Jagadish","year":"2005","unstructured":"Jagadish, H., Ooi, B., Tan, K., Yu, C., Zhang, R.: idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS)\u00a030(2), 397 (2005)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: ACM SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: ACM SIGMOD, pp. 301\u2013312 (2003)","DOI":"10.1145\/872757.872795"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14246-8_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:49:49Z","timestamp":1606168189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14246-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142451","9783642142468"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14246-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}