| The main concern in this thesis is the historical database which is a part of Real-time database system. The basic hierarchy architecture of VegeBam is constructed and a dynamic index structure of multi-dimensional space is studied. A Real-time database system called VegeBam is developed, which is of proprietary intellectual property rights. The main contents are as follows.Requirements of VegeBam are described and then storage structures of VegeBam are designed based on requirements including storage structure of the Real-time database file, storage structure of data table file and so on.A dynamic index structure called RS-tree is proposed based on a multi-dimensional index structure called R-tree. RS-tree is of two characteristics, Sequence ordering of index records and Position ordering of nodes, of which R-tree is not. It makes that the number of I/O operations of RS-tree is less than that of R-tree obviously during query, which improves the query performance of RS-tree. Experimental results show that RS-tree's average speed of query is nearly five hundreds of times faster than R-tree's when the number of query records is more than one thousand and when query is performed in huge amount of data, RS-tree is an effective index structure which can improve the query performance obviously.We have not only designed the hierarchy of VegeBam and defined interfaces between hierarchies, but also developed a Real-time database system called VegeBam which is of proprietary intellectual property rights. Data are stored in the form of bivariate table in VegeBam. VegeBam implements several operations including adding records, deleting records, modifying records and querying records, and supports multi-dimensional index structure called RS-tree. We perform several tests including data writing test, data reading test and data querying test. Experimental results show that Real-time database system called VegeBam is of application value fairly. |
PDF Full Text Request