| 711 |
A Case for A Collaborative Query Management System |
2009 |
CIDR |
0.00017751589 |
| 1,119 |
The Complexity of Causality and Responsibility for Query Answers and non-Answers |
2011 |
VLDB |
0.0001386199 |
| 1,650 |
Efficient Enumeration of Maximal k-Plexes |
2015 |
SIGMOD |
0.00011013428 |
| 1,938 |
Split-Correctness in Information Extraction |
2019 |
PODS |
0.00010028895 |
| 2,602 |
Tracing Data Errors with View-Conditioned Causality |
2011 |
SIGMOD |
8.4667197e-05 |
| 2,868 |
Computing the Shapley Value of Facts in Query Answering |
2022 |
SIGMOD |
7.9816425e-05 |
| 2,929 |
Complexity Bounds for Relational Algebra over Document Spanners |
2019 |
PODS |
7.8800307e-05 |
| 3,000 |
SANTOS: Relationship-based Semantic Table Union Search |
2023 |
SIGMOD |
7.7462128e-05 |
| 3,027 |
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries |
2020 |
PODS |
7.6842412e-05 |
| 3,042 |
Dichotomies in the Complexity of Preferred Repairs |
2015 |
PODS |
7.669374e-05 |
| 3,218 |
Reverse Data Management |
2011 |
VLDB |
7.3592173e-05 |
| 3,387 |
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration |
2020 |
PODS |
7.1573735e-05 |
| 3,440 |
Approximate Denial Constraints |
2020 |
VLDB |
7.0918817e-05 |
| 3,715 |
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries |
2020 |
VLDB |
6.8220943e-05 |
| 4,361 |
The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries |
2016 |
VLDB |
6.2559141e-05 |
| 4,558 |
Managing Structured Collections of Community Data |
2011 |
CIDR |
6.0869516e-05 |
| 4,859 |
Integrating Data Lake Tables |
2023 |
VLDB |
5.8732433e-05 |
| 4,937 |
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins |
2020 |
PODS |
5.8187108e-05 |
| 5,452 |
QueryVis: Logic-based Diagrams help Users Understand Complicated SQL Queries Faster |
2020 |
SIGMOD |
5.4999397e-05 |
| 5,823 |
Believe It or Not: Adding Belief Annotations to Databases |
2009 |
VLDB |
5.3129967e-05 |
| 5,855 |
Optimal Join Algorithms Meet Top-k |
2020 |
SIGMOD |
5.3006096e-05 |
| 5,858 |
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries |
2021 |
PODS |
5.2997454e-05 |
| 5,962 |
Beyond Equi-joins: Ranking, Enumeration and Factorization |
2021 |
VLDB |
5.2536266e-05 |
| 6,015 |
Linearized and Single-Pass Belief Propagation |
2015 |
VLDB |
5.2415551e-05 |
| 6,169 |
Approximate Lifted Inference with Probabilistic Databases |
2015 |
VLDB |
5.1716068e-05 |
| 6,347 |
A Relational Framework for Classifier Engineering |
2017 |
PODS |
5.1019568e-05 |
| 6,429 |
ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values |
2022 |
SIGMOD |
5.0666822e-05 |
| 6,546 |
Properties of Inconsistency Measures for Databases |
2021 |
SIGMOD |
5.0185588e-05 |
| 6,619 |
Near-Optimal Distributed Band-Joins through Recursive Partitioning |
2020 |
SIGMOD |
4.9910152e-05 |
| 7,022 |
A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations |
2023 |
SIGMOD |
4.8576599e-05 |
| 7,501 |
Ranked Enumeration of Minimal Triangulations |
2019 |
PODS |
4.7180617e-05 |
| 7,702 |
Counting and Enumerating (Preferred) Database Repairs |
2017 |
PODS |
4.6736471e-05 |
| 8,061 |
Efficient Computation of Quantiles over Joins |
2023 |
PODS |
4.5943269e-05 |
| 8,111 |
Databases will Visualize Queries too* |
2011 |
VLDB |
4.5842786e-05 |
| 8,340 |
Beta Probabilistic Databases: A Scalable Approach to Belief Updating and Parameter Learning |
2017 |
SIGMOD |
4.5433598e-05 |
| 8,404 |
On The Reasonable Effectiveness of Relational Diagrams: Explaining Relational Query Patterns and the Pattern Expressiveness of Relational Languages |
2024 |
SIGMOD |
4.5224126e-05 |
| 8,508 |
Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries |
2024 |
PODS |
4.4952414e-05 |
| 8,538 |
A Query Engine for Probabilistic Preferences |
2018 |
SIGMOD |
4.4937074e-05 |
| 8,541 |
Querying Probabilistic Preferences in Databases |
2017 |
PODS |
4.4937074e-05 |
| 8,581 |
Anytime Approximation in Probabilistic Databases via Scaled Dissociations |
2019 |
SIGMOD |
4.492241e-05 |
| 8,710 |
Data Conflict Resolution Using Trust Mappings |
2010 |
SIGMOD |
4.4631858e-05 |
| 8,840 |
The Cost of Representation by Subset Repairs |
2025 |
VLDB |
4.4388652e-05 |
| 9,091 |
Efficiently Enumerating Minimal Triangulations |
2017 |
PODS |
4.39823e-05 |
| 9,986 |
Database Research needs an Abstract Relational Query Language |
2026 |
CIDR |
4.1945683e-05 |
| 10,010 |
Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries |
2026 |
PODS |
4.1945683e-05 |
| 10,133 |
A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,140 |
Analyzing Deviations from Monotonic Trends through Database Repair |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,269 |
Database Views as Explanations for Relational Deep Learning |
2026 |
VLDB |
4.1945683e-05 |
| 10,355 |
Resilience for Regular Path Queries: Towards a Complexity Classification |
2025 |
PODS |
4.1945683e-05 |
| 10,513 |
Computing Inconsistency Measures Under Differential Privacy |
2025 |
SIGMOD |
4.1945683e-05 |