Classic or recent papers of each topic
Contributed by Song Bian (The Chinese University of Hong Kong)
- Hypothetical Reasoning via Provenance Abstraction. SIGMOD 2019. paper
- Ariadne: Online Provenance for Big Graph Analytics. SIGMOD 2019. paper
- Going Beyond Provenance: Explaining Query Answers with Pattern-based Counterbalances. SIGMOD 2019. paper
- Explaining Wrong Queries Using Small Examples SIGMOD 2019. paper
- Answering Why-questions by Exemplars in Attributed Graphs. SIGMOD 2019. paper
- Explaining Query Answers with Explanation-Ready Databases. PVLDB 2015. paper
- A Formal Approach to Finding Explanations for Database Queries. SIGMOD 2014. paper
- Provenance for Aggregate Queries. PODS 2011. paper
- Fast Approximation of Empirical Entropy via Subsampling. KDD 2019. paper
- Constraint-based Explanation and Repair of Filter-based Transformations. PVLDB 2018. paper
- DIFF: A Relational Interface for Large-Scale Data Explanation. PVLDB 2018. paper
- Interventional Fairness : Causal Database Repair for Algorithmic Fairness. SIGMOD 2019. paper
- Operationalizing Individual Fairness with Pairwise Fair Representations. PVLDB 2019. paper
- Certifying and Removing Disparate Impact. KDD 2015. paper
- Learning Fair Representations. ICML 2013. paper
- Fairness Through Awareness. ITCS 2012. paper
- Anti-Freeze for Large and Complex Spreadsheets: Asynchronous Formula Computation. SIGMOD 2019. paper
- Towards Democratizing Relational Data Visualization. SIGMOD 2019. paper
- Efficient Selection of Geospatial Data on Maps for Interactive and Visualized Exploration. SIGMOD 2018. paper
- Adaptive Sampling for Rapidly Matching Histograms. PVLDB 2018. paper
- Scaling Distance Labeling on Small-World Networks. SIGMOD 2019. paper
- Efficiently Answering Regular Simple Path Queries on Large Labeled Networks. SIGMOD 2019. paper
- When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD 2018. paper
- Maximizing Welfare in Social Networks under A Utility Driven Influence Diffusion model. SIGMOD 2019. paper
- Online Processing Algorithms for Influence Maximization. SIGMOD 2018. paper
- Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks. SIGMOD 2018. paper
- Efficient Algorithms for Adaptive Influence Maximization. PVLDB 2018. paper
- Influence Maximization in Near-Linear Time: A Martingale Approach. SIGMOD 2015. paper
- Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency. SIGMOD 2014. paper
- TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs SIGMOD 2018. paper
- FORA: Simple and Effective Approximate Single-Source Personalized PageRank. KDD 2017. paper
- HubPPR: Effective Indexing for Approximate Personalized PageRank. PVLDB 2016. paper
- Approximate Personalized PageRank on Dynamic Graphs. KDD 2016. paper
- Personalized PageRank Estimation and Search: A Bidirectional Approach. WSDM 2016. paper
- Local Computation of PageRank Contributions. WAW 2007. paper
- Local Graph Partitioning using PageRank Vectors. FOCS 2006. paper
- Scaling Personalized Web Search. WWW 2003. paper
- Efficient Knowledge Graph Accuracy Evaluation. PVLDB 2019. paper
- Maverick: Discovering Exceptional Facts from Knowledge Graphs. SIGMOD 2018. paper
- Question Answering Over Knowledge Graphs: Question Understanding Via Template Decomposition. PVLDB 2018. paper
- Deducing Certain Fixes to Graphs. PVLDB 2019. paper
- Discovering Graph Functional Dependencies. SIGMOD 2018. paper
- Dependencies for Graphs. PODS 2017. paper
- DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models. SIGMOD 2019. paper
- Deep Unsupervised Cardinality Estimation PVLDB 2019. paper
- Learning to Sample: Counting with Complex Queries. PVLDB 2019. paper
- Random Sampling over Joins Revisited. SIGMOD 2018. paper
- AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics. SIGMOD 2018. paper
- Two-Level Sampling for Join Size Estimation. SIGMOD 2017. paper
- Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities. SIGMOD 2019. paper
- Exact Cardinality Query Optimization with Bounded Execution Cost. SIGMOD 2019. paper
- Adaptive Optimization of Very Large Join Queries. SIGMOD 2018. paper
- RRR: Rank-Regret Representative. SIGMOD 2019. paper
- Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality. SIGMOD 2018. paper
- On Obtaining Stable Rankings. PVLDB 2018. paper
- Managing Non-Volatile Memory in Database Systems. SIGMOD 2018. paper
- Let’s Talk About Storage & Recovery Methods for NVM DBMS. sigmod 2015. paper
- Obladi: Oblivious Serializable Transactions in the Cloud. OSDI 2018. paper
- SMCQL: Secure Querying for Federated Databases. VLDB 2017. paper
- Shrinkwrap: Differentially-Private Query Processing in Private Data Federations VLDB 2019. paper
- ObliDB: Oblivious Query Processing. VLDB 2020. paper
- Answering Multi-Dimensional Analytical Queries under local differential privacy. SIGMOD 2019. paper
- Multi-Dimensional Data Sharing and Analytics as services under local differential privacy. VLDB 2019. paper
- Serializable Snapshot Isolation in PostgreSQL. VLDB 2012. paper
- Staring into the Abyss an evaluation of CC with 1000 scores. VLDB 2014. paper
- Rethinking serializable multiversion concurrency control. VLDB 2015. paper
- Mostly-Optimistic Concurrency Control for Highly contended dynamic workloasd on a thousand cores. VLDB 2016. paper
- Fast Databases with Fast Durability and recovery through multicore parallelism. OSDI 2014. paper
- Low Overhead Concurrency Control for Partitioned Main memory databases. SIGMOD 2010. paper