Welcome to DiSC
Journals
TODS '08/'09
VLDBJ '08/'09
PVLDB '08/'09
Forums
DE Bulletin '08/'09
SIGKDD Explor. '08/'09
SIGIR Forum '08/'09
SIGMOD Record '08/'09
Conferences
ADC '08
ADC '09
APCCM '08
APCCM '09
CIKM '08
CIKM '09
EDBT '08
EDBT '09
GIS '08
GIS '09
Hypertext '08
Hypertext '09
ICDT '09
JCDL '08
JCDL '09
KDD '08
KDD '09
MIR '08
PODS '08
PODS '09
SIGIR '08
SIGIR '09
SIGMOD '08
SIGMOD '09
Symposiums
SBBD '08
SBBD '09
Workshops
DaMoN '08
DaMoN '09
DBTest '08
DBTest '09
DOLAP '08
DOLAP '09
IDAR '08
KEYS '09
MobiDE '08
MobiDE '09
WebDB '08
WIDM '08
WIDM '09
XIME-P '08
Videos
SIGMOD/PODS '08
SIGMOD/PODS '09
|
This DVD contains the proceedings of the
28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
(PODS 2009),
which was held from June 29-July 1, 2009 in Providence, Rhode Island.
You may use the "  PDF"
link to retrieve the paper,
and the other links to find more information on the paper.
|
|
Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, Sathiya Keerthi, Srujana Merugu
A web of concepts 1-12
|
|
|
Bruno Marnette
Generalized schema-mappings: from termination to tractability 13-22
|
|
|
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan
Reverse data exchange: coping with nulls 23-32
|
|
|
Shun'ichi Amano, Leonid Libkin, Filip Murlak
XML schema mappings 33-42
|
|
|
Catriel Beeri, Phokion G. Kolaitis, Christos H. Papadimitriou
The ACM PODS Alberto O. Mendelzon test-of-time-award 2009 43
|
|
|
Georg Gottlob, Stephanie Tien Lee, Gregory Valiant
Size and treewidth bounds for conjunctive queries 45-54
|
|
|
Pawel Parys
XPath evaluation in linear time with polynomial combined complexity 55-64
|
|
|
Leonid Libkin
The finite model theory toolbox of a database theoretician 65-76
|
|
|
Andrea Calì, Georg Gottlob, Thomas Lukasiewicz
A general datalog-based framework for tractable query answering over ontologies 77-86
|
|
|
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
Satisfiability and relevance for queries over active documents 87-96
|
|
|
Wenfei Fan, Floris Geerts
Relative information completeness 97-106
|
|
|
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Suciu
Relationship privacy: output perturbation for queries with joins 107-116
|
|
|
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
An efficient rigorous approach for identifying statistically significant frequent itemsets 117-126
|
|
|
Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii
Similarity caching 127-136
|
|
|
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi
Indexing uncertain data 137-146
|
|
|
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo
Optimal sampling from sliding windows 147-156
|
|
|
Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss
Space-optimal heavy hitters with strong error bounds 157-166
|
|
|
Ke Yi, Qin Zhang
Optimal tracking of distributed heavy hitters and quantiles 167-174
|
|
|
Lars Arge
Worst-case efficient range search indexing: invited tutorial 175-176
|
|
|
Rasmus Pagh, Srinivasa Rao Satti
Secondary indexing in one dimension: beyond b-trees and bitmap indexes 177-186
|
|
|
Ke Yi
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes 187-196
|
|
|
Diego Figueira
Satisfiability of downward XPath with data equality tests 197-206
|
|
|
David DeHaan
Equivalence of nested queries with mixed semantics 207-216
|
|
|
Rada Chirkova, Michael R. Genesereth
Equivalence of SQL queries in presence of embedded dependencies 217-226
|
|
|
Sara Cohen, Benny Kimelfeld, Yehoshua Sagiv
Running tree automata on probabilistic XML 227-236
|
|
|
Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo
XML with incomplete information: models, properties, and query answering 237-246
|
|
|
Serge Abiteboul, Georg Gottlob, Marco Manna
Distributed XML design 247-258
|
|
|
Jian Li, Amol Deshpande
Consensus answers for queries over probabilistic databases 259-268
|
|
|
Sudipto Guha, Kamesh Munagala
Exceeding expectations and clustering uncertain data 269-278
|
|
|
Mikhail J. Atallah, Yinian Qi
Computing all skyline probabilities for uncertain data 279-287
|
Copyright ©2010 Association for Computing Machinery
|