106
Voted
SPIRE
15 years 7 months ago
2001 Springer 
Word-based Huffman coding has widespread use in information retrieval systems. Besides its compressing power, it also enables the implementation of both indexing and searching sch...
231
Voted
SPIRE
15 years 7 months ago
2001 Springer 
In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The di...
SPIRE
15 years 7 months ago
2001 Springer 
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
129
Voted
SPIRE
15 years 7 months ago
2001 Springer 
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
99
Voted
SPIRE
15 years 7 months ago
2001 Springer 
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...
|
Information Technology