ACM SIGMOD Vancouver, Canada, 2008
sigmod pods logo
top banner

Final Program

For Delegates


ACM SIGMOD/PODS Conference: Vancouver, 2008
Program: PODS Accepted Papers

Here is the list of accepted papers for PODS 2008 (in random order).


  • On the Complexity of Deriving Schema Mappings from Database Instances
    Pierre Senellart and Georg Gottlob
  • The power of two min-hashes in similarity search among hierarchical data objects
    Sreenivas Gollapudi and Rina Panigrahy
  • Estimating PageRank on Graph Streams
    Atish Das Sarma, Sreenivas Gollapudi and Rina Panigrahy
  • Answering Aggregate Queries in Data Exchange
    Foto Afrati and Phokion Kolaitis
  • XPath evaluation in linear time
    Mikolaj Bojanczyk and Pawel Parys
  • Towards a Theory of Schema-Mapping Optimization
    Ronald Fagin, Phokion Kolaitis, Alan Nash and Lucian Popa
  • Near-Optimal Dynamic Replication in Unstructured Peer-to-Peer Networks
    Mauro Sozio, Thomas Neumann and Gerhard Weikum
  • Epistemic Privacy
    Alexandre Evfimievski, Ronald Fagin and David Woodruff
  • The Chase Revisited
    Alin Deutsch, Alan Nash and Jeff Remmel
  • Static Analysis of Active XML Services
    Serge Abiteboul, Luc Segoufin and Victor Vianu
  • Evaluating Rank Joins with Optimal Cost
    Karl Schnaitter and Neoklis Polyzotis
  • A Generic Flow Algorithm for Shared Filter Ordering Problems
    Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan and Hao Yang
  • Incorporating Constraints in Probabilistic XML
    Sara Cohen, Benny Kimelfeld and Yehoshua Sagiv
  • Shape Sensitive Geometric Monitoring
    Izchack Sharfman, Assaf Schuster and Daniel Keren
  • Query Evaluation with Soft-Key Constraints
    Abhay Jha, Vibhor Rastogi and Dan Suciu
  • On Searching Compressed String Collections Cache-Obliviously
    Paolo Ferragina, Roberto Grossi, Rahul Shah, Ankur Gupta and Jeffrey Scott Vitter
  • Data Exchange and Schema Mappings in Open and Closed Worlds
    Leonid Libkin and Cristina Sirangelo
  • Tree-width and functional dependencies in databases
    Isolde Adler
  • XPath, transitive closure logic, and nested tree walking automata
    Balder ten Cate and Luc Segoufin
  • Approximation Algorithms for Clustering Uncertain Data
    Graham Cormode and Andrew McGregor
  • Complexity and Composition of Synthesized Web Services
    Wenfei Fan, Floris Geerts, Wouter Gelade, Frank Neven and Antonella Poggi
  • Local Hoare Reasoning about DOM
    Philippa Gardner, Gareth Smith, Mark Wheelhouse and Uri Zarfaty
  • Type inference for Datalog, and its application to query optimisation
    Oege de Moor, Damien Sereni, Pavel Avgustinov and Mathieu Verbaere
  • The Recovery of a Schema Mapping: Bringing Exchanged Data Back
    Marcelo Arenas, Jorge Perez and Cristian Riveros
  • Annotated XML: Queries and Provenance
    J. Nathan Foster, Todd Green and Val Tannen
  • Time-Decaying Aggregates in Out-of-order Streams
    Graham Cormode, Philip Korn and Srikanta Tirthapura
  • Approximation Algorithms for Co-Clustering Problems
    Aris Anagnostopoulos, Anirban Dasgupta and Ravi Kumar
  • Linking Uncertainty and Unreliability and Approximating Expressive Queries on Probabilistic Databases
    Christoph Koch
website design by linda fenton malloy