This paper examines the effect of batching search requests in the Interpolation Search Algorithm on ordered tables in main-memory as well as in a more typical database environment, i.e. a blocked secondary memory. Experiments are performed on several hybrid interpolation search algorithms over non-uniformly distributed data. The effect of batching on these algorithms is examined in terms of algorithms, analysis and experiments. Algorithms, analytic expressions and experimental results of these extensions are given and described. Analytic expressions of these algorithms are validated by experiments.

Current methods of evaluating nested queries in the SQL language can be inefficient in a variety of query and data base contexts. Previous research in the area of nested query optimization which sought methods of reducing evaluation costs is summarized, including a classification scheme for nested queries, algorithms designed to transform each type of query to a logically equivalent form which may then be evaluated more efficiently, and a description of a major bug in one of these algorithms. Further examination reveals another bug in the same algorithm. Solutions to these bugs are proposed and incorporated into a new transformation algorithm, and extensions are proposed which will allow the transformation algorithms to handle a larger class of predicates. A recursive algorithm for processing a general nested query is presented and the action of this algorithm is demonstrated. This algorithm can be used to transform any nested query.

The purpose of this paper is to summarize the research issues of statistical and scientific databases (SSDB's). It organizes the issues into four major groups: physical organization and access methods, operators, logical organization and user interfaces, and miscellaneous issues. It emphasizes the differences between SSDB's and traditional database applications, and motivates the need for new and innovative techniques for the support of SSDB's. In addition to describing current work in this field, it discusses open research areas and proposes possible approaches to their solution.

In this extended abstract we will discuss some of the difficulties of managing statistical/scientific databases (SSDBs) using most of the commercially available database management systems (DBMSs)and statistical packages. The most important requirements of SSDB management will also be presented.

One of the most difficult tasks in database design is the collection of relevant information needed for database design. This information can be separated into two categories: information about the processes which use, modify or produce the data, and information about the data which is used, modified, or produced by the processes. This paper describes a "forms" oriented requirements specification facility as a formal means for capturing the information crucial for database design. Both kinds of information are expressible by the proposed structured forms specification. Furthermore, not only the application usage, but also the integrity constraints that must be maintained in the database can be captured in a concise, unambiguous and machine manipulable manner. The concepts underlying the forms approach are few and simple, hence it is easy to use for the database designer and can be understood by non-computer specialists. This facilitates the cooperation from users to participate in the specification of database application requirements.

No abstract available.

TAXIS, a language for the design of interactive information systems (e.g., credit card verification, student-course registration, and airline reservations) is described. TAXIS offers (relational) database management facilities, a means of specifying semantic integrity constraints, and an exception-handling mechanism, integrated into a single language through the concepts of class, property , and the IS-A (generalization) relationship . A description of the main constructs of TAXIS is included and their usefulness illustrated with examples.

This paper describes TAXIS, a language for the design of Interactive Information Systems (e.g., credit card varification, student-course registration and airline reservations). TAXIS offers (relational) database management facilities, a means of specifying semantic integrity constraints and an exception-handling mechanism, integrated into a single language through the concepts of class, property and the ISA (generalization) relationship. The paper includes a description of the main constructs of TAXIS and illustrates their usefulness with examples.