27. PODS 2008: Vancouver, BC, Canada

Maurizio Lenzerini, Domenico Lembo (Eds.): Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada. ACM 2008, ISBN 978-1-60558-108-8

Invited talk

Peter Buneman, James Cheney, Wang Chiew Tan, Stijn Vansummeren:
Curated databases. 1-12

Schema Mappings

Marcelo Arenas, Jorge Pérez, Cristian Riveros:
The recovery of a schema mapping: bringing exchanged data back. 13-22
Pierre Senellart, Georg Gottlob:
On the complexity of deriving schema mappings from database instances. 23-32
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian Popa:
Towards a theory of schema-mapping optimization. 33-42

Best Newcomer Award & Invited Tutorial 1

Karl Schnaitter, Neoklis Polyzotis:
Evaluating rank joins with optimal cost. 43-52
Mikolaj Bojanzyk:
Effective characterizations of tree logics. 53-66

Mendelzon test-of-time award

Streaming data & best paper award

Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. 69-78
Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan, Hao Yang:
A generic flow algorithm for shared filter ordering problems. 79-88
Graham Cormode, Flip Korn, Srikanta Tirthapura:
Time-decaying aggregates in out-of-order streams. 89-98

Uncertain & probabilistic data

Christoph Koch:
Approximating predicates and expressive queries on probabilistic databases. 99-108
Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv:
Incorporating constraints in probabilistic XML. 109-118
Abhay Kumar Jha, Vibhor Rastogi, Dan Suciu:
Query evaluation with soft-key constraints. 119-128

Data exchange

Foto N. Afrati, Phokion G. Kolaitis:
Answering aggregate queries in data exchange. 129-138
Leonid Libkin, Cristina Sirangelo:
Data exchange and schema mappings in open and closed worlds. 139-148
Alin Deutsch, Alan Nash, Jeffrey B. Remmel:
The chase revisited. 149-158

Data quality, data privacy, & invited tutorial 2

Wenfei Fan:
Dependencies revisited for improving data quality. 159-170
Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff:
Epistemic privacy. 171-180

Searching & clustering

Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter:
On searching compressed string collections cache-obliviously. 181-190
Graham Cormode, Andrew McGregor:
Approximation algorithms for clustering uncertain data. 191-200
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar:
Approximation algorithms for co-clustering. 201-210
Sreenivas Gollapudi, Rina Panigrahy:
The power of two min-hashes for similarity search among hierarchical data objects. 211-220

Data & services

Serge Abiteboul, Luc Segoufin, Victor Vianu:
Static analysis of active XML systems. 221-230
Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Neven, Antonella Poggi:
Complexity and composition of synthesized web services. 231-240

XML & hierarchical data

Mikolaj Bojanczyk, Pawel Parys:
XPath evaluation in linear time. 241-250
Balder ten Cate, Luc Segoufin:
XPath, transitive closure logic, and nested tree walking automata. 251-260
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse, Uri Zarfaty:
Local Hoare reasoning about DOM. 261-270
J. Nathan Foster, Todd J. Green, Val Tannen:
Annotated XML: queries and provenance. 271-280

Query processing & optimization

Mauro Sozio, Thomas Neumann, Gerhard Weikum:
Near-optimal dynamic replication in unstructured peer-to-peer networks. 281-290
Oege de Moor, Damien Sereni, Pavel Avgustinov, Mathieu Verbaere:
Type inference for datalog and its application to query optimisation. 291-300
Izchak Sharfman, Assaf Schuster, Daniel Keren:
Shape sensitive geometric monitoring. 301-310
Isolde Adler:
Tree-width and functional dependencies in databases. 311-320

Last update Fri May 25 08:32:56 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page