20 search results - page 2 / 4 » Contracted Suffix Trees: A Simple and Dynamic Text Indexing ... |
EDBT
2010
ACM
13 years 8 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
FOCS
2009
IEEE
13 years 9 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
ICDE
2010
IEEE
14 years 5 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...
IR
2008
13 years 5 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...