Journal: Theory Comput. Syst.

Volume 57, Issue 4

805 -- 0. Editor's Note: Special Issue on Database Theory
806 -- 842Serge Abiteboul, Yael Amsterdamer, Daniel Deutch, Tova Milo, Pierre Senellart. Optimal Probabilistic Generation of XML Documents
843 -- 891Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis. On the Data Complexity of Consistent Query Answering
892 -- 926Amélie Gheerbrant, Leonid Libkin. Certain Answers over Incomplete XML Documents: Extending Tractability Boundary
927 -- 966Serge Abiteboul, Pierre Bourhis, Victor Vianu. Highly Expressive Query Languages for Unordered Data Trees
967 -- 1007Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven. Deciding Twig-definability of Node Selecting Tree Automata
1008 -- 1037Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman. Parallel Skyline Queries
1038 -- 1111Tom J. Ameloot, Jan Van den Bussche. Deciding Confluence for a Simple Class of Relational Transducer Networks
1112 -- 1113Balder ten Cate, Wang Chiew Tan. Foreword: Special Issue on Database Theory
1114 -- 1158Dominik D. Freydenberger, Timo Kötzing. Fast Learning of Restricted Regular Expressions and DTDs
1159 -- 1201Chao Li, Gerome Miklau. Lower Bounds on the Error of Query Sets Under the Differentially-Private Matrix Mechanism
1202 -- 1249Arnaud Durand 0001, Stefan Mengel. Structural Tractability of Counting of Solutions to Conjunctive Queries
1250 -- 1321Pierre Bourhis, Gabriele Puppis, Cristian Riveros. Which XML Schemas are Streaming Bounded Repairable?
1322 -- 1371Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Nöth. XML Compression via Directed Acyclic Graphs