Adrián Gómez-Brandón

Adrián Gómez-Brandón

Auto-generated profile, based on publicly available information

Adrián Gómez-Brandón

IMFD & CITIC, Universidade da Coruña, A Coruña, Spain

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2019 in Information Sciences
Verified
Journal Article
Closed access
NBNieves R. Brisaboa
Nieves R. Brisaboa
AGAdrián Gómez-Brandón
Adrián Gómez-Brandón
Gonzalo NavarroGonzalo Navarro
Gonzalo Navarro
JPJosé R. Paramá
José R. Paramá

23 March 2024 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
DADiego Arroyuelo
Diego Arroyuelo
AGAdrián Gómez-Brandón
Adrián Gómez-Brandón
AHAidan Hogan
Aidan Hogan
Gonzalo NavarroGonzalo Navarro
Gonzalo Navarro
JRJuan Reutter
Juan Reutter
ASAdrián Soto
Adrián Soto
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 length 3. Each rotation of the triples is lexicographically sorted and the values of the last attribute are stored as a column, so we obtain the order of the next column by stably re-sorting the triples by its attribute. We show that, by representing the columns with a compact data structure called a wavelet tree, this ordering enables forward and backward navigation between columns without needing pointers. These wavelet trees further support wco join algorithms and cardinality estimations for query planning. While traditional data structures such as B-Trees, tries, and so on, require 6 index orders to support all possible wco joins over triples, we can use one ring to index them all. This ring replaces the graph and uses only sublinear extra space, thus supporting wco joins in almost no space beyond storing the graph itself. Experiments querying a large graph (Wikidata) in memory show that the ring offers nearly the best overall query times while using only a small fraction of the space required by several state-of-the-art approaches. We then turn our attention to some theoretical results for indexing tables of arity d higher than 3 in such a way that supports wco joins. While a single ring of length d no longer suffices to cover all d ! orders, we need much fewer rings to index them all: O (2 d ) rings with a small constant. For example, we need 5 rings instead of 120 orders for d =5. We show that our rings become a particular case of what we dub order graphs , whose nodes are attribute orders and where stably sorting by some attribute leads us from an order to another, thereby inducing an edge labeled by the attribute. The index is then the set of columns associated with the edges, and a set of rings is just one possible graph shape. We show that other shapes, like for example a single ring instead of several ones of length d , can lead us to even smaller indexes, and that other more general shapes are also possible. For example, we handle d =5 attributes within space equivalent to 4 rings.

7 September 2023 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
DADiego Arroyuelo
Diego Arroyuelo
AGAdrián Gómez-Brandón
Adrián Gómez-Brandón
AHAidan Hogan
Aidan Hogan
Gonzalo NavarroGonzalo Navarro
Gonzalo Navarro
JRJaviel Rojas-Ledesma
Javiel Rojas-Ledesma

26 November 2024 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
DADiego Arroyuelo
Diego Arroyuelo
AGAdrián Gómez-Brandón
Adrián Gómez-Brandón
Gonzalo NavarroGonzalo Navarro
Gonzalo Navarro

1 March 2018
Verified
Conference Paper
Open access
NBNieves R. Brisaboa
Nieves R. Brisaboa
Travis GagieTravis Gagie
Travis Gagie
AGAdrian Gomez-Brandon
Adrian Gomez-Brandon
Gonzalo NavarroGonzalo Navarro
Gonzalo Navarro
The Block Tree (BT) is a novel compact data structure designed to compress sequence collections. It obtains compression ratios close to Lempel-Ziv and supports efficient direct access to any substring. The BT divides the text recursively into fixed-size blocks and those appearing earlier are represented with pointers. On repetitive collections, a few blocks can represent all the others, and thus the BT reduces the size by orders of magnitude. In this paper we extend the BT to two dimensions, to exploit repetitiveness in collections of images, graphs, and maps. This two-dimensional Block Tree divides the image regularly into subimages and replaces some of them by pointers to other occurrences thereof. We develop a specific variant aimed at compressing the adjacency matrices of Web graphs, obtaining space reductions of up to 50% compared with the k2-tree, which is the best alternative supporting direct and reverse navigation in the graph.

21 September 2016 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
NBNieves R. Brisaboa
Nieves R. Brisaboa
AGAdrián Gómez-Brandón
Adrián Gómez-Brandón
Gonzalo NavarroGonzalo Navarro
Gonzalo Navarro
JPJosé R. Paramá
José R. Paramá