{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:15:13Z","timestamp":1742969713457,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251979"},{"type":"electronic","value":"9783031251986"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-25198-6_7","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:32:38Z","timestamp":1676014358000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DASH: Data Aware Locality Sensitive Hashing"],"prefix":"10.1007","author":[{"given":"Zongyuan","family":"Tan","sequence":"first","affiliation":[]},{"given":"Hongya","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Du","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of ACM STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of SoCG, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s41019-021-00161-5","volume":"6","author":"Z Ren","year":"2021","unstructured":"Ren, Z., Gu, Yu., Li, C., Li, F.F., Yu, G.: GPU-based dynamic hyperspace hash with full concurrency. Data Sci. Eng. 6(3), 265\u2013279 (2021). https:\/\/doi.org\/10.1007\/s41019-021-00161-5","journal-title":"Data Sci. Eng."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Gan, J., Feng, J., Fang, Q., Ng, W.: Locality-sensitive hashing scheme based on dynamic collision counting. In: Proceedings of SIGMOD, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Huang, Q., Feng, J., Zhang, Y., et al.: Query-aware locality-sensitive hashing for approximate nearest neighbor search. In: Proceedings of VLDB, pp. 1\u201312 (2015)","DOI":"10.14778\/2850469.2850470"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Lu, K., Wang, H., Wang, W., Kudo, M.: VHP: approximate nearest neighbor search via virtual hypersphere partitioning. In: Proceedings of VLDB, pp. 1443\u20131455 (2020)","DOI":"10.14778\/3397230.3397240"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: Proceedings of STOC, pp. 793\u2013801 (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Andoni, A., Naor, A., Nikolov, A., et al.: Data-dependent hashing via nonlinear spectral gaps. In: Proceedings of ACM SOTC, pp. 787\u2013800 (2018)","DOI":"10.1145\/3188745.3188846"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Gao, J., Jagadish, H.V., et al.: DSH: data sensitive hashing for high-dimensional k-nnsearch. In: Proceedings of SIGMOD, pp. 1127\u20131138 (2014)","DOI":"10.1145\/2588555.2588565"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2010","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Dong, W., Wang, Z., Josephson, W., et al.: Modeling lsh for performance tuning. In: Proceedings of CIMK, pp. 669\u2013678 (2008)","DOI":"10.1145\/1458082.1458172"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Bustos, B. Pedreira, O. Brisaboa, N.: A dynamic pivot selection technique for similarity search. In: Proceedings of SISAP, pp. 394\u2013401 (2008)","DOI":"10.1109\/SISAP.2008.12"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: Proceedings of CVPR, pp. 2946\u20132953 (2013)","DOI":"10.1109\/CVPR.2013.379"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.: Tree quantization for large-scale similarity search and classification. In: Proceedings of CVPR, pp. 4240\u20134248 (2015)","DOI":"10.1109\/CVPR.2015.7299052"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s41019-022-00182-8","volume":"7","author":"P Yi","year":"2022","unstructured":"Yi, P., Li, J., Choi, B., Bhowmick, S.S., Xu, J.: FLAG: towards graph query autocompletion for large graphs. Data Sci. Eng. 7(2), 175\u2013191 (2022)","journal-title":"Data Sci. Eng."},{"key":"7_CR17","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. (2018)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Zheng, B., Xi, Z., Weng, L. et al.: PM-LSH: A fast and accurate LSH framework for high-dimensional approximate NN search. In: Proceedings of VLDB, pp. 643\u2013655 (2020)","DOI":"10.14778\/3377369.3377374"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Lu, K. and Kudo, M.: R2LSH: A nearest neighbor search scheme based on two-dimensional projected spaces. In: Proceedings of ICDE, pp. 1045\u20131056 (2020)","DOI":"10.1109\/ICDE48307.2020.00095"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Sun, Y., Wang, W., Qin, J., et al.: SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. In: Proceedings of VLDB, pp. 1\u201312 (2014)","DOI":"10.14778\/2735461.2735462"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Arora, A., Sinha, S., Kumar, P., Bhattacharya, A.: Hd-index: Pushing the scalability-accuracy boundary for approximate knn search in highdimensional spaces. In: Proceedings of VLDB, pp. 906\u2013919 (2018)","DOI":"10.14778\/3204028.3204034"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Liu, Y, Cheng, H, Cui, J.: PQBF: I\/O-efficient approximate nearest neighbor search by product quantization. In: CIKM, pp. 667\u2013676 (2017)","DOI":"10.1145\/3132847.3132901"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Satuluri, V., Parthasarathy, S.: Bayesian locality sensitive hashing for fast similarity search. In: Proceedings of VLDB, pp. 430\u2013441 (2012)","DOI":"10.14778\/2140436.2140440"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25198-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T22:46:54Z","timestamp":1728859614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25198-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251979","9783031251986"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25198-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}