30. PODS 2011: Athens, Greece

Maurizio Lenzerini, Thomas Schwentick (Eds.): Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece. ACM 2011, ISBN 978-1-4503-0660-7

Keynote address

Daniel Deutch, Tova Milo:
A quest for beauty and wealth (or, business processes for database researchers). 1-12

Streaming & sampling

Edith Cohen, Haim Kaplan:
Get the most out of your sample: optimal unbiased estimators using partial information. 13-24
Cheng Sheng, Yufei Tao:
FIFO indexes for decomposable problems. 25-35
Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright:
Pan-private algorithms via statistics on sketches. 37-48
Hossein Jowhari, Mert Saglam, Gábor Tardos:
Tight bounds for Lp samplers, finding duplicates in streams, and related problems. 49-58

Incomplete information & awards

Leonid Libkin:
Incomplete information and certain answers in general data models. 59-70
Wenfei Fan, Floris Geerts, Jef Wijsen:
Determining the currency of data. 71-82
Marcelo Arenas, Jorge Pérez, Juan L. Reutter:
Data exchange beyond complete data. 83-94

Index structures & external memory

Alessio Orlandi, Rossano Venturini:
Space-efficient substring occurrence estimation. 95-106
Cheng Sheng, Yufei Tao:
On finding skylines in external memory. 107-116
Zhewei Wei, Ke Yi:
Beyond simple aggregates: indexing for summary queries. 117-128
Cheng Sheng, Yufei Tao:
New results on two-dimensional orthogonal range aggregation in external memory. 129-139

Provenance

Yael Amsterdamer, Daniel Deutch, Tova Milo, Val Tannen:
On provenance minimization. 141-152
Yael Amsterdamer, Daniel Deutch, Val Tannen:
Provenance for aggregate queries. 153-164
Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton:
On the complexity of privacy-preserving complex event processing. 165-174
Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debmalya Panigrahi, Sudeepa Roy:
Provenance views for module privacy. 175-186

Queries & views

Benny Kimelfeld, Jan Vondrák, Ryan Williams:
Maximizing conjunctive views in deletion propagation. 187-198
Pablo Barceló, Leonid Libkin, Juan L. Reutter:
Querying graph patterns. 199-210
Michael Benedikt, Georg Gottlob, Pierre Senellart:
Determining relevance of accesses at runtime. 211-222
Paraschos Koutris, Dan Suciu:
Parallel evaluation of conjunctive queries. 223-234

Semistructured data & XML

Benny Kimelfeld, Yehoshua Sagiv:
Finding a minimal tree pattern under neighborhood constraints. 235-246
Timos Antonopoulos, Wim Martens, Frank Neven:
The complexity of text-preserving XML transformations. 247-258
Mikolaj Bojanczyk, Diego Figueira:
Efficient evaluation for a temporal logic on changing XML documents. 259-270

Rule-based query languages

Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan:
Rewrite rules for search database systems. 271-282
Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. 283-292
Serge Abiteboul, Meghyn Bienvenu, Alban Galland, Emilien Antoine:
A rule-based language for web data management. 293-304

Tutorial 1

Marcelo Arenas, Jorge Pérez:
Querying semantic web data with SPARQL. 305-316

Tutorial 2

S. Muthukrishnan:
Theory of data stream computing: where to go. 317-319

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