| Bringing data base technology to the programmer |
| Full text |
Pdf
(647 KB)
|
| Source
|
ACM SIGMOD Record
archive
Volume 6 , Issue 3 (1974)
table of contents
Pages: 2 - 15
Year of Publication: 1974
ISSN:0163-5808
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 7, Citation Count: 0
|
|
|
ABSTRACT
This paper reports work toward melding some ideas from data base management with currently popular views of structured programming. The basic idea is to allow all data structures used inside programs (instead of just those in an external data base) to be described at multiple conceptual levels by a separate definition. This approach brings to programmers the benefits of data independence and also allows structured programming to have its hitherto unrealized full effect on data.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
CODASYL, Data Base Task Group Report (April 71).
|
 |
2
|
|
| |
3
|
C. J. Date and P. Hopewell, File Definition and Logical Data Independence, <u>Proc. 1971 ACM SIGFIDET Workshop</u>, (Nov. 11--12, 1971) 117--138.
|
| |
4
|
P. J. Denning, Letter to the Editor, <u>SIGPLAN Notices 8</u>, 10 (Oct. 73) 5--6.
|
| |
5
|
E. W. Dijkstra, Notes on Structured Programming, <u>Structured Programming</u>, Academic Press (1972) 1--82.
|
| |
6
|
E. W. Dijkstra, Lectures at the Regional Conference on Programming Methodology, U. of New Mexico (Jan. 7--11, 1974).
|
 |
7
|
|
| |
8
|
J. Earley, On the Semantics of Data Structures, <u>Data Base Systems</u>, R. Rustin (Ed.), Prentice Hall (1972) 23--32.
|
| |
9
|
J. Earley, Relational Level Data Structures for Programming Languages, <u>Acta Informatica 2</u>, (1973) 293--309.
|
| |
10
|
J. Earley and P. Caizergues, VERS Manual Version 4, Computer Science Department, U. of California, Berkeley (Oct. 71).
|
 |
11
|
|
| |
12
|
B. Shnneiderman and P. Scheruerman, Structured Data Structures, Department of Computer Science, State U. of New York at Stony Brook (June 73)Technical Report No. 16.
|
 |
13
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|