NEW APPROACH TO THE MULTIPLE ATTRIBUTE TREE DATABASE ORGANIZATION

[[abstract]]Multiple attribute tree has been shown to be a very effective file structure for implementing a multiple attribute data base. A search directory has also been suggested. An alternative representation of the search directory is offered which is constructed from a multiple attribute tree based on the inverted list concept. Using simulation result, it is shown that inerted list representation is superior in terms of record retrieval time and the storage required by the search directory. In addition, each attribute can be equally efficiently used as a key for retrieval.[[fileno]]2030201010032[[department]]資訊工程學