Listar Laboratorio de Bases de Datos (LBD) por autor "Navarro, Gonzalo"
Mostrando ítems 21-23 de 23
-
Two-Dimensional Block Trees
Brisaboa, Nieves R.; Gagie, Travis; Gómez-Brandón, Adrián; Navarro, Gonzalo (Oxford University Press, 2024-01)[Absctract]: The Block Tree is a data structure for representing repetitive sequences in compressed space, which reaches space comparable with that of Lempel–Ziv compression while retaining fast direct access to any position ... -
Universal indexes for highly repetitive document collections
Claude, Francisco; Fariña, Antonio; Martínez Prieto, Miguel A.; Navarro, Gonzalo (Elsevier Ltd, 2016-11)[Abstract] Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These collections may reach huge sizes, but are ... -
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 ...