activity
20142016
most citedTwo simple full-text indexes based on the suffix array

3 citations · 4 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

6 papers · 1 filter

cs.DS2016

Suffix arrays with a twist

Tomasz Kowalski, Szymon Grabowski, Kimmo Fredriksson +1

The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navig…

cs.DS2016

Rank and select: Another lesson learned

Szymon Grabowski, Marcin Raniszewski

Rank and select queries on bitmaps are essential building bricks of many compressed data structures, including text indexes, membership and range supporting spatial data structures…

cs.DS2015★ 1 cited

A Bloom filter based semi-index on -grams

Szymon Grabowski, Robert Susik, Marcin Raniszewski

We present a simple -gram based semi-index, which allows to look for a pattern typically only in a small fraction of text blocks. Several space-time tradeoffs are presented. Exp…

cs.DS2015

FM-index for dummies

Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz

The FM-index is a celebrated compressed data structure for full-text pattern searching. After the first wave of interest in its theoretical developments, we can observe a surge of…

cs.DS2014

Sampling the suffix array with minimizers

Szymon Grabowski, Marcin Raniszewski

Sampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claude et al. showed an alphabet sampli…

cs.DS2014★ 3 cited

Two simple full-text indexes based on the suffix array

Szymon Grabowski, Marcin Raniszewski

We propose two suffix array inspired full-text indexes. One, called SA-hash, augments the suffix array with a hash table to speed up pattern searches due to significantly narrowed…