Skip to main content

Ranking Views

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems
  • 8 Accesses

Synonyms

Ranked materialized views; Ranked views

Definition

Let R be a relation with n attributes (A1,…, An), and let f(t) be a ranking function that assigns a score to each tuple t in R. Then, ranking view Rf is a view on R where tuples are ranked by their (most commonly decreasing) f(t) scores. For example, R may store restaurants with attributes price and rating, and f may be 0.4*price+0.6*rating.

A key problem is how to efficiently maintain one or more materialized ranking views (corresponding to ranking functions) over a relation R. Another key problem is how to use a set \( \mathrm{V}=\left\{{\mathrm{R}}_{\mathrm{f}1},{\mathrm{R}}_{\mathrm{f}2},\dots, {\mathrm{R}}_{\mathrm{f}\mathrm{s}}\right\} \) of ranking views over R to efficiently compute a new ranking view Rg not in V.

Historical Background

Ranking views were intensely studied from 2000 to 2006, as the popularity of the Web created large multi-attribute datasets, which users may wish to rank according to their personal...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Yi K, Yu H, Yang J, Xia G, Chen Y. Efficient maintenance of materialized top-k views. In: Proceedings of the 19th International Conference on Data Engineering; 2003. p. 189–200.

    Google Scholar 

  2. Chang Y, Bergman L, CastelliV, Li C, Lo ML, Smith J. The Onion technique: indexing for linear optimization queries. In: Proceedings of the ACM Special Interest Group on Management of Data Conference; 2000.

    Google Scholar 

  3. Hristidis V, Koudas N, Papakonstantinou Y. PREFER: a system for the efficient execution of multi-parametric ranked queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2001.

    Google Scholar 

  4. Hristidis V, Papakonstantinou Y. Algorithms and applications for answering ranked queries using ranked views. VLDB J. 2004;13(1):49–70.

    Article  Google Scholar 

  5. Das G, Gunopulos D, Koudas N, Tsirogiannis D. Answering top-k queries using views. In: Proceedings of the 32nd International Conference on Very large Data Bases; 2006. p. 451–62.

    Google Scholar 

  6. Ilyas IF, Beskales G, Soliman MA. A survey of top-k query processing techniques in relational database systems. ACM Comput Surv. 2008;40(4):11.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vagelis Hristidis .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Hristidis, V. (2018). Ranking Views. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_80682

Download citation

Publish with us

Policies and ethics