Accession Number : ADA188196

Title :   Allocation of Database Files Across Parallel Stores for Efficient Processing of Partial-Match Queries.

Descriptive Note : Formal rept. Jan-May 87,

Corporate Author : NAVAL RESEARCH LAB WASHINGTON DC

Personal Author(s) : Bestul, Thor ; Jajodia, Sushil

PDF Url : ADA188196

Report Date : 27 Oct 1987

Pagination or Media Count : 12

Abstract : This report presents the results of research on the allocation of binary cartesian product database files across several stores (such as disks) which are accessible in parallel so that the average time required to perform the retrieval (by using several parallel accesses) of all buckets specified by a partial-match query is objective of constructing efficient packings of Hamming spheres in hypercubes. The viewpoint of binary cartesian product file allocation thus produced allowed in our research the creation of allocations for two particular sizes of the set of stores such that the average processing time for partial-match queries was smaller than that of the best allocation technique found in the literature for these same two cases. It also provides a framework in which good allocations for other particular sizes of the set of stores, and possibly for general sets of stores, might be found.

Descriptors :   *ALLOCATIONS, *DATA BASES, *COMPUTER FILES, DISKS, EFFICIENCY, PACKAGING, SPHERES, THESES, TIME, INTERROGATION, STORES, ACCESS, INFORMATION RETRIEVAL

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE