{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T21:56:54Z","timestamp":1780351014730,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030896560","type":"print"},{"value":"9783030896577","type":"electronic"}],"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-89657-7_7","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T21:02:48Z","timestamp":1634850168000},"page":"81-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Data-Driven Learned Metric Index: An Unsupervised Approach"],"prefix":"10.1007","author":[{"given":"Ter\u00e9zia","family":"Slanin\u00e1kov\u00e1","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1380-5647","authenticated-orcid":false,"given":"Matej","family":"Antol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1824-468X","authenticated-orcid":false,"given":"Jaroslav","family":"O\u01cfha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vojt\u011bch","family":"Ka\u0148a","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vlastislav","family":"Dohnal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-030-28730-6_21","volume-title":"Advances in Databases and Information Systems","author":"M Antol","year":"2019","unstructured":"Antol, M., Dohnal, V.: BM-index: balanced metric space index based on weighted Voronoi partitioning. In: Welzer, T., Eder, J., Podgorelec, V., Kami\u0161ali\u0107 Latifi\u0107, A. (eds.) ADBIS 2019. LNCS, vol. 11695, pp. 337\u2013353. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-28730-6_21"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Antol, M., Ol\u2019ha, J., Slanin\u00e1kov\u00e1, T., Dohnal, V.: Learned metric index \u2014 proposition of learned indexing for unstructured data. Inf. Syst. 100, 101774 (2021)","DOI":"10.1016\/j.is.2021.101774"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s11042-009-0339-z","volume":"47","author":"M Batko","year":"2009","unstructured":"Batko, M., et al.: Building a web-scale image similarity search system. Multimedia Tools Appl. 47(3), 599\u2013629 (2009)","journal-title":"Multimedia Tools Appl."},{"key":"7_CR4","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":"7_CR5","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R.A., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. (CSUR 2001) 33(3), 273\u2013321 (2001)","DOI":"10.1145\/502807.502808"},{"key":"7_CR6","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB 1997), Athens, Greece, 25\u201329 August 1997, pp. 426\u2013435. Morgan Kaufmann (1997)"},{"key":"7_CR7","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":"7_CR8","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Vinciguerra, G.: The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. Proc. VLDB Endow. 13(8), 1162\u20131175 (2020)","DOI":"10.14778\/3389133.3389135"},{"issue":"8","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997)","journal-title":"Neural Comput."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-41062-8_3","volume-title":"Similarity Search and Applications","author":"ME Houle","year":"2013","unstructured":"Houle, M.E., Nett, M.: Rank cover trees for nearest neighbor search. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 16\u201329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41062-8_3"},{"key":"7_CR11","doi-asserted-by":"crossref","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 13058, pp. 95\u2013103 (2021)","DOI":"10.1007\/978-3-030-89657-7_8"},{"key":"7_CR12","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with GPUs. arXiv preprint arXiv:1702.08734 (2017)"},{"key":"7_CR13","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":"7_CR14","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 2018, pp. 489\u2013504. Association for Computing Machinery (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"7_CR15","first-page":"1097","volume":"25","author":"A Krizhevsky","year":"2012","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.E.: ImageNet classification with deep convolutional neural networks. Adv. Neural Inf. Process. Syst. 25, 1097\u20131105 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"8","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","volume":"32","author":"W Li","year":"2020","unstructured":"Li, W., et al.: Approximate nearest neighbor search on high dimensional data \u2014 experiments, analyses, and improvement. IEEE Trans. Knowl. Data Eng. 32(8), 1475\u20131488 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR17","unstructured":"Llaveshi, A., Sirin, U., Ailamaki, A., West, R.: Accelerating B+tree search by using simple machine learning techniques. In: AIDB \u2014 VLDB Workshop on Applied AI for Database Systems and Applications (2019)"},{"key":"7_CR18","unstructured":"Macke, S., et al.: Lifting the curse of multidimensional data with learned existence indexes. In: Workshop on ML for Systems at NeurIPS, pp. 1\u20136 (2018)"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Mic, V., Novak, D., Zezula, P.: Binary sketches for secondary filtering. ACM Trans. Inf. Syst. 37(1), 1:1\u20131:28 (2019). https:\/\/doi.org\/10.1145\/3231936","DOI":"10.1145\/3231936"},{"key":"7_CR20","unstructured":"Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Moriyama, A., Rodrigues, L.S., Scabora, L.C., Cazzolato, M.T., Traina, A.J.M., Traina, C.: VD-tree: how to build an efficient and fit metric access method using Voronoi diagrams. In: Proceedings of the 36th Annual ACM Symposium on Applied Computing (SAC), p. 327\u2013335. ACM, New York (2021)","DOI":"10.1145\/3412841.3441915"},{"key":"7_CR22","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":"7_CR23","unstructured":"M\u00fcller, M., R\u00f6der, T., Clausen, M., Eberhardt, B., Kr\u00fcger, B., Weber, A.: Documentation Mocap database HDM05. Technical report, CG-2007-2, Universit\u00e4t Bonn (2007)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Nathan, V., Ding, J., Alizadeh, M., Kraska, T.: Learning multi-dimensional indexes. In: Proceedings of the 2020 International Conference on Management of Data (SIGMOD), pp. 985\u20131000. ACM (2020)","DOI":"10.1145\/3318464.3380579"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Navarro, G., Reyes, N.: Dynamic spatial approximation trees. J. Exp. Algorithmics 12 (2008). https:\/\/doi.org\/10.1145\/1227161.1322337","DOI":"10.1145\/1227161.1322337"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Novak, D., Batko, M., Zezula, P.: Metric index: an efficient and scalable solution for precise and approximate similarity search. Inf. Syst. 36, 721\u2013733 (2011)","DOI":"10.1016\/j.is.2010.10.002"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Novak, D., Batko, M., Zezula, P.: Large-scale image retrieval using neural net descriptors. In: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1039\u20131040. ACM (2015)","DOI":"10.1145\/2766462.2767868"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-319-10085-2_4","volume-title":"Database and Expert Systems Applications","author":"D Novak","year":"2014","unstructured":"Novak, D., Zezula, P.: Rank aggregation of candidate sets for efficient similarity search. In: Decker, H., Lhotsk\u00e1, L., Link, S., Spies, M., Wagner, R.R. (eds.) DEXA 2014. LNCS, vol. 8645, pp. 42\u201358. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10085-2_4"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Oosterhuis, H., Culpepper, J.S., de Rijke, M.: The potential of learned index structures for index compression. In: Proceedings of the 23rd Australasian Document Computing Symposium (ADCS) (2018). https:\/\/doi.org\/10.1145\/3291992.3291993","DOI":"10.1145\/3291992.3291993"},{"key":"7_CR30","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: Machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR31","unstructured":"Sablayrolles, A., Douze, M., Schmid, C., J\u00e9gou, H.: Spreading vectors for similarity search. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, 6\u20139 May 2019. OpenReview.net (2019)"},{"key":"7_CR32","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008 (2017)"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Wang, H., Fu, X., Xu, J., Lu, H.: Learned index for spatial queries. In: 20th IEEE International Conference on Mobile Data Management (MDM), pp. 569\u2013574 (2019)","DOI":"10.1109\/MDM.2019.00121"},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/ACCESS.2018.2885350","volume":"7","author":"W Xiang","year":"2019","unstructured":"Xiang, W., Zhang, H., Cui, R., Chu, X., Li, K., Zhou, W.: Pavo: a RNN-based learned inverted index, supervised or unsupervised? IEEE Access 7, 293\u2013303 (2019)","journal-title":"IEEE Access"}],"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-030-89657-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T12:46:20Z","timestamp":1725972380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89657-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030896560","9783030896577"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89657-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 October 2021","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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sisap.org\/2021\/","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":"50","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":"23","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":"5","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":"46% - 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,8","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":"3,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)"}}]}}