{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T20:34:46Z","timestamp":1761165286227,"version":"build-2065373602"},"reference-count":19,"publisher":"Sociedade Brasileira de Computa\u00e7\u00e3o - SBC","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Diversos estudos mostram a import\u00e2ncia e a complexidade para determinar os pontos mais pr\u00f3ximos de uma trajet\u00f3ria, atrav\u00e9s de uma t\u00e9cnica conhecida como Consulta Cont\u00ednua. As solu\u00e7\u00f5es existentes para responder essas consultas utilizam das coordenadas euclidianas em dados espaciais para verificar se o objeto de interesse est\u00e1 dentro da cobertura da rota. No entanto, essa abordagem n\u00e3o se aplica a dados puramente m\u00e9tricos, pois n\u00e3o se pode represent\u00e1-los em um espa\u00e7o n-dimensional. Por outro lado, uma fun\u00e7\u00e3o de dist\u00e2ncia pode inferir segmentos de retas sobre o espa\u00e7o m\u00e9trico, semelhante \u00e0 associa\u00e7\u00e3o de uma geometria. Neste contexto, o presente trabalho associa propriedades Euclidianas ao espa\u00e7o m\u00e9trico para definir a qualifica\u00e7\u00e3o entre ponto e retas, de modo a expandir consultas cont\u00ednuas por abrang\u00eancia a este dom\u00ednio de dados. Os experimentos evidenciam que esta associa\u00e7\u00e3o permite consultas cont\u00ednuas por abrang\u00eancia eficientes em dados puramente m\u00e9tricos, suprimindo a lacuna das t\u00e9cnicas existentes na literatura.<\/jats:p>","DOI":"10.5753\/sbbd.2025.247823","type":"proceedings-article","created":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T19:26:36Z","timestamp":1761074796000},"page":"949-955","source":"Crossref","is-referenced-by-count":0,"title":["Estendendo Consultas Cont\u00ednuas por Abrang\u00eancia aos Dados M\u00e9tricos"],"prefix":"10.5753","author":[{"given":"Enzo","family":"Seraphim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1735-2447","authenticated-orcid":false,"given":"Thatyana F. P.","family":"Seraphim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucio F. D.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5059-9080","authenticated-orcid":false,"given":"Edmilson Marmo","family":"Moreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Olmes","family":"Carvalho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"3742","published-online":{"date-parts":[[2025,9,29]]},"reference":[{"key":"1","unstructured":"Afonso, F., Barbosa, F., and Rodrigues, A. (2011). Trajectory data similarity with metric data structures. In Geographical Inf. Science Research United Kingdom, 9p."},{"key":"2","unstructured":"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\u2013435, Morgan Kaufmann, San Francisco, CA, USA."},{"key":"3","doi-asserted-by":"crossref","unstructured":"Chen, L., \u00d6zsu, M. T., and Oria, V. (2005). Robust and fast similarity search for moving object trajectories. In Proc. ACM SIGMOD, pages 491\u2013502, New York, NY, USA.","DOI":"10.1145\/1066157.1066213"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H. T., Zhou, X., and Yu, J. X. (2009). Monitoring path nearest neighbor in road networks. In Proc. ACM SIGMOD, pages 591\u2013602, New York, NY, USA.","DOI":"10.1145\/1559845.1559907"},{"key":"5","unstructured":"CodePoint, Open CSV. (2025). <a href=\"https:\/\/osdatahub.os.uk\/downloads\/open\/CodePointOpen\"target=\"_blank\">[link]<\/a>"},{"key":"6","doi-asserted-by":"crossref","unstructured":"Deng, K., Xie, K., Zheng, K., and Zhou, X. (2011). Trajectory Indexing and Retrieval, pages 35\u201360. Springer, New York, NY.","DOI":"10.1007\/978-1-4614-1629-6_2"},{"key":"7","doi-asserted-by":"crossref","unstructured":"Guttman. A. (1984). R-trees: a dynamic index structure for spatial searching. SIGMOD Rec., 14 (2).","DOI":"10.1145\/971697.602266"},{"key":"8","doi-asserted-by":"crossref","unstructured":"G\u00fcting, R. H., Das, S. K., Vald\u00e9s, F., and Ray, S. (2025). Exact trajectory similarity search with n-tree: An efficient metric index for knn and range queries. ACM Trans. Spatial Algorithms Syst., 11(1).","DOI":"10.1145\/3716825"},{"key":"9","doi-asserted-by":"crossref","unstructured":"Kalashnikov, D., Prabhakar, S., Hambrusch, S., and Aref, W. (2002). Efficient evaluation of continuous range queries on moving objects. In Proc. DEXA, Berlin, Springer.","DOI":"10.1007\/3-540-46146-9_72"},{"key":"10","unstructured":"LibreOffice. (2025). <a href=\"https:\/\/github.com\/LibreOffice\/dictionaries\"target=\"_blank\">[link]<\/a>"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., and Tao, Y. (2003). Query processing in spatial network databases. In VLDB Conf., pages 802\u2013813. Morgan Kaufmann, San Francisco.","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"12","doi-asserted-by":"crossref","unstructured":"Shang, S., Deng, K., and Xie, K. (2010). Best point detour query in road networks. In Proc. 18th ACM SIGSPATIAL Int. Conf. on Advances in Geographic Information Systems, pages 71\u201380, New York, NY, USA.","DOI":"10.1145\/1869790.1869804"},{"key":"13","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., and Shen, Q. (2002). Continuous nearest neighbor search. In Proc. 28th Int. Conf. on VLDB, pages 287\u2013298. Morgan Kaufmann, San Francisco.","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"14","doi-asserted-by":"crossref","unstructured":"Traina Jr., C., Traina, A. J. M., Faloutsos, C., and Seeger, B. (2002). Fast Indexing and Visualization of Metric Data Sets using Slim-Trees. IEEE TKDE. 14(2).","DOI":"10.1109\/69.991715"},{"key":"15","unstructured":"UniProtKB, TrEMBL Fasta. (2025). <a href=\"https:\/\/www.uniprot.org\/help\/downloads\"target=\"_blank\">[link]<\/a>"},{"key":"16","doi-asserted-by":"crossref","unstructured":"Wang, S., Bao, Z., Culpepper, J. S., and Cong, G. (2021). A survey on trajectory data management, analytics, and learning. ACM Comput. Surv., 54(2).","DOI":"10.1145\/3440207"},{"key":"17","doi-asserted-by":"crossref","unstructured":"Xu, W., and Miranker, D. P. (2004). A metric model of amino acid substitution. Bioinformatics. UK, 20(8).","DOI":"10.1093\/bioinformatics\/bth065"},{"key":"18","doi-asserted-by":"crossref","unstructured":"Xuan, K., Zhao, G., Taniar, D., and Srinivasan, B. (2008). Continuous range search query processing in mobile navigation. In Int. Conf. on Parallel and Dist. Syst, pages 361\u2013368.","DOI":"10.1109\/ICPADS.2008.69"},{"key":"19","unstructured":"Zezula, P., Amato, G., Dohnal, V., and Batko, M. (2010). Similarity Search: The Metric Space Approach. Springer Publishing Company, Incorporated, 1st edition."}],"event":{"name":"Simp\u00f3sio Brasileiro de Banco de Dados","number":"40","location":"Brasil","acronym":"SBBD 2025"},"container-title":["Anais do XL Simp\u00f3sio Brasileiro de Banco de Dados (SBBD 2025)"],"original-title":[],"link":[{"URL":"https:\/\/sol.sbc.org.br\/index.php\/sbbd\/article\/download\/37308\/37091","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/sol.sbc.org.br\/index.php\/sbbd\/article\/download\/37308\/37091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T19:26:53Z","timestamp":1761074813000},"score":1,"resource":{"primary":{"URL":"https:\/\/sol.sbc.org.br\/index.php\/sbbd\/article\/view\/37308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":19,"URL":"https:\/\/doi.org\/10.5753\/sbbd.2025.247823","relation":{},"subject":[],"published":{"date-parts":[[2025,9,29]]}}}