Hierarchical table

Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S747000

Reexamination Certificate

active

07877394

ABSTRACT:
Various example embodiments are disclosed. According to one example embodiment, a method may include storing a plurality of database records, storing a value associated with each database record, receiving a request to sort the database records, sorting the database records, and sending a response message.

REFERENCES:
patent: 6438580 (2002-08-01), Mears et al.
patent: 6553370 (2003-04-01), Andreev et al.
patent: 6564225 (2003-05-01), Brogliatti et al.
patent: 7395206 (2008-07-01), Irwin et al.
patent: 2004/0243616 (2004-12-01), Benhase et al.
patent: 2005/0021538 (2005-01-01), Meyers et al.
Gurret, C. et al., “The Sort/Sweep Algorithm: A New Method for R-Tree Based Spatial Joins”, Proceedings of the 12th International Conference on Scientific and Statistical Database Management, Jul. 26, 2000, pp. 153-165.
Vaucher, J. G. “Building Optimal Binary Search Trees from Sorted Values in O(N) Time”, LNCS vol. 2635, Mar. 10, 2004, pp. 376-388.
Extended European Search Report for EP Application No. 09002788.9, mailed Nov. 25, 2009, 7 pages.

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

Hierarchical table does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Hierarchical table, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical table will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2655199

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