Modeling Distributed Generalized Suffix Trees For Quick Data Access
| dc.contributor.advisor | Глибовець, Андрій | |
| dc.contributor.author | Діденко, Віра | |
| dc.date.accessioned | 2024-04-11T06:36:23Z | |
| dc.date.available | 2024-04-11T06:36:23Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | The aim of this work is to distribute generalized suffix tree construction, so the process is efficient in terms of time complexity and memory consumption. A distributed approach to constructing the suffix tree will allow working with large alphabets and very long strings that exceed the available memory capacity. In this work, an efficient and highly scalable algorithm for constructing generalized suffix trees on distributed parallel platforms was modeled. The experimental results proved that the modeled algorithm’s efficiency is no less than the before known Elastic Range algorithm (ERa) while out-performing ERa on specific data. | uk_UA |
| dc.identifier.uri | https://ekmair.ukma.edu.ua/handle/123456789/28846 | |
| dc.language.iso | en | uk_UA |
| dc.relation.organisation | НаУКМА | uk_UA |
| dc.status | first published | uk_UA |
| dc.subject | Background On Suffix Trees And Their Application | uk_UA |
| dc.subject | Suffix Tree Construction Algorithms | uk_UA |
| dc.subject | Construction Algorithm By Optimizing ERa | uk_UA |
| dc.subject | магістерська робота | uk_UA |
| dc.title | Modeling Distributed Generalized Suffix Trees For Quick Data Access | uk_UA |
| dc.type | Other | uk_UA |
Files
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: