Set-Theoretic Problems of Null Completion in Relational Databases.

Abstract

When considering using databases to represent incomplete information, the relationship between two facts where one may imply the other needs to be addressed. In relational databases, this question becomes whether null completion is assumed. That is, does a (possibly partially-defined) tupe imply the existence of tuples that are less informative than the original tuple. We show that no relational algebra, that assumes equivalence under null completion, can include set-theoretic operators that are compatible with ordinary set theory. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1984
Accession Number
ADA145045

Entities

People

  • A. M. Keller

Organizations

  • Stanford University

Tags

Communities of Interest

  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Classification
  • Computer Science
  • Computers
  • Contracts
  • Databases
  • Engineering
  • Governments
  • Information Processing
  • Notation
  • Relational Database Management Systems
  • Relational Databases
  • Security
  • Set Theory
  • Standards
  • Symbols

Readers

  • Computational Linguistics
  • Statistical inference.