Loading...
Please wait, while we are loading the content...
Similar Documents
Distributed Splay Suffix Arrays: A New Structure for Distributed String Search
| Content Provider | Semantic Scholar |
|---|---|
| Author | Nai-Jie, Gu Gang, Liu Wan-Li, Dong |
| Copyright Year | 2007 |
| Abstract | As a structure for processing string problem, suffix array is certainly widely-known and extensively-studied. But if the string access pattern follows the “90/10” 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 “90/10” 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. Keywords— suffix arrays, splay tree, string search, distributed |
| Starting Page | 3207 |
| Ending Page | 3211 |
| Page Count | 5 |
| File Format | PDF HTM / HTML |
| Volume Number | 1 |
| Alternate Webpage(s) | http://www.waset.org/journals/waset/v10/v10-112.pdf |
| Alternate Webpage(s) | http://waset.org/publications/9022/distributed-splay-suffix-arrays-a-new-structure-for-distributed-string-search |
| Alternate Webpage(s) | http://www.waset.org/journals/waset/v10/v10-22.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
