ListarLaboratorio de Bases de Datos (LBD) por tema "Nearest-neighbor graphs"
Mostrando ítems 1-1 de 1
-
Worst-Case-Optimal Similarity Joins on Graph Databases
(Association for Computing Machinery (ACM), 2024-03-06)[Absctract]: We extend the concept of worst-case optimal equijoins in graph databases to the case where some nodes are required to be within the k-nearest neighbors (kNN) of others under some similarity function. We model ...