{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:02:41Z","timestamp":1725901361042},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374869"},{"type":"electronic","value":"9783642374876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37487-6_10","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T07:55:02Z","timestamp":1366185302000},"page":"101-115","source":"Crossref","is-referenced-by-count":1,"title":["Near-Optimal Partial Linear Scan for Nearest Neighbor Search in High-Dimensional Space"],"prefix":"10.1007","author":[{"given":"Jiangtao","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingfan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1109\/ICDE.2008.4497441","volume-title":"Proceedings of the 2008 IEEE 24th International Conference on Data Engineering","author":"V. Athitsos","year":"2008","unstructured":"Athitsos, V., Potamias, M., Papapetrou, P., Kollios, G.: Nearest neighbor retrieval using distance-based hashing. In: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pp. 327\u2013336. IEEE Computer Society, Washington, DC (2008)"},{"issue":"10","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TCOM.1985.1096214","volume":"33","author":"C.-D. Bei","year":"1985","unstructured":"Bei, C.-D., Gray, R.M.: An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Trans. Communication\u00a033(10), 1132\u20131133 (1985)","journal-title":"IEEE Trans. Communication"},{"key":"10_CR3","first-page":"577","volume-title":"ICDE 2000: Proceedings of the 16th International Conference on Data Engineering","author":"S. Berchtold","year":"2000","unstructured":"Berchtold, S., Bohm, C., Jagadish, H.V., Kriegel, H.-P., Sander, J.: Independent quantization: An index compression technique for high-dimensional data spaces. In: ICDE 2000: Proceedings of the 16th International Conference on Data Engineering, p. 577. IEEE Computer Society, Washington, DC (2000)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K. Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201dnearest neighbor\u201d meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv.\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0167-9473(92)90042-E","volume":"14","author":"G. Celeux","year":"1992","unstructured":"Celeux, G., Govaert, G.: A classification em algorithm for clustering and two stochastic versions. Comput. Stat. Data Anal.\u00a014(3), 315\u2013332 (1992)","journal-title":"Comput. Stat. Data Anal."},{"key":"10_CR7","first-page":"89","volume-title":"VLDB 2000: Proceedings of the 26th International Conference on Very Large Data Bases","author":"K. Chakrabarti","year":"2000","unstructured":"Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: A new approach to indexing high dimensional spaces. In: VLDB 2000: Proceedings of the 26th International Conference on Very Large Data Bases, pp. 89\u2013100. Morgan Kaufmann Publishers Inc., San Francisco (2000)"},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.is.2005.01.001","volume":"31","author":"H. Ferhatosmanoglu","year":"2006","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: High-dimensional nearest neighbor searching. Information Systems\u00a031(6), 512\u2013540 (2006)","journal-title":"Information Systems"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/ICDE.2001.914877","volume-title":"Proceedings of the 17th International Conference on Data Engineering","author":"R.F.S. Filho","year":"2001","unstructured":"Filho, R.F.S., Traina, A.J.M., Traina Jr., C., Faloutsos, C.: Similarity search without tears: The omni family of all-purpose access methods. In: Proceedings of the 17th International Conference on Data Engineering, pp. 623\u2013630. IEEE Computer Society, Washington, DC (2001)"},{"key":"10_CR10","first-page":"518","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases, VLDB 1999","author":"A. Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th International Conference on Very Large Data Bases, VLDB 1999, pp. 518\u2013529. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/602259.602266","volume-title":"SIGMOD 1984: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD 1984: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47\u201357. ACM, New York (1984)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: iDistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst.\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/ICDE.2004.1319980","volume-title":"ICDE 2004: Proceedings of the 20th International Conference on Data Engineering","author":"N. Koudas","year":"2004","unstructured":"Koudas, N., Ooi, B.C., Shen, H.T., Tung, A.K.H.: Ldc: Enabling search by partial distance in a hyper-dimensional space. In: ICDE 2004: Proceedings of the 20th International Conference on Data Engineering, p. 6. IEEE Computer Society, Washington, DC (2004)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TPAMI.2008.130","volume":"31","author":"H. Lejsek","year":"2009","unstructured":"Lejsek, H., \u00c1smundsson, F.H., J\u00f3nsson, B.P., Amsaleg, L.: Nv-tree: An efficient disk-based index for approximate search in very large high-dimensional collections. IEEE Trans. Pattern Anal. Mach. Intell.\u00a031, 869\u2013883 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR15","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB 2007, pp. 950\u2013961. VLDB Endowment (2007)"},{"key":"10_CR16","unstructured":"Postma, E.: Dimensionality reduction: A comparative review 10(February), 35 (October 2009)"},{"issue":"6","key":"10_CR17","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1109\/TKDE.2010.59","volume":"23","author":"S. Ramaswamy","year":"2011","unstructured":"Ramaswamy, S., Rose, K.: Adaptive cluster distance bounding for high-dimensional indexing. IEEE Trans. on Knowl. and Data Eng.\u00a023(6), 815\u2013830 (2011)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1145\/1066157.1066240","volume-title":"SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data","author":"H.T. Shen","year":"2005","unstructured":"Shen, H.T., Ooi, B.C., Huang, Z., Zhou, X.: Towards effective indexing for very large video sequence database. In: SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 730\u2013741. ACM, New York (2005)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/1559845.1559905","volume-title":"Proceedings of the 35th SIGMOD International Conference on Management of Data, SIGMOD 2009","author":"Y. Tao","year":"2009","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: Proceedings of the 35th SIGMOD International Conference on Management of Data, SIGMOD 2009, pp. 563\u2013576. ACM, New York (2009)"},{"key":"10_CR20","first-page":"194","volume-title":"VLDB 1998: Proceedings of the 24rd International Conference on Very Large Data Bases","author":"R. Weber","year":"1998","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB 1998: Proceedings of the 24rd International Conference on Very Large Data Bases, pp. 194\u2013205. Morgan Kaufmann Publishers Inc., San Francisco (1998)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37487-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T11:36:02Z","timestamp":1557660962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37487-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374869","9783642374876"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37487-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}