Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2011-01-11
2011-01-11
Colan, Giovanna (Department: 2162)
Data processing: database and file management or data structures
Database design
Data structure types
C707S956000, C712S008000, C712S300000
Reexamination Certificate
active
07870159
ABSTRACT:
A computer program product and associated algorithm for sorting S sequences of binary bits. The S sequences may be integers, floating point numbers, or character strings. The algorithm is executed by a processor of a computer system. Each sequence includes contiguous fields of bits. The algorithm executes program code at nodes of a linked execution structure in a sequential order with respect to the nodes. The algorithm executes a masking of the contiguous fields of the S sequences in accordance with a mask whose content is keyed to the field being masked. The sequential order of execution of the nodes is a function of an ordering of masking results of the masking. Each sequence, or a pointer to each sequence, is outputted to an array in the memory device whenever the masking places the sequence in a leaf node of the nodal linked execution structure.
REFERENCES:
patent: 3815038 (1974-06-01), Davis
patent: 4809158 (1989-02-01), McCauley
patent: 5440734 (1995-08-01), Wagar
patent: 5546390 (1996-08-01), Stone
patent: 5560007 (1996-09-01), Thai
patent: 5671406 (1997-09-01), Lubbers
patent: 5680607 (1997-10-01), Brueckheimer
patent: 5799184 (1998-08-01), Fulton et al.
patent: 5873078 (1999-02-01), Angle et al.
patent: 5924091 (1999-07-01), Burkhard
patent: 6128614 (2000-10-01), Mennemeier et al.
patent: 6144986 (2000-11-01), Silver
patent: 6373012 (2002-04-01), Crutchfield et al.
patent: 6381605 (2002-04-01), Kothuri et al.
patent: 6397216 (2002-05-01), Cattanach et al.
patent: 6519593 (2003-02-01), Matias et al.
patent: 6532457 (2003-03-01), Tal et al.
patent: 6553370 (2003-04-01), Andreev et al.
patent: 6564211 (2003-05-01), Andreev et al.
patent: 6571244 (2003-05-01), Larson
patent: 2002/0032681 (2002-03-01), Feldmeier et al.
patent: 2002/0143747 (2002-10-01), Tal et al.
patent: 2002/0165707 (2002-11-01), Call
patent: 2002/0174130 (2002-11-01), Wagner
patent: 2003/0004938 (2003-01-01), Lawder
patent: 2003/0051020 (2003-03-01), Kadam et al.
patent: 2003/0093565 (2003-05-01), Berger et al.
patent: 2003/0130981 (2003-07-01), Nehru et al.
patent: 2004/0032681 (2004-02-01), Smith et al.
Office Action (Mail Date Feb. 25, 2010) for U.S. Appl. No. 11/970,600, filed Jan. 8, 2008; Confirmation No. 3403.
Maus, Arne; ARL, a faster-in-place, cache friendly sorting algorithm; in NIK'2002—Norsk Informatikkonferanse, pp. 85-95.
Andersson, Arne et al.; Sorting in Linear Time?; Department of Computer Science, Lund University, Sweden, AMC, 1995; pp. 427-436.
Andersson, Arne et al.; A New Efficient Radix Sort; Department of Computer Science, Lund University, Sweden, AMC, 1994; 8 pages.
Notice of Allowance (mail date Nov. 12, 2008) for U.S. Appl. No. 11/473,288, filed Jun. 22, 2006; First Named Inventor Dennis J. Carroll; Confirmation No. 6602; Customer No. 30449.
Notice of Allowance (mail date Aug. 11, 2008) and Supplemental Notice of Allowability (mail date Nov. 18, 2008) for U.S. Appl. No. 11/011,930, filed Dec. 14, 2004; First Named Inventor Dennis J. Carroll; Confirmation No. 9521; Customer No. 30449.
Notice of Allowance (Mail Date Apr. 29, 2010) for U.S. Appl. No. 11/970,600, filed Jan. 8, 2008; Confirmation No. 3403.
Colan Giovanna
International Business Machines - Corporation
Pivnichny John R.
Schmeiser Olsen & Watts
LandOfFree
Algorithm for sorting bit sequences in linear complexity does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Algorithm for sorting bit sequences in linear complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm for sorting bit sequences in linear complexity will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2726136