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

PATRICIA-TRIES结构的XML数据索引技术
引用本文:龚成清.PATRICIA-TRIES结构的XML数据索引技术[J].宁波职业技术学院学报,2008,12(2):60-64.
作者姓名:龚成清
作者单位:广东女子职业技术学院,广州,511450
摘    要:随着网络技术的发展,XML的应用越来越广泛,它已经成为Internet上数据表示和交换的新标准,为了提高XML数据的查询效率,为XML数据建立索引是一种有效的方法。在压缩存储的思想下提出了基于Trie树结构的PATRICIA-TRIES索引结构。具体介绍了PATRICIA-TRIES索引结构建立的4个步骤:编码元素标签、编码元素值、建立索引树、设立头结点。该索引具有容量小、速度快的优点。实践证明,该方法是行之有效的。

关 键 词:XML  数据  索引  PATRICIA-TRIES
文章编号:1671-2153(2008)02-0060-05
修稿时间:2008年1月3日

The XML indexing technology based on the PATRICIA-TRIES structure
GONG Cheng-qing.The XML indexing technology based on the PATRICIA-TRIES structure[J].Journal of Ningbo Polytechnic,2008,12(2):60-64.
Authors:GONG Cheng-qing
Institution:GONG Cheng-qing (Guangdong Women Polytechnic, Guangzhou 511450, China)
Abstract:The application of XML is widely used with the development of the network. It has been a new standard of data show and data exchange of the Internet. In order to enhance the efficiency of the XML data querying, to set up the index for the data is a good way. Based on the idea of compressing storage, it brings forward a PATRICIA- TRIES indexing structure based on the Tile-tree structure. It introduces four steps to set up the PATRICIA-TRIES indexing structure in detail: coding the element label, coding the element value, set up the index-tree and set the heading nodes.The PATRICIA-TRIES indexing structure is small storage and fast processing speed. Proved in practice, it is an effective mothod.
Keywords:XML  data  indexing  PATRICIA-TRIES
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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