Aaron Finerman
Pages 609-611
In a document retrieval, or other pattern matching environment where stored entities (documents) are compared with each other or with incoming patterns (search requests), it appears that the best indexing (property) space is
…
G. Salton, A. Wong, C. S. Yang
Pages 613-620
This paper presents a data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists. SQUARE is based on the relational model of data, and is shown to be relationally complete …
Raymond F. Boyce, Donald D. Chamberlin, W. Frank King, Michael M. Hammer
Pages 621-628
The issue of program control structures has had a history of heated controversy. To put this issue on a solid footing, this paper reviews numerous theoretical results on control structures and explores their practical implications …
Henry F. Ledgard, Michael Marcotty
Pages 629-639
This paper describes a recovery scheme for syntax errors which provides automatically-generated high quality recovery with good diagnostic information at relatively low cost. Previous recovery techniques are summarized and empirical …
Susan L. Graham, Steven P. Rhodes
Pages 639-650
The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten the computation time in many cases …
James R. Bitner, Edward M. Reingold
Pages 651-656
This note discusses the reduction of the set basis problem to the clique cover problem.
Lawrence T. Kou, C. K. Wong
Pages 656-657
Pages 661-664
