Skip to main content
SpringerLink
Log in

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

  • Conference paper
Flexible Query Answering Systems (FQAS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8132))

Included in the following conference series:

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.

This work was supported by the European Regional Development Fund projects CZ.1.05/1.1.00/02.0070 and CZ.1.07/2.3.00/30.0010.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Chapter  Google Scholar 

  2. He, Z., Lo, E.: Answering why-not questions on top-k queries. IEEE Transactions on Knowledge and Data Engineering 99, 1 (2012)

    Article  Google Scholar 

  3. Ilyas, I., Aref, W., Elmagarmid, A.: Supporting top-k join queries in relational databases. The VLDB Journal 13(3), 207–221 (2004)

    Article  Google Scholar 

  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. 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)

    Article  Google Scholar 

  6. Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Trans. Database Syst. 29(2), 319–362 (2004)

    Article  Google Scholar 

  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. Straccia, U.: Top-k retrieval for ontology mediated access to relational databases. Information Sciences 198, 1–23 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Straccia, U., Madrid, N.: A top-k query answering procedure for fuzzy logic programming. Fuzzy Set and Systems 205, 1–29 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre of Excellence IT4Innovations, Institute for Research and Applications of Fuzzy Modeling, Division of the University of Ostrava, Czech Republic

    Nicolás Madrid

  2. Istituto di Scienza e Tecnologie dell’Informazione (ISTI - CNR), Pisa, Italy

    Umberto Straccia

Authors
  1. Nicolás Madrid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Umberto Straccia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronic Systems, Aalborg University, 6700, Esbjerg, Denmark

    Henrik Legind Larsen

  2. Department of Computer Science and Artificial Intelligence, University of Granada, 18071, Granada, Spain

    Maria J. Martin-Bautista

  3. Department of Computer Science and Arificial IntelIigence, University of Granada, 18071, Granada, Spain

    María Amparo Vila

  4. CBIT, Roskilde University, Universitetsvej 1, 4000, Roskilde, Denmark

    Troels Andreasen

  5. CBIT, Roskilde University, 4000, Roskilde, Denmark

    Henning Christiansen

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madrid, N., Straccia, U. (2013). On Top-k Retrieval for a Family of Non-monotonic Ranking Functions. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2013. Lecture Notes in Computer Science(), vol 8132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40769-7_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40769-7_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40768-0

  • Online ISBN: 978-3-642-40769-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation