Abstract is missing.
- Management of probabilistic data: foundations and challengesNilesh N. Dalvi, Dan Suciu. 1-12 [doi]
- Generalized hypertree decompositions: np-hardness and tractable variantsGeorg Gottlob, Zoltán Miklós, Thomas Schwentick. 13-22 [doi]
- Queries determined by views: pack your viewsMaarten Marx. 23-30 [doi]
- Provenance semiringsTodd J. Green, Gregory Karvounarakis, Val Tannen. 31-40 [doi]
- Machine models and lower bounds for query processingNicole Schweikardt. 41-52 [doi]
- Decision trees for entity identification: approximation algorithms and hardness resultsVenkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania. 53-62 [doi]
- XML transformation by tree-walking transducers with invisible pebblesJoost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel. 63-72 [doi]
- The complexity of query containment in expressive fragments of XPath 2.0Balder ten Cate, Carsten Lutz. 73-82 [doi]
- Expressiveness and complexity of xml publishing transducersWenfei Fan, Floris Geerts, Frank Neven. 83-92 [doi]
- Maintaining bernoulli samples over evolving multisetsRainer Gemulla, Wolfgang Lehner, Peter J. Haas. 93-102 [doi]
- Finding near neighbors through cluster pruningFlavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal. 103-112 [doi]
- CWA-solutions for data exchange settings with target dependenciesAndré Hernich, Nicole Schweikardt. 113-122 [doi]
- Quasi-inverses of schema mappingsRonald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. 123-132 [doi]
- On reconciling data exchange, data integration, and peer data managementGiuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati. 133-142 [doi]
- A crash course on database queriesJan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren. 143-154 [doi]
- The complexity of reasoning about pattern-based XML schemasGjergji Kasneci, Thomas Schwentick. 155-164 [doi]
- Monadic datalog over finite structures with bounded treewidthGeorg Gottlob, Reinhard Pichler, Fang Wei. 165-174 [doi]
- Index-based multidimensional array queries: safety and equivalenceRona Machlin. 175-184 [doi]
- Non-linear prefixes in query languagesAntonio Badia, Stijn Vansummeren. 185-194 [doi]
- Reasoning about XML update constraintsBogdan Cautis, Serge Abiteboul, Tova Milo. 195-204 [doi]
- Polynomial time fragments of XPath with variablesEmmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison. 205-214 [doi]
- Optimization of continuous queries with shared expensive filtersKamesh Munagala, Utkarsh Srivastava, Jennifer Widom. 215-224 [doi]
- Variance estimation over sliding windowsLinfeng Zhang, Yong Guan. 225-232 [doi]
- Marrying words and treesRajeev Alur. 233-242 [doi]
- Estimating statistical aggregates on probabilistic data streamsT. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee. 243-252 [doi]
- Sketching unaggregated data streams for subpopulation-size queriesEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. 253-262 [doi]
- What is next in event processing?Walker M. White, Mirek Riedewald, Johannes Gehrke, Alan J. Demers. 263-272 [doi]
- Privacy, accuracy, and consistency too: a holistic solution to contingency table releaseBoaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar. 273-282 [doi]
- On the complexity of managing probabilistic XML dataPierre Senellart, Serge Abiteboul. 283-292 [doi]
- The dichotomy of conjunctive queries on probabilistic structuresNilesh N. Dalvi, Dan Suciu. 293-302 [doi]
- Maximally joining probabilistic dataBenny Kimelfeld, Yehoshua Sagiv. 303-312 [doi]