REntry Class Reference

[libgfc Index] [libgfc Hierarchy] [Headers]


Class for RTree entries More...

#include <src/rtentry.h>

Public Members


Detailed Description

Class for RTree entries.

Each RTree entry (or index record as in Guttman '84) consists of

two parts, one is the Key, the other a pointer. The Key is a

rectangle (using GRect) and is of type RTKey; the pointer is

defined by the RPtr class, which may contain a child node (page) id

or a real tuple id if the entry is in a leaf node.

The main methods for the REntry class includes those that compares

keys and such. Most of Key related methods has already been

implemented in our GRect class so no reinventing the wheel here.

Note that this class is the in-memory representation of an RTree

entry; before the entry goes to a disk, it has to be pack()'ed.

Similarly the unpack() function should be used when a node page

just loaded into memory.



Documentation generated by lqian@lqian-sun on Wed Jul 14 09:36:10 EDT 1999
Kdoc