default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th PODS 2017: Chicago, IL, USA
- Emanuel Sallinger, Jan Van den Bussche, Floris Geerts:
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017. ACM 2017, ISBN 978-1-4503-4198-1
PODS Keynote
- Susan B. Davidson, Peter Buneman, Daniel Deutch, Tova Milo, Gianmaria Silvello
:
Data Citation: A Computational Challenge. 1-4
PODS Session 1: New Formal Frameworks
- Benny Kimelfeld, Christopher Ré:
A Relational Framework for Classifier Engineering. 5-20 - Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich:
Querying Probabilistic Preferences in Databases. 21-36
PODS Session 2: Algorithms, Data Structures, Benchmarking
- Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro, Efthymia Tsamoura:
Benchmarking the Chase. 37-52 - Tarun Kathuria, S. Sudarshan:
Efficient and Provable Multi-Query Optimization. 53-67 - Michael A. Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, Cynthia A. Phillips, Helen Xu:
Write-Optimized Skip Lists. 69-78 - Xiao Hu, Yufei Tao, Ke Yi:
Output-optimal Parallel Algorithms for Similarity Joins. 79-90
Gems of PODS and Test-of-Time Award Session
- Leonid Libkin, Moshe Y. Vardi:
2017 ACM PODS Alberto O. Mendelzon Test-of-Time Award. 91 - Todd J. Green, Val Tannen:
The Semiring Framework for Database Provenance. 93-99 - Behzad Golshan, Alon Y. Halevy, George A. Mihaila, Wang-Chiew Tan:
Data Integration: After the Teenage Years. 101-106
PODS Session 3: Concurrency, JSON, Learning and Privacy
- Rachid Guerraoui, Jingjing Wang:
How Fast can a Distributed Transaction Commit? 107-122 - Pierre Bourhis, Juan L. Reutter, Fernando Suárez, Domagoj Vrgoc:
JSON: Data model, Query languages and Schema specification. 123-135 - Jan Hidders, Jan Paredaens, Jan Van den Bussche:
J-Logic: Logical Foundations for JSON Querying. 137-149 - Yaacov Y. Weiss, Sara Cohen:
Reverse Engineering SPJ-Queries from Examples. 151-166 - Shiva Prasad Kasiviswanathan, Kobbi Nissim, Hongxia Jin:
Private Incremental Regression. 167-182
PODS Invited Tutorial 1
- Lise Getoor:
Statistical Relational Learning: Unifying AI & DB Perspectives on Structured Probabilistic Models. 183
PODS Session 4: Best Paper Award, Ontologies and JSON
- André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. 185-199 - Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev:
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. 201-216 - Antoine Amarilli, Mikaël Monet, Pierre Senellart:
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. 217-232 - Simone Bova, Stefan Szeider:
Circuit Treewidth, Sentential Decision, and Query Compilation. 233-246
PODS Session 5: Enumeration Problems
- David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres:
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. 247-260 - Di Xiao, Yi Cui, Daren B. H. Cline, Dmitri Loguinov:
On Asymptotic Cost of Triangle Listing in Random Graphs. 261-272 - Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
Efficiently Enumerating Minimal Triangulations. 273-287 - Ester Livshits, Benny Kimelfeld:
Counting and Enumerating (Preferred) Database Repairs. 289-301 - Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering Conjunctive Queries under Updates. 303-318
PODS Invited Tutorial 2
- Dan Suciu:
Communication Cost in Parallel Query Evaluation: A Tutorial. 319
PODS Session 6: Best Student Paper Award, Streaming and Sketches
- Sepehr Assadi:
Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem. 321-335 - Priya Govindan, Morteza Monemizadeh, S. Muthukrishnan:
Streaming Algorithms for Measuring H-Impact. 337-346 - Zengfeng Huang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Efficient Matrix Sketching over Distributed Data. 347-359 - Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff:
BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory. 361-376
PODS Session 7: Dependencies, Graphs and Query Evaluation
- Mario Alviano, Michael Morak, Andreas Pieris:
Stable Model Semantics for Tuple-Generating Dependencies Revisited. 377-388 - Nadime Francis, Leonid Libkin:
Schema Mappings for Data Graphs. 389-401 - Wenfei Fan, Ping Lu:
Dependencies for Graphs. 403-416 - Bas Ketsman, Dan Suciu:
A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries. 417-428 - Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another? 429-444
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 2025-03-24 00:15 CET 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:
