Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/3710
Title: Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes
Authors: Urbanovich, D.
Ajtkulov, P.
Issue Date: 2011
Publisher: St. Petersburg University Press
Citation: Urbanovich D. Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes / D. Urbanovich, P. Ajtkulov / Web of Data: The joint RuSSIR/EDBT 2011 Summer School, August 15–19, 2011, Proceedings of the Fifth Russian Young Scientists Conference in Information Retrieval / B. Novikov, P. Braslavsky (Eds.). — St. Petersburg, 2011 — P. 40-45.
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 algorithm under certain constraints. We propose that this algorithm could be useful in real-life database applications.
Keywords: DYNAMIC EXTENDED SUFFIX ARRAY
STRING MATCHING
TEXT INDEX
URI: http://hdl.handle.net/10995/3710
http://elar.urfu.ru/handle/10995/3710
Conference name: V Russian Summer School in Information Retrieval (RuSSIR’2011)
V Российская летняя школа по информационному поиску (RuSSIR’2011)
EDBT Summer Schools
Conference date: 15.08.2011–19.08.2011
ISBN: 978-5-288-05225-5
Origin: RuSSIR/EDBT2011
Appears in Collections:Информационный поиск

Files in This Item:
File Description SizeFormat 
RuSSIR_2011_04.pdf110,69 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.