Complexity of Views: Tree and Cyclic Schemas

DOI10.1137/0216003MaRDI QIDQ3775009zbMATH OpenOpenAlexFDO

Authors Oded Shmueli, Alon Itai

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1df518ffe97634cbf85e4e8da05cc9f7b430dc30

zbMATH Keywords

complexityrelational databasesmaintenancetree schemasviewamortized costacyclic schema

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Foundations of Information and Knowledge Systems
• Updates of Relational Views
• On the existence of acyclic views in a database scheme
• scientific article; zbMATH DE number 219221
• Deduction trees and the view update problem in indefinite deductive databases

Cited in

(6)

• On the existence of acyclic views in a database scheme
• Allocation techniques for distributed reduction data elements
• scientific article; zbMATH DE number 4049170 (Why is no real title available?)
• On cyclic covers and perfect models
• The tree projection theorem and relational query processing
• The complexity of embedded axiomatization for a class of closed database views

This page was built for publication: Complexity of Views: Tree and Cyclic Schemas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775009)