Sorted-paged retrieval of hierarchical data from relational...

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

Reexamination Certificate

active

06898593

ABSTRACT:
A method for sorted-paged retrieval of hierarchical data from a relational database is disclosed, which includes the use of one or more relational table equi-join terms in a query to increase the retrieval efficiency, suitable restrictions imposed on the join terms to further increase the retrieval efficiency, partial de-normalization or replication of information to improve the efficiency of the join operation(s) and thus further increase the retrieval efficiency, and proper cursor management to keep track of the current location of the cursor(s) involved. As a result, specific pages of objects can be efficiently retrieved from a database, while the specified sort orders and restrictions imposed by the original retrieval requests can be maintained.

REFERENCES:
patent: 5412804 (1995-05-01), Krishna
patent: 6735593 (2004-05-01), Williams

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

Sorted-paged retrieval of hierarchical data from relational... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sorted-paged retrieval of hierarchical data from relational..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorted-paged retrieval of hierarchical data from relational... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3415672

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