{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:26:36Z","timestamp":1742923596885,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864743"},{"type":"electronic","value":"9783030864750"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86475-0_6","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T07:03:29Z","timestamp":1630393409000},"page":"58-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["NV-QALSH: An NVM-Optimized Implementation of Query-Aware Locality-Sensitive Hashing"],"prefix":"10.1007","author":[{"given":"Zhili","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaqiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianlin","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"6_CR1","unstructured":"Chen, S., Gibbons, P.B., Nath, S., et al.: Rethinking database algorithms for phase change memory. In: CIDR, vol. 11, p. 5 (2011)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"6_CR3","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 the 2012 ACM SIGMOD International Conference on Management of Data, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"issue":"9","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.14778\/3397230.3397243","volume":"13","author":"L Gong","year":"2020","unstructured":"Gong, L., Wang, H., Ogihara, M., Xu, J.: iDEC: indexable distance estimating codes for approximate nearest neighbor search. Proc. VLDB Endow. 13(9), 1483\u20131497 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"6_CR5","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00778-017-0472-7","volume":"26","author":"Q Huang","year":"2017","unstructured":"Huang, Q., Feng, J., Fang, Q., Ng, W., Wang, W.: Query-aware locality-sensitive hashing scheme for $$l_p$$ norm. VLDB J. 26(5), 683\u2013708 (2017). https:\/\/doi.org\/10.1007\/s00778-017-0472-7","journal-title":"VLDB J."},{"issue":"1","key":"6_CR6","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 Endow. 9(1), 1\u201312 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Lei, Y., Huang, Q., Kankanhalli, M., Tung, A.K.: Locality-sensitive hashing scheme based on longest circular co-substring. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2589\u20132599 (2020)","DOI":"10.1145\/3318464.3389778"},{"issue":"7","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.14778\/3384345.3384355","volume":"13","author":"J Liu","year":"2020","unstructured":"Liu, J., Chen, S., Wang, L.: Lb+ trees: optimizing persistent index performance on 3dxpoint memory. Proc. VLDB Endow. 13(7), 1078\u20131090 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Liu, W., Wang, H., Zhang, Y., Wang, W., Qin, L.: I-LSH: I\/O efficient c-approximate nearest neighbor search in high-dimensional space. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1670\u20131673. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00169"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Lu, K., Kudo, M.: R2LSH: a nearest neighbor search scheme based on two-dimensional projected spaces. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1045\u20131056. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00095"},{"issue":"9","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.14778\/3397230.3397240","volume":"13","author":"K Lu","year":"2020","unstructured":"Lu, K., Wang, H., Wang, W., Kudo, M.: VHP: approximate nearest neighbor search via virtual hypersphere partitioning. Proc. VLDB Endow. 13(9), 1443\u20131455 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR13","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, pp. 950\u2013961 (2007)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Oukid, I., Lasperas, J., Nica, A., Willhalm, T., Lehner, W.: FPTree: A hybrid SCM-DRAM persistent and concurrent B-tree for storage class memory. In: Proceedings of the 2016 International Conference on Management of Data, pp. 371\u2013386 (2016)","DOI":"10.1145\/2882903.2915251"},{"key":"6_CR15","doi-asserted-by":"crossref","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. In: Proceedings of the VLDB Endowment (2014)","DOI":"10.14778\/2735461.2735462"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","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. ACM Trans. Database Syst. (TODS) 35(3), 1\u201346 (2010)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"6_CR17","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":"6_CR18","doi-asserted-by":"crossref","unstructured":"Yang, C., Deng, D., Shang, S., Shao, L.: Efficient locality-sensitive hashing over high-dimensional data streams. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1986\u20131989. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00220"},{"key":"6_CR19","unstructured":"Yang, J., Kim, J., Hoseinzadeh, M., Izraelevitz, J., Swanson, S.: An empirical guide to the behavior and use of scalable persistent memory. In: 18th $$\\{$$USENIX$$\\}$$ Conference on File and Storage Technologies ($$\\{$$FAST$$\\}$$ 2020), pp. 169\u2013182 (2020)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86475-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:05:52Z","timestamp":1710327952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86475-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864743","9783030864750"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86475-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","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":"37","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":"31","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","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)"}}]}}