基于4r树的双时态索引扩展技术-计算机软件与理论专业论文.docxVIP

中山大学硕士学位论文量的语义实现。文中提出的G4R树技术的基本思想是：首先通过数据变换，消除四 中山大学硕士学位论文 量的语义实现。文中提出的G4R树技术的基本思想是：首先通过数据变换，消除四 类双时态数据中的时间变元，然后分别对四类变换后的双时态数据建立4个R树索 引。查询时，对四个R树的查询条件也要执行相应的变换，以查询到相应结果。并 且严格证明了G4R树索引技术的正确性，最后通过实验验证此方法的可行性。 关键词：G4R树，偏移，时态数据库，变换。 II ABSTRACTTitle：Extensive ABSTRACT Title：Extensive technology oftemporal index based on 4R tree Major： Computer software and theory Name： Zhou fengIIua Supervisor：Associate Professor Ye Xiao-ping ABSTRACT Time rass through the whole developing procedures of the objects．The technology of database，which record and manage the data of world information，must regard the temporal as an important aspect of theory study and practice application．For some reason，the main databases，such as Relational Database and Object Relational Database， fall to index bitemporal data．As bitemporal data and spatial data both are two dimensions， combined with the characteristic of bitmeporal data，now temporal index technologies almost are the extension and improvement of spatial index technology,for example R tree and R+tree，to accelerate the rate of query and improve the efficiency of temporal index．Today there is GR tree which is the extension of R tree to index bitemporal data with variables and 4R tree which eliminate the time variable by transformation first and then index the transformed data on R tree．They 8ule efficient，but also have shortages： 1．Transaction time start must be large or equal to valid time start when valid time end is indeterminate． 2．Valid time variable must equal to transaction current time． 3．Query is limited on the current and history data． GR tree and 4R tree fall to deal with all bitemporal data due to rule 1；They are limited to deal with the lag，real time and exceeding between the time of data recording on database and being valid due to rule 2，and also limited to query the future time due to rule 3．All above restrict the bitemporal index technology to deep research and wide application． ill 中山大学硕士学位论文This 中山大学硕士学位论文 This paper first dis