This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献
OSQL is the object-oriented database language developed for the Iris object-oriented database management system at Hewlett-Packard Laboratories. Its three fundamental constructs are objects, types, and functions. This paper provides an overview of the underlying concepts and some important features of OSQL. 相似文献
Maximizing the satisfaction of a value in an engineering design is usually limited by tradeoffs in which other values become unacceptably sacrificed. In a few cases, however, the maximization is limited by a boundary between what is mathematically possible and what is not. Round wheels, vertical pillars, and binary memory elements are examples of optimum engineering structures which result from such mathematical limits. It is proposed that optimum characteristics of a language data model result similarly by minimizing the variety of primitive data objects, the complexity of those objects, and the number of objects needed to represent data states. Reducing these measures is needed to combine both rich data structure and powerful operations in one language. The minimizations lead to a narrow range of designs for language semantics in which the potential advantages of specialization is small compared with the advantages of commonality. Universal language for support of technical literacy appears to be an appropriate scope of generality in language design. 相似文献