Advertisement

The VLDB Journal

, Volume 13, Issue 1, pp 49–70 | Cite as

Algorithms and applications for answering ranked queries using ranked views

  • Vagelis HristidisEmail author
  • Yannis Papakonstantinou
Article

Abstract.

Ranked queries return the top objects of a database according to a preference function. We present and evaluate (experimentally and theoretically) a core algorithm that answers ranked queries in an efficient pipelined manner using materialized ranked views. We use and extend the core algorithm in the described PREFER and MERGE systems. PREFER precomputes a set of materialized views that provide guaranteed query performance. We present an algorithm that selects a near optimal set of views under space constraints. We also describe multiple optimizations and implementation aspects of the downloadable version of PREFER. Then we discuss MERGE, which operates at a metabroker and answers ranked queries by retrieving a minimal number of objects from sources that offer ranked queries. A speculative version of the pipelining algorithm is described.

Keywords:

Ranked queries Merge ranked views Materialization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    http://www.realtor.com.Google Scholar
  2. 2.
    Levy YSA, Mendelzon A, Srivastava D (1995) Answering queries using views. In: Proceedings of the Symposium on Principles of Database Systems, San Jose, 22-25 May 1995Google Scholar
  3. 3.
    Agrawal R, Wimmers E (2000) A framework for expressing and combining preferences. In: Proceedings of the ACM Special Interest Group on Management of Data Conference (SIGMOD), Dallas, 16-18 May 2000Google Scholar
  4. 4.
    Bruno N, Gravano L, Marian A (2002) Evaluating top-k queries over Web-accessible databases. In: Proceedings of the International Conference on Data Engineering, San Jose, 26 February-1 March 2002Google Scholar
  5. 5.
    Callan JP, Lu Z, Croft WB (1995) Searching distributed collections with inference networks. In: Proceedings of the International Conference on Research and Development in Information Retrieval (SIGIR), Seattle, 9-13 July 1995Google Scholar
  6. 6.
    Chang Y, Bergman L, Castelli V, Li C, Lo ML, Smith J (2000) The Onion technique: indexing for linear optimization queries. In: Proceedings of the ACM Special Interest Group on Management of Data Conference (SIGMOD), Dallas, 16-18 May 2000Google Scholar
  7. 7.
    Chaudhuri S, Gravano L (1996) Optimizing queries over multimedia repositories. In: Proceedings of the ACM Special Interest Group on Management of Data Conference (SIGMOD), Montreal, 4-6 June 1996Google Scholar
  8. 8.
    Cohen S, Nutt W, Serebrenik A (1999) Rewriting aggregate queries using views. In: Proceedings of the Symposium on Principles of Database Systems, Philadelphia, 31 May-2 June 1999Google Scholar
  9. 9.
    Duschka O, Genesereth M (1997) Answering recursive queries using views. In: Proceedings of the Symposium on Principles of Database Systems, Tucson, 12-14 May 1997Google Scholar
  10. 10.
    Fagin R (1996) Combining fuzzy information from multiple systems. In: Proceedings of the Symposium on Principles of Database Systems, Montreal, 3-5 June 1996Google Scholar
  11. 11.
    Fagin R (1998) Fuzzy queries in multimedia database systems. In: Proceedings of the Symposium on Principles of Database Systems, Seattle, 1-3 June 1998Google Scholar
  12. 12.
    Fagin R, Lotem A, Naor M (2001) Optimal aggregation algorithms for middleware. In: Proceedings of the Symposium on Principles of Database Systems, Santa Barbara, 21-23 May 2001Google Scholar
  13. 13.
    Fagin R, Wimmers E (1997) Incorporating user preferences in multimedia queries. In: Proceedings of the International Conference on Database Theory, Delphi, Greece, 8-10 January 1997Google Scholar
  14. 14.
    Goldstein J, Ramakrishnan R (2000) Contrast plots and P-Sphere trees: space vs. time in nearest neighbour searches. In: Proceedings of the Very Large Data Bases (VLDB) Conference, Cairo, Egypt, 10-14 September 2000Google Scholar
  15. 15.
    Gravano L, Chang CK, Molina HG, Paepcke A (1997) STARTS: Stanford proposal for Internet meta-searcing. In: Proceedings of the ACM Special Interest Group on Management of Data Conference (SIGMOD), Tucson, AZ, 13-15 May 1997Google Scholar
  16. 16.
    Gravano L, Garcia-Molina H (1997) Merging ranks from heterogeneous Internet sources. In: Proceedings of the Very Large Data Bases (VLDB) Conference, Athens, Greece, 25-29 August 1997Google Scholar
  17. 17.
    Guntzer U, Balke W, Kiessling W (2000) Optimizing multi-feature queries in image databases. In: Proceedings of the Very Large Data Bases (VLDB) Conference, Cairo, Egypt, 10-14 September 2000Google Scholar
  18. 18.
    Guntzer U, Balke W, Kiessling W (2001) Towards efficient multi-feature queries in heterogeneous environments. In: Proceedings of the IEEE International Conference on Information Technology (ITCC), Las Vegas, 2-4 April 2001Google Scholar
  19. 19.
    Halevy AY (2001) Answering queries using views: a survey. The VLDB Journal 10 (4): 270-294CrossRefzbMATHGoogle Scholar
  20. 20.
    Hochbaum D (1997) Approximation algorithms for NP-hard problems. PWS, BostonGoogle Scholar
  21. 21.
    Hristidis V, Koudas N, Papakonstantinou Y (2001) PREFER: a system for the efficient execution of multi-parametric ranked queries. In: Proceedings of the ACM Special Interest Group on Management of Data Conference (SIGMOD), Santa Barbara, 21-24 May 2001Google Scholar
  22. 22.
    Levy AY, Rajaraman A, Ordille JJ (1996) Querying heterogeneous information sources using source descriptions. In: Proceedings of the Very Large Data Bases (VLDB) Conference, Cairo, Egypt, 10-14 September 2000Google Scholar
  23. 23.
    Nepal S, Ramakrishna M (1999) Query processing issues in image (multimedia) databases. In: Proceedings of the International Conference on Data Engineering, Bombay, 3-6 September 1996Google Scholar
  24. 24.
    Papadimitriou C, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover, NYGoogle Scholar
  25. 25.
    Papakonstantinou Y, Vassalos V (1999) Query rewriting for semistructured data. In: Proceedings of the ACM Special Interest Group on Management of Data Conference (SIGMOD), Philadelphia, 1-3 June 1999Google Scholar
  26. 26.
    Srivastava D, Dar S, Jagadish HV, Levy A (1996) Answering queries with aggregation using views. In: Proceedings of the International Conference on Data Engineering, Bombay, 3-6 September 1996Google Scholar
  27. 27.
    Vassalos V, Papakonstantinou Y (2000) Expressive capabilities, description languages and query rewriting algorithms. Journal of Logic Programming 43 (1):75-122CrossRefMathSciNetzbMATHGoogle Scholar
  28. 28.
    Voorhees EM, Gupta NK, Johnson-Laird B (1995) The collection fusion problem. In: Proceedings of the Text Retrieval Conference (TREC-3), NIST special publication 500-225 (Harman DK, ed)Google Scholar

Copyright information

© Springer-Verlag Berlin/Heidelberg 2004

Authors and Affiliations

  1. 1.University of CaliforniaSan DiegoUSA

Personalised recommendations