default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th ICDT 2016: Bordeaux, France
- Wim Martens, Thomas Zeume:
19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016. LIPIcs 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-002-6 - Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers, List of Authors. 0:i-0:xvi
- Foto N. Afrati, Claire David, Georg Gottlob:
The ICDT 2016 Test of Time Award Announcement. 1:1-1:2 - Floris Geerts
:
Scale Independence: Using Small Data to Answer Queries on Big Data (Invited Talk). 2:1-2:2 - Yufei Tao:
Top-k Indexes Made Small and Sweet (Invited Talk). 3:1-3:1 - David P. Woodruff:
New Algorithms for Heavy Hitters in Data Streams (Invited Talk). 4:1-4:12 - Mark Kaminski, Egor V. Kostylev:
Beyond Well-designed SPARQL. 5:1-5:18 - Anirban Dasgupta, Kevin J. Lang, Lee Rhodes, Justin Thaler:
A Framework for Estimating Stream Expression Cardinalities. 6:1-6:17 - Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Probabilistic Programming with Datalog. 7:1-7:19 - Paraschos Koutris, Paul Beame, Dan Suciu:
Worst-Case Optimal Algorithms for Parallel Query Processing. 8:1-8:18 - Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. 9:1-9:17 - Serge Abiteboul, Pierre Bourhis, Victor Vianu:
A Formal Study of Collaborative Access Control in Distributed Datalog. 10:1-10:17 - Manas Joglekar, Christopher Ré:
It's All a Matter of Degree: Using Degree Information to Optimize Multiway Joins. 11:1-11:17 - Benoît Groz, Ezra Levin, Isaac Meilijson, Tova Milo:
Filtering With the Crowd: CrowdScreen Revisited. 12:1-12:18 - Christian Konrad:
Streaming Partitioning of Sequences and Trees. 13:1-13:18 - Pablo Muñoz, Nils Vortmeier, Thomas Zeume:
Dynamic Graph Queries. 14:1-14:18 - Diego Calvanese, Magdalena Ortiz, Mantas Simkus:
Verification of Evolving Graph-structured Data under Expressive Path Constraints. 15:1-15:19 - Ognjen Savkovic, Elisa Marengo, Werner Nutt:
Query Stability in Monotonic Data-Aware Business Processes. 16:1-16:18 - Dominik D. Freydenberger, Mario Holldack:
Document Spanners: From Expressive Power to Decision Problems. 17:1-17:17 - Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Algorithms for Provisioning Queries and Analytics. 18:1-18:18 - Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov:
Limits of Schema Mappings. 19:1-19:17 - Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys:
Reasoning About Integrity Constraints for Tree-Structured Data. 20:1-20:18 - Sebastian Arming, Reinhard Pichler, Emanuel Sallinger:
Complexity of Repair Checking and Consistent Query Answering. 21:1-21:18 - Markus Kröll, Reinhard Pichler, Sebastian Skritek:
On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. 22:1-22:18 - Konstantin Golenberg, Yehoshua Sagiv:
A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs. 23:1-23:17
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-12-03 20:17 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:
