ListarLaboratorio de Bases de Datos (LBD) por tema "Graph databases"
Mostrando ítems 1-3 de 3
-
Optimizing RPQs over a compact graph representation
(Springer, 2023-09-07)[Absctract]: We propose techniques to evaluate regular path queries (RPQs) over labeled graphs (e.g., RDF). We apply a bit-parallel simulation of a Glushkov automaton representing the query over a ring: a compact ... -
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
(Association for Computing Machinery (ACM), 2024-03-23)[Absctract]: We present an indexing scheme for triple-based graphs that supports join queries in worst-case optimal (wco) time within compact space. This scheme, called a ring, regards each triple as a cyclic string of ... -
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 ...