No abstract available.
Proceeding Downloads
Normalized data base structure: a brief tutorial
Casual and other users of large formatted data bases need a simple tabular (relational) view of the data rather than a network or tree-structured view. This paper illustrates the removal of repeating groups, hierarchic and plex structures, and cross-...
Unacceptable file operations in a relational data base
This paper is written within the context of a relational data base model as presented by E. F. Codd in [1]. It also serves as a companion paper to his paper [2].
The central thesis is that a file operation should not produce unexpected 'side effects' in ...
A data base sublanguage founded on the relational calculus
Three principal types of language for data base manipulation are identified: the low-level, procedure-oriented (typified by the CODASYL-proposed DML), the intermediate level, algebraic (typified by the Project MAC MacAIMS language), and the high level, ...
File definition and logical data independence
This paper presents an architecture for a data base system which is capable of providing data independence at two levels, viz physical and logical. The architecture employs a schema, which gives an abstract picture of the physical data base, and a ...
Storage structure and physical data independence
This paper presents the results of an investigation into the feasibility of physical data independence in a data base system. In theory physical data independence may be achieved by providing a picture of the data which remains invariant as the ...
Storage optimization of tree structured files representing descriptor sets
It is shown that the total node requirements for tree structured files can be minimized without significantly affecting the search time. However, search times are determined primarily by type of use, and the particular implementation of tree structured ...
Binary B-trees for virtual memory
A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keys can be done in time proportional to log N where N is the cardinality of the data-set. Binary B-trees are a modification of B-...
A model for access control
The problems of authorization for a multiple-user resource sharing data processing system are discussed. The requirements for access of objects to other objects are covered in some detail. A model is then developed in which the above requirements are ...
Information retrieval with large-scale geographic data bases
There has been growing interest in dealing with large-seale geographic data bases because of the growing capacities of computer systems and because of the increasing interest in environmental and social systems. This paper outlines the problems ...
Cited By
-
Lemaitre J and Hainaut J (2011). Quality Evaluation and Improvement Framework for Database Schemas - Using Defect Taxonomies Active Flow and Combustion Control 2018, 10.1007/978-3-642-21640-4_40, (536-550),
-
Chang S and Liu C (1978). Modeling and Design of Distributed Information Systems Advances in Information Systems Science, 10.1007/978-1-4615-9056-9_3, (157-221),
- Stonebraker M A comparison of the use of links and secondary indices in a relational data base system Proceedings of the 2nd international conference on Software engineering, (527-531)
- Copeland G and Su S A high level data sublanguage for a context-addressed segment-sequential memory Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, (265-276)
- Chamberlin D and Boyce R SEQUEL Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, (249-264)
-
Fay G (1974). DPL ALPHA System and Codd's Cellular Space, Journal of Cybernetics, 10.1080/01969727408621684, 4:3, (97-110), Online publication date: 1-Jan-1974.