A view based near optimal design of pointer access structures in relational databases

Abstract

A methodology for choosing pointer access structures for a relational database is proposed. The methodology is based on the usage patterns of the database that are represented as views. The pointer access structures can be simple access structures, such as circular chains, pointer indexes, chains, and tree indexes, as well as compound access structures, such as a tree index pointing to a set of pointer indexes.<>