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...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
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.
Bruno N, Gravano L, Marian A. Evaluating top-k queries over web accessible databases. In: Proceedings of ICDE; 2002.
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.
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.
Donjerkovic D, Ramakrishnan R. Probabilistic optimization of top-N queries. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999.
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.
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.
Fagin R, Wimmers E. Incorporating user preferences in multimedia queries. In: Proceedings of the 6th International Conference on Database Theory; 1997. p. 247–61.
Gravano L, Chaudhuri S. Evaluating top-k selection queries. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1999.
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.
Ilyas IF, Aref WG, Elmagarmid AK. Joining ranked inputs in practice, Hong Kong. 2003. p. 950–61.
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.
Singh S. Ranked selection indexes for linear preference queries. MSc thesis, Wichita State University. 2011.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
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
DOI: https://doi.org/10.1007/978-1-4614-8265-9_80681
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering