Sciweavers

77 search results - page 3 / 16
» SASE: Implementation of a Compressed Text Search Engine
Sort
View
DCC
1998
IEEE
13 years 11 months ago
Multiple Pattern Matching in LZW Compressed Text
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Mas...
ICSE
2010
IEEE-ACM
14 years 5 days ago
Improved social trustability of code search results
Search is a fundamental activity in software development. However, to search source code efficiently, it is not sufficient to implement a traditional full text search over a base ...
Florian S. Gysin
COMPSAC
2002
IEEE
14 years 10 days ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen
CORR
2011
Springer
181views Education» more  CORR 2011»
13 years 2 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
SPIRE
2001
Springer
13 years 11 months ago
Compaction Techniques for Nextword Indexes
Most queries to text search engines are ranked or Boolean. Phrase querying is a powerful technique for refining searches, but is expensive to implement on conventional indexes. I...
Dirk Bahle, Hugh E. Williams, Justin Zobel