Representation techniques for relational languages and the worst case asymptotical time complexity behaviour of the related algorithms.
MacLennan, Bruce J.
Smith, Douglas R.
MetadataShow full item record
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.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Reactivation of the relational interface in M_x001B_p2_x001B_sDBMS and implementation of the EWIR database Scrivener, Donna N.; Edwards, Renell D. (Monterey, California. Naval Postgraduate School, 1996-06);The primary Department of Defense source for technical parametric performance data on non-communications emitters is the Electronic Warfare Reprogramming Database (EWIRDB). Data representation in the EWIRDB is via disjointed ...
Anastasopoulos, Achilles (Monterey, California. Naval Postgraduate School, 1997-03);Relational, hierarchical, network, functional, and object oriented databases support its corresponding query language, SQL, DL/I, CODASYL-DML, DAPLEX, and OO-DML, respectively. However, each database type may be accessed ...
Grenseman, Paul D. (1988);The relational database model has become the most popular and widespread database model. Most current database systems are based upon or related to -he relational model. However, the relational model is beset with ...