archives

Query-friendly Compression and Indexing of Recurring Structures in XML Documents


Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Vemula, Satish, Justin, Hare and Seo-Young, Noh (2003) Query-friendly Compression and Indexing of Recurring Structures in XML Documents. Technical Report 03-02, Computer Science, Iowa State University.

Full text available as:Adobe PDF

Abstract

XML documents are by design self-describing. In order to accomplish this, the XML data is highly verbose and very repetitious. Although techniques already exist to compress XML and text in general, most do not keep the data in a form that is useful to users. We present a technique that makes use of recurring structures within an XML document to compress the file in a way that can achieve better compression than other query-friendly compression techniques while still maintaining the data in a form that allows for both querying and indexing. Further, we present an example implementation of the technique, complete with an index-building mechanism and query processing capabilities.

Keywords:XML Compressing, XML Indexing
Subjects:Data: DATA STRUCTURES
All uncategorized technical reports
ID code:00000297
Deposited by:Seo-Young Noh on 03 February 2003



Contact site administrator at: ssg@cs.iastate.edu