POSITIONAL ACCESS OF ELEMENTS ON B-TREE INCLUDING INFORMATION

PURPOSE: Positional access of elements on a b-tree is provided to find out a predetermined position of the element on a leaf-level of the b-tree by subtracting a present count from an order position of a search data item and using a difference. CONSTITUTION: The elements in a root node of the b-tree...

Full description

Saved in:
Bibliographic Details
Main Author BAILEY, STEVEN J
Format Patent
LanguageEnglish
Korean
Published 08.12.2004
Edition7
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:PURPOSE: Positional access of elements on a b-tree is provided to find out a predetermined position of the element on a leaf-level of the b-tree by subtracting a present count from an order position of a search data item and using a difference. CONSTITUTION: The elements in a root node of the b-tree are estimated to the right side from the left side(52). A sub tree of the root node is selected based on a leaf-level count representing a number of leaf-level elements included in respective sub trees, and a process is dropped to the root node of the selected sub tree(76). An estimation step, a selection step, and a drop step are repeated until the leaf node of the b-tree is encountered(66). The element in the predetermined order position is found out from the leaf node depending on a total number of the elements stored in a relative position of the elements in the leaf node and other leaf node preceding the leaf node.
Bibliography:Application Number: KR20040039243