Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Reflects downloads up to 10 Nov 2024Bibliometrics
Skip Table Of Content Section
research-article
Open Access
Conjunctive Regular Path Queries with Capture Groups
Article No.: 5, Pages 1–52https://doi.org/10.1145/3514230

In practice, regular expressions are usually extended by so-called capture groups or capture variables, which allow to capture a subexpression by a variable that can be referenced in the regular expression in order to describe repetitions of subwords. We ...

research-article
Open Access
Incremental Graph Computations: Doable and Undoable
Article No.: 6, Pages 1–44https://doi.org/10.1145/3500930

The incremental problem for a class \( {\mathcal {Q}} \) of graph queries aims to compute, given a query \( Q \in {\mathcal {Q}} \), graph G, answers Q(G) to Q in G and updates ΔG to G as input, changes ΔO to output Q(G) such that Q(GΔG) = Q(G)⊕ΔO. ...

research-article
Public Access
Mining Order-preserving Submatrices under Data Uncertainty: A Possible-world Approach and Efficient Approximation Methods
Article No.: 7, Pages 1–57https://doi.org/10.1145/3524915

Given a data matrix \( D \), a submatrix \( S \) of \( D \) is an order-preserving submatrix (OPSM) if there is a permutation of the columns of \( S \), under which the entry values of each row in \( S \) are strictly increasing. OPSM mining is ...

SECTION: Best of ICDT 2021
research-article
Optimal Joins Using Compressed Quadtrees
Article No.: 8, Pages 1–53https://doi.org/10.1145/3514231

Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now count several algorithms that are optimal in the worst case, and many of them have been implemented and validated in practice. However, the implementation ...

Subjects

Comments