ICDT A

26 papers

YearTitle / Authors
2011(Approximate) uncertain skylines.
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
2011Artifact systems with data dependencies and arithmetic.
Elio Damaggio, Alin Deutsch, Victor Vianu
2011Comparing workflow specification languages: a matter of views.
Serge Abiteboul, Pierre Bourhis, Victor Vianu
2011Complexity of higher-order queries.
Huy Vu, Michael Benedikt
2011Conjunctive queries determinacy and rewriting.
Daniel Pasaila
2011Data cleaning and query answering with matching dependencies and matching functions.
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. Lakshmanan
2011Database Theory - ICDT 2011, 14th International Conference, Uppsala, Sweden, March 21-24, 2011, Proceedings
Tova Milo
2011Detecting and exploiting near-sortedness for efficient relational query evaluation.
Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin
2011Efficient reasoning about data trees via integer linear programming.
Claire David, Leonid Libkin, Tony Tan
2011Faster query answering in probabilistic databases using read-once functions.
Sudeepa Roy, Vittorio Perduca, Val Tannen
2011Generating, sampling and counting subclasses of regular tree languages.
Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven
2011Knowledge compilation meets database theory: compiling queries to decision diagrams.
Abhay Kumar Jha, Dan Suciu
2011On provenance and privacy.
Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen, Yi Chen
2011On the equivalence of distributed systems with queries and communication.
Serge Abiteboul, Balder ten Cate, Yannis Katsis
2011On the optimal approximation of queries using tractable propositional languages.
Robert Fink, Dan Olteanu
2011Querying probabilistic business processes for sub-flows.
Daniel Deutch
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
2011Relaxed notions of schema mapping equivalence revisited.
Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov
2011Satisfiability algorithms for conjunctive queries over trees.
James Cheney
2011Simplifying schema mappings.
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
2011Solutions in XML data exchange.
Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
2011The PADS project: an overview.
Kathleen Fisher, David Walker
2011The complexity of evaluating tuple generating dependencies.
Reinhard Pichler, Sebastian Skritek
2011Tractability in probabilistic databases.
Dan Suciu
2011Two-variable logic and key constraints on data words.
Matthias Niewerth, Thomas Schwentick
2011View update translation for XML.
Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawek Staworko