WASET
	@article{(Open Science Index):https://publications.waset.org/pdf/9022,
	  title     = {Distributed Splay Suffix Arrays: A New Structure for Distributed String Search},
	  author    = {Tu Kun and  Gu Nai-jie and  Bi Kun and  Liu Gang and  Dong Wan-li},
	  country	= {},
	  institution	= {},
	  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.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {1},
	  number    = {10},
	  year      = {2007},
	  pages     = {3220 - 3224},
	  ee        = {https://publications.waset.org/pdf/9022},
	  url   	= {https://publications.waset.org/vol/10},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 10, 2007},
	}