Welcome to the InfoSci Platform
Component-Based Generalized Database Index Model

Component-Based Generalized Database Index Model

Ashraf Gaffar
Copyright: © 2005 |Pages: 6
ISBN13: 9781591405603|ISBN10: 1591405602|EISBN13: 9781591407959
DOI: 10.4018/978-1-59140-560-3.ch015
Cite Chapter Cite Chapter

MLA

Gaffar, Ashraf. "Component-Based Generalized Database Index Model." Encyclopedia of Database Technologies and Applications, edited by Laura C. Rivero, et al., IGI Global, 2005, pp. 87-92. https://doi.org/10.4018/978-1-59140-560-3.ch015

APA

Gaffar, A. (2005). Component-Based Generalized Database Index Model. In L. Rivero, J. Doorn, & V. Ferraggine (Eds.), Encyclopedia of Database Technologies and Applications (pp. 87-92). IGI Global. https://doi.org/10.4018/978-1-59140-560-3.ch015

Chicago

Gaffar, Ashraf. "Component-Based Generalized Database Index Model." In Encyclopedia of Database Technologies and Applications, edited by Laura C. Rivero, Jorge Horacio Doorn, and Viviana E. Ferraggine, 87-92. Hershey, PA: IGI Global, 2005. https://doi.org/10.4018/978-1-59140-560-3.ch015

Export Reference

Mendeley
Favorite

Abstract

The performance of a database is greatly affected by the performance of its indexes. An industrial quality database typically has several indexes associated with it. Therefore, the design of a good quality index is essential to the success of any nontrivial database. Parallel to their significance, indexed data structures are inherently complex applications that require a lot of effort and consume a considerable amount of resources. Index frameworks rely on code reuse to reasonably reduce the costs associated with them (Lynch & Stonebraker, 1988; Stonebraker, 1986). Generalized database systems have further addressed this challenge by offering databases with indexes that can be adjusted to different data/key types, different queries, or both. The generalized search tree (GiST; Hellerstein, Naughton, & Pfeffer, 1995; Hellerstein, Papadimitriou, & Koutsoupias, 1997) is a good example of a database system with a generalized index, or generalized index database for simplicity. Additional improvements extended the concept of generalized index databases to work on different domains by having generalized access methods (search criteria). For example, based on the work of Hellerstein et al. (1995), Aoki (1998) provides a generalized framework that allows users to adjust the index to different search criteria like equality, similarity, or nearest neighbor search. This makes the database system customizable to not only finding the exact records, but also to finding records that are “similar” or “close” to a given record. Users can customize their own criteria of “similarity” and let the index apply it to the database and return all “similar” results. This is particularly important for more challenging domains like multimedia applications, where there is always the need to find a “close image,” a “similar sound,” or “matching fingerprints.”

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.