Storing Data Once in M-tree and PM-tree-Reference-Cited by-同舟云学术

Storing Data Once in M-tree and PM-tree

Published:2019 Issue: Volume: Page:18-31
ISSN:0302-9743
Container-title:Similarity Search and Applications
language:
Short-container-title:

Author:

Razente Humberto^ORCID,Nardini Barioni Maria Camila^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-32047-8_2

Reference21 articles.

1. Arboretum: The Database Group at ICMC/USP Arboretum Library (2019). https://bitbucket.org/gbdi/arboretum . Accessed May 2019

2. Chen, L., Gao, Y., Zheng, B., Jensen, C.S., Yang, H., Yang, K.: Pivot-based metric indexing. Proc. VLDB Endow. (PVLDB) 10(10), 1058–1069 (2017). https://doi.org/10.14778/3115404.3115411

3. 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–435 (1997)

4. Comer, D.: The ubiquitous b-tree. ACM Comput. Surv. 11(2), 121–137 (1979). https://doi.org/10.1145/356770.356776

5. Figueroa, K., Navarro, G., Chaves, E.: Metric spaces library (2007). http://www.sisap.org/metricspaceslibrary.html

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Indexing Metric Spaces for Exact Similarity Search;ACM Computing Surveys;2022-12-07

2. Storing data once in M-trees and PM-trees: Revisiting the building principles of metric access methods;Information Systems;2022-02

3. A Survey on Big IoT Data Indexing: Potential Solutions, Recent Advancements, and Open Issues;Future Internet;2021-12-31