Abstract
SETL is a set-theoretically oriented language of very high level whose repertoire of semantic objects includes finite sets, ordered n-tuples, and sets of ordered n-tuples usable as mappings. This paper describes the structure of an optimizer for this language. Among other methods of interest, the optimizer uses techniques which allow relations of inclusion and membership to be established, the domains and ranges of (tabulated) mappings to be estimated from above and below, and the single-valuedness of (tabulated) mappings to be proved. Once facts of this kind have been established, automatic choice of data structures becomes possible. The methods employed are based upon, and extend, known techniques of data flow analysis.
Keywords
Computer scienceTupleUSableSet (abstract data type)Programming languageTheoretical computer scienceData structureAlgorithmDiscrete mathematicsMathematics
Affiliated Institutions
Related Publications
The Grid file: A data structure designed to support proximity queries on spatial objects
Abstract : This document describes a technique for storing large sets of spatial objects so that proximity queries are handled efficiently as part of the accessing mechanism. Th...
Automatic evaluation of machine translation quality using longest common subsequence and skip-bigram statistics
In this paper we describe two new objective automatic evaluation methods for machine translation. The first method is based on longest common subsequence between a candidate tra...
Indexing by latent semantic analysis
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (...
ON THE THEORY OF BAGS
Abstract We introduce the bag structure as a set-like object in which repeated elements are significant. We discuss operations on bags such as intersection, union and addition. ...
Set-oriented mining for association rules in relational databases
Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpos...
Publication Info
- Year
- 1975
- Type
- article
- Volume
- 18
- Issue
- 12
- Pages
- 722-728
- Citations
- 57
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
57
OpenAlex
Cite This
Jacob T. Schwartz
(1975).
Automatic data structure choice in a language of very high level.
Communications of the ACM
, 18
(12)
, 722-728.
https://doi.org/10.1145/361227.361235
Identifiers
- DOI
- 10.1145/361227.361235