Sciweavers

540 search results - page 1 / 108
» A New Compression Method for Compressed Matching
Sort
View
VLDB
1987
ACM
66views Database» more  VLDB 1987»
13 years 8 months ago
A New Compression Method with Fast Searching on Large Databases
In this paper, a new compression method for constant removal from very large scientific and statistical databases is presented. The new method combines the best features from seve...
Jianzhong Li, Doron Rotem, Harry K. T. Wong
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
13 years 11 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
13 years 9 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
13 years 9 months ago
Pattern Matching in Text Compressed by Using Antidictionaries
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, ...