Skip to content

International Conference on Database Theory

ICDT

A

CORE rank

CORE rank (raw)

A

Fields of research

Data Management and Data Science

Papers indexed

794

1986–2026

Papers per year

198638 peak2026

ICDT papers

794 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2012Deciding twig-definability of node selecting tree automata.Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven
2012Deciding eventual consistency for a simple class of relational transducer networks.Tom J. Ameloot, Jan Van den Bussche
2012Parallel skyline queries.Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman
2012Highly expressive query languages for unordered data trees.Serge Abiteboul, Pierre Bourhis, Victor Vianu
2012Finding optimal probabilistic generators for XML collections.Serge Abiteboul, Yael Amsterdamer, Daniel Deutch, Tova Milo, Pierre Senellart
2011Complexity of higher-order queries.Huy Vu, Michael Benedikt
2011Tractability in probabilistic databases.Dan Suciu
2011Faster query answering in probabilistic databases using read-once functions.Sudeepa Roy, Vittorio Perduca, Val Tannen
2011Relaxed notions of schema mapping equivalence revisited.Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov
2011The complexity of evaluating tuple generating dependencies.Reinhard Pichler, Sebastian Skritek
2011Conjunctive queries determinacy and rewriting.Daniel Pasaila
2011Two-variable logic and key constraints on data words.Matthias Niewerth, Thomas Schwentick
2011Knowledge compilation meets database theory: compiling queries to decision diagrams.Abhay Kumar Jha, Dan Suciu
2011Relative expressive power of navigational querying on graphs.George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu
2011The PADS project: an overview.Kathleen Fisher, David Walker
2011On the optimal approximation of queries using tractable propositional languages.Robert Fink, Dan Olteanu
2011Querying probabilistic business processes for sub-flows.Daniel Deutch
2011On provenance and privacy.Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen, Yi Chen
2011Efficient reasoning about data trees via integer linear programming.Claire David, Leonid Libkin, Tony Tan
2011Artifact systems with data dependencies and arithmetic.Elio Damaggio, Alin Deutsch, Victor Vianu
2011Satisfiability algorithms for conjunctive queries over trees.James Cheney
2011Simplifying schema mappings.Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
2011View update translation for XML.Iovka Boneva, Anne-Ccile Caron, Benot Groz, Yves Roos, Sophie Tison, Slawek Staworko
2011Solutions in XML data exchange.Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
2011Data cleaning and query answering with matching dependencies and matching functions.Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. Lakshmanan
376400 of 794← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.