Readings and References
Reference Books
Query Complexity
Optimal implementation of conjunctive queries in relational databases, Chandra, Merlin, STOC 1977 (paper)
Size bounds and query plans for relational joins, Atserias, Grohe, Marx, FOCS 2008 (paper)
Hypertree Decompositions and Tractable Queries, Gottlob, Leone, Scarcello, JCSS 2002 (paper)
Skew Strikes Back: New Developments in the Theory of Join
Algorithms, Ngo, Re, Rudra, SIGMOD RECORD 2013 (paper).
Datalog
What You Always Wanted to Know About Datalog(And Never Dared to Ask), Ceri, Gottlob, Tanca, TKDE 1989 (paper)
Parallel Query Processing
A Guide to Formal Analysis of Join Processing in Massively Parallel Systems, Koutris, Suciu, SIGMOD Record 2016 (paper)
Data Streaming
Models and issues in data stream systems, Babcock, Babu, Datar, Motwani, Widom, PODS 2002 (paper).
The space complexity of approximating the frequency moments, Alon, Matias, Szegedy, STOC 1996 (paper).
Uncertain Data
Probabilistic Databases, Suciu, Olteanu, Re, Koch (book)
Probabilistic Databases: Diamonds in the Dirt, Dalvi, Re, Suciu, CACM 2008 (paper)
The dichotomy of probabilistic inference for unions of conjunctive queries, Dalvi, Suciu, JACM 2012 (paper)
Consistent Query Answers in Inconsistent Databases, Arenas, Bertossi, Chomicki, PODS 1999 (paper)
Provenance
Provenance Semirings, Green, Karvounarakis, Tannen, PODS 2007 (paper)
Provenance in Databases: Why, How and Where, Cheney, Chiticariu, Tan, Foundations and Trends in Databases 2009 (paper)
On Propagation of Deletions and Annotations Through Views, Buneman, Khanna, Tan, PODS 2002 (paper)
Maximizing Conjunctive Views in Deletion Propagation, Kimefeld, Vondrak, Williams, TODS 2012 (paper)
Privacy
|