Diego Arroyuelo

Orcid: 0000-0002-2509-8097

Affiliations:
  • Universidad Técnica Federico Santa María, Chile


According to our database1, Diego Arroyuelo authored at least 48 papers between 2003 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Evaluating regular path queries on compressed adjacency matrices.
VLDB J., January, 2025

2024
Tackling Challenges in Implementing Large-Scale Graph Databases.
Commun. ACM, August, 2024

The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space.
ACM Trans. Database Syst., June, 2024

Worst-Case-Optimal Similarity Joins on Graph Databases.
Proc. ACM Manag. Data, February, 2024

Optimizing RPQs over a compact graph representation.
VLDB J., 2024

New Compressed Indices for Multijoins on Graph Databases.
CoRR, 2024

Space & Time Efficient Leapfrog Triejoin.
Proceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2024

2023
MillenniumDB: An Open-Source Graph Database System.
Data Intell., 2023

Engineering Rank/Select Data Structures for Big-Alphabet Strings.
CoRR, 2023

Trie-Compressed Adaptive Set Intersection.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
Datasets of Time- and Space-Efficient Regular Path Queries.
Dataset, October, 2022

Optimal Joins Using Compressed Quadtrees.
ACM Trans. Database Syst., 2022

Trie-Compressed Intersectable Sets.
CoRR, 2022

Adaptive Succinctness.
Algorithmica, 2022

Time- and Space-Efficient Regular Path Queries.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Engineering Practical Lempel-Ziv Tries.
ACM J. Exp. Algorithmics, 2021

Time- and Space-Efficient Regular Path Queries on Graphs.
CoRR, 2021

MillenniumDB: A Persistent, Open-Source, Graph Database.
CoRR, 2021

Worst-Case Optimal Graph Joins in Almost No Space.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

2020
To index or not to index: Time-space trade-offs for positional ranking functions in search engines.
Inf. Syst., 2020

Three success stories about compact data structures.
Commun. ACM, 2020

A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences.
Proceedings of the 39th International Conference of the Chilean Computer Science Society, 2020

Compressing and Randomly Accessing Sequences (note).
Proceedings of the Data Compression Conference, 2020

2019
A Practical Alphabet-Partitioning Rank/Select Data Structure.
Proceedings of the String Processing and Information Retrieval, 2019

Faster Dynamic Compressed d-ary Relations.
Proceedings of the String Processing and Information Retrieval, 2019

A Compact Rank/Select Data Structure for the Streaming Model.
Proceedings of the 38th International Conference of the Chilean Computer Science Society, 2019

Compressed Data Structures for Astronomical Content-Aware Resource Search.
Proceedings of the 38th International Conference of the Chilean Computer Science Society, 2019

2018
Hybrid compression of inverted lists for reordered document collections.
Inf. Process. Manag., 2018

2017
LZ78 Compression in Low Main Memory Space.
Proceedings of the String Processing and Information Retrieval, 2017

2016
Succinct Dynamic Cardinal Trees.
Algorithmica, 2016

2015
Fast in-memory XPath search using compressed indexes.
Softw. Pract. Exp., 2015

2014
Distributed text search using suffix arrays.
Parallel Comput., 2014

A Dynamic Pivoting Algorithm Based on Spatial Approximation Indexes.
Proceedings of the Similarity Search and Applications - 7th International Conference, 2014

2013
Document identifier reassignment and run-length-compressed inverted indexes for improved search performance.
Proceedings of the 36th International ACM SIGIR conference on research and development in Information Retrieval, 2013

2012
Distributed search based on self-indexed compressed text.
Inf. Process. Manag., 2012

Stronger Lempel-Ziv Based Compressed Text Indexing.
Algorithmica, 2012

To index or not to index: time-space trade-offs in search engines with positional ranking functions.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

2011
Untangled monotonic chains and adaptive range search.
Theor. Comput. Sci., 2011

Space-efficient construction of Lempel-Ziv compressed text indexes.
Inf. Comput., 2011

2010
Practical approaches to reduce the space requirement of lempel-ziv-based compressed text indices.
ACM J. Exp. Algorithmics, 2010

Compressed Self-indices Supporting Conjunctive Queries on Document Collections.
Proceedings of the String Processing and Information Retrieval, 2010

Succinct Trees in Practice.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
Fast In-Memory XPath Search over Compressed Text and Tree Indexes
CoRR, 2009

2008
An Improved Succinct Representation for Dynamic k-ary Trees.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
A Lempel-Ziv Text Index on Secondary Storage.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Reducing the Space Requirement of LZ-Index.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Space-Efficient Construction of LZ-Index.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2003
Memory-Adaptive Dynamic Spatial Approximation Trees.
Proceedings of the String Processing and Information Retrieval, 2003


  Loading...