Database sort and merge apparatus with multiple memory arrays ha

Communications: electrical – Land vehicle alarms or indicators – Internal alarm or indicator responsive to a condition of the...

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3401462, 364DIG1, 3642592, 3642821, 364243, G06F 708

Patent

active

052108708

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.

REFERENCES:
patent: 3394731 (1968-07-01), Flusche et al.
patent: 3713107 (1973-01-01), Barsamian
patent: 4030077 (1977-06-01), Florence et al.
patent: 4476524 (1984-10-01), Brown et al.
patent: 4497039 (1985-01-01), Kitakami et al.
patent: 4506326 (1985-03-01), Shaw et al.
patent: 4644471 (1987-02-01), Kojima et al.
patent: 4734877 (1988-03-01), Sakata et al.
patent: 4779192 (1988-11-01), Torii et al.
patent: 4799152 (1989-01-01), Chuang et al.
Nikkei Electronics, Feb. 9, 1987, No. 414, by Torii et al, entitled "CPU Integrated Data Base Processor . . . Data Bases".
IBM Technical Disclosure Bulletin, vol. 31, No. 1, Jun. 1988, pp. 199-202, entitled "Improved Hash and Index Searching Tech . . . Memory" by G. Bozman et al.
IBM Technical Disclosure Bulletin, vol. 31, No. 1, Jun. 1988, pp. 219-225, entitled "Relational Assignments For Distributed Database Systems" by D. Connell et al.
IBM Technical Disclosure Bulletin, vol. 30, No. 5, Nov. 1987, entitled "Parallel Equi-Join Algorithm . . . Operations" by G. Pfister.
Computerworld Article, Jul. 27, 1987, "Britton Lee UnCorks Data Base Series".
IEEE Computer Society Press, Jul. 1986, pp. 1233-1244, "A Relational Database Machine Organization For Parallel Pipelined Query Execution" by Hirakawa et al.
1986 ACM 0-89791-191-1, pp. 239-250, "Query Processing in Main Memory Database Management Systems", by T. Lehman, et al.
1983 ACM 0362-5915, pp. 15-40, "Operational Characteristics of a Hardware Based Pattern Matcher" by R. Haskin et al.
1982 ACM 0-89791-066-4, pp. 39-47, "The 801 Minicomputer", by G. Radin.
IBM Technical Disclosure Bulletin, vol. 20, No. 7, Dec. 1977, entitled "Offset Value Coding" by W. M. Conner.
The Systems Programming Series-"Sorting and Sort Systems", by H. Lorin, Copyright 1975, pp. 59-86.
IBM Technical Disclosure Bulletin, vol. 15, No. 1, Jun. 1972, pp. 297-304, entitled "Arrangement to Speed Up Sort Merge by Using Multiple Compares and Exchanges", by F. Tsui et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Database sort and merge apparatus with multiple memory arrays ha does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Database sort and merge apparatus with multiple memory arrays ha, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Database sort and merge apparatus with multiple memory arrays ha will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1357869

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.