skip to main content
Bibliometrics
Skip Table Of Content Section
research-article
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
Article No.: 5, Pages 1–45https://doi.org/10.1145/3644824

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 ...

research-article
Supporting Better Insights of Data Science Pipelines with Fine-grained Provenance
Article No.: 6, Pages 1–42https://doi.org/10.1145/3644385

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 ...

research-article
Sharing Queries with Nonequivalent User-defined Aggregate Functions
Article No.: 7, Pages 1–46https://doi.org/10.1145/3649133

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 ...

research-article
Open Access
Database Repairing with Soft Functional Dependencies
Article No.: 8, Pages 1–34https://doi.org/10.1145/3651156

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 ...

Subjects

Comments