Title: Reduced cover-trees and their application in the sabre access path model
Abstract: In this paper we define a tree-structure, the reduced cover-tree (RCT), for implementing both classical indexes and multiattribute search structures and we outline its application in the data access model of the relational multi-processor data base machine SABRE. The kernel of this data access model is an RCT describing the placement of a relation that could be either a multi-attribute clustering scheme also used to - in some extent - substitute secondary indexes, or a non-dense unique key index. If the placement is achieved by multi-attribute clustering a unique key index can be nicely constructed with the same tree-structure. The RCT is represented by a bit-table in a most economic way and thus the number of accesses to memory when retrieval can be considerably cut down. On the average the memory occupation rate should turn about 75 per cent.
Publication Year: 1981
Publication Date: 1981-09-09
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot