Buch, Englisch, 92 Seiten, Paperback, Format (B × H): 187 mm x 235 mm
Buch, Englisch, 92 Seiten, Paperback, Format (B × H): 187 mm x 235 mm
Reihe: Synthesis Lectures on Data Management
ISBN: 978-1-60845-795-3
Verlag: MORGAN & CLAYPOOL
This book is about large-scale construction and usage of full-text indexes. We focus mainly on suffix trees, and show efficient algorithms that can convert suffix trees to other kinds of full-text indexes and vice versa. There are four parts in this book. They are a mix of string searching theory with the reality of external memory constraints. The first part introduces general concepts of full-text indexes and shows the relationships between them. The second part presents the first series of external-memory construction algorithms that can handle the construction of full-text indexes for moderately large strings in the order of few gigabytes. The third part presents algorithms that scale for very large strings. The final part examines queries that can be facilitated by disk-resident full-text indexes.
Autoren/Hrsg.
Weitere Infos & Material
- Structures for Indexing Substrings
- External Construction of Suffix Trees
- Scaling Up: When the Input Exceeds the Main Memory
- Queries for Disk-based Indexes
- Conclusions and Open Problems