欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
讨论一种新的时态数据库索引技术TQD-tree。不同于常规的＂代数＂方式,TQD-tree基于＂序关系＂数学框架,但与＂代数＂方式一样能够实现＂一次一集合＂的数据操作。提出给定时间期间集合上线序划分概念并建立构建算法,在线序划分框架内,提出时态数据索TQD-tree,并研究了相应查询和更新算法。设计了仿真实验,对TQD-tree的性能进行了基本评估。
英文摘要：
This paper discussed a new technology of temporal data index which was called TQD-tree. Different from normal processing module of ＂algebra＂, TQD-tree was based on the mathematics framework of ＂order relation＂, which could also re- alize the data querying for ＂one set-at-a-time＇. Firstly, it put forward the concept of linear order partition in temporal data set and studied 1 corresponding construction algorithm. Secondly, in the framework of linear order partition, it presented temporal data index TQD-tree as well as the relevant algorithms of query and researched update ; in additon, designed simulated experi- ments for the basic evaluation of TQD-tree performance.
同期刊论文项目
同项目期刊论文
期刊信息
位置：