Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1149436 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Answering queries using views: A survey
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Information integration using logical views
- MiniCon: a scalable algorithm for answering queries using views
- Non-standard inferences in description logics
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
Cited in
(3)
This page was built for publication: Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638226)