Compressed pattern matching for SEQUITUR

Mitarai, Shuichi; Hirao, Masahiro; Matsumoto, Tetsuya; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo

doi:10.1109/dcc.2001.917178

Cited by 11 publications

(11 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lempel-ZIP family (Ziv and Lempel, 1977;Ziv and Lempel, 1978) and Sequitur (Nevill-Manning and Witten, 1997). Matching in the compressed text without decompression has been introduced (Amir and Benson, 1992) and throughly studied later on (Amir et al, 1996;Farach and Thorup, 1998;Navarro and Raffinot, 1999;Kida et al, 1999;Mitarai, 2001). Simulating the KMP algorithm over LZ78 compressed text can solve the occurrence problem in O(m 2 +n) (Amir et al, 1996).…”

Section: Related Workmentioning

confidence: 99%

“…As a result, a literal match may not be counted if it is from a different function call. Due to the path interruption and path context problems, existing pattern matching algorithms, such as the one in (Mitarai, 2001), are not directly applicable for finding a path in a WPP. In this paper we develop a set of path matching algorithms that operates on WPPs.…”

Section: Introductionmentioning

confidence: 99%

“…When the need to search for a pattern in the data stream arises, it is highly desirable to avoid uncompressing the data. Therefore researchers have been developing algorithms for pattern matching that operate directly on compressed data (Amir and Benson, 1992;Amir et al, 1996;Kida et al, 1999;Mitarai, 2001;Navarro et al, 2001). …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The design and evaluation of path matching schemes on compressed control flow traces

Lin

Zhang

Gupta

2007

Journal of Systems and Software

View full text Add to dashboard Cite

A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in compressed format. On the other hand, control flow traces are frequently queried to assist program analysis and optimization, e.g. finding frequently executed subpaths that may be optimized. In this paper, we identify path interruption and path context problems in querying an intraprocedural path over control flow traces. While algorithms that perform pattern matching on compressed strings have been proposed, solving new challenges requires the extension of traditional algorithms. We design and evaluate four path matching schemes including those that match in the compressed data directly and those that match after decompression. In addition, simple indices are also designed to improve matching performance. Our experimental results show that these schemes are practical and can be adapted to environments with different hardware settings and path matching requests.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The design and evaluation of path matching schemes on compressed control flow traces

Lin

Zhang

Gupta

2007

Journal of Systems and Software

View full text Add to dashboard Cite

show abstract

“…Lossy compression algorithms represent an improvement in time and space overhead, with the addition of some inaccuracy. Sequitor [14] and Path Grammar Guided Trace Compression (PGGTC) [15] are both trace compression techniques developed specifically for address traces, they are lossless and lossy respectively. Both depend on the creation of a context free grammar (CFG) that represents repeated portions of the address trace.…”

Section: Comparison To Related Projectsmentioning

confidence: 99%

“…Each of the previously proposed solutions has shortcomings. Compression techniques incur a large slowdown [14,15], and some of them require that the entire trace be stored before being compressed [14], truncating the trace loses valuable information. On-the-fly processing is done successfully, but uses a large amount of time on valuable HPC resources and has to be rerun each time the evaluation study changes [6].…”

Section: Introductionmentioning

confidence: 99%

PSnAP: Accurate Synthetic Address Streams through Memory Profiles

Olschanowsky

Tikir

Carrington

et al. 2010

Languages and Compilers for Parallel Computing

View full text Add to dashboard Cite

Abstract. Memory address traces are an important information source; they drive memory simulations for performance modeling, systems design and application tuning. For long running applications, the direct use of an address trace is complicated by its size. Previous attempts to reduce trace size incurred a substantial penalty with respect to trace accuracy. We propose a novel method of memory profiling that enables the generation of highly accurate synthetic traces with space requirements typically under 1% of the original traces. We demonstrate the synthetic trace accuracy in terms of cache hit rates, spatial-temporal locality scores and locality surfaces. Simulated cache hit rates from synthetic traces are within 3.5% of observed and on average are within 1.0% for L1 cache. Our profiles are on average 60 times smaller than compressed traces. The combination of small profile sizes and high similarity to original traces makes our technique uniquely applicable to performance modeling and trace driven simulation of large-scale parallel scientific applications.

show abstract

String Matching Over Compressed Text on Handheld Devices Using Tagged Sub-Optimal Code (TSC)

Bellaachia

Rassan

2005

Real-Time Syst

View full text Add to dashboard Cite

This paper presents Tagged Sub-optimal code (TSC), a new coding technique to speed up string matching over compressed databases on personal digital assistants (PDA). TSC is a variable-length sub-optimal code that supports minimal prefix property. It always determines its codeword boundary without traversing a tree or lookup table. TSC technique may be beneficial in many types of applications: speeding up string matching over compressed text, and speeding decoding process. This paper also presents two algorithms for string matching over compressed text using TSC (SCTT) and the Byte Pair Encoding (BPE) technique (SCTB).Several experiments were conducted to compare the performance of TSC, Byte Pair Encoding (BPE), and Huffman code. Several PDA databases with different record sizes were used: the well-known Calgary dataset and a set of small-sized PDA databases. Experimental results show that SCTT is almost twice as fast as the Huffmanbased algorithm. SCTT has also the same performance in search time as the search in uncompressed databases and is faster than the SCTB algorithm. For frequently updated PDA databases such as phone books, to-do list, and memos, SCTT is the recommended method regardless of the size of the average record length, since the time required to compress the updated records using BPE poses significant delays compared to TSC.

show abstract

Compressed pattern matching for SEQUITUR

Cited by 11 publications

References 22 publications

The design and evaluation of path matching schemes on compressed control flow traces

The design and evaluation of path matching schemes on compressed control flow traces

PSnAP: Accurate Synthetic Address Streams through Memory Profiles

String Matching Over Compressed Text on Handheld Devices Using Tagged Sub-Optimal Code (TSC)

Contact Info

Product

Resources

About