Issue Downloads
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
- Diego Arroyuelo,
- Adrián Gómez-Brandón,
- Aidan Hogan,
- Gonzalo Navarro,
- Juan Reutter,
- Javiel Rojas-Ledesma,
- 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 ...
Supporting Better Insights of Data Science Pipelines with Fine-grained Provenance
Successful data-driven science requires complex data engineering pipelines to clean, transform, and alter data in preparation for machine learning, and robust results can only be achieved when each step in the pipeline can be justified, and its effect on ...
Sharing Queries with Nonequivalent User-defined Aggregate Functions
This article presents Sharing User-Defined Aggregate Function (SUDAF), a declarative framework that allows users to write User-defined Aggregate Functions (UDAFs) as mathematical expressions and use them in Structured Query Language statements. SUDAF ...
Database Repairing with Soft Functional Dependencies
A common interpretation of soft constraints penalizes the database for every violation of every constraint, where the penalty is the cost (weight) of the constraint. A computational challenge is that of finding an optimal subset: a collection of database ...