Patent US3710659A successfully refreshed from Google Patents.
Patent US5619713A successfully refreshed from Google Patents.
US5619713A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for realigning database fields through the use of a crosspoint switch
Assignee: International Business Machines Corp
•
Filing: 1995-02-17
•
Granted: 1997-04-08
•
Expires: 2015-02-17
Abstract
Abstract A processor functioning as a coprocessor attached to a central processing complex provides efficient execution of the functions required for database processing: sorting, merging, joining, searching and manipulating fields in a host memory system. The specialized functional units: a memory interface and field extractor/assembler, a Predicate Evaluator, a combined sort/merge/join unit, a hasher, and a microcoded control processor, are all centered around a partitioned Working Store. Each functional unit is pipelined and optimized according to the function it performs, and executes its portion of the query efficiently. All functional units execute simultaneously under the control processor to achieve the desired results. Many different database functions can be performed by chaining simple operations together. The processor can effectively replace the CPU bound portions of complex database operations with functions that run at the maximum memory access rate improving performance on complex queries.
Inventors
- 👤 Richard I. Baum
- 👤 Glen A. Brent
- 👤 Donald H. Gibson
- 👤 David B. Lindquist
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 13:03
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/76; G06F15/78; G06F16/00; G06F16/20; G06F16/28; G06F16/284; F; F02; F02B; F02B75/00; F02B75/02; F02B2075/022; F02B2075/027; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934; Y10S707/99937; Y10S707/99941; Y10S707/99943; Y10S707/99951; Y10S707/99952
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
243 words
An apparatus for realigning database fields, comprising: mapping table means comprising a plurality of entries, each of the entries corresponding to a plurality of database records, wherein each of the entries comprises: a data realignment mask indicative of at least one byte within each of said plurality of database records; a first address of the database record in a first memory, said first address representing a source for said at least one byte within each of said plurality of database records; and a second address in a second memory, said second address representing a destination for said at least one byte within each of said plurality of database records; memory request means coupled to the mapping table means for reading one of the plurality of database records from the first memory address; first storage means, coupled to the memory request means, for storing the one of the plurality of database records; crosspoint switching means, coupled to the first storage means and the mapping table means, for realigning data from the one of the plurality of database records responsive to said data realignment mask; and second storage means, coupled to the crosspoint switching means, for receiving said realigned data from the crosspoint switching means and for providing said realigned data to the second memory at the second address, wherein said received data is realigned by said crosspoint switching means as said data is read from said first storage means to said second storage means.
Claim 2
Independent Claim
243 words
An apparatus for realigning database fields, comprising: mapping table means comprising a plurality of entries, each of the entries corresponding to a plurality of database records, wherein each of the entries comprises: a data realignment mask indicative of at least one byte within each of said plurality of database records; a first address of the database record in a first memory, said first address representing a source for said at least one byte within each of said plurality of database records; and a second address in a second memory, said second address representing a destination for said at least one byte within each of said plurality of database records; memory request means coupled to the mapping table means for reading one of the plurality of database records from the first memory address; first storage means, coupled to the memory request means, for storing the one of the plurality of database records; crosspoint switching means, coupled to the first storage means and the mapping table means, for realigning data from the one of the plurality of database records responsive to said data realignment mask; and second storage means, coupled to the crosspoint switching means, for receiving said realigned data from the crosspoint switching means and for providing said realigned data to the second memory at the second address, wherein said received data is realigned by said crosspoint switching means as said data is read from said first storage means to said second storage means.
Claim 3
Dependent Claim
115 words
An apparatus for realigning database fields as recited in claim 1, further comprising request queue means for receiving and queuing data realignment requests from a first processor; and control means, coupled to the request queue means and the mapping table means, for reading one of the data realignment requests from the request queue means and for addressing an entry in the mapping table means corresponding to a database record identified in the one of the data realignment requests; wherein the mapping table means further comprises third register means for receiving the entry addressed by the control means and wherein the crosspoint switching means is coupled to the mapping table means by the third register means.
Claim 4
Independent Claim
155 words
An apparatus for realigning database fields for use with a host computer having a system memory, said apparatus comprising: a mapping table comprising a plurality of entries, each of the entries corresponding to a plurality of database records, wherein each of the entries comprises: a control field for holding a data realignment bit mask indicative of at least one data byte within each of the plurality of database records; a first address field for holding a first address in a first memory; and a second address field for holding a second address in the system memory; a first buffer for storing database fields; a second buffer; and a crosspoint switch, coupled to the first buffer and the second buffer, and having a control input coupled to the mapping table so as to receive the data realignment mask, wherein said crosspoint switch realigns data as it is read from said first buffer to said second buffer.
Claim 5
Independent Claim
155 words
An apparatus for realigning database fields for use with a host computer having a system memory, said apparatus comprising: a mapping table comprising a plurality of entries, each of the entries corresponding to a plurality of database records, wherein each of the entries comprises: a control field for holding a data realignment bit mask indicative of at least one data byte within each of the plurality of database records; a first address field for holding a first address in a first memory; and a second address field for holding a second address in the system memory; a first buffer for storing database fields; a second buffer; and a crosspoint switch, coupled to the first buffer and the second buffer, and having a control input coupled to the mapping table so as to receive the data realignment mask, wherein said crosspoint switch realigns data as it is read from said first buffer to said second buffer.
References Cited (Backward Citations)
US3394731A
Cited
US3976980A
Cited
US3713107A
Cited
EP0066061A2
Cited
EP0070119A2
Cited
US4497039A
Cited
US4476524A
Cited
US4506326A
Cited
US4644471A
Cited
US4799152A
Cited
US4779182A
Cited
US4734877A
Cited
US4751635A
Cited
JPS6478369A
Cited
WO1989012277A1
Cited
US5187787A
Cited
US5187787B1
Cited
GB2235798A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-04-07 | 2000-10-07 | 2001-04-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-04-07 | 2004-10-07 | 2005-04-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-04-07 | 2008-10-07 | 2009-04-08 | $7700.00 | Window Closed / Lapsed |