{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T07:12:41Z","timestamp":1784099561448,"version":"3.55.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T00:00:00Z","timestamp":1498694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T00:00:00Z","timestamp":1498694400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60970043"],"award-info":[{"award-number":["60970043"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005950","name":"Hong Kong University of Science and Technology","doi-asserted-by":"crossref","award":["FSGRF13EG22"],"award-info":[{"award-number":["FSGRF13EG22"]}],"id":[{"id":"10.13039\/501100005950","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005950","name":"Hong Kong University of Science and Technology","doi-asserted-by":"crossref","award":["FSGRF14EG31"],"award-info":[{"award-number":["FSGRF14EG31"]}],"id":[{"id":"10.13039\/501100005950","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP130103401"],"award-info":[{"award-number":["DP130103401"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP130103405"],"award-info":[{"award-number":["DP130103405"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602186"],"award-info":[{"award-number":["61602186"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00778-017-0472-7","type":"journal-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T04:17:45Z","timestamp":1498709865000},"page":"683-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Query-aware locality-sensitive hashing scheme for $$l_p$$ norm"],"prefix":"10.1007","volume":"26","author":[{"given":"Qiang","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianlin","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiong","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"key":"472_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: ICDT, pp. 420\u2013434 (2001)","DOI":"10.1007\/3-540-44503-X_27"},{"key":"472_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Fagin, R., Kumar, R., Patrascu, M., Sivakumar, D.: Corrigendum to efficient similarity search and classification via rank aggregation by ronald fagin, ravi kumar and d. sivakumar (proceedings sigmod\u201903). In: SIGMOD, pp. 1375\u20131376 (2008)","DOI":"10.1145\/1376616.1376778"},{"key":"472_CR3","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"},{"key":"472_CR4","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P., Nguyen, H.L., Razenshteyn, I.: Beyond locality-sensitive hashing. In: SODA, pp. 1018\u20131028 (2014)","DOI":"10.1137\/1.9781611973402.76"},{"key":"472_CR5","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: STOC, pp. 793\u2013801 (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"472_CR6","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM45(6), 891\u2013923 (1998)","DOI":"10.1145\/293347.293348"},{"key":"472_CR7","doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: Lsh forest: self-tuning indexes for similarity search. In: WWW, pp. 651\u2013660 (2005)","DOI":"10.1145\/1060745.1060840"},{"key":"472_CR8","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: K-d trees for semidynamic point sets. In: SoCG, pp. 187\u2013197 (1990)","DOI":"10.1145\/98524.98564"},{"key":"472_CR9","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: ICML, pp. 97\u2013104 (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"472_CR10","doi-asserted-by":"crossref","unstructured":"Binder, K., Heermann, D.: Monte Carlo simulation in statistical physics: an introduction. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-03163-2"},{"key":"472_CR11","doi-asserted-by":"crossref","unstructured":"Cai, R., Zhang, C., Zhang, L., Ma, W.Y.: Scalable music recommendation by search. In: ACM MM, pp. 1065\u20131074 (2007)","DOI":"10.1145\/1291233.1291466"},{"issue":"354","key":"472_CR12","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1080\/01621459.1976.10480344","volume":"71","author":"JM Chambers","year":"1976","unstructured":"Chambers, J.M., Mallows, C.L., Stuck, B.: A method for simulating stable random variables. JASA 71(354), 340\u2013344 (1976)","journal-title":"JASA"},{"key":"472_CR13","doi-asserted-by":"crossref","unstructured":"Cormode, G., Indyk, P., Koudas, N., Muthukrishnan, S.: Fast mining of massive tabular data via approximate distance computations. In: ICDE, pp. 605\u2013614 (2002)","DOI":"10.1109\/ICDE.2002.994778"},{"key":"472_CR14","doi-asserted-by":"crossref","unstructured":"Curtin, R.R., Gardner, A.B.: Fast approximate furthest neighbors with data-dependent candidate selection. In: SISAP, pp. 221\u2013235 (2016)","DOI":"10.1007\/978-3-319-46759-7_17"},{"key":"472_CR15","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: STOC, pp. 537\u2013546 (2008)","DOI":"10.1145\/1374376.1374452"},{"key":"472_CR16","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: SoCG, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"472_CR17","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: SIGMOD, pp. 301\u2013312 (2003)","DOI":"10.1145\/872757.872795"},{"key":"472_CR18","doi-asserted-by":"crossref","unstructured":"Gan, J., Feng, J., Fang, Q., Ng, W.: Locality-sensitive hashing scheme based on dynamic collision counting. In: SIGMOD, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"key":"472_CR19","first-page":"518","volume":"99","author":"A Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. VLDB 99, 518\u2013529 (1999)","journal-title":"VLDB"},{"key":"472_CR20","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"472_CR21","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: A replacement for voronoi diagrams of near linear size. In: FOCS, pp. 94\u2013103 (2001)","DOI":"10.1109\/SFCS.2001.959884"},{"issue":"1","key":"472_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput. 8(1), 321\u2013350 (2012)","journal-title":"Theory Comput."},{"issue":"301","key":"472_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. JASA 58(301), 13\u201330 (1963)","journal-title":"JASA"},{"key":"472_CR24","doi-asserted-by":"crossref","unstructured":"Howarth, P., R\u00fcger, S.: Fractional distance measures for content-based image retrieval. In: ECIR, pp. 447\u2013456 (2005)","DOI":"10.1007\/978-3-540-31865-1_32"},{"issue":"1","key":"472_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/2850469.2850470","volume":"9","author":"Q Huang","year":"2015","unstructured":"Huang, Q., Feng, J., Zhang, Y., Fang, Q., Ng, W.: Query-aware locality-sensitive hashing for approximate nearest neighbor search. Proc. VLDB 9(1), 1\u201312 (2015)","journal-title":"Proc. VLDB"},{"key":"472_CR26","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"472_CR27","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV 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. TODS 30(2), 364\u2013397 (2005)","journal-title":"TODS"},{"issue":"1","key":"472_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE TPAMI 33(1), 117\u2013128 (2011)","journal-title":"IEEE TPAMI"},{"key":"472_CR29","doi-asserted-by":"crossref","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of lipschitz mappings into a hilbert space. Contemporary mathematics 26, 189\u2013206 (1984)","DOI":"10.1090\/conm\/026\/737400"},{"key":"472_CR30","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1145\/253262.253347","volume":"26","author":"N Katayama","year":"1997","unstructured":"Katayama, N., Satoh, S.: The sr-tree: an index structure for high-dimensional nearest neighbor queries. ACM SIGMOD Rec. 26, 369\u2013380 (1997)","journal-title":"ACM SIGMOD Rec."},{"key":"472_CR31","doi-asserted-by":"crossref","unstructured":"Ke, Y., Sukthankar, R., Huston, L., Ke, Y., Sukthankar, R.: Efficient near-duplicate detection and sub-image retrieval. In: ACM MM, vol.\u00a04, p.\u00a05 (2004)","DOI":"10.1145\/1027527.1027729"},{"key":"472_CR32","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: STOC, pp. 599\u2013608 (1997)","DOI":"10.1145\/258533.258653"},{"key":"472_CR33","doi-asserted-by":"crossref","unstructured":"Kong, W., Li, W.J., Guo, M.: Manhattan hashing for large-scale image retrieval. In: SIGIR, pp. 45\u201354 (2012)","DOI":"10.1145\/2348283.2348293"},{"issue":"4","key":"472_CR34","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"KI Lin","year":"1994","unstructured":"Lin, K.I., Jagadish, H.V., Faloutsos, C.: The tv-tree: an index structure for high-dimensional data. VLDBJ 3(4), 517\u2013542 (1994)","journal-title":"VLDBJ"},{"issue":"9","key":"472_CR35","doi-asserted-by":"publisher","first-page":"745","DOI":"10.14778\/2732939.2732947","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Cui, J., Huang, Z., Li, H., Shen, H.T.: Sk-lsh: an efficient index structure for approximate nearest neighbor search. Proc. VLDB 7(9), 745\u2013756 (2014)","journal-title":"Proc. VLDB"},{"key":"472_CR36","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: VLDB, pp. 950\u2013961 (2007)"},{"key":"472_CR37","doi-asserted-by":"crossref","unstructured":"Nguyen, T.T., Hui, P.M., Harper, F.M., Terveen, L., Konstan, J.A.: Exploring the filter bubble: the effect of using recommender systems on content diversity. In: WWW, pp. 677\u2013686 (2014)","DOI":"10.1145\/2566486.2568012"},{"key":"472_CR38","unstructured":"Nolan, J.P.: Stable Distributions - Models for Heavy Tailed Data. Birkhauser, Boston (2015). In progress, Chapter 1 online at academic2.american.edu\/$$\\sim $$jpnolan"},{"key":"472_CR39","doi-asserted-by":"crossref","unstructured":"Panigrahy, R.: Entropy based nearest neighbor search in high dimensions. In: SODA, pp. 1186\u20131195 (2006)","DOI":"10.1145\/1109557.1109688"},{"key":"472_CR40","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/568271.223794","volume":"24","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. ACM SIGMOD Rec. 24, 71\u201379 (1995)","journal-title":"ACM SIGMOD Rec."},{"key":"472_CR41","unstructured":"Samet, H.: Foundations of multidimensional and metric data structures. Morgan Kaufmann, Burlington (2006)"},{"issue":"1","key":"472_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/2735461.2735462","volume":"8","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Wang, W., Qin, J., Zhang, Y., Lin, X.: Srs: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. Proc. VLDB 8(1), 1\u201312 (2014)","journal-title":"Proc. VLDB"},{"issue":"3","key":"472_CR43","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1806907.1806912","volume":"35","author":"Y Tao","year":"2010","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. TODS 35(3), 20 (2010)","journal-title":"TODS"},{"key":"472_CR44","first-page":"194","volume":"98","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. VLDB 98, 194\u2013205 (1998)","journal-title":"VLDB"},{"key":"472_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, D., Agrawal, D., Chen, G., Tung, A.K.: Hashfile: An efficient index structure for multimedia data. In: ICDE, pp. 1103\u20131114 (2011)","DOI":"10.1109\/ICDE.2011.5767837"},{"key":"472_CR46","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Guo, Q., Tung, A.K., Wu, S.: Lazylsh: Approximate nearest neighbor search for multiple distance functions with a single index. In: SIGMOD, pp. 2023\u20132037. ACM (2016)","DOI":"10.1145\/2882903.2882930"},{"key":"472_CR47","doi-asserted-by":"crossref","unstructured":"Zolotarev, V.M.: One-dimensional stable distributions, vol.\u00a065. American Mathematical Society, Providence (1986)","DOI":"10.1090\/mmono\/065"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0472-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0472-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0472-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T09:17:05Z","timestamp":1750411025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0472-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,29]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["472"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0472-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,29]]},"assertion":[{"value":"10 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}