An efficient implementation of a flexible XPath extension

Authors:
Nieves R. Brisaboa;Ana Cerdeira-Pena;Gonzalo Navarro;Gabriella Pasi
Affiliations:
Univ. da Coruña, A Coruña, Spain;Univ. da Coruña, A Coruña, Spain;Univ. of Chile, Santiago, Chile;DISCO, Univ. degli Studi, di Milano Bicocca, Milano, Italy
Venue:
RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Year:
2010

Citing 9
Cited 0

Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
Blind Queries to XML Data

DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
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
A flexible extension of XPath to improve XML querying

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
FuzzyXPath: Using Fuzzy Logic an IR Features to Approximately Query XML Documents

IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
A fuzzy extension of the XPath query language

Journal of Intelligent Information Systems
A compressed self-indexed representation of XML documents

ECDL'09 Proceedings of the 13th European conference on Research and advanced technology for digital libraries
Enhanced byte codes with restricted prefix properties

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an efficient implementation of different flexible queries (that constitute an extension of the XPath query language) to be executed on XML documents represented by using a recent structure called XML Wavelet Tree (XWT) [3]. A XWT represents the XML document compressed by using only about 35% of its original size, but it also provides some implicit self-indexing features that help to obtain not only efficient implementations of standard XPath queries, but also of extended ones. This is shown based on the implementation of the flexible structure based constraints, below and near [7].