An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A relational model of data for large shared data banks
Communications of the ACM
Surveyor's Forum: Related Information
ACM Computing Surveys (CSUR)
Surveyor's Forum: Related Information
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
A relational database management system has been implemented in the MUMPS language using a binary tree structure for storage of relations. Several examples are given to illustrate the available functions and commands. Some details of the data structure are given, and tradeoffs discussed. The system was intended for teaching and research and no attempt was made to optimize performance. Nevertheless, timing measurements are presented to show that the use of a MUMPS-like tree structure for relational database system implementation can yield performance which varies with the size of the operand relations in a manner similar to previously reported relational database implementations.