default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th ICDT 2017: Venice, Italy
- Michael Benedikt, Giorgio Orsi:
20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy. LIPIcs 68, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-024-8 - Front Matter, Table of Contents, Preface, Conference Organization, List of Authors. 0:i-0:xii
- Cristina Feier
, Antti Kuusisto, Carsten Lutz:
Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk). 1:1-1:17 - Dániel Marx:
Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk). 2:1-2:1 - Tova Milo:
The Smart Crowd - Learning from the Ones Who Know (Invited Talk). 3:1-3:1 - Foto N. Afrati, Manas R. Joglekar, Christopher Ré, Semih Salihoglu, Jeffrey D. Ullman:
GYM: A Multiround Distributed Join Algorithm. 4:1-4:18 - Antoine Amarilli, Yael Amsterdamer, Tova Milo, Pierre Senellart:
Top-k Querying of Unknown Values under Order Constraints. 5:1-5:18 - Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart:
Combined Tractability of Query Evaluation via Tree Automata and Cycluits. 6:1-6:19 - Pablo Barceló, Miguel Romero:
The Complexity of Reverse Engineering Problems for Conjunctive Queries. 7:1-7:17 - Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering FO+MOD Queries Under Updates on Bounded Degree Databases. 8:1-8:18 - Simone Bova, Hubie Chen:
How Many Variables Are Needed to Express an Existential Positive Query?. 9:1-9:16 - Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
Expressive Power of Entity-Linking Frameworks. 10:1-10:18 - Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, Wei Zhan:
k-Regret Minimizing Set: Efficient Algorithms and Hardness. 11:1-11:19 - Shaleen Deep, Paraschos Koutris:
The Design of Arbitrage-Free Data Pricing Schemes. 12:1-12:18 - Dominik D. Freydenberger:
A Logic for Document Spanners. 13:1-13:18 - Minos N. Garofalakis, Vasilis Samoladas:
Distributed Query Monitoring through Convex Analysis: Towards Composable Safe Zones. 14:1-14:18 - Tomasz Gogacz, Szymon Torunczyk:
Entropy Bounds for Conjunctive Queries with Functional Dependencies. 15:1-15:17 - Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger:
On the Automated Verification of Web Applications with Embedded SQL. 16:1-16:18 - Benny Kimelfeld, Ester Livshits, Liat Peterfreund:
Detecting Ambiguity in Prioritized Database Repairing. 17:1-17:20 - Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Compression of Unordered XML Trees. 18:1-18:17 - Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. 19:1-19:18 - Luc Segoufin, Alexandre Vigny:
Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. 20:1-20:16 - Bruhathi Sundarmurthy, Paraschos Koutris, Willis Lang, Jeffrey F. Naughton, Val Tannen:
m-tables: Representing Missing Data. 21:1-21:20 - Andrew McGregor, Hoa T. Vu:
Better Streaming Algorithms for the Maximum Coverage Problem. 22:1-22:18
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-11 20:32 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:
