topleft.jpg (5500 bytes) topline.gif (300 bytes)
logo2_small.jpg (1813 bytes) banner_sstd.gif (2051 bytes)
Authors are invited to submit electronically original research contributions or experience reports in English. Papers should be no longer than twenty pages, 1.5 spaced, in no smaller than 10 point font with 1 inch margins (left, right, top, bottom.) The program committee may reject papers that exceed this length on the grounds of length alone.

Submitted papers will be refereed by at least three reviewers for quality, correctness, originality, and relevance. Notification and reviews will be communicated via email. Accepted papers will be presented at the conference and included in the proceedings, which will be published by Springer-Verlag as part of the Lecture Notes in Computer Science series .

Proposals for panels that examine emerging, innovative, or otherwise provocative issues within the conference area are encouraged as well. Panel proposals should include a 1-2 page summary of the topic and the names and affiliations of 3-4 panelists who have made a commitment to participate. A mix of industry and academic panel members is recommended.

Proposals for 90-minute tutorials are also invited on topics within the conference area. Tutorial proposals must be at most 5 pages, they must identify the intended audience, and they must give enough material to provide a sense of what will be covered.

A fully electronic review process is being planned. Technical papers and panel and tutorial proposals should be submitted electronically in postscript or pdf format by Monday, February 19, 2001. Abstracts of technical papers are due on February 12, 2001.

NOTE:The deadline for abstract submission is over. If you have submitted an abstract please use the returned URL to submit your paper by Feb.19th. Thank you for your interest in SSTD 2001.

Accepted Papers

1. A Spatiotemporal Query Language for Moving Point Contexts

M. Vazirgiannis, O. Wolfson

2. A model-based, open architecture for mobile, spatially-aware applications

Daniela Nicklas, Matthias Großmann, Thomas Schwarz, Steffen Volz, Bernhard Mitschang

3. Calendars, Time Granularities, and Automata

Ugo Dal Lago, Angelo Montanari 

4. Composing Cardinal Direction Relations

Spiros Skiadopoulos, Manolis Koubarakis

5. Compressing Multiresolution Triangle Meshes

Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo

6. Constrained Nearest Neighbor Queries

Hakan Ferhatosmanoglu, Ioana Stanoi, Divyakant Agrawal, Amr El Abbadi

7. Creating Representations for Continuously Moving Regions from Observations

Erlend Tossebro, Ralf Hartmut Gueting

8. Design and Implementation of Multi-Scale Spatial Databases

Sheng Zhou, Christopher B. Jones 

9. Discovering Spatial Co-location Patterns: A Summary of Results

Shashi Shekhar, Yan Huang

10. Efficient Mining of Spatiotemporal Patterns

Dimitrios Gunopulos, Ilias Tsoukatos

11. Efficient OLAP operations in spatial data warehouses

Dimitris Papadias, Panos Kalnis, Jun Zhang , Yufei Tao 

12. Efficient Techniques for Spatial Query Processing

Ravi Kothuri, Siva Ravada

13. Evaluation of Buffer Queries in Spatial Databases

Edward P.F. Chan

14. Interval Sequences: An Object-Relational Approach to Manage Spatial Data

Hans-Peter Kriegel, Marco Pötke, Thomas Seidl

15. K-Nearest Neighbor Search for Moving Query Points

Zhexuan Song, Nick Roussopoulos

16. Moving Objects: Logical Relationships and Queriess

Jianwen Su, Haiyan Xu, Oscar H. Ibarra

17. Object-Relational Indexing for General Interval Relationshipss

Hans-Peter Kriegel, Marco Pötke, Thomas Seidl

18. On Multi-Way Spatial Joins with Direction Predicatess

Hongjun Zhu, Jianwen Su, Oscar H. Ibarra

19. Pre-Aggregation In Spatial Data Warehousess

Torben Bach Pedersen, Nectaria Tryfona

20. Query Processing in Broadcasted Spatial Index Treess

Walid G. Aref, Susanne Hambrusch, Chuan-Ming Liu, Sunil Prabhakar 

21. Querying Mobile Objects in Spatio-Temporal Databasess

Kriengkrai Porkaew, Iosif Lazaridis, Sharad Mehrotra

22. Selectivity Estimation of Complex Spatial Queriess

Nikos Mamoulis, Dimitris Papadias

23. Semantic Caching in Location-Dependent Query Processings

Baihua Zheng, Dik Lun Lee

24. Similarity Retrieval Based on Cardinal Directionss

Roop K. Goyal, Max J. Egenhofer

25. The Architecture of ArcIMS, a Distributed Internet Map Server

Russell East, Roop Goyal, Art Haddad, Alexander Konovalov, Andrea Rosso, Mike Tait and Jay Theodore

26. The Continuous Update Query within an Architecture for Querying
XML-Represented Moving Objects

Thomas Brinkhoff, Jürgen Weitkämper 

27. Wavelet-Based Cost Estimation for Spatial Queries

Min Wang, Jeff Vitter, Lipyeow Lim, Sriram Padmanaban