29. PODS 2010: Indianapolis, Indiana, USA

Jan Paredaens, Dirk Van Gucht (Eds.): Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6-11, 2010, Indianapolis, Indiana, USA. ACM 2010, ISBN 978-1-4503-0033-9

Opening and keynote

Joseph M. Hellerstein:
Datalog redux: experience and conjecture. 1-2

Query languages

Pablo Barceló, Carlos A. Hurtado, Leonid Libkin, Peter T. Wood:
Expressive languages for path queries over graph-structured data. 3-14
Benny Kimelfeld, Christopher Ré:
Transducing Markov sequences. 15-26
Michael Benedikt, Gabriele Puppis, Huy Vu:
Positive higher-order queries. 27-38

Awards

Jianwen Su, Phokion G. Kolaitis:
The ACM PODS Alberto O. Mendelzon test-of-time-award 2010. 39-40
Daniel M. Kane, Jelani Nelson, David P. Woodruff:
An optimal algorithm for the distinct elements problem. 41-52
Christopher Ré, Dan Suciu:
Understanding cardinality estimation using entropy maximization. 53-64

Tutorial 1

Gerhard Weikum, Martin Theobald:
From information to knowledge: harvesting entities and relationships from web sources. 65-76

Streams and query processing

Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang:
Optimal sampling from distributed streams. 77-86
Christoph Koch:
Incremental query evaluation in a ring of databases. 87-98
Jelani Nelson, David P. Woodruff:
Fast Manhattan sketches in data streams. 99-110
Michael Meier, Michael Schmidt, Fang Wei, Georg Lausen:
Semantic query optimization in the presence of types. 111-122

Privacy

Chao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau, Andrew McGregor:
Optimizing linear counting queries under differential privacy. 123-134
Mangesh Gupte, Mukund Sundararajan:
Universally optimal privacy mechanisms for minimax agents. 135-146
Daniel Kifer, Bing-Rong Lin:
Towards an axiomatization of statistical privacy and utility. 147-158

Tutorial 2

T. S. Jayram:
Information complexity: a tutorial. 159-168
Wenfei Fan, Floris Geerts:
Capturing missing tuples and missing values. 169-178

Uncertainty in databases

Jef Wijsen:
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. 179-190
Claire David, Leonid Libkin, Filip Murlak:
Certain answers for XML queries. 191-202
Nilesh N. Dalvi, Karl Schnaitter, Dan Suciu:
Computing query probability with incidence algebras. 203-214
Daniel Deutch, Christoph Koch, Tova Milo:
On probabilistic fixpoint and Markov chain query languages. 215-226

Schema mappings and design

Marcelo Arenas, Jorge Pérez, Juan L. Reutter, Cristian Riveros:
Foundations of schema mapping management. 227-238
Wim Martens, Matthias Niewerth, Thomas Schwentick:
Schema design for XML repositories: complexity and tractability. 239-250
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven:
Simplifying XML schema: single-type approximations of regular tree languages. 251-260

Query learning

Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan:
Characterizing schema mappings via data examples. 261-272
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan:
Understanding queries in a search database system. 273-284
Aurélien Lemay, Sebastian Maneth, Joachim Niehren:
A learning algorithm for top-down XML transformations. 285-296

Constraints & indexing

Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang:
Cache-oblivious hashing. 297-304
Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul:
Performance guarantees for B-trees with different-sized atomic keys. 305-316
Sven Hartmann, Sebastian Link:
When data dependencies over SQL tables meet the logics of paradox and S-3. 317-326
Gianluigi Greco, Francesco Scarcello:
The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability. 327-338

Last update Wed May 22 16:21:08 2013 CET by the DBLP Team —

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