EGIST: AN IMPROVED GENERALIZED SEARCH TREE

YANG Guogui. EGIST: AN IMPROVED GENERALIZED SEARCH TREEJ. Journal of Computer Research and Development, 2001, 38(3): 355-360.

Citation:

YANG Guogui. EGIST: AN IMPROVED GENERALIZED SEARCH TREEJ. Journal of Computer Research and Development, 2001, 38(3): 355-360.

Citation:

YANG Guogui. EGIST: AN IMPROVED GENERALIZED SEARCH TREEJ. Journal of Computer Research and Development, 2001, 38(3): 355-360.

Abstract

Object relational DBMSs （ ORDBMSs ） are designed to satisfy the demands of novel application domains by providing an extensible architecture and the domain specific component. So, providing an extensible access method is one of the important aspects of ORDBMSs. Based on the GiST（generalized search tree）, EGiST is presented. It can be used to implement the B + tree,RD Tree,K D tree,SS tree, and other kinds of search trees.

FullText(HTML)

Turn off MathJax

Article Contents

Export File