| The GR-tree is an access method for general
bitemporal data. Here we provide the C++ source code for it. The
GR-tree is implemented as described in the VLDB'98 paper,
R-tree-based Indexing of Now-Relative Bitemporal Data [.ps.gz].
The source code provided here also implements the so-called
intermediate GR-tree, as well as the access methods based on the
R-tree and 2R-tree maximum-timestamp approaches. The implementation is
based on a debugged and revised version of GiST (Generalized
Search Tree) release 0.9beta1. |
| The source code compiles into a stand-alone
experimental testbed. This testbed provides commands for creating,
dropping, opening, and closing an index; for searching an index and
inserting and deleting data; for accumulating I/O statistics; for
calculating different properties of the tree (such as overlap,
deadspace, node fill factor); for logging certain internal workings of
index operations; for changing different parameters (e.g., page size,
size of simulated page buffer); for changing current time
value, etc. Example command files are provided together with the
source code. |
| The source code also includes the bitemporal workload generator
and the parameter files for this generator that were used when
performing experiments reported in the above-mentioned VLDB
paper. |
|
|
