DEVELOPING PARALLEL DATABASE SEARCH TECHNOLOGY USING LINDA(R)

MANAGEMENT AND SEARCH OF LARGE DATABASES IS A COMPUTATIONAL BOTTLENECK IN MANY DOMAINS. ONE ATTRACTIVE APPROACH TO ELIMINATING IT IS TO EXPLOIT RECENT ADVANCES IN PARALLEL COMPUTER HARDWARE AND PROCESSING. HOWEVER, THE DEVELOPMENT OF SOFTWARE THAT PERMITS THIS REPRESENTS ONE OF THE MAJOR CHALLENGES FACING COMPUTER SCIENTISTS. THIS PROJECT PROPOSES TO DEVELOP A GENERIC APPROACH TO PARALLEL DATABASE MANAGEMENT THAT SHOULD BE ESPECIALLY SUITABLE FOR LARGE DATABASES OF COMPLEX OBJECTS IN WHICH EVEN SINGLE OBJECT COMPARISONS MAY BE COMPUTATIONALLY COSTLY. (EXAMPLES INCLUDE DATABASES OF IMAGE DATA, IN WHICH DATABASE SEARCH MAY REQUIRE NUMEROUS COMPARISONS OF COMPLICATED IMAGES). OUR APPROACH IS BASED ON THE USE OF LINDA, A COMMERCIAL PRODUCT OF SCIENTIFIC COMPUTING ASSOCIATES, INC. LINDA SYSTEMS PROVIDE CONVENIENT ACCESS TO PARALLELISM FROM WITHIN FAMILIAR HIGH-LEVEL LANGUAGES SUCH AS C OR FORTRAN. IN PHASE I WE WILL DEVELOP A FAST TEXT RETRIEVAL SYSTEM FOR ASYNCHRONOUS MULTIPROCESSORS. THIS WILL SERVE AS PROOF OF CONCEPT FOR MORE GENERAL SOFTWARE TO BE INVESTIGATED IN PHASE II WORK. BECAUSE WE WILL USE LINDA, THE TECHNOLOGY DEVELOPED WILL BE NOT ONLY EFFICIENT, BUT ALSO PORTABLE ACROSS VASTLY DIFFERENT PARALLEL ARCHITECTURES INCLUDING BOTH EXPLICITLY PARALLEL COMPUTERS AND LOCAL-AREA NETWORKS OF WORKSTATIONS FUNCTIONING AS PARALLEL "HYPERCOMPUTERS".