In this paper, we study the complexity of evaluating Conjunctive Queries with negation
(\cqneg). First, we present an algorithm with linear preprocessing time and constant delay …

Database systems are often confronted with queries that join many tables but ultimately only
output comparatively small aggregate information. Despite all advances in query …

Updates in graph DBMS lead to structural changes in the graph over time with different
intermediate states. Capturing these changes and their time is one of the main purposes of …

A common challenge for database management systems (DBMSs) is efficiently evaluating
queries. The most basic queries are conjunctive queries (CQs), which are SELECT-FROM …

Most data analytical pipelines often encounter the problem of querying inconsistent data that
could violate pre-determined integrity constraints. Data cleaning is an extensively studied …

The evaluation of top-k conjunctive queries, a staple in business analysis, often requires
evaluating the conjunctive query prior to filtering the top-k results, leading to a significant …