Parallel searching technique

• US 5,884,303 A
• Filed: 02/06/1997
• Issued: 03/16/1999
• Est. Priority Date: 03/15/1996
• Status: Expired due to Term

• Current Assignee: International Computers Limited (Fujitsu Limited)
• Original Assignee: International Computers Limited (Fujitsu Limited)
• Inventors: Brown, Anthony Peter Graham
• Primary Examiner(s): Lintz, Paul R.
• Assistant Examiner(s): Corrielus, Jean M.
• Application Number:
  US08/796,257
• Time in Patent Office: 768 Days
• Field of Search: 707/2, 707/10, 707/3
• US Class Current: 707/779
• CPC Class Codes: G06F 16/24532 of parallel queries
• CPC Class Codes: Y10S 707/954 Relational
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

A parallel query manager accepts a list of file extents to be searched and produces a number of search lists, one for each disk to be searched. The query manager first uses a mapper to find out how the database spaces are stored on disk. It then matches the search extent list with the mapping information to determine which parts of which disks are to be searched. It then initiates several searches in parallel so that all the affected disks can be kept busy at the same time. The query manager then checks for return data on each stream, and merges the results.

Claims

1. A data processing system comprising:

(a) a plurality of data storage units;

(b) a plurality of search units for performing searches on respective ones of said data storage units in parallel;

(c) an application which generates a search request specifying a list of data areas to be searched within one or more files;

(d) means for creating a mapping table, indicating the way in which the files are mapped on to the data storage units;

(e) means for utilising said list of data areas and said mapping table to create a plurality of search lists, one for each of the data storage units, each search list identifying data areas, or parts thereof, that are mapped on to a respective one of the data storage units; and

(f) means for passing said search lists to respective ones of said search units, along with requests to initiate searches on said data areas identified in the search lists.

2. A data processing system according to claim 1 wherein said means for utilising said list of data areas and said mapping table to create a plurality of search lists comprises:

(a) computer means for performing an outer program loop, in respect of each of said data storage units, and an inner program loop in respect of each of said files; and

(b) means within said inner program loop for finding the data areas or parts thereof within a particular target file that map on to a particular target disk.

3. A data processing system according to claim 1 further comprising means for merging the results of said plurality of searches and for returning the merged results to said application.

4. A data processing system according to claim 1 wherein said application is a relational database management system.

5. A data processing system according to claim 1 wherein said data storage units are magnetic disk storage units.

6. A data processing system according to claim 1 wherein said means for creating a mapping table is resident within the operating system of the data processing system.

7. A data processing system according to claim 1 wherein said search units comprise search accelerator units.