Skip to main content
SpringerLink
Log in

Algorithms and applications for answering ranked queries using ranked views

  • Published:
The VLDB Journal Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. http://www.realtor.com.

  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 1995

  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 2000

  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 2002

  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 1995

  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 2000

  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 1996

  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 1999

  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 1997

  10. Fagin R (1996) Combining fuzzy information from multiple systems. In: Proceedings of the Symposium on Principles of Database Systems, Montreal, 3-5 June 1996

  11. Fagin R (1998) Fuzzy queries in multimedia database systems. In: Proceedings of the Symposium on Principles of Database Systems, Seattle, 1-3 June 1998

  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 2001

  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 1997

  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 2000

  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 1997

  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 1997

  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 2000

  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 2001

  19. Halevy AY (2001) Answering queries using views: a survey. The VLDB Journal 10 (4): 270-294

    Article  MATH  Google Scholar 

  20. Hochbaum D (1997) Approximation algorithms for NP-hard problems. PWS, Boston

  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 2001

  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 2000

  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 1996

  24. Papadimitriou C, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover, NY

    Google Scholar 

  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 1999

  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 1996

  27. Vassalos V, Papakonstantinou Y (2000) Expressive capabilities, description languages and query rewriting algorithms. Journal of Logic Programming 43 (1):75-122

    Article  MathSciNet  MATH  Google Scholar 

  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)

Download references

Author information

Authors and Affiliations

  1. University of California, San Diego, USA

    Vagelis Hristidis & Yannis Papakonstantinou

Authors
  1. Vagelis Hristidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yannis Papakonstantinou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vagelis Hristidis.

Additional information

Received: 10 June 2002, Accepted: 11 June 2002, Published online: 30 September 2003

Edited by: A. Mendelzon

Work supported by NSF Grant No. 9734548.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hristidis, V., Papakonstantinou, Y. Algorithms and applications for answering ranked queries using ranked views. VLDB 13, 49–70 (2004). https://doi.org/10.1007/s00778-003-0099-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-003-0099-8

Keywords:

Search

Navigation