{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T17:28:46Z","timestamp":1745429326968,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031469930"},{"type":"electronic","value":"9783031469947"}],"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-46994-7_24","type":"book-chapter","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:16Z","timestamp":1698303736000},"page":"282-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SISAP 2023 Indexing Challenge \u2013 Learned Metric Index"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0502-1145","authenticated-orcid":false,"given":"Ter\u00e8zia","family":"Slanin\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2765-8329","authenticated-orcid":false,"given":"David","family":"Proch\u00e1zka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1380-5647","authenticated-orcid":false,"given":"Matej","family":"Antol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1824-468X","authenticated-orcid":false,"given":"Jaroslav","family":"Olha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7768-7435","authenticated-orcid":false,"given":"Vlastislav","family":"Dohnal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Antol, M., O\u00edha, J., Slanin\u00e1kov\u00e1, T., Dohnal, V.: Learned metric index - proposition of learned indexing for unstructured data. Inf. Syst. 100 (2021)","DOI":"10.1016\/j.is.2021.101774"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-32047-8_6","volume-title":"Similarity Search and Applications","author":"M Berrendorf","year":"2019","unstructured":"Berrendorf, M., Borutta, F., Kr\u00f6ger, P.: k-Distance approximation for memory-efficient RkNN retrieval. In: Amato, G., Gennaro, C., Oria, V., Radovanovi\u0107, M. (eds.) SISAP 2019. LNCS, vol. 11807, pp. 57\u201371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32047-8_6"},{"key":"24_CR3","unstructured":"Dong, Y., Indyk, P., Razenshteyn, I.P., Wagner, T.: Learning space partitions for nearest neighbor search. In: 8th International Conference on Learning Representations, ICLR, Addis Ababa, Ethiopia, 26\u201330 April 2020 (2020)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Galakatos, A., Markovitch, M., Binnig, C., Fonseca, R., Kraska, T.: FITing-tree: a data-aware index structure. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 1189\u20131206. ACM (2019)","DOI":"10.1145\/3299869.3319860"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-030-89657-7_8","volume-title":"Similarity Search and Applications","author":"M H\u00fcnem\u00f6rder","year":"2021","unstructured":"H\u00fcnem\u00f6rder, M., Kr\u00f6ger, P., Renz, M.: Towards a learned index structure for approximate nearest neighbor search query processing. In: Reyes, N., et al. (eds.) SISAP 2021. LNCS, vol. 13058, pp. 95\u2013103. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89657-7_8"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","volume":"7","author":"J Johnson","year":"2019","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with GPUs. IEEE Trans. Big Data 7(3), 535\u2013547 (2019)","journal-title":"IEEE Trans. Big Data"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Lin, K.-I., Yang, C.: The Ann-tree: an index for efficient approximate nearest neighbor search. In: Proceedings Seventh International Conference on Database Systems for Advanced Applications. DASFAA 2001, pp. 174\u2013181, April 2001","DOI":"10.1109\/DASFAA.2001.916376"},{"key":"24_CR8","unstructured":"Kraska, T., et al.: SageDB: a learned database system. In: CIDR 2019, 9th Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, 13\u201316 January 2019, Online Proceedings (2019). www.cidrdb.org"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data. SIGMOD \u201918, pp. 489\u2013504. Association for Computing Machinery (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"24_CR10","unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: International Conference on Computer Vision Theory and Applications (VISAPP), pp. 331\u2013340 (2009)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-031-17849-8_22","volume-title":"Similarity Search and Applications - SISAP 2022","author":"J Olha","year":"2022","unstructured":"Olha, J., Slanin\u00e1kov\u00e1, T., Gendiar, M., Antol, M., Dohnal, V.: Learned indexing in proteins: substituting complex distance calculations with embedding and clustering techniques. In: Skopal, T., Falchi, F., Loko\u010d, J., Sapino, M.L., Bartolini, I., Patella, M. (eds.) SISAP 2022. LNCS, vol. 13590, pp. 274\u2013282. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17849-8_22"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1009745219419","volume":"2","author":"J Sander","year":"1998","unstructured":"Sander, J., Ester, M., Kriegel, H.P., Xu, X.: Density-based clustering in spatial databases: the algorithm GDBScan and its applications. Data Min. Knowl. Disc. 2(2), 169\u2013194 (1998)","journal-title":"Data Min. Knowl. Disc."},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-32047-8_16","volume-title":"Similarity Search and Applications","author":"E Schubert","year":"2019","unstructured":"Schubert, E., Rousseeuw, P.J.: Faster k-medoids clustering: improving the PAM, CLARA, and CLARANS algorithms. In: Amato, G., Gennaro, C., Oria, V., Radovanovi\u0107, M. (eds.) SISAP 2019. LNCS, vol. 11807, pp. 171\u2013187. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32047-8_16"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-030-89657-7_7","volume-title":"Similarity Search and Applications","author":"T Slanin\u00e1kov\u00e1","year":"2021","unstructured":"Slanin\u00e1kov\u00e1, T., Antol, M., O\u013eha, J., Ka\u0148a, V., Dohnal, V.: Data-driven learned metric index: an unsupervised approach. In: Reyes, N., et al. (eds.) SISAP 2021. LNCS, vol. 13058, pp. 81\u201394. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89657-7_7"},{"key":"24_CR15","doi-asserted-by":"publisher","unstructured":"Slanin\u00e1kov\u00e1, T., Antol, M., Ol\u00edha, J., Dohnal, V., Ladra, S., Mart\u00ednez-Prieto, M.A.: Reproducible experiments with learned metric index framework. Inf. Syst. 102255 (2023). https:\/\/doi.org\/10.1016\/j.is.2023.102255","DOI":"10.1016\/j.is.2023.102255"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Van Der Walt, S., Colbert, S.C., Varoquaux, G.: The numpy array: a structure for efficient numerical computation. Comput. Sci. Eng. 13(2) (2011)","DOI":"10.1109\/MCSE.2011.37"},{"issue":"9","key":"24_CR17","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1109\/TASLP.2018.2831456","volume":"26","author":"C Zhang","year":"2018","unstructured":"Zhang, C., Koishida, K., Hansen, J.H.: Text-independent speaker verification based on triplet convolutional neural network embeddings. IEEE\/ACM Trans. Audio Speech Lang. Process. 26(9), 1633\u20131644 (2018)","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46994-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T21:20:49Z","timestamp":1730409649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46994-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031469930","9783031469947"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46994-7_24","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":"27 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coruna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"33","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":"16","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":"4","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":"48% - 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":"2","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":"Familiarity, LaTeX and LNCS friendly, steering committee has subscription","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)"}}]}}