Efficient indexing of hierarchical relational database records

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07412444

ABSTRACT:
According to various embodiments, systems, and methods, a sorting construct (TREE_SORT) is generated to efficiently traverse hierarchical data structures in relational databases. A TREE_SORT construct is generated by transforming a value that represents the sequential order of a given node relative to its siblings (Peer_Sequence) to a left-justified string of a given width. A TREE_SORT value for the parent of a given node is prepended to the left of the generated substring of the transformed Peer_Sequence value. As a result, a sorting construct of the parent node sorts before sorting constructs of child nodes.

REFERENCES:
patent: 5121493 (1992-06-01), Ferguson
patent: 5201048 (1993-04-01), Coulter et al.
patent: 6181678 (2001-01-01), Ha-Duong et al.
patent: 6185557 (2001-02-01), Liu
patent: 6334125 (2001-12-01), Johnson et al.
patent: 6480849 (2002-11-01), Lee et al.
patent: 6571244 (2003-05-01), Larson
patent: 6684222 (2004-01-01), Cornelius et al.
patent: 6957205 (2005-10-01), Liongosari
patent: 7069272 (2006-06-01), Snyder
patent: 2005/0065910 (2005-03-01), Welton et al.
Screen Shot for Mercury TestDirector 8.0, Mercury, Oct. 26, 2005.

LandOfFree

Say what you really think

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

Rating

Efficient indexing of hierarchical relational database records does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient indexing of hierarchical relational database records, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient indexing of hierarchical relational database records will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4019685

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