Listar Laboratorio de Bases de Datos (LBD) por autor "Reutter, Juan"

Mostrando ítems 1-2 de 2

    • 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 ...