Organization: Euclidean Coordinatized Space

1

C.C. Aggarwal, J. Wolf, P. Yu, and M. Epelman. The S-Tree: An efficient index for multidimensional objects". In SSD, 1997.

2

C.H. Ang and T.C. Tan. New linear node splitting algorithm for R-Trees. In SSD, 1997.

3

P. Baumann. Management of multidimensional discrete data. In VLDB, 1994.

4

Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, and Peter Widmayer. On Optimal Multiversion Access Structures. In SSD, 1993.

5

N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD, 1990.

6

Stefan Berchtold, Daniel A. Keim, and Hans-Peter Kriegel. The X-tree : An index structure for high-dimensional data. In VLDB, 1996.

7

Tolga Bozkaya and Meral Ozoyoglu. Distance-Based Indexing for High-Dimensional Metric Spaces. In SIGMOD, 1997.

8

Thomas Brinkhoff and Hans-Peter Kriegel. The impact Global Clustering on Spatial Database Systems. In VLDB, 1994.

9

Elisabetta Bruzzone, Leila De Floriani, and Monica Pellegrinelli. A Hierarchical Spatial Index for Cell Complexes. In SSD, 1993.

10

G. Droge and H.J. Schek. Query-adaptive data space partitioning using variable-size storage clusters. In SSD, 1993.

11

Christos Faloutsos and Volker Gaede. Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension. In VLDB, 1996.

12

A. Frank. Properties of geographic data: Requirements for spatial access methods. In SSD, 1991.

13

A. Frank and W. Kukn. Cell graphs: A provable correct method for the storage of geometry. In Symposium on Spatial Data Handling, 1986.

14

Michael Freeston. A General Solution of the N-demensional B-tree problem. In SIGMOD, 1995.

15

D. Greene. An implementation and performance analysis of spatial data access methods. In Data Engineering, 1989.

16

R. Guttman. R-tree: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference. ACM, 1984.

17

L.M. Haas, J.C. freytag, G.M. Lohman, and H. Pirahesh. Extensible query processing in Starburst. In SIGMOD, 1989.

18

A. Henrich. A DistanceScan Algorithm for Spatial Access Structures. In ACM GIS, 1994.

19

A. Henrich. A Hybrid Split Strategy For k-d-Tree Bases Access Structures. In ACM GIS, 1996.

20

A. Henrich, H.W. Six, and P. Widmayer. The LSD-tree: Spatial access to multidimensional point- and non-point-objects. In VLDB, 89.

21

Andreas Henrich and Jens Moller. Extending a Spatial Access Structure to Support Additional Standard Attributes. In SSD, 1995.

22

B. Himatsingka and J. Srivastava. Performance Evaluation of Grid Based Multi-Attribute Record Declustering Methods. In Data Engineering, 1994.

23

K.I. Lin. The TV-tree: An index structure for high-dimensional data. In VLDB, 1994.

24

Ming-Ling Lo and Chinya V. Ravishankar. Generating Seeded Trees from Data Sets. In SSD, 1995.

25

Raymond T. Ng and Jiawei Han. Efficient and Effective Clusting Methods for Spatial Data Mining. In VLDB, 1994.

26

J.T. Robinson. The KDB-tree: A search structure for large multimensional dynamic indexes. In SIGMOD, 1981.

27

B. Seeger, , and H.P. Kriegel. The buddy-tree: An efficient and robust access method for spatial database systems. In VLDB, 1990.

28

B. Seeger and H.P. Kriegel. Techniques for design and implementation of efficient spatial access methods. In VLDB, 1988.

29

T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-Tree: A dynamic index for multi-dimensional objects. In VLDB, 1987.

30

Kenneth C. Sevcik and Nick Koudas. Filter Trees for Managing Spatial Data over a Range of Size Granularities. In VLDB, 1996.

31

Clifford A. Shaffer and Patrick R. Brown. A Paging Scheme for Pointer-Based Quadtrees. In SSD, 1993.

32

A.P. Sistla, C. Yu, C. Liu, and K. Liu. Similarity based Retrieval of Pictures Using Indices on Spatial Relationships. In VLDB, 1995.