Representation Techniques for Relational Languages and the Worst Case Asymptotical Time Complexity Behaviour of the Related Algorithms.

Abstract

This thesis is aimed at determining the worst case asymptotical time complexity behaviour of algorithms for relational operations that work on extensionally or intensionally represented binary relatons. Those relational operations came 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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1982
Accession Number
ADA121995

Entities

People

  • Suha Futaci

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Collisions
  • Computational Science
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Hash Tables
  • Language
  • Lists (Data Structures)
  • Numbers
  • Permutations
  • Programming Languages
  • Real Numbers
  • Records
  • Sequences

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Linguistics
  • Database Systems and Applications