Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes
|
|
| Автор |
Urbanovich, D.
Ajtkulov, P. |
|
| Тематика |
DYNAMIC EXTENDED SUFFIX ARRAY
STRING MATCHING TEXT INDEX |
|
| Описание |
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. |
|
| Дата |
2011-10-12T09:55:32Z
2011-10-12T09:55:32Z 2011 |
|
| Тип |
Article
Journal article (info:eu-repo/semantics/article) Published version (info:eu-repo/semantics/publishedVersion) |
|
| Идентификатор |
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.
978-5-288-05225-5 http://elar.urfu.ru/handle/10995/3710 |
|
| Язык |
en
|
|
| Связанные ресурсы |
RuSSIR/EDBT2011
|
|
| Формат |
413595 bytes
application/pdf |
|
| Издатель |
St. Petersburg University Press
|
|