17 search results - page 1 / 4 » Fast In-Memory XPath Search using Compressed Indexes |
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
ALENEX
2008
14 years 7 hour ago
2008
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
SIGIR
2012
ACM
12 years 1 months ago
2012
ACM
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
CPM
2010
Springer
14 years 3 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...