CSCI 599 Fall 2000 - Readings List

---

Notation

• S: paper in spatial db

• T: paper in temporal db

• M: paper in Moving Object db

• O: paper related to OLAP

Introduction

• [S1] Ralf Hartmut Guting. An Introduction to Spatial Database Systems . VLDB Journal 3(4): 357-399, 1994.

• [S2] Claudia Bauzer Medeiros and Fatima Pires. Databases for GIS . SIGMOD Record 23(1): 107-115, 1994.

• [T1] Christian S. Jensen et. al,. The Consensus Glossary of Temporal Database Concepts - February 1998 Version . Temporal Databases, Dagstuhl, pp.367-405, 1997.

• [T2] Christian S. Jensen. Introduction to Temporal Database Research .Temporal Database Management, 2000.

• [M1]A. Prasad Sistla,Ouri Wolfson,Sam Chamberlain,Son Dao. Modelling and Querying Moving Objects .ICDE'1997

• [M2]Ouri Wolfson,Sam Chamberlain,Liqin Jiang Moving Objects Databases: Issues and Solutions . Statistical and Scientific Database Management'1998

• [M3]Luca Forlizzi, Ralf Hartmut Güting, Enrico Nardelli & Markus Schneider A Data Model and Data Structures for Moving Objects Databases .ACM SIGMOD Int. Conf. on Management of Data, 319-330, 2000.

Data Structures and Query Processing

• [S3] R.H. Güting and M. Schneider. Realm-Based Spatial Data Types: The ROSE Algebra . VLDB Journal 4, pp.100-143, 1995.

• [S4] Hanan Samet. Spatial Data Structures. Modern Database Systems , pp.361-385, 1995.

• [S6] Russell East, Roop Goyal, Art Haddad, Alexander Konovalov, Andrea Rosso, Mike Tait, and Jay Theodore. The Architecture of ArcIMS, a Distributed Internet Map Server. SSTD'2001

• [M4] Michalis Vazirgiannis and Ouri Wolfson. A Spatiotemporal Model and Language for Moving Objects on Road Networks. SSTD'2001

• [M6] Kriengkrai Porkaew, Iosif Lazaridis, and Sharad Mehrotra. Querying Mobile Objects in Spatio-Temporal Databases. SSTD'2001

• [M7] Zhexuan Song and Nick Roussopoulos. K-Nearest Neighbor Search for Moving Query Point. SSTD'2001

• [M8] Ravi Kanth Kothuri and Siva Ravada. Efficient Processing of Large Spatial Queries Using Interior Approximations. SSTD'2001

Indexing

• [S5] Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider and Bernhard Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles SIGMOD Conference pp.322-331, 1990.

• [M5] George Kollios, Dimitrios Gunopulos, Vassilis J. Tsotras On Indexing Mobile Objects . PODS'1999

• [T7] Hans-Peter Kriegel, Marco Pötke, and Thomas Seidl Object-Relational Indexing for General Interval Relationships. SSTD'2001

• [S7] Hans-Peter Kriegel, Marco Pötke, and Thomas Seidl Interval Sequences: An Object-Relational Approach to Manage Spatial Data. SSTD'2001

Data Warehousing and Minning

• [T3] Rakesh Agrawal, Christos Faloutsos and Arun N. Swami. Efficient Similarity Search In Sequence Databases . FODO , 69-84, 1993.

• [T4] Kin-pong Chan and Ada Wai-Chee Fu. Efficient Time Series Matching by Wavelets . ICDE, pp.126-133, 1999.

• [T5] Flip Korn, H. V. Jagadish and Christos Faloutsos. Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences . SIGMOD Conference, pp.289-300, 1997.

• [T6] K.V. Ravi Kanth, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh Dimensionality Reduction for Similarity Searching in Dynamic Databases . CIVU'1998

• [M9] Ilias Tsoukatos and Dimitrios Gunopulos Efficient Mining of Spatiotemporal Patterns. SSTD'2001

• [O1] Ching-Tien Ho Rakesh Agrawal Nimrod Megiddo Ramakrishnan Srikant Range Queries in OLAP Data Cubes (1997) . SIGMOD 1997

• [O2] S. Geffner D. Agrawal A. El Abbadi The Dynamic Data Cube . EDBT'2000

• [O3] Mirek Riedewald, Divyakant Agrawal, and Amr El Abbadi Flexible Data Cubes for Online Aggregation . ICDT'2001

• [O4] J. Shanmugasundaram, U. Fayyad, and P. Bradley. Compressed data cubes for olap aggregate query approximation on continuous dimensions . KDD'1999

• [O5] J. S. Vitter, M. Wang, and B. Iyer. Data Cube Approximation and Histograms via Wavelets . CIKM'1999

• [O6] Coming soon