libgist v.2.0/amdb v.1.0
Welcome to the combined release libgist v.2.0 and amdb v.1.0.
Libgist is an implementation of the Generalized Search Tree, a
template index structure that makes it easy to implement any type of
hierarchical access method (AM).
Its features include:
- facilitates implementation of new AMs by letting the implementor
extend the core
libgist classes with a class that encapsulates the high-level, data-oriented
aspects of a particular AM
- comes prepackaged with
extensions for B-trees, R-trees, R*-trees, SS-trees and SR-trees
- designed to be a simple, low-overhead library that can be easily incorporated
into applications that need fast access to the data they manage
-
uses regular
files for storage purposes and supports single-user access without transactional
behavior
- written in C++ (with the GNU g++ compiler) and highly portable
Amdb is a graphical tool that facilitates the design and tuning
process for height-balanced tree-structured AMs (such as those captured by
GiST). Its features include:
- a suite of
graphical views to
visualize the entire search tree, paths and subtrees within the tree,
and data contained in the tree
- graphical animation of index search, insert and delete operations
- an analysis framework
that provides metrics that characterize the performance of
queries, the tree structure, and the structure-shaping aspects of an
AM implementation
- integration of the framework's performance metrics with the visualization
tools
- based on libgist, written in Java and highly portable
The combination of performance metrics and visualization tools allows an AM
designer to locate and investigate sources of performance loss in a particular
AM.
Table of Contents
Related Material
Comments, questions and suggestions may be directed to gist@postgres.berkeley.edu
Last modified: $Date: 2001/03/21 22:01:41 $ by $Author: mct $.