26. PODS 2007: Beijing, China

• Nilesh N. Dalvi, Dan Suciu:
  Management of probabilistic data: foundations and challenges. 1-12
  

Query processing and rewriting

• Georg Gottlob, Zoltán Miklós, Thomas Schwentick:
  Generalized hypertree decompositions: np-hardness and tractable variants. 13-22
  
• Maarten Marx:
  Queries determined by views: pack your views. 23-30
  
• Todd J. Green, Gregory Karvounarakis, Val Tannen:
  Provenance semirings. 31-40
  

Machine models and data structures

• Nicole Schweikardt:
  Machine models and lower bounds for query processing. 41-52
  
• Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, Mukesh K. Mohania:
  Decision trees for entity identification: approximation algorithms and hardness results. 53-62
  

XML 1

• Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel:
  XML transformation by tree-walking transducers with invisible pebbles. 63-72
  
• Balder ten Cate, Carsten Lutz:
  The complexity of query containment in expressive fragments of XPath 2.0. 73-82
  
• Wenfei Fan, Floris Geerts, Frank Neven:
  Expressiveness and complexity of xml publishing transducers. 83-92
  

Randomization

• Rainer Gemulla, Wolfgang Lehner, Peter J. Haas:
  Maintaining bernoulli samples over evolving multisets. 93-102
  
• Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal:
  Finding near neighbors through cluster pruning. 103-112
  

Data exchange and schema mappings

• André Hernich, Nicole Schweikardt:
  CWA-solutions for data exchange settings with target dependencies. 113-122
  
• Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan:
  Quasi-inverses of schema mappings. 123-132
  
• Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati:
  On reconciling data exchange, data integration, and peer data management. 133-142
  

Types and chemas

• Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
  A crash course on database queries. 143-154
  
• Gjergji Kasneci, Thomas Schwentick:
  The complexity of reasoning about pattern-based XML schemas. 155-164
  

Query languages

• Georg Gottlob, Reinhard Pichler, Fang Wei:
  Monadic datalog over finite structures with bounded treewidth. 165-174
  
• Rona Machlin:
  Index-based multidimensional array queries: safety and equivalence. 175-184
  
• Antonio Badia, Stijn Vansummeren:
  Non-linear prefixes in query languages. 185-194
  

XML 2

• Bogdan Cautis, Serge Abiteboul, Tova Milo:
  Reasoning about XML update constraints. 195-204
  
• Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison:
  Polynomial time fragments of XPath with variables. 205-214
  

Data streams

• Kamesh Munagala, Utkarsh Srivastava, Jennifer Widom:
  Optimization of continuous queries with shared expensive filters. 215-224
  
• Linfeng Zhang, Yong Guan:
  Variance estimation over sliding windows. 225-232
  

Sequences, streams, events

• Rajeev Alur:
  Marrying words and trees. 233-242
  
• T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee:
  Estimating statistical aggregates on probabilistic data streams. 243-252
  
• Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
  Sketching unaggregated data streams for subpopulation-size queries. 253-262
  
• Walker M. White, Mirek Riedewald, Johannes Gehrke, Alan J. Demers:
  What is "next" in event processing? 263-272
  

Privacy, probabilistic databases

• Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar:
  Privacy, accuracy, and consistency too: a holistic solution to contingency table release. 273-282
  
• Pierre Senellart, Serge Abiteboul:
  On the complexity of managing probabilistic XML data. 283-292
  
• Nilesh N. Dalvi, Dan Suciu:
  The dichotomy of conjunctive queries on probabilistic structures. 293-302
  
• Benny Kimelfeld, Yehoshua Sagiv:
  Maximally joining probabilistic data. 303-312