LIPIcs, Volume 68, ICDT 2017

• Michael Benedikt and Giorgio Orsi LIPIcs, Volume 68, ICDT'17, Complete Volume 10.4230/LIPIcs.ICDT.2017
• Michael Benedikt and Giorgio Orsi Front Matter, Table of Contents, Preface, Conference Organization, List of Authors 10.4230/LIPIcs.ICDT.2017.0
• Cristina Feier, Antti Kuusisto, and Carsten Lutz Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk) 10.4230/LIPIcs.ICDT.2017.1
• Dániel Marx Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk) 10.4230/LIPIcs.ICDT.2017.2
• Tova Milo The Smart Crowd - Learning from the Ones Who Know (Invited Talk) 10.4230/LIPIcs.ICDT.2017.3
• Foto N. Afrati, Manas R. Joglekar, Christopher M. Re, Semih Salihoglu, and Jeffrey D. Ullman GYM: A Multiround Distributed Join Algorithm 10.4230/LIPIcs.ICDT.2017.4
• Antoine Amarilli, Yael Amsterdamer, Tova Milo, and Pierre Senellart Top-k Querying of Unknown Values under Order Constraints 10.4230/LIPIcs.ICDT.2017.5
• Antoine Amarilli, Pierre Bourhis, Mikaël Monet, and Pierre Senellart Combined Tractability of Query Evaluation via Tree Automata and Cycluits 10.4230/LIPIcs.ICDT.2017.6
• Pablo Barceló and Miguel Romero The Complexity of Reverse Engineering Problems for Conjunctive Queries 10.4230/LIPIcs.ICDT.2017.7
• Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt Answering FO+MOD Queries Under Updates on Bounded Degree Databases 10.4230/LIPIcs.ICDT.2017.8
• Simone Bova and Hubie Chen How Many Variables Are Needed to Express an Existential Positive Query? 10.4230/LIPIcs.ICDT.2017.9
• Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, and Wang-Chiew Tan Expressive Power of Entity-Linking Frameworks 10.4230/LIPIcs.ICDT.2017.10
• Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, and Wei Zhan k-Regret Minimizing Set: Efficient Algorithms and Hardness 10.4230/LIPIcs.ICDT.2017.11
• Shaleen Deep and Paraschos Koutris The Design of Arbitrage-Free Data Pricing Schemes 10.4230/LIPIcs.ICDT.2017.12
• Dominik D. Freydenberger A Logic for Document Spanners 10.4230/LIPIcs.ICDT.2017.13
• Minos Garofalakis and Vasilis Samoladas Distributed Query Monitoring through Convex Analysis: Towards Composable Safe Zones 10.4230/LIPIcs.ICDT.2017.14
• Tomasz Gogacz and Szymon Torunczyk Entropy Bounds for Conjunctive Queries with Functional Dependencies 10.4230/LIPIcs.ICDT.2017.15
• Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, and Florian Zuleger On the Automated Verification of Web Applications with Embedded SQL 10.4230/LIPIcs.ICDT.2017.16
• Benny Kimelfeld, Ester Livshits, and Liat Peterfreund Detecting Ambiguity in Prioritized Database Repairing 10.4230/LIPIcs.ICDT.2017.17
• Markus Lohrey, Sebastian Maneth, and Carl Philipp Reh Compression of Unordered XML Trees 10.4230/LIPIcs.ICDT.2017.18
• Thomas Schwentick, Nils Vortmeier, and Thomas Zeume Dynamic Complexity under Definable Changes 10.4230/LIPIcs.ICDT.2017.19
• Luc Segoufin and Alexandre Vigny Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion 10.4230/LIPIcs.ICDT.2017.20
• Bruhathi Sundarmurthy, Paraschos Koutris, Willis Lang, Jeffrey Naughton, and Val Tannen m-tables: Representing Missing Data 10.4230/LIPIcs.ICDT.2017.21
• Andrew McGregor and Hoa T. Vu Better Streaming Algorithms for the Maximum Coverage Problem 10.4230/LIPIcs.ICDT.2017.22