{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:59:33Z","timestamp":1742936373797,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030287290"},{"type":"electronic","value":"9783030287306"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-28730-6_21","type":"book-chapter","created":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T23:02:44Z","timestamp":1566946964000},"page":"337-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["BM-index: Balanced Metric Space Index Based on Weighted Voronoi Partitioning"],"prefix":"10.1007","author":[{"given":"Matej","family":"Antol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vlastislav","family":"Dohnal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1007\/s11042-012-1271-1","volume":"71","author":"G Amato","year":"2014","unstructured":"Amato, G., Gennaro, C., Savino, P.: MI-File: using inverted files for scalable approximate similarity search. Multimed. Tools Appl. 71, 1333\u20131362 (2014)","journal-title":"Multimed. Tools Appl."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0031-3203(84)90064-5","volume":"17","author":"F Aurenhammer","year":"1984","unstructured":"Aurenhammer, F., Edelsbrunner, H.: An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recogn. 17(2), 251\u2013257 (1984)","journal-title":"Pattern Recogn."},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv. 23(3), 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"21_CR4","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. Multimed. Tools Appl. 47(3), 599\u2013629 (2009)","journal-title":"Multimed. Tools Appl."},{"key":"21_CR5","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21th International Conference on Very Large Data Bases, VLDB 1995, pp. 574\u2013584. Morgan Kaufmann Publishers Inc., San Francisco (1995)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44808-X_12","volume-title":"Algorithm Engineering and Experimentation","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G.: A probabilistic spell for the curse of dimensionality. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 147\u2013160. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44808-X_12"},{"key":"21_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21257-9","volume-title":"Operators for Similarity Search: Semantics, Techniques and Usage Scenarios","author":"P Deepak","year":"2015","unstructured":"Deepak, P., Prasad, M.D.: Operators for Similarity Search: Semantics, Techniques and Usage Scenarios. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21257-9"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Esuli, A.: MiPai: using the pp-index to build an efficient and scalable similarity search system. In: Second International Workshop on Similarity Search and Applications, SISAP 2009, 29\u201330 2009, Prague, Czech Republic, pp. 146\u2013148 (2009)","DOI":"10.1109\/SISAP.2009.14"},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ipm.2010.11.011","volume":"48","author":"A Esuli","year":"2012","unstructured":"Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. Inform. Process. Manage. (IPM) 48(5), 889\u2013902 (2012)","journal-title":"Inform. Process. Manage. (IPM)"},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/s0895480102412856","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. SIAM J. Discrete Math. (2003). https:\/\/doi.org\/10.1137\/s0895480102412856","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-02224-2_10","volume-title":"Similarity Search and Applications","author":"K Figueroa","year":"2018","unstructured":"Figueroa, K., Paredes, R., Reyes, N.: New permutation dissimilarity measures for proximity searching. In: Marchand-Maillet, S., Silva, Y.N., Ch\u00e1vez, E. (eds.) SISAP 2018. LNCS, vol. 11223, pp. 122\u2013133. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02224-2_10"},{"issue":"5","key":"21_CR12","first-page":"4:1","volume":"36","author":"V Mic","year":"2018","unstructured":"Mic, V., Novak, D., Zezula, P.: Binary sketches for secondary filtering. ACM Trans. Inform. Syst. 36(5), 4:1\u20134:30 (2018)","journal-title":"ACM Trans. Inform. Syst."},{"issue":"12","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.14778\/2824032.2824059","volume":"8","author":"B Naidan","year":"2015","unstructured":"Naidan, B., Boytsov, L., Nyberg, E.: Permutation search methods are efficient, yet faster search is possible. Proc. VLDB Endow. 8(12), 1618\u20131629 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.is.2010.10.002","volume":"36","author":"D Novak","year":"2011","unstructured":"Novak, D., Batko, M., Zezula, P.: Metric index: an efficient and scalable solution for precise and approximate similarity search. Inform. Syst. 36, 721\u2013733 (2011)","journal-title":"Inform. Syst."},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-662-49214-7_2","volume-title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIV","author":"D Novak","year":"2016","unstructured":"Novak, D., Zezula, P.: PPP-codes for large-scale similarity searching. In: Hameurlain, A., K\u00fcng, J., Wagner, R., Decker, H., Lhotska, L., Link, S. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIV. LNCS, vol. 9510, pp. 61\u201387. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49214-7_2"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Paredes, R.U., Navarro, G.: EGNAT: a fully dynamic metric access method for secondary memory. In: Second International Workshop on Similarity Search and Applications, SISAP 2009, 29\u201330 2009, Czech Republic, pp. 57\u201364 (2009)","DOI":"10.1109\/SISAP.2009.20"},{"key":"21_CR17","series-title":"The Morgan Kaufmann Series in Data Management Systems","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann, Burlington (2006)"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jda.2008.09.011","volume":"7","author":"M Skala","year":"2009","unstructured":"Skala, M.: Counting distance permutations. J. Discrete Algorithms 7(1), 49\u201361 (2009). https:\/\/doi.org\/10.1016\/j.jda.2008.09.011. Selected papers from the 1st International Workshop on Similarity Search and Applications","journal-title":"J. Discrete Algorithms"},{"issue":"7","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/J.IS.2012.06.005","volume":"38","author":"ES Tellez","year":"2013","unstructured":"Tellez, E.S., Chavez, E., Navarro, G.: Succinct nearest neighbor search. Inform. Syst. 38(7), 1019\u20131030 (2013). https:\/\/doi.org\/10.1016\/J.IS.2012.06.005","journal-title":"Inform. Syst."},{"key":"21_CR20","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: The Metric Space Approach","author":"P Zezula","year":"2005","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems, vol. 32. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28730-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:46:53Z","timestamp":1710348413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-28730-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030287290","9783030287306"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28730-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bled","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2019.um.si\/","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":"103","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":"27","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":"19","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":"26% - 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.15","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.61","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":"19 short papers are published in CCIS 1064","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)"}}]}}