Skip to main content

Answering Ontological Ranking Queries Based on Subjective Reports

  • Conference paper
Scalable Uncertainty Management (SUM 2014)

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

Included in the following conference series:

  • 542 Accesses

Abstract

The use of preferences in query answering, both in traditional databases and in ontology-based data access, has recently received much attention, due to its many real-world applications. In this paper, we tackle the problem of query answering in Datalog+/– ontologies subject to the querying user’s preferences and a collection of subjective reports (i.e., scores for a list of features) of other users, who have their own preferences as well. All these pieces of information are combined to rank the query results. We first focus on the problem of ranking atoms in a database by leveraging reports and customizing their content according to the user’s preferences. Then, we extend this approach to deal with ontological query answering using provenance information. Though the general problem is shown to have an exponential-time data complexity upper bound, we propose a special case that has polynomial time data complexity.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Barbier, G., Feng, Z., Gundecha, P., Liu, H.: Provenance Data in Social Media. Morgan and Claypool (2013)

    Google Scholar 

  2. Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  3. Bistarelli, S., Pini, M.S., Rossi, F., Venable, K.B.: Bipolar preference problems: Framework, properties and solving techniques. In: Azevedo, F., Barahona, P., Fages, F., Rossi, F. (eds.) CSCLP. LNCS (LNAI), vol. 4651, pp. 78–92. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. ICDE, pp. 421–430 (2001)

    Google Scholar 

  5. Brewka, G.: Preferences, contexts and answer sets. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, p. 22. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Buneman, P.: The providence of provenance. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds.) BNCOD 2013. LNCS, vol. 7968, pp. 7–12. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. KR, pp. 70–80 (2008)

    Google Scholar 

  8. Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. J. Web Sem. 14, 57–83 (2012)

    Article  Google Scholar 

  9. Chomicki, J.: Preference formulas in relational queries. TODS 28(4), 427–466 (2003)

    Article  Google Scholar 

  10. Dividino, R., Gröner, G., Scheglmann, S., Thimm, M.: Ranking RDF with provenance via preference aggregation. In: ten Teije, A., Völker, J., Handschuh, S., Stuckenschmidt, H., d’Acquin, M., Nikolov, A., Aussenac-Gilles, N., Hernandez, N. (eds.) EKAW 2012. LNCS, vol. 7603, pp. 154–163. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Govindarajan, K., Jayaraman, B., Mantha, S.: Preference queries in deductive databases. New Generat. Comput. 19(1), 57–86 (2001)

    Article  MATH  Google Scholar 

  12. Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: Proc. PODS, pp. 31–40 (2007)

    Google Scholar 

  13. Ha, V., Haddawy, P.: Toward case-based preference elicitation: Similarity measures on preference structures. In: Proc. UAI, pp. 193–201 (1998)

    Google Scholar 

  14. Lacroix, M., Lavency, P.: Preferences: Putting more knowledge into queries. In: Proc. VLDB, vol. 87, pp. 1–4 (1987)

    Google Scholar 

  15. Lukasiewicz, T., Martinez, M.V., Simari, G.I.: Preference-based query answering in Datalog+/– ontologies. In: Proc. IJCAI, pp. 1017–1023 (2013)

    Google Scholar 

  16. Moreau, L.: The foundations for provenance on the Web. Found. Trends Web Sci. 2(2/3), 99–241 (2010)

    Article  MathSciNet  Google Scholar 

  17. Stefanidis, K., Koutrika, G., Pitoura, E.: A survey on representation, composition and application of preferences in database systems. TODS 36(3), 19:1–19:45 (2011)

    Google Scholar 

  18. Straccia, U.: On the top-k retrieval problem for ontology-based access to databases. In: Pivert, O., Zadrożny, S. (eds.) Flexible Approaches in Data, Information and Knowledge Management. SCI, vol. 497, pp. 95–114. Springer, Heidelberg (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lukasiewicz, T., Martínez, M.V., Molinaro, C., Predoiu, L., Simari, G.I. (2014). Answering Ontological Ranking Queries Based on Subjective Reports. In: Straccia, U., Calì, A. (eds) Scalable Uncertainty Management. SUM 2014. Lecture Notes in Computer Science(), vol 8720. Springer, Cham. https://doi.org/10.1007/978-3-319-11508-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11508-5_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11507-8

  • Online ISBN: 978-3-319-11508-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics