List update employing neutral sort keys

Details List update employing neutral sort keys List update employing neutral sort keys

2007-11-06

2007-11-06

Gaffin, Jeffrey (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

11106287

ABSTRACT:
A method, system and program product for updating a list. A first list associated with a first platform includes a first plurality of data entries which includes a first plurality and a second plurality of keys. A second list associated with a second platform includes a second plurality of data entries which includes a third plurality of keys, and which match the first plurality of data entries. The first plurality of keys is formed from a character set that includes a subset of characters that are sorted differently on the first and second platforms. The second plurality and third plurality of keys are formed from characters sorted identically on said first and second platforms. After the first list is updated, the lists are sorted and compared. The second list is updated, thereby providing a match between the first plurality and second plurality of data entries.

REFERENCES:
patent: 5710899 (1998-01-01), Eick
patent: 5737594 (1998-04-01), Williams
patent: 5745896 (1998-04-01), Vijaykumar
patent: 5806057 (1998-09-01), Gormley et al.
patent: 5978788 (1999-11-01), Castelli et al.
patent: 6078924 (2000-06-01), Ainsbury et al.
patent: 6115710 (2000-09-01), White
patent: 6424969 (2002-07-01), Gruenwald
patent: 6687688 (2004-02-01), Fujihara et al.
patent: 6704737 (2004-03-01), Nixon et al.
patent: 6959303 (2005-10-01), Rajasekaran et al.
patent: 7197498 (2007-03-01), Perloff
Goetz Graefe, Implementing sorting in database system, Sep. 2006, ACM Press, vol. 38, issue 3, pp. 1-37.
Leo J. Guibas et al., A new representation for linear list, 1977, ACM Press, pp. 49-60.
Peter Klier et al., On finding the closest matches in a fixed set, Mar. 1991, ACM Press, vol. 17, issue 1, p. 88-97.
John A. N. Lee et al., The definition and validation of the radix sorting technique, 1972, ACM Press, pp. 142-149.
Das et al.; Multi-Mesh—An Efficient Topology for Parallel Processing; 1995 IEEE; pp. 17-21; Electronics Unit, Indian Statistical Institute, Calcutta—700 035, India.
Morgado et al.; Adding Value to Key Issues Research Through Q-Sorts and Interpretive Structured Modeling; Communications of the Association for Information Systems, vol. 1, Article 3, Jan. 1999; pp. 1-24.
Das et al.; A New Network Topology With Multiple Meshes; 1999 IEEE Transactions on Computers, vol. 48, No. 5, May 1999; pp. 536-551.

Affiliated with

Also associated with

Rating

List update employing neutral sort keys does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with List update employing neutral sort keys, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List update employing neutral sort keys will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3853656