| org.h2.index |
|
Javadoc package documentation
Various table index implementations, as well as cursors to navigate in an index.
|
| Java Source File Name | Type | Comment |
| BaseIndex.java | Class | Most index implementations extend the base index. |
| BtreeCursor.java | Class | The cursor implementation for the b tree index. |
| BtreeHead.java | Class | The head page of a b-tree index. |
| BtreeIndex.java | Class | This is the most common type of index, a b tree index.
The index structure is:
- There is one
BtreeHead that points to the root page.
The head always stays where it is.
- There is a number of
BtreePage s.
|
| BtreeLeaf.java | Class | An outer page of a btree index.
Page format:
L { P(pointers) | D(data) } data.len { data[0].pos [data[0]], ... |
| BtreeNode.java | Class | An inner page of a b-tree index.
Page format:
N children.len children[0..len] data.len { data[0].pos [data[0]], ... |
| BtreePage.java | Class | An abstract b-tree page. |
| BtreePosition.java | Class | Represents a position of a b-tree index. |
| Cursor.java | Interface | A cursor is a helper object to iterate through an index.
For indexes are sorted (such as the b tree index), it can iterate
to the very end of the index. |
| FunctionCursor.java | Class | A cursor for a function that returns a result set. |
| FunctionIndex.java | Class | An index for a function that returns a result set. |
| HashCursor.java | Class | The cursor for a hash index. |
| HashIndex.java | Class | An index based on an in-memory hash map. |
| Index.java | Interface | An index. |
| IndexCondition.java | Class | A index condition object is made for each condition that can potentially use
an index. |
| IndexType.java | Class | |
| LinearHashBucket.java | Class | A index page of a linear hash index. |
| LinearHashCursor.java | Class | The cursor implementation for the linear hash index. |
| LinearHashEntry.java | Class | An index entry of a linear hash index. |
| LinearHashHead.java | Class | The head page of a linear hash index. |
| LinearHashIndex.java | Class | A linear hash index implementation. |
| LinkedCursor.java | Class | The cursor implementation for the linked index. |
| LinkedIndex.java | Class | A linked index is a index for a linked (remote) table. |
| MetaCursor.java | Class | An index for a meta data table. |
| MetaIndex.java | Class | The index implementation for meta data tables. |
| MultiVersionCursor.java | Class | The cursor implementation for the multi-version index. |
| MultiVersionIndex.java | Class | A multi-version index is a combination of a regular index,
and a in-memory tree index that contains uncommitted changes. |
| RangeCursor.java | Class | The cursor implementation for the range index. |
| RangeIndex.java | Class | An index for the SYSTEM_RANGE table. |
| ScanCursor.java | Class | The cursor implementation for the scan index. |
| ScanIndex.java | Class | The scan index is not really an 'index' in the strict sense, because it can
not be used for direct lookup. |
| TreeCursor.java | Class | The cursor implementation for a tree index. |
| TreeIndex.java | Class | The tree index is an in-memory index based on a binary AVL trees. |
| TreeNode.java | Class | Represents a index node of a tree index. |
| ViewCursor.java | Class | The cursor implementation of a view index. |
| ViewIndex.java | Class | This object represents a virtual index for a query. |