Method for accelerated sorting based on data format

Details Method for accelerated sorting based on data format Method for accelerated sorting based on data format

1999-07-19

2002-08-13

Corrielus, Jean M. (Department: 2172)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

06434560

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates in general to sorting techniques, and in particular, to a method for accelerated sorting based on data format.
2. Description of Related Art
It is well known in the art to sort data for various reasons, and a number of different sorting methods are known. Consider, for example, the well-known treatise by Donald E. Knuth, entitled “The Art of Computer Programming, Volume 3, Searching and Sorting”, Addison-Wesley Publishing Co., 1973. This treatise describes a number of different situations where sorting methods may be used, such as with lists, tables, trees, etc. It also describes a number of different sorting methods, such as quicksorts, merge sorts, etc.
It is not uncommon in the art for a first process to receive data from a second process and then sort the data before presenting it to a user. Unfortunately, the receiving process usually knows little about the received data, and thus tends to use the same sorting method, regardless of whether the received data is unsorted, partially sorted, or fully sorted. Obviously, this promotes sub-optimal performance, because the receiving process may spend unnecessary time in sorting data that does not need to be sorted.
What is needed then is a method for determining whether the data received by a process is either unsorted, partially sorted, or fully sorted, and selecting a sorting method (or not sorting) based on that determination. Such a method can result in substantial time savings and performance gains.
SUMMARY OF THE INVENTION
To overcome the limitations in the prior art described above, and to overcome other limitations that will become apparent upon reading and understanding the present specification, the present invention discloses a method, system, and article of manufacture for accelerated sorting based on data format, wherein the format is determined from known, derived, or empirical information indicating whether the data is an unordered format, in a partially ordered format, or in a fully ordered format, according to varying degrees of consistency or probability. Information used in making these determinations may include the receipt of an indicator from the sending process, the received data itself, a tracing or trending analysis performed on the received data, etc. Once a determination is made, more efficient sorting methods may be selected and used, or sorting may be avoided altogether.


REFERENCES:
patent: 4086628 (1978-04-01), Woodrum
patent: 5193207 (1993-03-01), Vander Vegt et al.
patent: 5204967 (1993-04-01), Armstrong
patent: 5551018 (1996-08-01), Hansen
patent: 5563997 (1996-10-01), Fisher
patent: 5604851 (1997-02-01), Taylor
patent: 5615366 (1997-03-01), Hansen
patent: 5634009 (1997-05-01), Iddon et al.
patent: 5813004 (1998-09-01), Meck et al.
patent: 5960435 (1999-09-01), Rathmann et al.
patent: 6035296 (2000-03-01), Fushinmi
patent: 6199064 (2001-03-01), Schindler
patent: 60-168261 (1985-08-01), None
patent: 01-114939 (1989-10-01), None
patent: 05-303484 (1993-11-01), None
patent: 10-228384 (1998-08-01), None
patent: WO 98/29835 (1998-07-01), None
Brigner, P., “Creating Signed, Persistant Java Applets”, Dr. Dobb's Journal, vol. 24, No. 2, 82, 84-88, Feb. 1999 (Abstract only 1pp.).
Gustavson, R., “CGI-ROM: Servers on a Disc and Other Web/CD Intersections”, Emedia Professional, vol. 11, No. 3, pp. 43-44, 46-48, 50, 52, Mar. 1998 (Abstract only 1pp.).
Gulesian, M., “Plugging into the Web”, DBMS, vol., 9, No. 13, pp. 69-70, 72, Dec. 1996 (Abstract only 1pp.).
Kostler, G. et al., “Client-server Optimization for Multimedia Document Exchange”, Database Systems for Advance Applications '97. Proceedings of the Fifth International Conference, pp. 135-144, Published: Singapore, 1997, xvii+542pp (Abstract only 1pp.).
Robicheaux, M., “Client/Server/Web: Extending Your Reach”, Object Magazine, pp. 51-53, Jul. 1996 (Abstract only 1pp.).
Law, KCK et al., “Web-Enabling Legacy Applications”, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No. 98TB100250), pp. 218-225 IEEE Computer Soc. (Abstract only 1pp.).
Bisson, S., “Making an ASP of Yourself”, Application Development Advisor, vol. 1 No. 5, 62, 64-65, May-Jun. 1998 (Abstract only 1pp).
Hu, JC et al., “Measuring the Impact of Event Dispatching and Concurrency Models on Web Server Performance Over High-speed Networks”, Dept. of Computer Sci., Washington Univ., St. Louis, MO, USA, GLOBECOM 97. IEEEE Global Telecommunications Conference, Conference Record, (Cat No. 97CH36125), Pt. vol. 3, pp. 1924-1931, 1997, (Abstract only 1pp.).
Dreher C., “A Client-side Save Method in Java”, WEB Techniques, vol. 3, No. 2, pp. 67-71, Feb. 1998 (Abstract only 1pp.).
Carroll E et al., “Database Programming with JDBC”, WEB Techniques, vol. 1, No. 7, pp. 45-46, 48-50, Oct. 1996, (Abstract only 1pp.).
Oney W, “Porting from DOS to windows”, Dr. Dobb's Journal, vol. 19, No. 3, pp. 82, 84-85, 88-94, 98, 100, Mar. 1994, (Abstract only 1pp.).
Beiser K, “Getting “Grabby”. Offline Web Browsing”, Online, vol. 21, No. 2, pp. 20-22, 24-27, Mar. 1997, (Abstract only 1pp.).
Voigt K, “Reasoning About Changes and Uncertainty in Browser Customization”, AI Applications in Knowledge Navigation and Retrieval, Papers from the 1995 AAAI Fall Symposium (Tech. Report FS-95-03), pp. 136-141, (Abstract only 1pp.).
Calcote J, “Thread Pools and Server Performance”, Dr. Dobb's Journal, vol. 22, No. 7, pp. 60, 62-64, 86-89, Jul. 1997, (Abstract only 1pp.).
Gravano L. et al., “Merging Ranks from Heterogeneous Internet Sources”, Proceedings of the Twenty-Third International Conference on Very Large Databases, pp. 196-205, Published: San Francisco, CA, USA, 1997, xvi+59 pp. (Abstract only 1pp.).
Liu Haiya et al, “A Multicontext Logic Used for Integrating heterogeneous Databases”, Journal of Software, vol. No. 8, No. 9, pp. 687-693, Sep. 1997, (Abstract only 1pp.).
Binkley J. et al., “Rama: An Architecture for Internet Information Filtering”, Journal of Intelligent Information Systems: Integrating Artificial Intelligence and Database Technologies, vol. 5, No. 2, pp. 81-99, Sep. 1995, (Abstract only 1pp.).
Kelehr P et al, “TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems”, Proceedings of the Winter 1994 USENIX Conference, pp. 115-132, Published: Berkeley, CA USA, 1994, 372.pp. (Abstract only 1pp.).

Affiliated with

Also associated with

Rating

Method for accelerated sorting based on data format does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for accelerated sorting based on data format, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for accelerated sorting based on data format will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2948320