Login | Register

An R-tree index using the STL style


An R-tree index using the STL style

Zhong, Ming An (2004) An R-tree index using the STL style. Masters thesis, Concordia University.

Text (application/pdf)
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 > Gina Cody School 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.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science
Thesis Supervisor(s):Butler, Greg
Identification Number:QA 76.73 C153Z46 2004
ID Code:7954
Deposited By: Concordia University Library
Deposited On:18 Aug 2011 18:11
Last Modified:13 Jul 2020 20:02
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top