Counting Database Repairs: Exact and Approximate Approaches for Functional Dependencies and Conjunctive Queries
The core message of this article is to provide a complete complexity classification for the problem of counting database repairs, both exactly and approximately, in the presence of functional dependencies and conjunctive queries.
Insert-Only vs. Insert-Delete in Dynamic Query Evaluation: A Comparative Study
Efficiently process and update queries with constant-delay enumeration using optimal algorithms.
Enforcing Existence and Non-Existence Constraints in MatBase: Algorithms and Implementation Details
MatBase implements algorithms for enforcing existence and non-existence constraints efficiently.
A Polystore Architecture Using Knowledge Graphs for Querying Heterogeneous Data Stores
Providing a federated database architecture using knowledge graphs to query heterogeneous data across distinct repositories.
Schema-Based Query Optimisation for Graph Databases: Leveraging Schema Information for Query Efficiency
The authors propose a schema-based query rewriting approach to optimize graph queries by injecting relevant structural information from a graph schema. This method aims to improve query performance and reduce the size of intermediate subquery results.
© 2024 by Linnk AI