Font Size: a A A

An R-tree index using the STL style

Posted on:2005-06-26Degree:M.Comp.ScType:Thesis
University:Concordia University (Canada)Candidate:Zhong, MingAnFull Text:PDF
GTID:2458390008994435Subject:Computer Science
Abstract/Summary:
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.
Keywords/Search Tags:R-tree, Index, STL, Data, Using
Related items