The ring: worst-case optimal joins in graph databases using (almost) no extra space

DOI10.1145/3644824MaRDI QIDQ6536406

Diego Arroyuelo, Adrián Gómez-Brandón, Adrián Soto, Aidan Hogan, Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma

Publication date: 30 April 2024

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

zbMATH Keywords

graph databaseswavelet treesgraph indexinggraph patternscolumn storesworst-case optimal joins

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast construction of wavelet trees
• Compact binary relation representations with rich functionality
• Colored range queries and document retrieval
• Lightweight algorithms for constructing and inverting the BWT of string collections
• New algorithms on wavelet trees and applications to information retrieval
• Wavelet trees for all
• Compressing table data with column dependency
• Size Bounds and Query Plans for Relational Joins
• Compressed representations of sequences and full-text indexes
• Indexing compressed text
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Joins via Geometric Resolutions
• Size and Treewidth Bounds for Conjunctive Queries
• Tables

This page was built for publication: The ring: worst-case optimal joins in graph databases using (almost) no extra space