Advertisement

On Top-k Retrieval for a Family of Non-monotonic Ranking Functions

  • Nicolás Madrid
  • Umberto Straccia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8132)

Abstract

We presented a top-k algorithm to retrieve tuples according to the order provided by a non-necessarily monotone ranking funtion that belongs to a novel family of functions. The conditions imposed on the ranking functions are related to the values where the maximum score is achieved.

Keywords

Relational Database Ranking Function Boolean Variable Good Preference Great Score 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Badr, M., Vodislav, D.: A general top-k algorithm for web data sources. In: Hameurlain, A., Liddle, S.W., Schewe, K.-D., Zhou, X. (eds.) DEXA 2011, Part I. LNCS, vol. 6860, pp. 379–393. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    He, Z., Lo, E.: Answering why-not questions on top-k queries. IEEE Transactions on Knowledge and Data Engineering 99, 1 (2012)CrossRefGoogle Scholar
  3. 3.
    Ilyas, I., Aref, W., Elmagarmid, A.: Supporting top-k join queries in relational databases. The VLDB Journal 13(3), 207–221 (2004)CrossRefGoogle Scholar
  4. 4.
    Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 11:1–11:58 (2008)Google Scholar
  5. 5.
    Luo, Y., Wang, W., Lin, X., Zhou, X., Wang, J., Li, K.: Spark2: Top-k keyword query in relational databases. IEEE Transactions on Knowledge and Data Engineering 23(12), 1763–1780 (2011)CrossRefGoogle Scholar
  6. 6.
    Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Trans. Database Syst. 29(2), 319–362 (2004)CrossRefGoogle Scholar
  7. 7.
    Ranu, S., Singh, A.K.: Answering top-k queries over a mixture of attractive and repulsive dimensions. Proc. VLDB Endowment 5(3), 169–180 (2011)Google Scholar
  8. 8.
    Straccia, U.: Top-k retrieval for ontology mediated access to relational databases. Information Sciences 198, 1–23 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Straccia, U., Madrid, N.: A top-k query answering procedure for fuzzy logic programming. Fuzzy Set and Systems 205, 1–29 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Xin, D., Han, J., Chang, K.C.: Progressive and selective merge: computing top-k with ad-hoc ranking functions. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, SIGMOD 2007, pp. 103–114. ACM, New York (2007)CrossRefGoogle Scholar
  11. 11.
    Xu, C., Wang, Y., Lin, S., Gu, Y., Qiao, J.: Efficient fuzzy top-k query processing over uncertain objects. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part I. LNCS, vol. 6261, pp. 167–182. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Yi, K., Li, F., Kollios, G., Srivastava, D.: Efficient processing of top-k queries in uncertain databases with x-relations. IEEE Transactions on Knowledge and Data Engineering 20(12), 1669–1682 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Nicolás Madrid
    • 1
  • Umberto Straccia
    • 2
  1. 1.Centre of Excellence IT4Innovations, Institute for Research and Applications of Fuzzy ModelingDivision of the University of OstravaCzech Republic
  2. 2.Istituto di Scienza e Tecnologie dell’Informazione (ISTI - CNR)PisaItaly

Personalised recommendations