Font Size: a A A

Research Of XML Compression And Self-index

Posted on:2010-08-12Degree:MasterType:Thesis
Country:ChinaCandidate:H Q FuFull Text:PDF
GTID:2178360272499804Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
XML have become the "globle language" in the Internet. So, how to deal with the XML in DBMS have become focus.What discussed in this paper is how to compress and store XML file and create self-index of it in native XML DBMS.Since XML file need to describe the struct of the data, it has lot of mark.This make XML take up more storage space. People try to resolute the problem through compress the XML. Many idea can not keep the structure of XML. When compressed XML file be queried , we must uncompress it first. Or we have to compress the keyword in the same way .I adapt the compression as the method to eliminate data redundancy of XML. But, I only compress the text node of the XML file to keep the structure of it.To my storage strategy, the speciality is the data need to be uncompressed only after application find its node position. So it more efficiency.To this storage strategy ,the paper give a search method. During the process of the uncompress, the system can create a full text index of the node content.It use suffix array as the data struct. So the query will faster because the index. So ,this is the text node level self-index.
Keywords/Search Tags:XML, Compress, Self-index, BWT, Suffix array
PDF Full Text Request
Related items