Abstract is missing.
- Database Theory - ICDT 2014 [doi]
- Remaining CALM in Declarative NetworkingFrank Neven. 1 [doi]
- Links between Join Processing and Convex GeometryChristopher Ré. 2 [doi]
- Search Joins with the WebChristian Bizer. 3 [doi]
- Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduceFoto N. Afrati, Anish Das Sarma, Anand Rajaraman, Pokey Rule, Semih Salihoglu, Jeffrey D. Ullman. 4-14 [doi]
- On the Complexity of Mining Itemsets from the Crowd Using TaxonomiesAntoine Amarilli, Yael Amsterdamer, Tova Milo. 15-25 [doi]
- Oblivious Query ProcessingArvind Arasu, Raghav Kaushik. 26-37 [doi]
- Dynamic Conjunctive QueriesThomas Zeume, Thomas Schwentick. 38-49 [doi]
- Basic Model Theory of XPath on Data TreesDiego Figueira, Santiago Figueira, Carlos Areces. 50-60 [doi]
- Synthesizing transformations from XML schema mappingsClaire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk. 61-71 [doi]
- Reasoning about XML Constraints based on XML-to-relational mappingsMatthias Niewerth, Thomas Schwentick. 72-83 [doi]
- Deciding Correctness with Fairness for Simple Transducer NetworksTom J. Ameloot. 84-95 [doi]
- Triejoin: A Simple, Worst-Case Optimal Join AlgorithmTodd L. Veldhuizen. 96-106 [doi]
- Datalog Rewritings of Regular Path Queries using ViewsNadime Francis, Luc Segoufin, Cristina Sirangelo. 107-118 [doi]
- Conjunctive Context-Free Path QueriesJelle Hellings. 119-130 [doi]
- Containment of Data Graph QueriesEgor V. Kostylev, Juan L. Reutter, Domagoj Vrgoc. 131-142 [doi]
- Deduction with Contradictions in DatalogSerge Abiteboul, Daniel Deutch, Victor Vianu. 143-154 [doi]
- Counting Database Repairs that Satisfy Conjunctive Queries with Self-JoinsDany Maslowski, Jef Wijsen. 155-164 [doi]
- A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple KeysParaschos Koutris, Dan Suciu. 165-176 [doi]
- Counting of Query Expressions: Limitations of Propositional MethodsPaul Beame, Jerry Li, Sudeepa Roy, Dan Suciu. 177-188 [doi]
- The Theory of Zeta Graphs with an Application to Random NetworksChristopher Ré. 189-200 [doi]
- Circuits for Datalog ProvenanceDaniel Deutch, Tova Milo, Sudeepa Roy, Val Tannen. 201-212 [doi]
- On Load Shedding in Complex Event ProcessingYeye He, Siddharth Barman, Jeffrey F. Naughton. 213-224 [doi]
- Dynamic Processing of Dominating Queries with Performance GuaranteesAndreas Kosmatopoulos, Apostolos N. Papadopoulos, Kostas Tsichlas. 225-234 [doi]
- The Complexity of Width Minimization for Existential Positive QueriesSimone Bova, Hubie Chen. 235-244 [doi]
- Principles of Guarded Structural IndexingFrançois Picalausa, George H. L. Fletcher, Jan Hidders, Stijn Vansummeren. 245-256 [doi]
- The ICDT 2014 Test of Time AwardMichael Benedikt, Ronald Fagin, Wim Martens. 257 [doi]