DocumentCode :
2885868
Title :
A view based near optimal design of pointer access structures in relational databases
Author :
Gündem, Taflan ; Ecklund, Earl F., Jr.
Author_Institution :
Dept. of Comput. Eng., Bogazici Univ., Istanbul, Turkey
fYear :
1990
fDate :
7-9 Mar 1990
Firstpage :
539
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
Keywords :
relational databases; chains; circular chains; compound access structures; pointer access structures; pointer indexes; relational databases; tree indexes; view based near optimal design; Algebra; Approximation algorithms; Design methodology; Design optimization; Graphics; Mathematics; Notice of Violation; Operations research; Relational databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location :
Miami Beach, FL
Print_ISBN :
0-8186-2035-8
Type :
conf
DOI :
10.1109/PARBSE.1990.77205
Filename :
77205
Link To Document :
بازگشت