Skip to main content

Rank-Join Indices

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

Synonyms

Skyline queries; Top-k queries

Definition

Let R1 be a relation, over attributes \(A^1_1,\ldots , A^1_n\). We say that R1 is a ranked relation, if there is a designated rank attribute\(A^1_r\), with domain a subset of \(\mathbb {R}^{+}\), such that the value \(A^1_r(t)\) for tuple t defines the score of the tuple, and induces a ranking for the tuples in R1. Let R1, …, Rq be ranked relations. Without loss of generality, assume that \(A^1_1,\ldots ,A^q_1\) are the rank attributes, let θ be an arbitrary join condition defined between (sub)sets of the remaining attributes, and let \(J(R_1,\ldots ,R_q) = (R_1 \Join _{{\theta }_1} \ldots \Join _{{\theta }_{q-1}} R_q )\) denote the resulting relation. Let \(f: \mathbb {R}^{+} \times \ldots \times \mathbb {R}^{+} \rightarrow \mathbb {R}^{+}\) be a scoring function that takes as input the rank attribute values \((s_1,\ldots ,s_q) = (A^1_1(t),\ldots ,A^q_1(t))\) of tuple t ∈ J(R1, …, Rq), and produces a score value f(s1, …, sq) for the...

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. Agrawal R, Wimmers E. A framework for expressing and combining preferences. In: Proceedings of ACM SIGMOD International Conference on Management of Data; 2000. p. 297–306.

    Google Scholar 

  2. Bruno N, Gravano L, Marian A. Evaluating top-k queries over web accessible databases. In: Proceedings of ICDE; 2002.

    Google Scholar 

  3. Chang K, Huang S-W. Minimal probing: supporting expensive predicates for top-k queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2002.

    Google Scholar 

  4. Chang YC, Bergman L, Castelli V, Li CS, Lo ML, Smith J. The onion technique: indexing for linear optimization queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 391–402.

    Google Scholar 

  5. Donjerkovic D, Ramakrishnan R. Probabilistic optimization of top-N queries. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999.

    Google Scholar 

  6. Fagin R. Combining fuzzy information from multiple systems. In: Proceedings of the ACM SIGACT-SIGMOD Symposium on Principles of Database Systems; 1996. p. 216–26.

    Google Scholar 

  7. Fagin R. Fuzzy queries in multimedia database systems. In: Proceedings of the ACM SIGACT-SIGMOD Symposium on Principles of Database Systems; 1998. p. 1–10.

    Google Scholar 

  8. Fagin R, Wimmers E. Incorporating user preferences in multimedia queries. In: Proceedings of the 6th International Conference on Database Theory; 1997. p. 247–61.

    Google Scholar 

  9. Gravano L, Chaudhuri S. Evaluating top-k selection queries. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1999.

    Google Scholar 

  10. Hristidis V, Koudas N, Papakonstantinou Y. Efficient execution of multiparametric ranked queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2001.

    Google Scholar 

  11. Ilyas IF, Aref WG, Elmagarmid AK. Joining ranked inputs in practice, Hong Kong. 2003. p. 950–61.

    Google Scholar 

  12. Natsev A, Chang Y, Smith J, Li C-S, Vitter JS. Supporting incremental join queries on ranked inputs. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001.

    Google Scholar 

  13. Singh S. Ranked selection indexes for linear preference queries. MSc thesis, Wichita State University. 2011.

    Google Scholar 

  14. Tsaparas P, Palpanas T, Kotidis Y, Koudas N, Srivastava D. Ranked join indices. In: Proceedings of the 19th International Conference on Data Engineering; 2003. p. 277–88.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Themis Palpanas .

Editor information

Editors and Affiliations

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

Palpanas, T., Tsaparas, P. (2018). Rank-Join Indices. 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_80681

Download citation

Publish with us

Policies and ethics