Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th ICDT 2014: Athens, Greece
- Nicole Schweikardt, Vassilis Christophides, Vincent Leroy:
Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014. OpenProceedings.org 2014 - Database Theory - ICDT 2014.
Invited Papers
- Frank Neven:
Remaining CALM in Declarative Networking. 1 - Christopher Ré:
Links between Join Processing and Convex Geometry. 2 - Christian Bizer
:
Search Joins with the Web. 3
Distributed Computations
- Foto N. Afrati, Anish Das Sarma, Anand Rajaraman, Pokey Rule, Semih Salihoglu, Jeffrey D. Ullman:
Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce. 4-14 - Antoine Amarilli, Yael Amsterdamer, Tova Milo:
On the Complexity of Mining Itemsets from the Crowd Using Taxonomies. 15-25 - Arvind Arasu, Raghav Kaushik:
Oblivious Query Processing. 26-37
Dynamic Complexity and XML
- Thomas Zeume, Thomas Schwentick:
Dynamic Conjunctive Queries. 38-49 - Diego Figueira, Santiago Figueira, Carlos Areces:
Basic Model Theory of XPath on Data Trees. 50-60 - Claire David, Piotr Hofman, Filip Murlak, Michal Pilipczuk:
Synthesizing transformations from XML schema mappings. 61-71
Best Paper Awards
- Matthias Niewerth, Thomas Schwentick:
Reasoning about XML Constraints based on XML-to-relational mappings. 72-83 - Tom J. Ameloot:
Deciding Correctness with Fairness for Simple Transducer Networks. 84-95 - Todd L. Veldhuizen:
Triejoin: A Simple, Worst-Case Optimal Join Algorithm. 96-106
Graph Databases
- Nadime Francis, Luc Segoufin, Cristina Sirangelo:
Datalog Rewritings of Regular Path Queries using Views. 107-118 - Jelle Hellings:
Conjunctive Context-Free Path Queries. 119-130 - Egor V. Kostylev, Juan L. Reutter, Domagoj Vrgoc:
Containment of Data Graph Queries. 131-142
Uncertainty
- Serge Abiteboul, Daniel Deutch, Victor Vianu:
Deduction with Contradictions in Datalog. 143-154 - Dany Maslowski, Jef Wijsen:
Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins. 155-164 - Paraschos Koutris, Dan Suciu:
A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys. 165-176
Probabilistic Databases and Provenance
- Paul Beame, Jerry Li, Sudeepa Roy, Dan Suciu:
Counting of Query Expressions: Limitations of Propositional Methods. 177-188 - Christopher Ré:
The Theory of Zeta Graphs with an Application to Random Networks. 189-200 - Daniel Deutch, Tova Milo, Sudeepa Roy, Val Tannen:
Circuits for Datalog Provenance. 201-212
Algorithms and Queries
- Yeye He, Siddharth Barman, Jeffrey F. Naughton:
On Load Shedding in Complex Event Processing. 213-224 - Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Kostas Tsichlas:
Dynamic Processing of Dominating Queries with Performance Guarantees. 225-234 - Simone Bova, Hubie Chen:
The Complexity of Width Minimization for Existential Positive Queries. 235-244 - François Picalausa, George H. L. Fletcher, Jan Hidders, Stijn Vansummeren:
Principles of Guarded Structural Indexing. 245-256
Test of time award
- Michael Benedikt, Ronald Fagin, Wim Martens:
The ICDT 2014 Test of Time Award. 257
a service of 
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-04-15 20:33 CEST 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:
