ACM Home Page
Please provide us with feedback. Feedback
Path expressions in databases
Full text PdfPdf (701 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems table of contents
Atlanta, Georgia
SESSION: Session 9 table of contents
Pages: 366 - 378  
Year of Publication: 1983
ISBN:0-89791-097-4
Author
Marc H. Graham  Georgia Institute of Technology, Atlanta, Georgia
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 1
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/588058.588101
What is a DOI?

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
{A} Armstrong, W.W "Dependency structures of data base relationships," IFIP 74, pp 580-583
2
 
3
{BH} Beeri, C, Honeyman, P "Preserving functional dependencies," to appear, SIAM J Comput
 
4
{BV} Beeri, C, Vardi, M.Y "A proof procedure for data dependencies," Technical Report, Dept. of Computer Science, the Hebrew University of Jerusalem, 1980
5
6
 
7
{G2} Graham, M.H. "More on Path Expressions," in preparation
8
9
10