Zobrazeno 1 - 10
of 98
pro vyhledávání: '"Arroyuelo, Diego"'
Autor:
Arroyuelo, Diego, Barisione, Fabrizio, Fariña, Antonio, Gómez-Brandón, Adrián, Navarro, Gonzalo
A recent surprising result in the implementation of worst-case-optimal (wco) multijoins in graph databases (specifically, basic graph patterns) is that they can be supported on graph representations that take even less space than a plain representati
Externí odkaz:
http://arxiv.org/abs/2408.00558
Autor:
Arroyuelo, Diego1 (AUTHOR), Hogan, Aidan2 (AUTHOR), Navarro, Gonzalo2 (AUTHOR), Reutter, Juan1 (AUTHOR), Vrgoč, Domagoj1 (AUTHOR)
Publikováno v:
Communications of the ACM. Aug2024, Vol. 67 Issue 8, p40-44. 5p.
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. A way to solve RPQs is to translate them into a sequenc
Externí odkaz:
http://arxiv.org/abs/2307.14930
Autor:
Arroyuelo, Diego, Carmona, Gabriel, Larrañaga, Héctor, Riveros, Francisco, Rojas-Morales, Carlos Eugenio, Sepúlveda, Erick
Large-alphabet strings are common in scenarios such as information retrieval and natural-language processing. The efficient storage and processing of such strings usually introduces several challenges that are not witnessed in small-alphabets strings
Externí odkaz:
http://arxiv.org/abs/2305.14461
Autor:
Arroyuelo, Diego, Castillo, Juan Pablo
We introduce space- and time-efficient algorithms and data structures for the offline set intersection problem. We show that a sorted integer set $S \subseteq [0{..}u)$ of $n$ elements can be represented using compressed space while supporting $k$-wa
Externí odkaz:
http://arxiv.org/abs/2212.00946
We introduce a time- and space-efficient technique to solve regularpath queries over labeled graphs. We combine a bit-parallel simula-tion of the Glushkov automaton of the regular expression with thering index introduced by Arroyuelo et al., exploiti
Externí odkaz:
http://arxiv.org/abs/2111.04556
Autor:
Vrgoc, Domagoj, Rojas, Carlos, Angles, Renzo, Arenas, Marcelo, Arroyuelo, Diego, Aranda, Carlos Buil, Hogan, Aidan, Navarro, Gonzalo, Riveros, Cristian, Romero, Juan
In this systems paper, we present MillenniumDB: a novel graph database engine that is modular, persistent, and open source. MillenniumDB is based on a graph data model, which we call domain graphs, that provides a simple abstraction upon which a vari
Externí odkaz:
http://arxiv.org/abs/2111.01540
Autor:
Arroyuelo, Diego1 (AUTHOR) diego.arroyuelo@uc.cl, Gómez-Brandón, Adrián2 (AUTHOR) adrian.gbrandon@udc.es, Hogan, Aidan3 (AUTHOR) ahogan@dcc.uchile.cl, Navarro, Gonzalo3 (AUTHOR) gnavarro@dcc.uchile.cl, Reutter, Juan4 (AUTHOR) jreutter@ing.puc.cl, Rojas-Ledesma, Javiel5 (AUTHOR) jrojas@dcc.uchile.cl, Soto, Adrián6 (AUTHOR) adrian.soto@uai.cl
Publikováno v:
ACM Transactions on Database Systems. Jun2024, Vol. 49 Issue 2, p1-45. 45p.
Publikováno v:
Proc. SPIRE 2019
The $k^2$-tree is a successful compact representation of binary relations that exhibit sparseness and/or clustering properties. It can be extended to $d$ dimensions, where it is called a $k^d$-tree. The representation boils down to a long bitvector.
Externí odkaz:
http://arxiv.org/abs/1911.08971