Abstract
XML has gained prominence as data storage and exchange format for web applications. This is because there are certain features which are unique to XML like self descriptivism, extensibility and non proprietary text document storage. In spite of all these unique features XML has an inherent limitation of verbosity. This size problem of XML should be dealt with efficiently so that a good compression is achieved and at the same time the compressed data is directly queriable i.e. it should not require decompression at the time of querying. The proposed technique creates a new query engine based on novel three dimensional indexes consisting of structure, attribute and content index. The structure index consists of all unique root to leaf paths of the XML document, the content index stores the contents path wise i.e. all the contents of one particular type of path class is stored in one file and attribute index is created in manner similar to that of content index. Based on this three dimensional compact storage a new query engine is proposed which can answer xpath queries very efficiently. This approach dramatically reduces the storage requirement for XML coupled with efficient processing of xpath queries. General Terms Response time, inverted list, compact storage, algorithm
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.