Ranking Approximate Query Rewritings Based on Views

  • Hélène Jaudoin
  • Pierre Colomb
  • Olivier Pivert
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5822)


This paper considers the problem of rewriting queries using views by means of a tolerant method. The approach proposed is based on an approximate matching between the constraints from the query and those from the views, in the case where both the query and the views contain arithmetical constraints expressed as intervals. In such a context, the answers obtained are not certain anymore but only more or less probable. An algorithm which retrieves the top-k rewritings of a given query is described. Experimentations are reported, which show that the extra cost induced by the approximate nature of the rewriting process is perfectly acceptable.


Global Schema User Query Conjunctive Query View Versus Probable Answer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: Proc. of PODS 1998, pp. 254–263 (1998)Google Scholar
  2. 2.
    Afrati, F., Li, C., Mitra, P.: Rewriting queries using views in the presence of arithmetic comparisons. Theoretical Computer Science 368, 88–123 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bellahsène, Z., Roantree, M.: Querying distributed data in a super-peer based architecture. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds.) DEXA 2004. LNCS, vol. 3180, pp. 296–305. Springer, Heidelberg (2004)Google Scholar
  4. 4.
    Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)zbMATHGoogle Scholar
  5. 5.
    Dalvi, N., Suciu, D.: Answering queries from statistics and probabilistic views. In: Proc. of VLDB 2005, pp. 805–816. VLDB Endowment (2005)Google Scholar
  6. 6.
    Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: Proc. of VLDB 2006, pp. 451–462. VLDB Endowment (2006)Google Scholar
  7. 7.
    Dong, X., Halevy, A., Yu, C.: Data integration with uncertainty. In: Proc. of VLDB 2007, pp. 687–698. VLDB Endowment (2007)Google Scholar
  8. 8.
    Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. 24(6) (1995)Google Scholar
  9. 9.
    Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: A brief survey. Discrete Appl. Math. DOI 10 (2007)Google Scholar
  10. 10.
    Halevy, A.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)zbMATHCrossRefGoogle Scholar
  11. 11.
    Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations 43, 85–103 (1972)MathSciNetGoogle Scholar
  12. 12.
    Knuth, D.E.: Dancing links. Arxiv preprint cs.DS/0011047 (2000)Google Scholar
  13. 13.
    Pottinger, R., Levy, A.Y.: A scalable algorithm for answering queries using views. In: Proc. of VLDB 2000, San Francisco, CA, USA, pp. 484–495 (2000)Google Scholar
  14. 14.
    Das Sarma, A., Dong, X., Halevy, A.: Bootstrapping pay-as-you-go data integration systems. In: Proc. of SIGMOD 2008, pp. 861–874. ACM, New York (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hélène Jaudoin
    • 1
  • Pierre Colomb
    • 2
  • Olivier Pivert
    • 1
  1. 1.IRISA-ENSSATUniversité de Rennes 1France
  2. 2.LIMOSUniversité Blaise PascalFrance

Personalised recommendations