Skip to main content

Rank-Join Indices

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

Synonyms

Definition

Let R 1 be a relation, over attributes A 1 1, …, A n 1. We say that R 1 is a ranked relation, if there is a designated rank attribute A r 1, with domain a subset of \(\mathbb{R}^{+}\), such that the value A r 1(t) for tuple t defines the score of the tuple, and induces a ranking for the tuples in R 1. Let R 1, …, R q be ranked relations. Without loss of generality, assume that A 1 1, …, A 1 q 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} \bowtie _{\theta _{1}}\ldots \bowtie _{\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, …, s q ) = (A 1 1(t), …, A 1 q(t)) of tuple t ∈ J(R 1, …, R q ), and produces a score value f(s 1, …, s q ) for the tuple t. A top-k join query asks for the ktuples...

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

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Agrawal R, Wimmers E. A framework for expressing and combining preferences. In: Proceedings of ACM SIGMOD, Dallas. 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, San Jose. 2002.

    Google Scholar 

  3. Chang K, Huang S-W. Minimal probing: supporting expensive predicates for top-k queries. In: Proceedings of ACM SIGMOD, Madison. 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 ACM SIGMOD, Dallas. 2000. p. 391–402.

    Google Scholar 

  5. Donjerkovic D, Ramakrishnan R. Probabilistic optimization of top-N queries. In: Proceedings of VLDB, Edinburgh. 1999.

    Google Scholar 

  6. Fagin R. Combining fuzzy information from multiple systems. In: PODS, Montreal. 1996. p. 216–26.

    Google Scholar 

  7. Fagin R. Fuzzy queries in multimedia database systems. In: PODS, Seattle. 1998. p. 1–10.

    Google Scholar 

  8. Fagin R, Wimmers E. Incorporating user preferences in multimedia queries. In: ICDT, Delphi. 1997. p. 247–61.

    Google Scholar 

  9. Gravano L, Chaudhuri S. Evaluating top-k selection queries. In: Proceedings of VLDB, Edinburgh. 1999.

    Google Scholar 

  10. Hristidis V, Koudas N, Papakonstantinou Y. Efficient execution of multiparametric ranked queries. In: Proceedings of SIGMOD, Santa Barbara. 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 VLDB, Roma. 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: ICDE, Bangalore. 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

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Palpanas, T., Tsaparas, P. (2016). Rank-Join Indices. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_80681-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_80681-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics