Zhong, Ming An (2004) An R-tree index using the STL style. Masters thesis, Concordia University.
MQ91161.pdf - Accepted Version
Indexes are critical for performance of database systems. Trees are effective indexes that handle both single-dimensional and multi-dimensional data. The R-tree is a commonly used multi-dimensional tree index for the spatial data and geographic information system (GIS). By using design pattern and following the C++ STL style, the R-tree index structure in this thesis is designed and implemented using generic programming techniques. The components are designed to be the STL style containers so that they have a uniform and clear interface and can be used like a standard container. The R-tree structure can adapt to different data types, user-defined key types, and support user-defined queries.
|Divisions:||Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering|
|Item Type:||Thesis (Masters)|
|Authors:||Zhong, Ming An|
|Pagination:||vii, 109 leaves : ill. ; 29 cm.|
|Degree Name:||M. Comp. Sc.|
|Thesis Supervisor(s):||Butler, Greg|
|Deposited By:||Concordia University Libraries|
|Deposited On:||18 Aug 2011 18:11|
|Last Modified:||04 Nov 2016 23:48|
Repository Staff Only: item control page