Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Gray:1985:PRI, author = "P. M. D. Gray and P. Esslemont", title = "The performance of a relational interface to a {Codasyl} database", journal = j-COMP-J, volume = "28", number = "5", pages = "501--507", month = nov, year = "1985", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/28.5.501", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:19 MST 2012", bibsource = "Compendex database; Database/Wiederhold.bib; http://comjnl.oxfordjournals.org/content/28/5.toc; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/", URL = "http://comjnl.oxfordjournals.org/content/28/5/501.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/501.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/502.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/503.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/504.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/505.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/506.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/507.tif", acknowledgement = ack-nhfb, affiliation = "Univ of Aberdeen, Dep of Computing Science, Old Aberdeen, Scotl", affiliationaddress = "Univ of Aberdeen, Dep of Computing Science, Old Aberdeen, Scotl", classcodes = "C6160D (Relational databases)", classification = "723", corpsource = "Dept. of Comput. Sci., King's Coll., Aberdeen Univ., UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "ASTRID; ASTRID program generators; Codasyl database; CODASYL database; computer software --- Performance; database systems; generator; performance; program; relational databases; relational interface", remark = "Relational interface to a Codasyl Database is built and a generalized relational query processor is implemented. The query processor translates queries in relational algebra into Codasyl commands which choose optimal traversal paths. The performance of the query processor is analyzed.", treatment = "P Practical", }