Abstract is missing.
- A Theory of Regular QueriesMoshe Y. Vardi. 1-9 [doi]
- 2016 ACM PODS Alberto O. Mendelzon Test-of-Time AwardMarcelo Arenas, Peter Buneman, Jan Van den Bussche. 11 [doi]
- FAQ: Questions Asked FrequentlyMahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra. 13-28 [doi]
- Shortest Paths and Distances with Differential PrivacyAdam Sealfon. 29-41 [doi]
- Minimization of Tree Pattern QueriesWojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys. 43-54 [doi]
- Optimal Score Aggregation AlgorithmsRonald Fagin. 55 [doi]
- Hypertree Decompositions: Questions and AnswersGeorg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello. 57-74 [doi]
- Incremental View Maintenance For Collection ProgrammingChristoph Koch 0001, Daniel Lupei, Val Tannen. 75-90 [doi]
- AJAR: Aggregations and Joins over Annotated RelationsManas R. Joglekar, Rohan Puttagunta, Christopher Ré. 91-106 [doi]
- Bounded Query Rewriting Using ViewsYang Cao, Wenfei Fan, Floris Geerts, Ping Lu. 107-119 [doi]
- Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is UndecidableTomasz Gogacz, Jerzy Marcinkowski. 121-134 [doi]
- Towards a Worst-Case I/O-Optimal Algorithm for Acyclic JoinsXiao Hu, Ke Yi. 135-150 [doi]
- On the Complexity of Inner Product Similarity JoinThomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri 0001. 151-164 [doi]
- Data Management for Social NetworkingSara Cohen. 165-177 [doi]
- Verification of Hierarchical Artifact SystemsAlin Deutsch, Yuliang Li, Victor Vianu. 179-194 [doi]
- Recency-Bounded Verification of Dynamic Database-Driven SystemsParosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine. 195-210 [doi]
- Making SQL Queries Correct on Incomplete Databases: A Feasibility StudyPaolo Guagliardo, Leonid Libkin. 211-223 [doi]
- Designing a Query Language for RDF: Marrying Open and Closed WorldsMarcelo Arenas, Martín Ugarte. 225-236 [doi]
- Schema Validation via Streaming CircuitsFilip Murlak, Charles Paperman, Michal Pilipczuk. 237-249 [doi]
- Variability in Data StreamsDavid Felber, Rafail Ostrovsky. 251-260 [doi]
- Streaming Space Complexity of Nearly All Functions of One Variable on Frequency VectorsVladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang. 261-276 [doi]
- Efficient Top-k Indexing via General ReductionsSaladi Rahul, Yufei Tao. 277-288 [doi]
- Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and DictionariesMichael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh 0002, David Zage. 289-302 [doi]
- Logical Aspects of Massively Parallel and Distributed SystemsFrank Neven. 303-314 [doi]
- Counting Answers to Existential Positive Queries: A Complexity ClassificationHubie Chen, Stefan Mengel. 315-326 [doi]
- Computing Join Queries with Functional DependenciesMahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu. 327-342 [doi]
- Semantic Acyclicity Under ConstraintsPablo Barceló, Georg Gottlob, Andreas Pieris. 343-354 [doi]
- Tractable Lineages on Treelike Instances: Limits and ExtensionsAntoine Amarilli, Pierre Bourhis, Pierre Senellart. 355-370 [doi]
- Towards Tight Bounds for the Streaming Set Cover ProblemSariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian. 371-383 [doi]
- An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related ProblemsArnab Bhattacharyya, Palash Dey, David P. Woodruff. 385-400 [doi]
- Better Algorithms for Counting Triangles in Data StreamsAndrew McGregor, Sofya Vorotnikova, Hoa T. Vu. 401-411 [doi]
- Locating a Small Cluster PrivatelyKobbi Nissim, Uri Stemmer, Salil P. Vadhan. 413-427 [doi]
- Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data StructuresPankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath. 429-440 [doi]
- Space Lower Bounds for Itemset Frequency SketchesEdo Liberty, Michael Mitzenmacher, Justin Thaler, Jonathan Ullman. 441-454 [doi]
- Are Few Bins Enough: Testing Histogram DistributionsClément L. Canonne. 455-463 [doi]
- Range-Max Queries on Uncertain DataPankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri. 465-476 [doi]
- Fast Algorithms for Parsing Sequences of Parentheses with Few ErrorsArturs Backurs, Krzysztof Onak. 477-488 [doi]