String algorithms and data structures

Details String algorithms and data structures String algorithms and data structures

2008-01-15

arxiv.org/abs/0801.2378v1

Computer Science

Data Structures and Algorithms

Scientific paper

The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and prefetching policies. The expertise nowadays required to design good string data structures and algorithms is therefore transversal to many computer science fields and much more study on the orchestration of known, or novel, techniques is needed to make progress in this fascinating topic. This survey is aimed at illustrating the key ideas which should constitute, in our opinion, the current background of every index designer. We also discuss the positive features and drawback of known indexing schemes and algorithms, and devote much attention to detail research issues and open problems both on the theoretical and the experimental side.

Affiliated with

Also associated with

No associations

Rating

String algorithms and data structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with String algorithms and data structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and String algorithms and data structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159280