Jean E. Sammet
Pages 549-550
The functional approach to database design is introduced. In this approach the goal of design is to derive a data structure which is capable of supporting a set of anticipated queries rather than a structure which “models the …
Rob Gerritsen
Pages 551-557
This paper describes a high level and nonprocedural translation definition language, CONVERT, which provides very powerful and highly flexible data restructuring capabilities. Its design is based on the simple underlying concept …
Nan C. Shu, Barron C. Housel, Vincent Y. Lum
Pages 557-567
An approach for implementing a “smart” interface to support a relational view of data is proposed. The basic idea is to employ automatic programming techniques so that the interface analyzes and efficiently refines the high level …
John Miles Smith, Philip Yen-Tang Chang
Pages 568-579
The relational model of data, the XRM Relational Memory System, and the SEQUEL language have been covered in previous papers and are reviewed. SEQUEL is a relational data sublanguage intended for ad hoc interactive problem solving …
M. M. Astrahan, D. D. Chamberlin
Pages 580-588
Consider two linearly ordered sets
A, B, |
A | =
m, |
B | =
n, m ≤
n, and
p, p ≤
m, parallel processors working synchronously. The paper presents an algorithm for merging
A and
B with the
p parallel processors, which requires …
Fănică Gavril
Pages 588-591
The solution of separable closed queueing networks requires the evaluation of homogeneous multinomial expressions. The number of terms in those expressions grows combinatorially with the size of the network such that a direct …
M. Reiser, H. Kobayashi
Pages 592-593
Pages 598-601
