Maximal objects and the semantics of universal relation databases
From MaRDI portal
Publication:3321499
DOI10.1145/319830.319831zbMATH Open0536.68081OpenAlexW2066954445MaRDI QIDQ3321499FDOQ3321499
Authors: David Maier, Jeffrey D. Ullman
Publication date: 1983
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/319830.319831
Recommendations
user interfaceacyclic hypergraphquery languagerelational databasemaximal objectsuniversal relationmodification of the lossless-join algorithm
Cited In (14)
- Using trees to mine multirelational databases
- Connections in acyclic hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tree projection theorem and relational query processing
- Update and retrieval in a relational database through a universal schema interface
- Connection-trap-free database schemes
- A universal table model for categorical databases
- Testing arbitrary subhypergraphs for the lossless join property
- NP-complete problems simplified on tree schemas
- On the existence of acyclic views in a database scheme
- Generating hinges from arbitrary subhypergraphs
- On the foundations of the universal relation model
- An extended bill of material model for selecting production alternatives in a multi-routeing environment
Uses Software
This page was built for publication: Maximal objects and the semantics of universal relation databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3321499)