Elements of Data Management Systems
ACM Computing Surveys (CSUR)
Hierarchical Data-Base Management: A Survey
ACM Computing Surveys (CSUR)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM - Special 25th Anniversary Issue
Analysis and performance of inverted data base structures
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Self-Study Questions & Answers
IEEE Annals of the History of Computing
Some techniques and trade-offs affecting large data base retrieval times
ACM '69 Proceedings of the 1969 24th national conference
A technique for implementing a set processor
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
DIAM II: The binary infological level and its database language - FORAL
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
A relational model of data for large shared data banks
Software pioneers
A graduate course in database management
ACM SIGMOD Record
Data base system objectives as design constraints
ACM SIGMIS Database
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Data base system objectives as design constraints
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
DATAPLUS: a language for real time information retrieval from hierarchical data bases
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Requirements for the development of computer-based urban information systems
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
The ADEPT-50 time-sharing system
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Incorporating complex data structures into a language for social science research
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Data structures and accessing in data-base systems: II information organization
IBM Systems Journal
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
Data definition standardization
SIGFIDET '70 Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
A data base sublanguage founded on the relational calculus
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.03 |
An important consideration in the design of programming systems for the management of large files of data is the method of treating hierarchical data (that is, data among which logical relationships exist at more than two levels). Recent systems have accomplished this by simply duplicating some essential item of data at several levels. Such duplication makes the storage of even small data bases inefficient; for large masses of data, storage becomes economically unfeasible. Other systems have provided the means to specify and construct hierarchies, but none have provided language that affords control over retrieval and output levels, and control over the scope of output. Within the Time-Shared Data Management System (TDMS), currently being produced at System Development Corporation, a method has been devised for maintaining hierarchical associations within logical entries of a data base. Basically, the technique permits the automatic association of related data through a device known as a repeating group. The term “repeating group” is not new, but the TDMS treatment of the repeating group concept is. This paper describes how this technique is implemented in the language and tables of TDMS.