A Scalable Algorithm for Answering Queries Using Views

By Rachel Pottinger, Alon Y. Halevy. Very Large Data Bases Conference, 2000

437 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/a314843f7833df637452cd5e8109afcab7f2321e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Diego Calvanese
2. Giuseppe De Giacomo
3. Domenico Lembo
4. Antonella Poggi
5. Riccardo Rosati
6. Maurizio Lenzerini
7. Mariano Rodriguez-Muro
8. Marco Ruzzi

Citations in the corpus

• Optimizing queries using materialized views: a practical, scalable solution (2001, background): “Levy, Mendelzon and Sagiv [11] studied the complexity of rewriting SPJ queries using views and proved that many related problems are NP-complete.”
• The MASTRO system for ontology-based data access (2011, methodology): “Such systems implement query answering by means of query rewriting algorithms, such as the inverse rules, the bucket, or the MiniCon [29] algorithms.”
• Quality-Driven Query Answering for Integrated Information Systems (2002, background): “Also recently, Pottinger and Levy introduced an improved algorithm for the same problem [109].”