SBBD

Paper Registration

1

Select Book

2

Select Paper

3

Fill in paper information

4

Congratulations

Fill in your paper information

English Information

(*) To change the order drag the item to the new position.

Authors
# Name
1 Enzo Seraphim(seraphim@unifei.edu.br)
2 Luis Pedras(d2023001970@unifei.edu.br)
3 Thatyana Seraphim(thatyana@unifei.edu.br)
4 Lucio Santos(santos@ifnmg.edu.br)
5 Luiz Olmes Carvalho(olmes@unifei.edu.br)

(*) To change the order drag the item to the new position.

Reference
# Reference
1 Benrazek, A.; Kemouguette, I.; Kouahla, Z.; Farou, B.; Seridi, H. (2026). Optimizing Overlap in Tree-Based Indexing Structures for Enhanced K-NN Search Efficiency. Journal of Eng.and Technology for Industrial Applications. 10.5935/jetia.v12i57.2744.
2 Ciaccia, P., Patella, M., and Zezula, P. (1997). M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In Proc. Int. Conf. VLDB, pages 426–435, USA.
3 Daulay, R. S. A.; Efendi, S.; Suherman (2023). Review of literature on improving the KNN algorithm. Transactions on Engineering and Computing Sciences, [S. l.], v. 11, n. 3, p. 63–72, 2023. 10.14738/tecs.113.14768.
4 Eclipse Foundation (2026). Deeplearning4j: Open-source, distributed deep learning for the JVM. Disponível: deeplearning4j.konduit.ai. Acesso: mai/2026.
5 Gou, J.; Du, L.; Zhang, Y.; Xiong, T. (2012). A New Distance-weighted k-nearest Neighbor Classifier. Journal of Information and Computational Science. 1429-1436.
6 Hjaltason, G. R.; Samet, H. (2003). Index-driven similarity search in metric spaces. ACM Transactions on Database Systems, 28(4), 517-580. 10.1145/958942.958948.
7 Halder, R.K.; Uddin, M.N.; Uddin, M.A.; Aryal S.; Khraisat, A.(2024) Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications. J Big Data 11, 113 (2024). 10.1186/s40537-024-00973-y.
8 Carvalho, L. O., Seraphim, T. F. P., Traina, C., and Seraphim, E. (2013). Obinject: a noodmg persistence and indexing framework for object injection. J. Inf. Data Manag., 4:220–235.
9 Procházka, D.; Slanináková, T.; Čerňanský, J.; Olha, J.; Antol, M.; Dohnal, V. (2025). Scaling Learned Metric Index to 100M Datasets. Similarity Search and Applications. SISAP 2024. Lecture Notes in Computer Science, vol 15268. Springer.
10 Schubert, E.; Zimek A. (2010). ELKI Multi-View Clustering Data Sets Based on the Amsterdam Library of Object Images. Zenodo, 2010, 10.5281/zenodo.6355684
11 Tian, Y.; Yan, T.; Zhao, X.; Huang, K.; Zhou, X. (2022). A Learned Index for Exact Similarity Search in Metric Spaces. IEEE Transactions on Knowledge and Data Engineering (TKDE). 10.1109/TKDE.2022.3206441
12 Traina Jr.; C., Traina, A. J. M.; Faloutsos, C.; Seeger, B. (2002). Fast Indexing and Visualization of Metric Data Sets using Slim-Trees. IEEE Transactions on Knowledge and Data Engineering (TKDE). 14(2). 10.1109/69.991715
13 Silva, W. Z.; Traina A. J. M.; Traina Jr., C. (2026), Include-Slim: Supporting Similarity Retrieval Variants with a Metric Access Method in IEEE Open Journal of the Computer Society, pp. 1-13, PrePrints 5555. 10.1109/OJCS.2026.3687006.
14 Wu, X.; Kumar, V.; Quinlan, J. R.; Ghosh, J.; Yang, Q.; Motoda, H.; Mclachlan, G. J.; Ng, A.; Liu, B.; Yu, P. S. (2008). Top 10 algorithms in data mining. Knowledge and Information Systems, [S. l.], v. 14, n. 1, p. 1–37, 2008. 10.1007/s10115-007-0114-2.
15 Wang, Y.; Wang B.; Zhu R.; Sun W.; Yang X.; (2026). LM-Tree: A Hybrid Learned Index for Similarity Search in Metric Spaces. Proc. ACM Manag. Data 4, 1, Article 51 (2026), 25 pages. 10.1145/3786665.