摘要
针对时态查询与时间属性紧密相关的特点,利用时间区间作为改进后B+-tree的索引关键字建立索引,改进后的B+-tree命名为Changing B+-tree(CB+-tree)。实验证明,在CB+-tree上进行时态查询比B+-tree及基于DOM的XML文档的查询效率有所提高。
Focused on the close relative between temporal queries and time attribute,this paper uses temporal interval as an index key of the modified B＋-tree to create indexes.The modified B＋-tree is denoted Changing B＋-tree（CB＋-tree）.Through the experiments,new index method processes several typical queries in temporal XML better than querying in B＋-tree index and DOM method.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第9期77-79,共3页
Computer Engineering
基金
南京航空航天大学引进人才科研基金资助项目(S0677-042)
