{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:02:10Z","timestamp":1743015730085,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030320461"},{"type":"electronic","value":"9783030320478"}],"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-32047-8_2","type":"book-chapter","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T05:07:22Z","timestamp":1569301642000},"page":"18-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Storing Data Once in M-tree and PM-tree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9687-5730","authenticated-orcid":false,"given":"Humberto","family":"Razente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5809-0243","authenticated-orcid":false,"given":"Maria Camila","family":"Nardini Barioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"2_CR1","unstructured":"Arboretum: The Database Group at ICMC\/USP Arboretum Library (2019). https:\/\/bitbucket.org\/gbdi\/arboretum. Accessed May 2019"},{"issue":"10","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.14778\/3115404.3115411","volume":"10","author":"L Chen","year":"2017","unstructured":"Chen, L., Gao, Y., Zheng, B., Jensen, C.S., Yang, H., Yang, K.: Pivot-based metric indexing. Proc. VLDB Endow. (PVLDB) 10(10), 1058\u20131069 (2017). https:\/\/doi.org\/10.14778\/3115404.3115411","journal-title":"Proc. VLDB Endow. (PVLDB)"},{"key":"2_CR3","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: International Conference on Very Large Data Bases (VLDB), Greece, Athens, pp. 426\u2013435 (1997)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous b-tree. ACM Comput. Surv. 11(2), 121\u2013137 (1979). https:\/\/doi.org\/10.1145\/356770.356776","journal-title":"ACM Comput. Surv."},{"key":"2_CR5","unstructured":"Figueroa, K., Navarro, G., Chaves, E.: Metric spaces library (2007). http:\/\/www.sisap.org\/metricspaceslibrary.html"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.L., Yu, C., Zhang, R.: iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. (TODS) 30(2), 364\u2013397 (2005). https:\/\/doi.org\/10.1145\/1071610.1071612","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2014.01.007","volume":"43","author":"J Lokoc","year":"2014","unstructured":"Lokoc, J., Mosko, J., Cech, P., Skopal, T.: On indexing metric spaces using cut-regions. Inf. Syst. 43, 1\u201319 (2014). https:\/\/doi.org\/10.1016\/j.is.2014.01.007","journal-title":"Inf. Syst."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Lokoc, J., Skopal, T.: On reinsertions in m-tree. In: International Workshop on Similarity Search and Applications (SISAP), pp. 121\u2013128. IEEE (2008). https:\/\/doi.org\/10.1109\/SISAP.2008.10","DOI":"10.1109\/SISAP.2008.10"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.is.2016.06.004","volume":"64","author":"G Navarro","year":"2017","unstructured":"Navarro, G., Paredes, R., Reyes, N., Bustos, C.: An empirical evaluation of intrinsic dimension estimators. Inf. Syst. 64, 206\u2013218 (2017). https:\/\/doi.org\/10.1016\/j.is.2016.06.004","journal-title":"Inf. Syst."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.is.2016.03.009","volume":"59","author":"G Navarro","year":"2016","unstructured":"Navarro, G., Reyes, N.: New dynamic metric indices for secondary memory. Inf. Syst. 59, 48\u201378 (2016). https:\/\/doi.org\/10.1016\/j.is.2016.03.009","journal-title":"Inf. Syst."},{"issue":"4","key":"2_CR11","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. Inf. Syst. 36(4), 721\u2013733 (2011). https:\/\/doi.org\/10.1016\/j.is.2010.10.002","journal-title":"Inf. Syst."},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Razente, H.L., Barioni, M.C.N., Traina, A.J.M., Faloutsos, C., Traina-Jr, C.: A novel optimization approach to efficiently process aggregate similarity queries in metric access methods. In: International Conference on Information and Knowledge Management (CIKM), Napa Valley, California, pp. 193\u2013202. ACM (2008). https:\/\/doi.org\/10.1145\/1458082.1458110","DOI":"10.1145\/1458082.1458110"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-02224-2_9","volume-title":"Similarity Search and Applications","author":"H Razente","year":"2018","unstructured":"Razente, H., Sousa, R.M.S., Barioni, M.C.N.: Metric indexing assisted by short-term memories. In: Marchand-Maillet, S., Silva, Y.N., Ch\u00e1vez, E. (eds.) SISAP 2018. LNCS, vol. 11223, pp. 107\u2013121. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02224-2_9"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Razente, H.L., Lima, R.L.B., Barioni, M.C.N.: Similarity search through one-dimensional embeddings. In: ACM Symposium on Applied Computing (SAC), Marrakech, Morocco, pp. 874\u2013879. ACM (2017). https:\/\/doi.org\/10.1145\/3019612.3019674","DOI":"10.1145\/3019612.3019674"},{"key":"2_CR15","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)"},{"key":"2_CR16","volume-title":"Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise","author":"M Schroeder","year":"1990","unstructured":"Schroeder, M.: Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W. H. Freeman and Company, New York (1990)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11408079_73","volume-title":"Database Systems for Advanced Applications","author":"T Skopal","year":"2005","unstructured":"Skopal, T., Pokorn\u00fd, J., Sn\u00e1\u0161el, V.: Nearest neighbours search using the PM-tree. In: Zhou, L., Ooi, B.C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 803\u2013815. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11408079_73"},{"issue":"11","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1016\/j.patrec.2011.04.016","volume":"32","author":"R Socorro","year":"2011","unstructured":"Socorro, R., Mico, L., Oncina, J.: A fast pivot-based indexing algorithm for metric spaces. Pattern Recogn. Lett. 32(11), 1511\u20131516 (2011). https:\/\/doi.org\/10.1016\/j.patrec.2011.04.016","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C Traina-Jr","year":"2007","unstructured":"Traina-Jr, C., Filho, R.F.S., Traina, A.J.M., Vieira, M.R., Faloutsos, C.: The omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J. 16(4), 483\u2013505 (2007). https:\/\/doi.org\/10.1007\/s00778-005-0178-0","journal-title":"VLDB J."},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C Traina-Jr","year":"2002","unstructured":"Traina-Jr, C., Traina, A., Faloutsos, C., Seeger, B.: Fast indexing and visualization of metric data sets using slim-trees. IEEE Trans. Knowl. Data Eng. (TKDE) 14(2), 244\u2013260 (2002). https:\/\/doi.org\/10.1109\/69.991715","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"issue":"1","key":"2_CR21","first-page":"3","volume":"1","author":"C Traina-Jr","year":"2010","unstructured":"Traina-Jr, C., Traina, A., Wu, L., Faloutsos, C.: Fast feature selection using fractal dimension. J. Inf. Data Manag. (JIDM) 1(1), 3\u201316 (2010)","journal-title":"J. Inf. Data Manag. (JIDM)"}],"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-32047-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:43:54Z","timestamp":1710326634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-32047-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030320461","9783030320478"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32047-8_2","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":"23 September 2019","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":"Newark, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"2 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2019\/","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":"42","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":"12","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":"18","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":"29% - 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":"2.88","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":"1-92","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)"}}]}}