Computer method and storage structure for storing and...

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 12/02 (2006.01) G06F 17/30 (2006.01)

Patent

CA 2117846

A computer method and storage structure for storing and accessing multidimensional data is provided. A tree manager provided by the present invention stores data such as pointers, variable length data records, other B-trees, and directories, in a Multidimensional B-tree (MDB-tree). An MDB-tree has an imbedded "parent-child" structure which allows subtrees to be stored within nodes. The subtrees contain subnodes, which, in turn, may contain subtrees. The nodes are indexed by a primary key value while the subnodes in a subtree are indexed by secondary key values. Nodes of a MDB-tree contain a key value table, a subnode table, and a data area. When the tree manager attempts to store a unit of data on a page and the unit of data is too large for the page, the tree manager attempts to split a node currently stored on the page (or the unit of data being inserted) into a subnode and a subtree. The subtree is then stored on a new page. If the unit of data cannot be split into a subnode and a subtree, then one or more of the node currently stored on the page are moved to a new page.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Computer method and storage structure for storing and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computer method and storage structure for storing and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer method and storage structure for storing and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1940036

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.