11 search results - page 1 / 3 » Accelerating Boyer Moore Searches on Binary Texts |
WIA
2007
Springer
13 years 11 months ago
2007
Springer
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
DCC
2002
IEEE
14 years 4 months ago
2002
IEEE
CPM
2000
Springer
13 years 9 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
DATESO
2007
13 years 6 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...