ACM SIGMOD/PODS 2005 Conference

Baltimore, Maryland

June 13-16,2005 

PODS Accepted Papers

  • Simulatable Auditing
    Krishnaram Kenthapadi (Stanford University), Nina Mishra (HP Labs/Stanford), Kobbi Nissim (Ben Gurion University)

  • Join-Distinct Aggregate Estimation over Update Streams
    Minos Garofalakis (Bell Labs), Sumit Ganguly (IIT Kanpur), Amit Kumar (IIT Delhi), Rajeev Rastogi (Bell Labs)

  • Peer Data Exchange
    Ariel Fuxman (University of Toronto), Phokion Kolaitis (IBM Almaden Research Center), Renee J. Miller (University of Toronto), Wang-Chiew Tan (University of California at Santa Cruz)

  • Histograms Revisited: When are histograms the best approximation method for aggregates over joins?
    Alin Dobra (University of Florida)

  • On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values
    Christoph Koch (Technical University of Vienna, Austria )

  • A Divide-and-Merge Methodology for Clustering
    David Cheng (MIT), Ravi Kannan (Yale University), Santosh Vempala (MIT), Grant Wang (MIT)

  • Determining Source Contribution in Information Integration Systems
    Alin deutsch (UC San Diego), Yannis Katsis (UC San Diego), Yannis Papakonstantinou (University of California at San Diego, USA )

  • Views and Queries: Determinacy and Rewriting
    Luc Segoufin (INRIA, France ), Victor Vianu (UC San Diego)

  • XPath Satisfiability in the Presence of DTDs
    Michael Benedikt (Bell Labs), Wenfei Fan (Bell Labs), Floris Geerts (university of Edinburgh)

  • An Incremental Algorithm for Computing Ranked Full Disjunctions
    Sara Cohen (Technion - Israel Institute of Technology), Yehoshua Sagiv (The Hebrew University of Jerusalem)

  • Lower Bounds for Sorting with Few Random Accesses to External Memory
    Martin Grohe (Humboldt-Universitaet), Nicole Schweikardt (Humboldt-Universitaet Berlin)

  • Relative Risk and Odds Ratio: A Data Mining Perspective
    Haiquan Li (institute for infocomm research), Jinyan Li (institute for infocomm research), limsoon wong (institute for infocomm research), Mengling Feng (Nanyang Technological University), Yap Peng Tan (Nanyang Technological University)

  • Security Analysis of Cryptographically Controlled Access to XML Documents
    Martin Abadi (University of California, Santa Cruz), Bogdan Warinschi (Computer Science Dept, University of California, Santa Cruz)

  • Multi-Structural Databases
    Ronald Fagin (IBM Almaden Research Center), R Guha (IBM), Ravi Kumar (IBM), Jasmine Novak (IBM), D Sivakumar (IBM), Andrew Tomkins (IBM)

  • Composition of Mappings Given by Embedded Dependencies
    Alan Nash (University of California, San Diego), Phil Bernstein (Microsoft Research), Sergey Melnik (Microsoft Research)

  • Space Efficient Mining of Multigraph Streams
    Graham Cormode (Bell Labs), S. Muthukrishan (Rutgers University)

  • Practical Privacy: The SuLQ Framework
    Avrim Blum (Carnegie Mellon), Cynthia Dwork (Microsoft Research), Frank McSherry (Microsoft Research), Kobbi Nissim (Ben Gurion University)

  • Buffering in Query Evaluation over XML Streams
    Ziv Bar-Yossef (Technion), Marcus Fontoura (IBM Almaden), Vanja Josifovski (IBM Almaden)

  • XML Data Exchange: Consistency and Query Answering
    Marcelo Arenas (U of Toronto), Leonid Libkin (U of Toronto)

  • Deciding Well-Definedness of XQuery Fragments
    Stijn Vansummeren (Limburgs Univsersitair Centrum)

  • On the complexity of division and set joins in the relational algebra
    Dirk Leinders (Limburgs Universitair Centrum), Jan Van den Bussche (Limburgs Universitair Centrum)

  • XML Type Checking with Macro Tree Transducers
    Sebastian Maneth (Ecole Polytechnique Federal de Lausanne), Thomas Perst (Technische Universität München), Alexandru Berlea (TU München), Helmut Seidl (Technische Universität München)

  • Computing Cores for Data Exchange: Hard Cases and Practical Solutions
    Georg Gottlob (TU Wien, Inst f. Informationssysteme)

  • FTW: Fast Similarity Search under the Time Warping Distance
    Yasushi Sakurai (NTT), Masatoshi Yoshikawa (Nagoya University), Christos Faloutsos (Carnegie Mellon University)

  • Allocating Isolation Levels to Transactions
    Alan Fekete (University of Sydney)

  • Operator Placement for In-Network Stream Query Processing
    Utkarsh Srivastava (Stanford University), Kamesh Munagala (Duke University), Jennifer Widom (Stanford University)

  • Estimating arbitrary subset sums with few probes
    Noga Alon (Tel-Aviv University), Nick Duffield (AT&T Labs Research), Carsten Lund (AT&T Labs Research), Mikkel Thorup (AT&T Labs Research)

  • Space Complexity of Hierarchical Heavy Hitters in Multi-Dimensional Data Streams
    Nisheeth Shrivastava (University Of California), John Hershberger (Mentor Graphics Corp), Subhash Suri (University of California, Santa Barbara), Csaba Toth (Massachusetts Institute of Technology)

  • Differential Constraints
    Bassem Sayrafi (Indiana University), Dirk Van Gucht (Indiana University)

  • Diagnosis of Asynchronous Discrete Event Systems - Datalog to the Rescue!
    Serge Abiteboul (INRIA), Zoe Abrams (Stanford University), Stefan Haar (IRISA), Tova Milo (Tel Aviv University)

  • Regular and Unambiguous Rewritings for Active XML
    Serge Abiteboul (INRIA), Tova Milo (Tel Aviv University), Omar Benjelloun (Stanford University)

  • Privacy-Enhancing k-Anonymization of Customer Data
    Sheng Zhong (Stevens Institute of Technology), Zhiqiang Yang (Stevens Institute of Technology), Rebecca Wright (Stevens Institute of Technology)