Algorithms for handling information on secondary media, like hard disks, CD-ROMs, etc., and try to minimize the number of page accesses in them.
Published in Chapter:
Indexing Textual Information
Ioannis N. Kouris (University of Patras, Greece), Christos Makris (University of Patras, Greece), Evangelos Theodoridis (University of Patras, Greece), and Athanasios Tsakalidis (University of Patras, Greece)
Copyright: © 2009
|Pages: 6
DOI: 10.4018/978-1-60566-026-4.ch302
Abstract
Information retrieval is the computational discipline that deals with the efficient representation, organization, and access to information objects that represent natural language texts (Baeza-Yates, & Ribeiro-Neto, 1999; Salton & McGill, 1983; Witten, Moûat, & Bell, 1999). A crucial subproblem in the information retrieval area is the design and implementation of efficient data structures and algorithms for indexing and searching information objects that are vaguely described. In this article, we are going to present the latest developments in the indexing area by giving special emphasis to: data structures and algorithmic techniques for string manipulation, space efficient implementations, and compression techniques for efficient storage of information objects. The aforementioned problems appear in a series of applications as digital libraries, molecular sequence databases (DNA sequences, protein databases [Gusûeld, 1997)], implementation of Web search engines, web mining and information filtering.