ScholarLens Back to search
2011•Electronic Archive of Ural Federal University (ELAR UrFU)Open access

Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes

D. Urbanovich, P. Ajtkulov

Open full text 1 citations

Abstract

Dynamic suffix array is a suffix data structure that reflects various patterns in a mutable string. Dynamic suffix array is rather convenient for performing substring search queries over database indexes that are frequently modified. We are to introduce an O(nlog2n) algorithm that builds suffix array for any string and to show how to implement dynamic suffix array using this\nalgorithm under certain constraints. We propose that this algorithm could be useful in real-life database applications.

Open-access reader

About this research paper

What this paper is about

Dynamic suffix array is a suffix data structure that reflects various patterns in a mutable string. Dynamic suffix array is rather convenient for performing substring search queries over database indexes that are frequently modified. We are to introduce an O(nlog2n) algorithm that builds suffix array for any string and to show how to implement dynamic suffix array using this\nalgorithm under certain constraints. We propose that this algorithm could be useful in real-life database applications.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Dynamic suffix array is a suffix data structure that reflects various patterns in a mutable string. Dynamic suffix array is rather convenient for performing substring search queries over database indexes that are frequently modified. We are to introduce an O(nlog2n) algorithm that builds suffix array for any string and to show how to implement dynamic suffix array using this\nalgorithm under certain constraints. We propose that this algorithm could be useful in real-life database applications.

Key concepts: Suffix array, Compressed suffix array, Substring, Suffix, Generalized suffix tree, Suffix tree, Computer science, String (physics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes — Research Paper | ScholarLens