Tu Kun and Gu Nai-jie and Bi Kun and Liu Gang and Dong Wan-li
Distributed Splay Suffix Arrays A New Structure for Distributed String Search
3220 - 3224
2007
1
10
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/9022
https://publications.waset.org/vol/10
World Academy of Science, Engineering and Technology
As a structure for processing string problem, suffix
array is certainly widelyknown and extensivelystudied. But if the
string access pattern follows the “9010" rule, suffix array can not take
advantage of the fact that we often find something that we have just
found. Although the splay tree is an efficient data structure for small
documents when the access pattern follows the “9010" rule, it
requires many structures and an excessive amount of pointer
manipulations for efficiently processing and searching large
documents. In this paper, we propose a new and conceptually powerful
data structure, called splay suffix arrays (SSA), for string search. This
data structure combines the features of splay tree and suffix arrays into
a new approach which is suitable to implementation on both
conventional and clustered computers.
Open Science Index 10, 2007