Abstract is missing.
- Tractability in probabilistic databasesDan Suciu. 1-2 [doi]
- On provenance and privacySusan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen, Yi Chen. 3-10 [doi]
- The PADS project: an overviewKathleen Fisher, David Walker. 11-17 [doi]
- Efficient reasoning about data trees via integer linear programmingClaire David, Leonid Libkin, Tony Tan. 18-29 [doi]
- Generating, sampling and counting subclasses of regular tree languagesTimos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven. 30-41 [doi]
- View update translation for XMLIovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawek Staworko. 42-53 [doi]
- Querying probabilistic business processes for sub-flowsDaniel Deutch. 54-65 [doi]
- Artifact systems with data dependencies and arithmeticElio Damaggio, Alin Deutsch, Victor Vianu. 66-77 [doi]
- Comparing workflow specification languages: a matter of viewsSerge Abiteboul, Pierre Bourhis, Victor Vianu. 78-89 [doi]
- Relaxed notions of schema mapping equivalence revisitedReinhard Pichler, Emanuel Sallinger, Vadim Savenkov. 90-101 [doi]
- Solutions in XML data exchangeMikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak. 102-113 [doi]
- Simplifying schema mappingsDiego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi. 114-125 [doi]
- On the equivalence of distributed systems with queries and communicationSerge Abiteboul, Balder ten Cate, Yannis Katsis. 126-137 [doi]
- Two-variable logic and key constraints on data wordsMatthias Niewerth, Thomas Schwentick. 138-149 [doi]
- Knowledge compilation meets database theory: compiling queries to decision diagramsAbhay Kumar Jha, Dan Suciu. 162-173 [doi]
- On the optimal approximation of queries using tractable propositional languagesRobert Fink, Dan Olteanu. 174-185 [doi]
- (Approximate) uncertain skylinesPeyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips. 186-196 [doi]
- Relative expressive power of navigational querying on graphsGeorge H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu. 197-207 [doi]
- Complexity of higher-order queriesHuy Vu, Michael Benedikt. 208-219 [doi]
- Conjunctive queries determinacy and rewritingDaniel Pasaila. 220-231 [doi]
- Faster query answering in probabilistic databases using read-once functionsSudeepa Roy, Vittorio Perduca, Val Tannen. 232-243 [doi]
- The complexity of evaluating tuple generating dependenciesReinhard Pichler, Sebastian Skritek. 244-255 [doi]
- Detecting and exploiting near-sortedness for efficient relational query evaluationSagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin. 256-267 [doi]
- Data cleaning and query answering with matching dependencies and matching functionsLeopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. Lakshmanan. 268-279 [doi]