Complexity of Views: Tree and Cyclic Schemas
From MaRDI portal
Publication:3775009
DOI10.1137/0216003zbMATH Open0635.68122OpenAlexW2136207544MaRDI QIDQ3775009FDOQ3775009
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
Recommendations
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)
Cited In (6)
- On cyclic covers and perfect models
- The tree projection theorem and relational query processing
- Allocation techniques for distributed reduction data elements
- On the existence of acyclic views in a database scheme
- The complexity of embedded axiomatization for a class of closed database views
- Title not available (Why is that?)
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)