default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd PODS 2014: Snowbird, UT, USA
- Richard Hull, Martin Grohe:
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27, 2014. ACM 2014, ISBN 978-1-4503-2375-8
Keynote address
- Leonid Libkin:
Incomplete data: what went wrong, and how to fix it. 1-13
Web queries and big data
- Marcelo Arenas, Georg Gottlob
, Andreas Pieris:
Expressive languages for querying the semantic web. 14-26 - Georg Gottlob, Sebastian Rudolph, Mantas Simkus:
Expressiveness of guarded existential rule languages. 27-38 - Reinhard Pichler, Sebastian Skritek:
Containment and equivalence of well-designed SPARQL. 39-50 - Wenfei Fan, Floris Geerts, Leonid Libkin:
On scale independence for querying big data. 51-62
Awards session
- Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture. 64-75
Tutorial 1
- Peter J. Haas:
Model-data Ecosystems: challenges, tools, and trends. 76-87
Sketching and sampling
- Edith Cohen:
All-distances sketches, revisited: HIP estimators for massive graphs analysis. 88-99 - Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni:
Composable core-sets for diversity and coverage maximization. 100-108 - Rasmus Pagh, Morten Stöckel, David P. Woodruff:
Is min-wise hashing optimal for summarizing set intersection? 109-120
Enumeration, counting, and probabilities
- Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating answers to first-order queries over databases of low degree. 121-131 - Gianluigi Greco, Francesco Scarcello:
Counting solutions to conjunctive queries: structural and hybrid tractability. 132-143 - Robert Fink, Dan Olteanu:
A dichotomy for non-repeating queries with negation in probabilistic databases. 144-155
Tutorial 2
- Benny Kimelfeld:
Database principles in information extraction. 156-163 - Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Cleaning inconsistencies in information extraction via prioritized repairs. 164-175
Classics
- Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Nested dependencies: structure and reasoning. 176-187 - Pablo Barceló, Miguel Romero, Moshe Y. Vardi:
Does query evaluation tractability help query containment? 188-199 - Michael Benedikt, Balder ten Cate, Efthymia Tsamoura:
Generating low-cost plans from proofs. 200-211
Computing joins
- Paul Beame, Paraschos Koutris, Dan Suciu:
Skew in parallel query processing. 212-223 - Rasmus Pagh, Francesco Silvestri:
The input/output complexity of triangle enumeration. 224-233 - Hung Q. Ngo, Dung T. Nguyen, Christopher Ré, Atri Rudra:
Beyond worst-case analysis for joins with minesweeper. 234-245
Data structures and range queries
- Xiaocheng Hu, Miao Qiao, Yufei Tao:
Independent range sampling. 246-255 - Yufei Tao:
A dynamic I/O-efficient structure for one-dimensional top-k range reporting. 256-265 - Manish Patil, Sharma V. Thankachan, Rahul Shah, Yakov Nekrich, Jeffrey Scott Vitter:
Categorical range maxima queries. 266-277 - Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. 278-288
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 2026-07-15 00:50 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
