首页 | 本学科首页   官方微博 | 高级检索  
     检索      

ArithRegion——一种压缩XML的索引结构
引用本文:包小源,唐世渭,吴泠,杨冬青,宋再生,王腾蛟.ArithRegion——一种压缩XML的索引结构[J].北京大学学报(自然科学版),2006,42(1):103-109.
作者姓名:包小源  唐世渭  吴泠  杨冬青  宋再生  王腾蛟
作者单位:天津师范大学计算机与信息工程学院,天津,300074;E-mail: zongyj@pku.org.cn;北京大学计算机科学系,北京,100871
基金项目:科技部科研项目,国家科技攻关项目
摘    要:XML在数据交换中的应用越来越广泛,但由于标记引入而使其空间膨胀较大,对传输及存储资源耗费严重。压缩后的XML数据容量明显减少,但怎样基于压缩后的XML数据直接进行高效的查询处理,当前研究工作较少。以反向算术压缩为基本压缩算法,提出针对XML数据库中压缩XML文件的索引结构ArithRegion,基于该索引结构,可高效处理形如//element1/element2/…/elmentm的查询。

关 键 词:XML  索引  B+树  算术压缩  
收稿时间:2005-01-05
修稿时间:2005-01-052005-03-23

ArithRegion-An Index Structure on Compressed XML Data
BAO Xiaoyuan,TANG Shiwei,WU Ling,YANG Dongqing,SONG Zaisheng,WANG Tengjiao.ArithRegion-An Index Structure on Compressed XML Data[J].Acta Scientiarum Naturalium Universitatis Pekinensis,2006,42(1):103-109.
Authors:BAO Xiaoyuan  TANG Shiwei  WU Ling  YANG Dongqing  SONG Zaisheng  WANG Tengjiao
Institution:1. Computer and Information Engineering College, Tianjin Normal University, Tianjin , 300074; 2. Department of Computer Seietwe, Peking University, Beijing, 100871
Abstract:Even XML is used as a popular data exchange standard over Internet and Intranet, its space expansion makes the transmitting and storing of XML data very expensive in terms of resources because of adding tags to every different semantic content unit. After compressed, its size will be much smaller, but how to evaluate query efficiently and directly based on the compressed data is still a necessary work. The authors propose an XML index structure using B+ tree as its' backbone structure, on compressed data which is resulted from revert arithmetic compression, ArithRegion. Queries as the form of //element1/element2/…/elmentm can be evaluated efficiently using ArithRegion.
Keywords:XML
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《北京大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号