Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
From MaRDI portal
Publication:3638226
DOI10.1007/978-3-642-00685-2_2zbMath1246.68109MaRDI QIDQ3638226
Hélène Jaudoin, Farouk Toumani, Frédéric Flouvat, Jean-Marc Petit
Publication date: 2 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01120890/file/Liris-3557.pdf
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Information integration using logical views
- MiniCon: a scalable algorithm for answering queries using views
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Non-standard inferences in description logics
- Answering queries using views: A survey