List update employing neutral sort keys

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

2007-10-05

2008-11-18

Abel-Jalil, Neveen (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07454419

ABSTRACT:
A method for updating a list. A first list associated with a first platform includes a first plurality and a second plurality of keys. A second list associated with a second platform includes a third plurality of keys. The first and second platforms sort a first subset of characters differently. The second plurality and third plurality of keys are formed from a second subset of n characters sorted identically on the first and second platforms. An initial key in the first plurality of keys is converted to a neutral key to be included in the second plurality of keys by converting a character in the initial key to a number represented in a number system having a base b where n≧b. After the first list is updated, the lists are sorted and compared, and the second list is updated.

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: 5832497 (1998-11-01), Taylor
patent: 5852822 (1998-12-01), Srinivasan et al.
patent: 5870746 (1999-02-01), Knutson 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: 6701313 (2004-03-01), Smith
patent: 6704737 (2004-03-01), Nixon et al.
patent: 6947931 (2005-09-01), Bass et al.
patent: 6959303 (2005-10-01), Rajasekaran et al.
patent: 7165060 (2007-01-01), Foster et al.
patent: 7197498 (2007-03-01), Perloff
patent: 7293022 (2007-11-01), Murray
Goetz Graefe; Implementing Sorting in Database Systems; ACM Computing Surveys, vol. 38, No. 3, Article 10, Publication date: Sep. 2006; pp. 1-37.
Guibas et al.; A New Representation For Linear Lists; 1977; ACM Press; pp. 49-60.
Klier et al.; On Finding the Closest Bitwise Matches in a Fixed Set; ACM Transactions on Mathematical Software, vol. 17, No. 1; Mar. 1991; pp. 88-97.
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-4022250