Metric Indexing Assisted by Short-Term Memories-Reference-Cited by-同舟云学术

Metric Indexing Assisted by Short-Term Memories

Published:2018 Issue: Volume: Page:107-121
ISSN:0302-9743
Container-title:Similarity Search and Applications
language:
Short-container-title:

Author:

Razente Humberto^ORCID,Sousa Régis Michel Santos^ORCID,Barioni Maria Camila Nardini^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-02224-2_9

Reference22 articles.

1. Arboretum library. https://bitbucket.org/gbdi/arboretum . Accessed July 2018

2. 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)

3. Figueroa, K., Navarro, G., Chávez, E.: Metric spaces library (2007). http://www.sisap.org/Metric_Space_Library.html

4. Gama, J.: A survey on learning from data streams: current and future trends. Progr. Artif. Intell. 1(1), 45–55 (2012)

5. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: International Confernence on Management of Data (SIGMOD), Boston, MA, pp. 47–57 (1984)

Cited by 4 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 comprehensive analysis of delayed insertions in metric access methods;Information Systems;2021-01

4. Storing Data Once in M-tree and PM-tree;Similarity Search and Applications;2019