Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar12th ICDT 2009: Saint-Petersburg, Russia
- Ronald Fagin:
Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings. ACM International Conference Proceeding Series 361, ACM 2009, ISBN 978-1-60558-423-2
Invited papers
- Victor Vianu:
Automatic verification of database-driven systems: a new frontier. 1-13 - Andrea Calì, Georg Gottlob
, Thomas Lukasiewicz:
Datalog±: a unified approach to ontologies and integrity constraints. 14-30
Inconsistency and repairs
- Foto N. Afrati, Phokion G. Kolaitis:
Repair checking in inconsistent databases: algorithms and complexity. 31-41 - Jef Wijsen:
Consistent query answering under primary keys: a characterization of tractable queries. 42-52 - Solmaz Kolahi, Laks V. S. Lakshmanan:
On approximating optimum repairs for functional dependency violations. 53-62
Data exchange
- Balder ten Cate, Phokion G. Kolaitis:
Structural characterizations of schema-mapping languages. 63-72 - Marcelo Arenas, Pablo Barceló, Juan L. Reutter:
Query languages for data exchange: beyond unions of conjunctive queries. 73-83 - Bogdan Cautis, Alin Deutsch, Nicola Onose:
Querying data sources that export infinite sets of views. 84-97
Data structures and algorithms
- Kenneth A. Ross, John Cieslewicz:
Optimal splitters for database partitioning with size bounds. 98-110 - Hao Yuan, Mikhail J. Atallah:
Efficient data structures for range-aggregate queries on trees. 111-120 - Rasmus Resen Amossen, Rasmus Pagh:
Faster join-projects and sparse matrix multiplications. 121-126
Uncertain databases
- Christoph Koch:
A compositional query algebra for second-order logic and uncertain databases. 127-140 - Sungwoo Park, Seung-won Hwang:
A logical account of uncertain databases based on linear logic. 141-148 - Michaela Götz, Christoph Koch:
A compositional framework for complex queries over uncertain data. 149-161
XML
- Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens:
Incremental XPath evaluation. 162-173 - Dario Colazzo, Giorgio Ghelli, Carlo Sartiani:
Efficient asymmetric inclusion between regular expression types. 174-182 - Clemens Ley, Michael Benedikt:
How big must complete XML query languages be? 183-200
Querying
- George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. 201-211 - Todd J. Green, Zachary G. Ives, Val Tannen:
Reconcilable differences. 212-224
Business processes
- Christian Fritz, Richard Hull, Jianwen Su:
Automatic construction of simple artifact-based business processes. 225-238 - Daniel Deutch, Tova Milo:
TOP-K projection queries for probabilistic business processes. 239-251 - Alin Deutsch, Richard Hull, Fabio Patrizi, Victor Vianu:
Automatic verification of data-centric business processes. 252-267
Streams, data mining, complexity
- Sudipto Guha:
Tight results for clustering and summarizing data streams. 268-275 - Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogish Sabharwal:
Analysis of sampling techniques for association rule mining. 276-283 - David P. Woodruff:
The average-case complexity of counting distinct elements. 284-295
Provenance
- Todd J. Green:
Containment of conjunctive queries on annotated relations. 296-309 - Olivier Biton, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy:
Optimizing user views for workflows. 310-323
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 2020-07-02 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
