Equivalence of views by query capacity
type: Item
instance of: scholarly article
title: Equivalence of views by query capacity
zbMATH Open document ID: 0625.68080
DOI: 10.1016/0022-0000(86)90020-6
author: Tim Connors
published in: Journal of Computer and System Sciences
publication date: 1986-01-01T00:00:00Z
review text: The ability of view users to retrieve information contained in a database is studied. A measure of this ability, called ``query capacity'', is introduced and shown to be valuable for defining important concepts concerning views. Three such notions, namely equivalence, redundancy, and decomposition of views, are identified and investigated. A key tool, called ``template substitution'', is introduced to aid in these investigations. Among the major results obtained are the following: (1) Characterizations of view equivalence and redundancy in views. (2) The decidability of view equivalence. (3) A technique to eliminate redundancy in views. (4) The decomposition of a view into an essentially unique normal form.
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 4016238
zbMATH Keywords: database management systems
zbMATH Keywords: query capacity
zbMATH Keywords: decomposition of views
zbMATH Keywords: view equivalence
zbMATH Keywords: redundancy in views
MaRDI profile type: Publication
full work available at URL: 0022-0000(86)90020-6
OpenAlex ID: W2084162471
cites work: Inclusion and equivalence between relational database schemata
cites work: Equivalences among Relational Expressions
cites work: Equivalence of Relational Database Schemes
cites work: Q3935440
cites work: Relative Information Capacity of Simple Relational Database Schemata
cites work: Adequacy of decompositions of relational databases
cites work: Q3962496
cites work: On the design of relational database schemata
description: scientific article; zbMATH DE number 4016238