Filtration Algorithms for Approximate Order-Preserving Matching

Chhabra, Tamanna; Giaquinta, Emanuele; Tarhio, Jorma

doi:10.1007/978-3-319-23826-5_18

Cited by 12 publications

(18 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We tested our algorithm SIMD-OPPM against the most effective previous solutions, which include S2OPPM and S4OPPM [4], SSEOPPM and AVXOPPM [5], FFK-OPPM [13], and SKIP-OPPM [12]. S2OPPM and S4OPPM [4] solutions are based on SBNDM2 and SBNDM4 [19].…”

Section: Resultsmentioning

confidence: 99%

“…S2OPPM and S4OPPM [4] solutions are based on SBNDM2 and SBNDM4 [19]. SSEOPPM and AVXOPPM [5] represent the online solution grounded on SSE4.2 and AVX instruction set, respectively. FFK-OPPM [13] presents the filtration approach by Faro and Külekci.…”

Section: Resultsmentioning

confidence: 99%

“…One of them is the orderpreserving pattern matching (OPPM) problem [1][2][3][4][5][6]. Some solutions have been devoted to such a problem in recent years.…”

Section: Introductionmentioning

confidence: 99%

“…Specifically, two online solutions to the OPPM problem were proposed by Chhabra et al [5]. The online solutions use the single instruction multiple data (SIMD) architecture [11].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Engineering order‐preserving pattern matching with SIMD parallelism

et al. 2016

Self Cite

View full text Add to dashboard Cite

SUMMARYThe order-preserving pattern matching problem has gained attention in recent years. It consists in finding all substrings in the text, which have the same length and relative order as the input pattern. Typically, the text and the pattern consist of numbers. Since recent times, there has been a tendency to utilize the ability of the word RAM model to increase the efficiency of string matching algorithms. This model works on computer words, reading and processing blocks of characters at once, so that usual arithmetic and logic operations on words can be performed in one unit of time. In this paper, we present a fast order-preserving pattern matching algorithm, which uses specialized word-size packed string matching instructions, grounded on the single instruction multiple data instruction set architecture. We show with experimental results that the new proposed algorithm is more efficient than the previous solutions.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

“…One of them is the orderpreserving pattern matching (OPPM) problem [1][2][3][4][5][6]. Some solutions have been devoted to such a problem in recent years.…”

Section: Introductionmentioning

confidence: 99%

“…Specifically, two online solutions to the OPPM problem were proposed by Chhabra et al [5]. The online solutions use the single instruction multiple data (SIMD) architecture [11].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Engineering order‐preserving pattern matching with SIMD parallelism

et al. 2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…The bottom line is that our index takes roughly the same space as the compressor gzip and can report the order‐preserving occurrences of a pattern an order of magnitude faster than simply scanning the input file. Indeed, in Section 4, we show that our solution is significantly faster than the current fastest online algorithm and the offline algorithm by Chhabra et al, which is also based on the idea of building a “partial” index to speed up the search.…”

Section: Introductionmentioning

confidence: 84%

A compact index for order‐preserving pattern matching

2019

View full text Add to dashboard Cite

Summary Order‐preserving pattern matching has been introduced recently, but it has already attracted much attention. Given a reference sequence and a pattern, we want to locate all substrings of the reference sequence whose elements have the same relative order as the pattern elements. For this problem, we consider the offline version in which we build an index for the reference sequence so that subsequent searches can be completed very efficiently. We propose a space‐efficient index that works well in practice despite its lack of good worst‐case time bounds. Our solution is based on the new approach of decomposing the indexed sequence into an order component, containing ordering information, and a δ component, containing information on the absolute values. Experiments show that this approach is viable, is faster than the available alternatives, and is the first one offering simultaneously small space usage and fast retrieval.

show abstract