I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. ii The University of Waterloo requires the signatures of all persons using or photocopying this thesis. Please sign below, and give address and date. iii Efficient implementation of access methods is crucial for many database systems. Today, database systems are increasingly being employed to support new applications involving multi-dimensional data. A large variety of specialized access methods have been developed to solve specific problems. These specialized access methods are usually hand-coded from scratch. The effort required
|
1651
|
R-trees: A dynamic index structure for spatial searching
– Guttman
- 1984
|
|
1268
|
The C++ Programming Language
– Stroustrup
- 1997
|
|
706
|
The r*-tree: An efficient and robust access method for points and rectangles
– Beckmann, Kriegel, et al.
- 1990
|
|
692
|
Multidimensional binary search trees used for associative searching
– Bentley
- 1975
|
|
455
|
The ubiquitous B-tree
– Comer
- 1979
|
|
452
|
The R ∗ -tree: An Efficient and Robust Access Method for Points and Rectangles
– Beckmann, Kriegel, et al.
- 1990
|
|
417
|
Multidimensional access methods
– Gaede, Gunther
- 1998
|
|
363
|
The grid file: An adaptable, symmetric multikey file structure
– Nievergelt, Hinterberger, et al.
|
|
300
|
The K-D-B Tree: A Search Structure for Large Multidimensional Indexes
– Robinson
- 1981
|
|
238
|
An approach to persistent programming
– Atkinson, Bailey, et al.
- 1983
|
|
192
|
R+-tree: A dynamic index for multi-dimensional objects
– Sellis, Roussopoulos, et al.
- 1987
|
|
184
|
A:Pfeffer, Generalized Search Trees for Database Systems
– Hellerstein
- 1995
|
|
124
|
A class of data structures for associative searching
– ORENSTEIN, T
- 1984
|
|
106
|
Extendible Hashing: A Fast Access Method for Dynamic Files
– Fagin
- 1979
|
|
101
|
Organization and maintenance of large ordered indices
– Bayer, McCreight
- 1972
|
|
93
|
The lsd tree: Spatial access to multidimensional point and non-point objects
– Henrich, Six, et al.
- 1989
|
|
90
|
The BANG file: a New Kind of Grid File
– Freeston
- 1987
|
|
77
|
Sorting and searching
– Knuth
- 1973
|
|
58
|
XML How to Program
– Dietel, Deitel, et al.
|
|
38
|
hashing: A new tool for file and table addressing
– Linear
- 1980
|
|
37
|
Efficient Structures for Geometric Data Management. LNCS 337
– GÜNTHER
- 1988
|
|
32
|
An analysis of rule indexing implementations in data base systems
– Stonebraker, Sellis, et al.
- 1986
|
|
28
|
Inclusion of new types in relational database systems
– STONEBRAKER
- 1986
|
|
26
|
Globally order preserving multidimensional linear hashing
– HUTFLESZ, SIX, et al.
- 1988
|
|
26
|
Linear hashing with partial expansions
– Larson
- 1980
|
|
25
|
A robust multi-attribute search structure
– Lomet, Salzberg
- 1989
|
|
14
|
The R-file: An efficient access structure for proximity queries
– HUTFLESZ, SIX, et al.
- 1990
|
|
9
|
A new tree type data structure with homogeneous node suitable for a very large spatial database
– OHSAWA, M
- 1990
|
|
7
|
Techniques for design and implementation of spatial access methods
– SEEGER, KRIEGEL
- 1988
|
|
3
|
Database : a toolkit for constructing memory mapped databases. Persistent Object Systems
– Buhr, Goel, et al.
- 1992
|
|
3
|
Understanding Control Flow with Concurrent Programming Using C++. http://www.uwaterloo.ca/ cs342
– Buhr
- 1995
|
|
2
|
Exact Positioning of Data Approach to Memory Mapped Persistent Stores : Design, Analysis and Modelling
– Goel
- 1996
|
|
1
|
The cell tree: an objected-oriented index structure for geometric databases
– Gunther
- 1989
|
|
1
|
An ap1983
– Atkinson, Bailey, et al.
|
|
