A compressed self-indexed representation of XML documents

Authors:
Nieves R. Brisaboa;Ana Cerdeira-Pena;Gonzalo Navarro
Affiliations:
Database Lab., Univ. da Coruña, Spain;Database Lab., Univ. da Coruña, Spain;Dept. of Computer Science, Univ. of Chile
Venue:
ECDL'09 Proceedings of the 13th European conference on Research and advanced technology for digital libraries
Year:
2009

Citing 8
Cited 4

Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
XIRQL: a query language for information retrieval in XML documents

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Personalised Indexing and Retrieval of Heterogeneous Structured Documents

Information Retrieval
FLUX: fuzzy content and structure matching of XML range queries

Proceedings of the 15th international conference on World Wide Web
Lightweight natural language text compression

Information Retrieval
Reorganizing compressed text

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Enhanced byte codes with restricted prefix properties

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

An efficient implementation of a flexible XPath extension

RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Wavelet trees for all

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Implicit indexing of natural language text by reorganizing bytecodes

Information Retrieval
Wavelet trees for all

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a structure we call XML Wavelet Tree (XWT) to represent any XML document in a compressed and self-indexed form. Therefore, any query or procedure that could be performed over the original document can be performed more efficiently over the XWT representation because it is shorter and has some indexing properties. In fact, XWT permits to answer XPath queries more efficiently than using the uncompressed version of the documents. XWT is also competitive when comparing it with inverted indexes over the XML document (if both structures use the same space).