{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:37:01Z","timestamp":1742971021054,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030731960"},{"type":"electronic","value":"9783030731977"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-73197-7_38","type":"book-chapter","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T19:03:01Z","timestamp":1617735781000},"page":"569-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MLSH: Mixed Hash Function Family for Approximate Nearest Neighbor Search in Multiple Fractional Metrics"],"prefix":"10.1007","author":[{"given":"Kejing","family":"Lu","sequence":"first","affiliation":[]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,6]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional spaces. In: ICDT, pp. 420\u2013434 (2001)","DOI":"10.1007\/3-540-44503-X_27"},{"key":"38_CR2","unstructured":"Aref, W.G., et al.: A video database management system for advancing video database research. In: Multimedia Information Systems, pp. 8\u201317 (2002)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Zheng, B., Zhao, X., Weng, L., Hung, N.Q.V., Liu, H., Jensen, C.S.: PM-LSH: A fast and accurate LSH framework for high-dimensional approximate NN search. PVLDB 13(5), 643\u2013655 (2020)","DOI":"10.14778\/3377369.3377374"},{"key":"38_CR4","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)"},{"key":"38_CR5","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"},{"issue":"7","key":"38_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/TKDE.2007.1037","volume":"19","author":"D Francois","year":"2007","unstructured":"Francois, D., Wertz, V., Verleysen, M.: The concentration of fractional distances. IEEE Trans. Knowl. Data Eng. 19(7), 873\u2013886 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"38_CR7","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":"38_CR8","unstructured":"He, J., Kumar, S., Chang, S.F.: On the difficulty of nearest neighbor search. In: ICML, pp. 1127\u20131134 (2012)"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Howarth, P., Ruger, 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":"5","key":"38_CR10","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$${}_{\\text{ p }}$$ norm. VLDB J. 26(5), 683\u2013708 (2017)","journal-title":"VLDB J."},{"issue":"1","key":"38_CR11","first-page":"1","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. PVLDB 9(1), 1\u201312 (2015)","journal-title":"PVLDB"},{"key":"38_CR12","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"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Ke, Y., Sukthankar, R., Huston, L.: An efficient parts-based near-duplicate and sub-image retrieval system. In: ACM Multimedia, pp. 869\u2013876 (2004)","DOI":"10.1145\/1027527.1027729"},{"issue":"8","key":"38_CR14","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","volume":"32","author":"W Li","year":"2020","unstructured":"Li, W., Zhang, Y., Sun, Y., Wang, W., Zhang, W., Lin, X.: Approximate nearest neighbor search on high dimensional data - experiments, analyses, and improvement. IEEE Trans. Knowl. Data Eng. 32(8), 1475\u20131488 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Lu, K., Kudo, M.: R2LSH: A nearest neighbor search scheme based on two-dimensional projected spaces. In: ICDE, pp. 1045\u20131056 (2020)","DOI":"10.1109\/ICDE48307.2020.00095"},{"issue":"9","key":"38_CR16","first-page":"1443","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. PVLDB 13(9), 1443\u20131455 (2020)","journal-title":"PVLDB"},{"issue":"1","key":"38_CR17","first-page":"1","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. PVLDB 8(1), 1\u201312 (2014)","journal-title":"PVLDB"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Guo, Q., Tung, A.K.H., Wu, S.: LazyLSH: Approximate nearest neighbor search for multiple distance functions with a single index. In: SIGMOD, pp. 2023\u20132037 (2016)","DOI":"10.1145\/2882903.2882930"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73197-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T15:19:25Z","timestamp":1628349565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73197-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030731960","9783030731977"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73197-7_38","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":"6 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dm.iis.sinica.edu.tw\/DASFAA2021\/index.html","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":"490","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":"98","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":"33","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":"20% - 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":"7","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":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}