| 709 |
A Case for A Collaborative Query Management System |
2009 |
CIDR |
0.00017740603 |
| 1,119 |
The Complexity of Causality and Responsibility for Query Answers and non-Answers |
2011 |
VLDB |
0.00013851012 |
| 1,650 |
Efficient Enumeration of Maximal k-Plexes |
2015 |
SIGMOD |
0.00011002771 |
| 1,940 |
Split-Correctness in Information Extraction |
2019 |
PODS |
0.00010019194 |
| 2,600 |
Tracing Data Errors with View-Conditioned Causality |
2011 |
SIGMOD |
8.4652308e-05 |
| 2,876 |
Computing the Shapley Value of Facts in Query Answering |
2022 |
SIGMOD |
7.9739469e-05 |
| 2,932 |
Complexity Bounds for Relational Algebra over Document Spanners |
2019 |
PODS |
7.8724421e-05 |
| 3,001 |
SANTOS: Relationship-based Semantic Table Union Search |
2023 |
SIGMOD |
7.739698e-05 |
| 3,030 |
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries |
2020 |
PODS |
7.676832e-05 |
| 3,045 |
Dichotomies in the Complexity of Preferred Repairs |
2015 |
PODS |
7.6618214e-05 |
| 3,224 |
Reverse Data Management |
2011 |
VLDB |
7.3523336e-05 |
| 3,386 |
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration |
2020 |
PODS |
7.151562e-05 |
| 3,448 |
Approximate Denial Constraints |
2020 |
VLDB |
7.081095e-05 |
| 3,702 |
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries |
2020 |
VLDB |
6.8251643e-05 |
| 4,358 |
The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries |
2016 |
VLDB |
6.2499e-05 |
| 4,557 |
Managing Structured Collections of Community Data |
2011 |
CIDR |
6.0815338e-05 |
| 4,860 |
Integrating Data Lake Tables |
2023 |
VLDB |
5.867964e-05 |
| 4,940 |
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins |
2020 |
PODS |
5.8131196e-05 |
| 5,459 |
QueryVis: Logic-based Diagrams help Users Understand Complicated SQL Queries Faster |
2020 |
SIGMOD |
5.4946579e-05 |
| 5,837 |
Believe It or Not: Adding Belief Annotations to Databases |
2009 |
VLDB |
5.3078955e-05 |
| 5,845 |
Optimal Join Algorithms Meet Top-k |
2020 |
SIGMOD |
5.3057391e-05 |
| 5,859 |
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries |
2021 |
PODS |
5.2963939e-05 |
| 5,963 |
Beyond Equi-joins: Ranking, Enumeration and Factorization |
2021 |
VLDB |
5.2485815e-05 |
| 6,019 |
Linearized and Single-Pass Belief Propagation |
2015 |
VLDB |
5.2365238e-05 |
| 6,167 |
Approximate Lifted Inference with Probabilistic Databases |
2015 |
VLDB |
5.1725053e-05 |
| 6,345 |
A Relational Framework for Classifier Engineering |
2017 |
PODS |
5.0970607e-05 |
| 6,424 |
ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values |
2022 |
SIGMOD |
5.0618143e-05 |
| 6,544 |
Properties of Inconsistency Measures for Databases |
2021 |
SIGMOD |
5.013741e-05 |
| 6,618 |
Near-Optimal Distributed Band-Joins through Recursive Partitioning |
2020 |
SIGMOD |
4.9864636e-05 |
| 7,024 |
A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations |
2023 |
SIGMOD |
4.8530001e-05 |
| 7,500 |
Ranked Enumeration of Minimal Triangulations |
2019 |
PODS |
4.7135369e-05 |
| 7,701 |
Counting and Enumerating (Preferred) Database Repairs |
2017 |
PODS |
4.6690279e-05 |
| 8,065 |
Efficient Computation of Quantiles over Joins |
2023 |
PODS |
4.5899218e-05 |
| 8,115 |
Databases will Visualize Queries too* |
2011 |
VLDB |
4.5800219e-05 |
| 8,334 |
Beta Probabilistic Databases: A Scalable Approach to Belief Updating and Parameter Learning |
2017 |
SIGMOD |
4.5390028e-05 |
| 8,400 |
On The Reasonable Effectiveness of Relational Diagrams: Explaining Relational Query Patterns and the Pattern Expressiveness of Relational Languages |
2024 |
SIGMOD |
4.5180771e-05 |
| 8,506 |
Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries |
2024 |
PODS |
4.4909322e-05 |
| 8,537 |
A Query Engine for Probabilistic Preferences |
2018 |
SIGMOD |
4.4893996e-05 |
| 8,539 |
Querying Probabilistic Preferences in Databases |
2017 |
PODS |
4.4893996e-05 |
| 8,578 |
Anytime Approximation in Probabilistic Databases via Scaled Dissociations |
2019 |
SIGMOD |
4.4879347e-05 |
| 8,705 |
Data Conflict Resolution Using Trust Mappings |
2010 |
SIGMOD |
4.4589067e-05 |
| 8,839 |
The Cost of Representation by Subset Repairs |
2025 |
VLDB |
4.4346105e-05 |
| 9,088 |
Efficiently Enumerating Minimal Triangulations |
2017 |
PODS |
4.3940132e-05 |
| 9,985 |
Database Research needs an Abstract Relational Query Language |
2026 |
CIDR |
4.1905499e-05 |
| 10,010 |
Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries |
2026 |
PODS |
4.1905499e-05 |
| 10,133 |
A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,140 |
Analyzing Deviations from Monotonic Trends through Database Repair |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,269 |
Database Views as Explanations for Relational Deep Learning |
2026 |
VLDB |
4.1905499e-05 |
| 10,367 |
Resilience for Regular Path Queries: Towards a Complexity Classification |
2025 |
PODS |
4.1905499e-05 |
| 10,522 |
Computing Inconsistency Measures Under Differential Privacy |
2025 |
SIGMOD |
4.1905499e-05 |