Abstract is missing.
- Computational Thinking, Inferential Thinking and "Big Data"Michael I. Jordan. 1 [doi]
- Dichotomies in the Complexity of Preferred RepairsRonald Fagin, Benny Kimelfeld, Phokion G. Kolaitis. 3-15 [doi]
- The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key ConstraintsParaschos Koutris, Jef Wijsen. 17-29 [doi]
- High-Level Why-Not Explanations using OntologiesBalder ten Cate, Cristina Civili, Evgeny Sherkhonov, Wang Chiew Tan. 31-43 [doi]
- The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2015Foto N. Afrati, Frank Neven, Dan Suciu. 45 [doi]
- Parallel-Correctness and Transferability for Conjunctive QueriesTom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick. 47-58 [doi]
- LogiQL: A Declarative Language for Enterprise ApplicationsTodd J. Green. 59-64 [doi]
- Function Symbols in Tuple-Generating Dependencies: Expressive Power and ComputabilityGeorg Gottlob, Reinhard Pichler, Emanuel Sallinger. 65-77 [doi]
- Default Negation for Non-Guarded Existential RulesMario Alviano, Andreas Pieris. 79-90 [doi]
- Chase Termination for Guarded Existential RulesMarco Calautti, Georg Gottlob, Andreas Pieris. 91-103 [doi]
- Recovering Exchanged DataGösta Grahne, Ali Moallemi, Adrian Onet. 105-116 [doi]
- The (Almost) Complete Guide to Tree Pattern ContainmentWojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko. 117-130 [doi]
- Efficient Evaluation and Approximation of Well-designed Pattern TreesPablo Barceló, Reinhard Pichler, Sebastian Skritek. 131-144 [doi]
- BonXai: Combining the simplicity of DTD with the expressiveness of XML SchemaWim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick. 145-156 [doi]
- Compact Summaries over Large DatasetsGraham Cormode. 157-158 [doi]
- Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?M. Praveen, B. Srivathsan. 159-172 [doi]
- Querying Big Data by Accessing Small DataWenfei Fan, Floris Geerts, Yang Cao, Ting Deng, Ping Lu. 173-184 [doi]
- Skyline Queries with Noisy ComparisonsBenoît Groz, Tova Milo. 185-198 [doi]
- The Communication Complexity of Distributed Set-Joins with Applications to Matrix MultiplicationDirk Van Gucht, Ryan Williams, David P. Woodruff, Qin Zhang. 199-212 [doi]
- Joins via Geometric Resolutions: Worst-case and BeyondMahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra. 213-228 [doi]
- External Memory Stream SamplingXiaocheng Hu, Miao Qiao, Yufei Tao. 229-239 [doi]
- Vertex and Hyperedge Connectivity in Dynamic Graph StreamsSudipto Guha, Andrew McGregor, David Tench. 241-247 [doi]
- Fast and Near-Optimal Algorithms for Approximating Distributions by HistogramsJayadev Acharya, Ilias Diakonikolas, Chinmay Hegde, Jerry Zheng Li, Ludwig Schmidt. 249-263 [doi]
- On Top-k Range Reporting in 2D SpaceSaladi Rahul, Yufei Tao. 265-275 [doi]
- Dynamic Data Structures for Document Collections and GraphsJ. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter. 277-289 [doi]
- Join Dependency Testing, Loomis-Whitney Join, and Triangle EnumerationXiaocheng Hu, Miao Qiao, Yufei Tao. 291-301 [doi]
- Private Multiplicative Weights Beyond Linear QueriesJonathan Ullman. 303-312 [doi]
- Symmetric Weighted First-Order Model CountingPaul Beame, Guy Van den Broeck, Eric Gribkoff, Dan Suciu. 313-328 [doi]
- Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor SearchMichael Kapralov. 329-342 [doi]
- k-Histogram Distributions in Sub-linear TimePiotr Indyk, Reut Levi, Ronitt Rubinfeld. 343 [doi]