Show simple item record

dc.contributor.advisorMacLennan, Bruce J.
dc.contributor.authorFutaci, Suha.
dc.dateJune 1982
dc.date.accessioned2012-11-20T00:08:35Z
dc.date.available2012-11-20T00:08:35Z
dc.date.issued1982-06
dc.identifier.urihttp://hdl.handle.net/10945/20318
dc.descriptionApproved for public release; distribution is unlimiteden_US
dc.description.abstractThis thesis is aimed at determining the worst case asymptotical time complexity behavior of algorithms for relational operations that work on extensionally or intensionally represented binary relations. Those relational operations come from a relational language being designed at Naval Postgraduate School. One particular extensional representation technique and two intensional representation techniques are proposed. The above analysis in turn determines the feasibility of implementing a subset of the relational language on conventional architectures.en_US
dc.description.urihttp://archive.org/details/representationte00futa
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsCopyright is reserved by the copyright owneren_US
dc.subject.lcshComputer scienceen_US
dc.titleRepresentation techniques for relational languages and the worst case asymptotical time complexity behaviour of the related algorithms.en_US
dc.typeThesisen_US
dc.contributor.secondreaderSmith, Douglas R.
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentComputer Science
dc.subject.authorcomplexity relationen_US
dc.description.serviceLieutenant (junior grade), Turkish Navyen_US
etd.thesisdegree.nameM.S. in Computer Scienceen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineComputer Scienceen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record