Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th PODS 2016: San Francisco, CA, USA
- Tova Milo, Wang-Chiew Tan:
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016. ACM 2016, ISBN 978-1-4503-4191-2
PODS Keynote
- Moshe Y. Vardi:
A Theory of Regular Queries. 1-9
PODS Award talks + 1 regular paper
- Marcelo Arenas, Peter Buneman, Jan Van den Bussche:
2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award. 11 - Mahmoud Abo Khamis
, Hung Q. Ngo, Atri Rudra:
FAQ: Questions Asked Frequently. 13-28 - Adam Sealfon:
Shortest Paths and Distances with Differential Privacy. 29-41 - Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Pattern Queries. 43-54
Gems of PODS
- Ronald Fagin:
Optimal Score Aggregation Algorithms. 55 - Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions: Questions and Answers. 57-74
Session 1: Query rewriting, Views, and Join Algorithms
- Christoph Koch, Daniel Lupei, Val Tannen:
Incremental View Maintenance For Collection Programming. 75-90 - Manas R. Joglekar, Rohan Puttagunta, Christopher Ré:
AJAR: Aggregations and Joins over Annotated Relations. 91-106 - Yang Cao, Wenfei Fan, Floris Geerts, Ping Lu:
Bounded Query Rewriting Using Views. 107-119 - Tomasz Gogacz, Jerzy Marcinkowski:
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. 121-134 - Xiao Hu, Ke Yi:
Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins. 135-150 - Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri:
On the Complexity of Inner Product Similarity Join. 151-164
PODS Tutorial 1
- Sara Cohen:
Data Management for Social Networking. 165-177
Session 2: Workflows and Incomplete Information
- Alin Deutsch, Yuliang Li, Victor Vianu:
Verification of Hierarchical Artifact Systems. 179-194 - Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, Othmane Rezine:
Recency-Bounded Verification of Dynamic Database-Driven Systems. 195-210 - Paolo Guagliardo, Leonid Libkin:
Making SQL Queries Correct on Incomplete Databases: A Feasibility Study. 211-223 - Marcelo Arenas, Martín Ugarte:
Designing a Query Language for RDF: Marrying Open and Closed Worlds. 225-236
Session 3: Data Streams and Indexes
- Filip Murlak, Charles Paperman, Michal Pilipczuk:
Schema Validation via Streaming Circuits. 237-249 - David Felber, Rafail Ostrovsky:
Variability in Data Streams. 251-260 - Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang:
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. 261-276 - Saladi Rahul, Yufei Tao:
Efficient Top-k Indexing via General Reductions. 277-288 - Michael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh, David Zage:
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. 289-302
PODS Tutorial 2
- Frank Neven:
Logical Aspects of Massively Parallel and Distributed Systems. 303-314
Session 4: Query Evaluation
- Hubie Chen, Stefan Mengel:
Counting Answers to Existential Positive Queries: A Complexity Classification. 315-326 - Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
Computing Join Queries with Functional Dependencies. 327-342 - Pablo Barceló, Georg Gottlob, Andreas Pieris:
Semantic Acyclicity Under Constraints. 343-354 - Antoine Amarilli, Pierre Bourhis, Pierre Senellart:
Tractable Lineages on Treelike Instances: Limits and Extensions. 355-370
Session 5: Data Streams and Privacy
- Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
Towards Tight Bounds for the Streaming Set Cover Problem. 371-383 - Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. 385-400 - Andrew McGregor, Sofya Vorotnikova, Hoa T. Vu:
Better Algorithms for Counting Triangles in Data Streams. 401-411 - Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Locating a Small Cluster Privately. 413-427
Session 6: Algorithms and Data Structures
- Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath:
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures. 429-440 - Edo Liberty, Michael Mitzenmacher, Justin Thaler, Jonathan R. Ullman:
Space Lower Bounds for Itemset Frequency Sketches. 441-454 - Clément L. Canonne:
Are Few Bins Enough: Testing Histogram Distributions. 455-463 - Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Range-Max Queries on Uncertain Data. 465-476 - Arturs Backurs, Krzysztof Onak:
Fast Algorithms for Parsing Sequences of Parentheses with Few Errors. 477-488
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
