{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:37Z","timestamp":1740099097764,"version":"3.37.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319935539"},{"type":"electronic","value":"9783319935546"}],"license":[{"start":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T00:00:00Z","timestamp":1528416000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-93554-6_37","type":"book-chapter","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T10:15:20Z","timestamp":1528366520000},"page":"395-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fast PQ Hash Code Indexing"],"prefix":"10.1007","author":[{"given":"Jingsong","family":"Shan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingxin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhua","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"key":"37_CR1","unstructured":"Wang, J., Zhang, T., Song, J., et al.: A Survey on Learning to Hash. CoRR, abs\/1606.00185 (2016)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Torralba, A., Murphy, K.P., Freeman, W.T., et al.: Context-based vision system for place and objectrecognition. In: Proceedings of 9th IEEE International Conference on Computer Vision (ICCV2003), Nice, France, 14\u201317 October 2003, pp. 273\u2013280 (2003)","DOI":"10.1109\/ICCV.2003.1238354"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004)","journal-title":"Int. J. Comput. Vis."},{"issue":"3","key":"37_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1011139631724","volume":"42","author":"A Oliva","year":"2001","unstructured":"Oliva, A., Torralba, A.: Modeling the shape of the scene: a holistic representation of the spatial envelope. Int. J. Comput. Vis. 42(3), 145\u2013175 (2001)","journal-title":"Int. J. Comput. Vis."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Seidl, T., Kriegel, H.: Optimal multi-step k-Nearest neighbor search. In: Proceedings of SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, 2\u20134 June 1998, pp. 154\u2013165 (1998)","DOI":"10.1145\/276304.276319"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Xu, H., Wang, J., Li, Z., et al.: Complementary hashing for approximate nearest neighbor search. In: Proceedings of IEEE International Conference on Computer Vision, ICCV 2011, Barcelona, Spain, 6\u201313 November 2011, pp. 1631\u20131638 (2011)","DOI":"10.1109\/ICCV.2011.6126424"},{"issue":"9","key":"37_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"2","key":"37_CR8","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/PL00010672","volume":"9","author":"AW Fu","year":"2000","unstructured":"Fu, A.W., Chan, P.M., Cheung, Y., et al.: Dynamic vp-Tree indexing for n-Nearest neighbor search given pair-wise distances. VLDB J. 9(2), 154\u2013173 (2000)","journal-title":"VLDB J."},{"key":"37_CR9","volume-title":"Handbook of Discrete and Computational Geometry, Second Edition","author":"Piotr Indyk","year":"2004","unstructured":"Indyk, P.: Nearest neighbors in high-dimensional spaces. In: Proceedings of Handbook of Discrete and Computational Geometry, pp. 877\u2013892, 2nd edn. (2004)"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., et al.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, 8\u201311 June 2004, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"issue":"1","key":"37_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"37_CR12","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TPAMI.2013.240","volume":"36","author":"T Ge","year":"2014","unstructured":"Ge, T., He, K., Ke, Q., et al.: Optimized product quantization. IEEE Trans. Pattern Anal. Mach. Intell. 36(4), 744\u2013755 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Kalantidis, Y., Avrithis, Y.S.: Locally optimized product quantization for approximate nearest neighbor search. In: Proceedings of 2014 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, OH, USA, 23\u201328 June 2014, pp. 2329\u20132336 (2014)","DOI":"10.1109\/CVPR.2014.298"},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/129617.129623","volume":"35","author":"EA Fox","year":"1992","unstructured":"Fox, E.A., Heath, L.S., Chen, Q.F., et al.: Practical minimal perfect hash functions for large databases. Commun. ACM 35(1), 105\u2013121 (1992)","journal-title":"Commun. ACM"},{"key":"37_CR15","unstructured":"Limasset, A., Rizk, G., Chikhi, R., et al.: Fast and scalable minimal perfect hashing for massive keysets. CoRR, abs\/1702.03154 (2017)"},{"key":"37_CR16","unstructured":"Mitzenmacher, M., Vadhan, S.P.: Why simple hash functions work: exploiting the entropy in a data stream. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, 20\u201322 January 2008, pp. 746\u2013755 (2008)"},{"issue":"7","key":"37_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/Time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"}],"container-title":["Advances in Intelligent Systems and Computing","Innovative Mobile and Internet Services in Ubiquitous Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93554-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T10:31:49Z","timestamp":1528367509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93554-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,8]]},"ISBN":["9783319935539","9783319935546"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93554-6_37","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,6,8]]}}}