Representation techniques for relational languages and the worst case asymptotical time complexity behaviour of the related algorithms.
Loading...
Authors
Futaci, Suha.
Subjects
complexity relation
Advisors
MacLennan, Bruce J.
Date of Issue
1982-06
Date
June 1982
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
This 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.
Type
Thesis
Description
Series/Report No
Department
Computer Science
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner