[DL] ICDT 2003 - Call for participation

[Maurizio Lenzerini]

I C D T 2003
The 9th International Conference on Database Theory
Rettorato dell'Universita' di Siena, 
Siena, Italy, 8-10 January 2003
http://www.dis.uniroma1.it/icdt03


                                CALL FOR PARTICIPATION

The series of ICDT conferences provides a biennial, international
forum for the  communication of research  advances on the principles
of database systems. ICDT is  traditionally held in a historic
European city. ICDT  2003 will be held in Siena,  Italy. Siena is in
Toscana (Tuscany), a region of Italy, and one of the most  important
historical areas of the whole world. The capital of Toscana is Firenze
(Florence), which is only 70 km  away from Siena. The home page of the
conference is at http://www.dis.uniroma1.it/icdt03. 

The International Workshop on Data Quality in Cooperative Information
Systems (see  http://www.dis.uniroma1.it/~dq/dqcis/) will be held in
conjunction with ICDT 2003 (Siena, 10-11 January 2003). 


REGISTRATION OPEN
-----------------

See http://www.consultaumbria.com/icdt2003/ for information about
registration, accomodation, and social program.



INVITED TALKS
-------------

Hector Garcia-Molina, "Open Problems in Peer-to-Peer Systems" 
Yannis Ioannidis, "Approximations in Database Systems" 
Limsoon Wong, "Bioinformatics Adventures in Database Research" 



PRELIMINARY PROGRAM 
-------------------

January 8, 2003

9:00 - 9:15 Welcome
9:15 - 10:15 Session 1
             Invited talk: Limsoon Wong, "Bioinformatics Adventures in
Database Research" 

10:15 - 10:45 Coffee break

10:45 - 12:45 Session 2: Reasoning about XML schemas and queries

              Incremental Validation of XML Documents
              Yannis Papakonstantinou, Victor Vianu

              Typechecking top-down uniform unranked tree transducers
              Wim Martens, Frank Neven

              Structural Properties of XPath Fragments
              Michael Benedikt, Wenfei Fan, Gabriel M. Kuper

              On Reasoning about Structural Equality in XML: A
Description Logic Approach
              David Toman, Grant Weddell


12:45 - 14:30 Lunch break

14:30 - 16:30 Session 3: Aggregate queries

              Containment of Aggregate Queries
              Sara Cohen, Werner Nutt, Yehoshua Sagiv

              Auditing sum queries
              F.M. Malvestuto, M. Mezzini

              CRB-Tree: An Efficient Indexing Scheme for Range
Aggregate Queries
              Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge
 
              Optimal Range Max Datacube for Fixed Dimensions
              Chung Keung Poonv


16:30 - 17:00 Coffee break

17:00 - 18:00 Session 4: Query evaluation

              Processing XML Streams with Deterministic Automata
              Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan Suciu

              Deciding termination of query evaluation in
transitive-closure logics for constraint databases
              Floris Geerts, Bart Kuijpers


January 9, 2003

9:00 - 10:00  Session 5
              Invited talk: Yannis Ioannidis, "Approximations in
Database Systems" 

10:00 - 10:30 Coffee break

10:30 - 12:30 Session 6: Query rewriting and reformulation

              Data Exchange: Semantics and Query Answering
              Ronald Fagin, Phokion G. Kolaitis, Renee J. Miller,
Lucian Popa

              Reformulation of XML Queries and Constraints
              Alin Deutsch, Val Tannen

              New Rewritings and Optimizations for Regular Path
Queries
              Gosta Grahne, Alex Thomo

              Database interrogation using conjunctive queries
              Michal Bielecki, Jan Van den Bussche

12:30 - 14:30 Lunch break

14:30 - 15:30 Session 7: Semi-structured versus structured data

              On the Difficulty of Finding Optimal Relational
Decompositions for XML Workloads: a Complexity 

Theoretic Perspective
              Rajasekar Krishnamurthy, Venkatesan T. Chakaravarthy,
Jeffrey F. Naughton

              Generating Relations from XML Documents
              Sara Cohen, Yaron Kanza, Yehoshua Sagiv

16:00         Social program



January 10, 2003

9:00 - 10:00  Session 8
              Invited talk: Hector Garcia-Molina, "Open Problems in
Peer-to-Peer Systems"  

10:00 - 10:30 Coffee break

10:30 - 12:30 Session 9: Query containment

              Containment for XPath Fragments under DTD Constraints
              Peter T. Wood

              XPath containment in the presence of disjunction, DTDs,
and variables
              Frank Neven, Thomas Schwentick

              Decidable Containment of Recursive Queries
              Diego Calvanese, Giuseppe De Giacomo, Moshe Y. Vardi

              Containment of Conjunctive Queries with Safe Negation
              Fang Wei, Georg Lausen


12:30 - 14:30 Lunch break

14:30 - 16:30 Session 10: Consistency and incompleteness 

              Probabilistic Interval XML
              Edward Hung, Lise Getoor, V. S. Subrahmanian

              Condensed Representation of Database Repairs for
Consistent Query Answering
              Jef Wijsen

              Typing Graph Manipulation Operations
              Jan Hidders

              Characterizing the Temporal and Semantic Coherency of
Broadcast-based Data Dissemination
              Evaggelia Pitoura, Panos K. Chrysanthis, Krithi
Ramamritham


16:30 - 17:00 Coffee break

17:00 - 18:00 Session 11: Data structures

              An Efficient Indexing Scheme for Multi-dimensional
Moving Objects
              Khaled Elbassioni, Amr Elmasry, Ibrahim Kamel

              Nearest Neighbors Can Be Found Efficiently If the
Dimension Is Small Relative to the Input Size
              Michiel Hagedoorn

18:00 - 18:30 Closing session