Browsing by Author "Arroyuelo, Diego"

Now showing items 1-4 of 4

    • Evaluating regular path queries on compressed adjacency matrices 

      Arroyuelo, Diego; Gómez-Brandón, Adrián; Navarro, Gonzalo (Springer Science and Business Media Deutschland GmbH, 2025)
      [Abstract]: Regular Path Queries (RPQs), which are essentially regular expressions to be matched against the labels of paths in labeled graphs, are at the core of graph database query languages like SPARQL and GQL. A way ...

    • Optimizing RPQs over a compact graph representation 

      Arroyuelo, Diego; Gómez-Brandón, Adrián; Hogan, Aidan; Navarro, Gonzalo; Rojas-Ledesma, Javiel (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 

      Arroyuelo, Diego; Gómez-Brandón, Adrián; Hogan, Aidan; Navarro, Gonzalo; Reutter, Juan; Rojas-Ledesma, Javiel; Soto, Adrián (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 

      Arroyuelo, Diego; Bustos, Benjamin; Gómez-Brandón, Adrián; Hogan, Aidan; Navarro, Gonzalo; Reutter, Juan (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 ...