ACM SIGMOD ONLINE
ACM SIGMOD Online
ACM
Search SIGMOD Join SIGMOD Feedback What's New Home
Welcome
SIGMOD Call For Papers
PODS Call For Papers
SIGMOD Program
PODS Program
Registration
Organization
Venue Information
Related Links

PODS 2002 - At a glance:

 

Monday

9:00-10:30

    PODS Opening / Invited Talk 1 (Lecture Hall)
       Models and Issues in Data Stream Systems.
                Rajeev Motwani (joint work with Brian Babcock,
                Shivnath Babu, Mayur Datar, Jennifer Widom - Stanford
                University)


10:30-11:00 Coffee Break
11:00-12:00

    Research 1:  Award Winnning Papers (Lecture Hall)
        Best Paper
                Monadic Datalog over Trees and the Expressive Power of Languages
                for Web Information Extraction.  Georg Gottlob and Christoph Koch (TU Wien)

 

        Best Newcomer Paper
                From Discrepancy to Declustering: Near optimal multidimensional
                declustering strategies for range queries.  Chung-Min Chen (Telcordia) and Christine T. Cheng (IMA, University
                of Minnesota)


12:00-13:30 Lunch (on our own)
13:30-15:00

    Invited Tutorial 1 (Lecture Hall)
        Algorithmics and Applications of Tree and Graph Searching.
                Dennis Shasha (joint work with Rosalba Giugno and
                Jason T-L Wang - New York University)
                (Tutorial Slides)

15:00-15:30 Coffee Break
15:30-17:00

    Research 2:  Information Processing on WWW and XML (Lecture Hall)
        Validating Streaming XML Documents.
                Luc Segoufin (INRIA - Rocquencourt) and Victor Vianu (UC San Diego)

       Containment and Equivalence for an XPath Fragment.
                Gerome Miklau and Dan Suciu (University of Washington)

       On the Power of Walking for Querying Tree-Structured Data.
                Frank Neven (University of Limburg)

17:00-17:15 Short refreshments break
17:15-18:15

    Research 3:  Information Processing on WWW and XML (continued) (Lecture Hall)
        A Normal Form for XML Documents.
                Marcelo Arenas and Leonid Libkin (University of Toronto)

       Distributed Computation of Web Queries Using Automata.
                Marc Spielmann (University of Limburg), Jerzy Tyszkiewicz (University
                of Warsaw), and Jan Van den Bussche (University of Limburg)


21:00- PODS Business Meeting

Tuesday

9:00-10:30 SIGMOD Opening, SIGMOD/PODS Plenary Address
10:30-11:00 Coffee Break

11:00-12:30

    Research 4:  Query Processing and Optimization I (Hall of Ideas EFG)
        Conjunctive Selection Conditions in Main Memory.
                Kenneth A. Ross (Columbia University)

        Efficient Aggregation over Objects with Extent.
                Donghui Zhang, Vassilis J. Tsotras, and Dimitrios Gunopulos (UC Riverside)

      How to Evaluate Multiple Range-Sum Queries Progressively.
                Rolfe R. Schmidt and Cyrus Shahabi (University of Southern California)

12:30-14:00 Lunch (catered)
14:00-15:30

    Research 5:  Views and Warehousing (Hall of Ideas EFG)
        On the Computation of Relational View Complements.
                Jens Lechtenboerger and Gottfried Vossen (University of Muenster)

       On Propagation of Deletions and Annotations Through Views.
                Peter Buneman (University of Edinburgh and University of Pennsylvania),
                Sanjeev Khanna (University of Pennsylvania)
                and Wang-Chiew Tan (University of Pennsylvania).


       The View Selection Problem Has an Exponential-Time Lower Bound
       for Conjunctive Queries and Views.

                Rada Chirkova (Stanford University)

15:30-16:00 Coffee Break
16:00-17:30

    Research 6:  OLAP & Constraints (Hall of Ideas EFG)
        OLAP Dimension Constraints.
                Carlos A. Hurtado and Alberto O. Mendelzon (University of Toronto)

      Fast Algorithms For Hierarchical Range Histogram Construction.
                Sudipto Guha (University of Pennsylvania), Nick Koudas (AT&T Research
                Labs), and Divesh Srivastava (AT&T Research Labs)


      On Moving Objects Queries.
                Hoda Mokhtar, Oscar Ibarra, and Jianwen Su (UC Santa Barbara)

18:00 SIGMOD Business Meeting
19:00 Reception


Wednesday

8:30-10:00

    Research 7:  Queries and Views (Hall of Ideas EFG)
        Knowledge Compilation = Query Rewriting + View Synthesis.
                Marco Cadoli and Toni Mancini (University of Rome "La Sapienza")

      Answering Queries Using Views with Arithmetic Comparisons.
                Foto Afrati (National Technical University of Athens),
                Chen Li (UC Irvine), and Prasenjit Mitra (Stanford University)


        Characterizing Memory Requirements for Queries over Continuous Data
       Streams.

                Arvind Arasu, Brian Babcock, Shivnath Babu, Jon McAlister,
                and Jennifer Widom (Stanford University)


10:00-10:30 Coffee Break

10:30-12:00

    Invited Tutorial 2 (Lecture Hall)

      Data Integration: A Theoretical Perspective
                Maurizio Lenzerini (University of Rome "La Sapienza")

12:00-13:30 Lunch (catered)
13:30-14:30 SIGMOD Awards and SIGMOD Best Paper presentation
14:30-15:00 Coffee Break
15:00-16:30

    Research 8:  Semistructured Data and XML (Hall of Ideas EFG)
       Lossless Regular Path Views.
                Diego Calvanese (University of Rome "La Sapienza"),
                Giuseppe De Giacomo (University of Rome "La Sapienza"),
                Maurizio Lenzerini (University of Rome "La Sapienza"), and
                Moshe Y. Vardi (Rice University)

 

      On Verifying Consistency of XML Specifications.
                Marcelo Arenas (University of Toronto), Wenfei Fan (Bell Laboratories),
                and Leonid Libkin (University of Toronto)


      Labeling Dynamic XML Trees.
                Edith Cohen (AT&T Labs-Research), Haim Kaplan (Tel Aviv University),
                and Tova Milo (INRIA and Tel-Aviv University}


16:30-16:45 Short refreshments break
16:45-17:45

    Research 9:  Query Processing and Optimization II (Hall of Ideas EFG)
      On the Complexity of (Approximate) Query Optimization.
                Sourav Chatterji (UC Berkeley), Sai Surya Kiran Evani (Sun Microsystems),
                Sumit Ganguly (Bell Laboratories), and Mahesh Datt Yemmanaru (Sun
                Microsystems)


      Least Expected Cost Query Optimization: What Can We Expect?
                Francis Chu, Joseph Halpern, and Johannes Gehrke (Cornell University)

19:00-20:00 Reception
20:00 Banquet


 

Top of Page