Abstract is missing.
- A web of conceptsNilesh N. Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, Sathiya Keerthi, Srujana Merugu. 1-12 [doi]
- Generalized schema-mappings: from termination to tractabilityBruno Marnette. 13-22 [doi]
- Reverse data exchange: coping with nullsRonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. 23-32 [doi]
- XML schema mappingsShun ichi Amano, Leonid Libkin, Filip Murlak. 33-42 [doi]
- The ACM PODS Alberto O. Mendelzon test-of-time-award 2009Catriel Beeri, Phokion G. Kolaitis, Christos H. Papadimitriou. 43 [doi]
- Size and treewidth bounds for conjunctive queriesGeorg Gottlob, Stephanie Tien Lee, Gregory Valiant. 45-54 [doi]
- XPath evaluation in linear time with polynomial combined complexityPawel Parys. 55-64 [doi]
- The finite model theory toolbox of a database theoreticianLeonid Libkin. 65-76 [doi]
- A general datalog-based framework for tractable query answering over ontologiesAndrea Calì, Georg Gottlob, Thomas Lukasiewicz. 77-86 [doi]
- Satisfiability and relevance for queries over active documentsSerge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. 87-96 [doi]
- Relative information completenessWenfei Fan, Floris Geerts. 97-106 [doi]
- Relationship privacy: output perturbation for queries with joinsVibhor Rastogi, Michael Hay, Gerome Miklau, Dan Suciu. 107-116 [doi]
- An efficient rigorous approach for identifying statistically significant frequent itemsetsAdam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin. 117-126 [doi]
- Similarity cachingFlavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii. 127-136 [doi]
- Indexing uncertain dataPankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi. 137-146 [doi]
- Optimal sampling from sliding windowsVladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo. 147-156 [doi]
- Space-optimal heavy hitters with strong error boundsRadu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss. 157-166 [doi]
- Optimal tracking of distributed heavy hitters and quantilesKe Yi, Qin Zhang. 167-174 [doi]
- Worst-case efficient range search indexing: invited tutorialLars Arge. 175-176 [doi]
- Secondary indexing in one dimension: beyond b-trees and bitmap indexesRasmus Pagh, Srinivasa Rao Satti. 177-186 [doi]
- Dynamic indexability and lower bounds for dynamic one-dimensional range query indexesKe Yi. 187-196 [doi]
- Satisfiability of downward XPath with data equality testsDiego Figueira. 197-206 [doi]
- Equivalence of nested queries with mixed semanticsDavid DeHaan. 207-216 [doi]
- Equivalence of SQL queries in presence of embedded dependenciesRada Chirkova, Michael R. Genesereth. 217-226 [doi]
- Running tree automata on probabilistic XMLSara Cohen, Benny Kimelfeld, Yehoshua Sagiv. 227-236 [doi]
- XML with incomplete information: models, properties, and query answeringPablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo. 237-246 [doi]
- Distributed XML designSerge Abiteboul, Georg Gottlob, Marco Manna. 247-258 [doi]
- Consensus answers for queries over probabilistic databasesJian Li, Amol Deshpande. 259-268 [doi]
- Exceeding expectations and clustering uncertain dataSudipto Guha, Kamesh Munagala. 269-278 [doi]
- Computing all skyline probabilities for uncertain dataMikhail J. Atallah, Yinian Qi. 279-287 [doi]