Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Inplace Run-Length 2d Compressed Search Amihood Amir Gad M. Landau y Dina Sokol z
 

Summary: Inplace Run-Length 2d Compressed Search
Amihood Amir  Gad M. Landau y Dina Sokol z
Abstract
The recent explosion in the amount of stored data has necessitated the storage and trans-
mission of data in compressed form. The need to quickly access this data has given rise to a
new paradigm in searching, that of compressed matching [1, 8, 10]. The goal of the compressed
pattern matching problem is to nd a pattern in a text without decompressing the text.
The criterion of extra space is very relevant to compressed searching. An algorithm is called
inplace if the amount of extra space used is proportional to the input size of the pattern. In this
paper we present a 2d compressed matching algorithm that is inplace. Let compressed(T ) and
compressed(P ) denote the compressed text and pattern, respectively. The algorithm presented
in this paper runs in time O(jcompressed(T )j + jP j log ) where  is min(jP j; jj), and  is
the alphabet, for all patterns that have no trivial rows (rows consisting of a single repeating
symbol). The amount of space used is O(jcompressed(P )j). The compression used is the 2d
run-length compression, used in FAX transmission.
1 Introduction
As technology develops in diverse areas, from medicine to multimedia, there is a continuous increase
in the amount of stored digital data. This increase has made it critically important to store and
transmit les in a compressed form. The need to quickly access this data has given rise to a new
paradigm in searching, that of compressed matching [1, 8, 10]. In traditional pattern matching,

  

Source: Amir, Amihood - Computer Science Department, Bar Ilan University
Sokol, Dina - Department of Computer and Information Science, Brooklyn College, City University of New York

 

Collections: Computer Technologies and Information Sciences; Mathematics