Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On the Top-k Retrieval Problem for Ontology-Based Access to Databases

  • Chapter
  • First Online:
Flexible Approaches in Data, Information and Knowledge Management

Part of the book series: Studies in Computational Intelligence ((SCI,volume 497))

Abstract

The chapter is a succinct summary on the problem of evaluating ranked top-k queries in the context of ontology-based access over relational databases. An ontology layer is used to define the relevant abstract concepts and relations of the application domain, while facts with associated score are stored into a relational database. Queries are conjunctive queries with ranking aggregates and scoring functions. The results of a query may be ranked according to the score and the problem is to find efficiently the top-k ranked query answers.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    By purpose we will neglect the details of these works (including description of algorithms and implementations).

  2. 2.

    http://www.jessrules.com/

  3. 3.

    http://www.ilog.com/products/jrules/

  4. 4.

    That is, the ontology satisfiability problem, the subsumption problem and the instance checking problem.

  5. 5.

    The FOL-reading of concept \(\exists R\) is: set of \(x\) such that \(\exists y. R(x,y)\).

  6. 6.

    Of course, for any interpretation \(\fancyscript{I}\), \({(\lnot R)}^\mathcal{I} = {\Delta }^\mathcal{I} \times {\Delta }^\mathcal{I} \setminus {R}^\mathcal{I}\).

  7. 7.

    We use the symbol ‘,’ to denote conjunction in the rule body.

  8. 8.

    A predicate \(p(\mathbf{x ,y})\) is functional if for any \(\varvec{t}\) there is unique \(t'\) for which \(p(\varvec{t},t')\) is true.

  9. 9.

    For the sake of ease of presentation, we are not going to present the whole mapping for Horn-DL, but for a significant subset only that is sufficient to illustrate the main idea behind this translation.

References

  1. Abadi, D.J., Marcus, A., Madden, S., Hollenbach, K.: Sw-store: a vertically partitioned dbms for semantic web data management. VLDB J. 18(2), 385–406 (2009)

    Article  Google Scholar 

  2. Zimmermann, A.P.A., Lopes, N., Straccia, U.: A general framework for representing, reasoning and querying with annotated semantic web data. J. Web Semant. 11, 72–95 (March 2012)

    Article  Google Scholar 

  3. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Baader, F., Brandt, S., Lutz, C.: Pushing the \({\cal E L}\) envelope. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence IJCAI-05, pp. 364–369, Edinburgh, UK. Morgan-Kaufmann Publishers, San Francisco (2005)

    Google Scholar 

  5. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Proceedings of the 18th International Joint Conference on Artificial intelligence, pp. 325–330. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  6. Baader, F., Brandt S., Lutz, C.: Pushing the \(\cal EL\) envelope further. In: Clark, K., Patel-Schneider, P.F. (eds.) Proceedings of the OWLED 2008 DC Workshop on OWL: Experiences and Directions (2008)

    Google Scholar 

  7. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.). The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  8. Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Longman, Boston (1999)

    Google Scholar 

  9. Brickley, D., Guha, R.V.: RDF vocabulary description language 1.0: RDF schema. In: W3C Recommendation, W3C (2004). http://www.w3.org/TR/rdf-schema/

  10. Bruno, N., Chaudhuri, S., Gravano, L.: Top-k selection queries over relational databases: mapping strategies and performance evaluation. ACM Trans. Database Syst. 27(2), 153–187 (2002)

    Article  Google Scholar 

  11. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: tractable description logics for ontologies. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005) (2005)

    Google Scholar 

  12. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR-06), pp. 260–270 (2006)

    Google Scholar 

  13. Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the dl-lite family. J. Autom. Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  14. Chang, K.C.-C., won Hwang, S.: Minimal probing: supporting expensive predicates for top-k queries. In: Proceedings of the SIGMOD Conference, pp. 346–357 (2002)

    Google Scholar 

  15. Chortaras, A., Stamou, G.B., Stafylopatis, A.: Integrated query answering with weighted fuzzy rules. In: Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-07), vol. 4724 in Lecture Notes in Computer Science, pp. 767–778. Springer (2007)

    Google Scholar 

  16. Chortaras, A., Stamou, G.B., Stafylopatis, A.: Top-down computation of the semantics of weighted fuzzy logic programs. In: Proceedings of the 1st International Conference on Web Reasoning and Rule Systems (RR-07), pp. 364–366 (2007)

    Google Scholar 

  17. Cuenca-Grau, B., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P.F., Sattler, U.: OWL 2: the next step for OWL. J. Web Semant. 6(4), 309–322 (2008)

    Article  Google Scholar 

  18. Damásio, C.V., Medina, M., Ojeda-Aciego, J.: A tabulation procedure for first-order residuated logic programs. In: Proceedings of the IEEE World Congress on Computational Intelligence (Sect. Fuzzy Systems) (WCCI-06), pp. 9576–9583 (2006)

    Google Scholar 

  19. Damásio, C.V., Medina, M., Ojeda-Aciego, J.: A tabulation procedure for first-order residuated logic programs. In: Proceedings of the 11th International Conference on Information Processing and Managment of Uncertainty in Knowledge-Based Systems, (IPMU-06) (2006)

    Google Scholar 

  20. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374–425 (2001)

    Article  Google Scholar 

  21. Dubois, D., Prade, H.: Possibility theory, probability theory and multiple-valued logics: a clarification. Ann. Math. Artif. Intell. 32(1–4), 35–66 (2001)

    Article  MathSciNet  Google Scholar 

  22. Fagin, R.: Combining fuzzy information: an overview. SIGMOD Rec. 31(2), 109–118 (2002)

    Article  Google Scholar 

  23. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Symposium on Principles of Database Systems (2001)

    Google Scholar 

  24. Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proceedings of the 12th International Conference on World Wide Web, pp. 48–57. ACM Press (2003)

    Google Scholar 

  25. Gutierrez, C., Hurtado, C., Mendelzon, A.O.: Foundations of semantic web databases. In: Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS-04). ACM Press (2004)

    Google Scholar 

  26. Haase, C., Lutz, C.: Complexity of subsumption in the \(\cal EL\) family of description logics: acyclic and cyclic tboxes. In: Ghallab, M., Spyropoulos, C.D., Fakotakis, N., Avouris, N. (eds.) Proceedings of the 18th European Conference on Artificial Intelligence (ECAI08), vol. 178 of Frontiers in Artificial Intelligence and Applications, pp. 25–29. IOS Press (2008)

    Google Scholar 

  27. Ianni, G., Krennwallner, T., Martello, A., Polleres, A.: Dynamic querying of mass-storage RDF data with rule-based entailment regimes. In: Proceedings of the 8th International Semantic Web Conference (ISWC-09), vol. 5823 in Lecture Notes in Computer Science, pp. 310–327. Springer (2009)

    Google Scholar 

  28. Ianni, G., Krennwallner, T., Martello, A., Polleres, A.: A rule system for querying persistent rdfs data. In: Proceedings of the 6th European Semantic Web Conference on Semantic Web: Research and Applications (ESWC-2009), pp. 857–862 (2009)

    Google Scholar 

  29. Ianni, G., Krennwallner, T., Martello, A., Polleres, A.: A rule system for querying persistent rdfs data. In: Aroyo, L., Traverso, P., Ciravegna, F., Cimiano, P., Heath, T., Hyvönen, E., Mizoguchi, R., Oren, E., Sabou, M., Simperl, E.P.B. (eds.) ESWC, vol. 5554 of Lecture Notes in Computer Science, pp. 857–862. Springer (2009)

    Google Scholar 

  30. Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. In: Proceedings of the 29th International Conference on Very Large Data, Bases (VLDB-03), pp. 754–765 (2003)

    Google Scholar 

  31. Ilyas, I.F., Aref, W.G., Elmagarmid, A.K., Elmongui, H.G., Shah, R., Vitter, J.S.: Adaptive rank-aware query optimization in relational databases. ACM Trans. Database Syst. 31(4), 1257–1304 (2006)

    Article  Google Scholar 

  32. 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), 1–58 (2008)

    Article  Google Scholar 

  33. Kifer, M., Lausen, G.: Logical foundations of object-oriented and frame-based languages. J. ACM 42(4), 741–843 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  34. Li, C., Chang, K.C.-C., Ilyas, I.F.: Supporting ad-hoc ranking aggregates. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data (SIGMOD-06), pp. 61–72. ACM Press, New York (2006)

    Google Scholar 

  35. Li, C., Chang, K.C.-C., Ilyas, I.F., Song, S.: RankSQL: query algebra and optimization for relational top-k queries. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (SIGMOD-05), pp. 131–142. ACM Press, New York (2005)

    Google Scholar 

  36. Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)

    Book  MATH  Google Scholar 

  37. Lukasiewicz, T., Straccia, U.: Top-k retrieval in description logic programs under vagueness for the semantic web. In: Proceedings of the 1st International Conference on Scalable Uncertainty Management (SUM-07), vol. 4772 in Lecture Notes in Computer Science, pp. 16–30. Springer (2007)

    Google Scholar 

  38. Lutz, C., Toman, D., Wolter, F.: Conjunctive query answering in the description logic \(\cal EL\) using a relational database system. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI09). AAAI Press (2009)

    Google Scholar 

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

  40. Marin, D.: A formalization of rdf. Technical report TR/DCC-2006-8, Deptartment of Computer Science, Universidad de Chile (2004). http://www.dcc.uchile.cl/cgutierr/ftp/draltan.pdf

  41. Muñoz, S., Pérez, J., Gutiérrez, C.: Minimal deductive systems for rdf. In: Proceedings of the 4th European Semantic Web Conference (ESWC-07), vol. 4519 in Lecture Notes in Computer Science, pp. 53–67. Springer (2007)

    Google Scholar 

  42. OWL web ontology language overview. In: W3C (2004). http://www.w3.org/TR/owl-features/

  43. OWL 2 web ontology language document overview. In: W3C (2009). http://www.w3.org/TR/2009/REC-owl2-overview-20091027/

  44. OWL 2 web ontology language profiles. In: W3C (2009). http://www.w3.org/TR/2009/REC-owl2-profiles-20091027/

  45. Moreno, G., Julian, P., Medina, J., Ojeda, M.: Efficient thresholded tabulation for fuzzy query answering. In: Foundations of Reasoning Under Uncertainty, vol. 249 in Studies in Fuzziness and Soft Computing, pp. 125–141. Springer (2010)

    Google Scholar 

  46. Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)

    MATH  Google Scholar 

  47. Ragone, A., Straccia, U., Di Noia, T., Di Sciascio, E., Donini, F.M.: Vague knowledge bases for matchmaking in p2p e-marketplaces. In: Proceedings of the 4th European Semantic Web Conference (ESWC-07), vol. 4519 in Lecture Notes in Computer Science, pp. 414–428. Springer (2007)

    Google Scholar 

  48. Ragone, A., Straccia, U., Di Noia, T., Di Sciascio, E., Donini, F.M.: Fuzzy matchmaking in e-marketplaces of peer entities using Datalog. Fuzzy Sets Syst. 160(2), 251–268 (2009)

    Article  Google Scholar 

  49. RDF semantics. In: W3C (2004). http://www.w3.org/TR/rdf-mt/

  50. Rule interchange format (RIF). In: W3C (2011). http://www.w3.org/2001/sw/wiki/RIF

  51. SPARQL 1.1 entailment regimes. In: W3C (2011). http://www.w3.org/TR/2011/WD-sparql11-entailment-20110512/

  52. SPARQL 1.1 query language. In: W3C (2012). http://www.w3.org/TR/sparql11-query/

  53. SPARQL query language for RDF. In: W3C (2008). http://www.w3.org/TR/rdf-sparql-query/

  54. Straccia, U.: Answering vague queries in fuzzy DL-Lite. In: Proceedings of the 11th International Conference on Information Processing and Managment of Uncertainty in Knowledge-Based Systems, (IPMU-06), pp. 2238–2245. E.D.K., Paris (2006)

    Google Scholar 

  55. Straccia, U.:. Towards top-k query answering in deductive databases. In: Proceedings of the 2006 IEEE International Conference on Systems, Man and Cybernetics (SMC-06), pp. 4873–4879. IEEE (2006)

    Google Scholar 

  56. Straccia, U.: Towards top-k query answering in description logics: the case of DL-Lite. In: Proceedings of the 10th European Conference on Logics in Artificial Intelligence (JELIA-06), vol. 4160 in Lecture Notes in Computer Science, pp. 439–451, Liverpool, UK. Springer (2006)

    Google Scholar 

  57. Straccia, U.: Towards vague query answering in logic programming for logic-based information retrieval. In: Proceedings of World Congress of the International Fuzzy Systems Association (IFSA-07), vol. 4529 in Lecture Notes in Computer Science, pp. 125–134, Cancun, Mexico. Springer (2007)

    Google Scholar 

  58. Straccia, U.: Fuzzy description logic programs. In: Marsala, C., Bouchon-Meunier, B., Yager, R.R., Rifqi, M. (eds.) Uncertainty and Intelligent Information Systems, Chap. 29, pp. 405–418. World Scientific, Singapore (2008)

    Google Scholar 

  59. Straccia, U.: Managing uncertainty and vagueness in description logics, logic programs and description logic programs. In: Proceedings of 4th International Summer School, Tutorial Lectures on Reasoning Web, vol. 5224 in Lecture Notes in Computer Science, pp. 54–103. Springer (2008)

    Google Scholar 

  60. Straccia, U.: An ontology mediated multimedia information retrieval system. In: Proceedings of the 40th International Symposium on Multiple-Valued Logic (ISMVL-10), pp. 319–324. IEEE Computer Society (2010)

    Google Scholar 

  61. Straccia, U.: Softfacts: a top-k retrieval engine for ontology mediated access to relational databases. In: Proceedings of the 2010 IEEE International Conference on Systems, Man and Cybernetics (SMC-10), pp. 4115–4122. IEEE Press (2010)

    Google Scholar 

  62. Straccia, U.: Fuzzy logic, annotation domains and semantic web languages. In: Proceedings of the 5th International Conference on Scalable Uncertainty Management (SUM-11), vol. 6929 in Lecture Notes in Computer Science, pp. 2–21. Springer (2011)

    Google Scholar 

  63. Straccia, U.: Top-k retrieval for ontology mediated access to relational databases. Inf. Sci. 198, 1–23 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  64. Straccia, U., Madrid, N.: A top-k query answering procedure for fuzzy logic programming. Fuzzy Sets Syst. 205, 1–29 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  65. ter Horst, H.J.: Completeness, decidability and complexity of entailment for rdf schema and a semantic extension involving the owl vocabulary. J. Web Semant. 3(2–3), 79–115 (2005)

    Article  MathSciNet  Google Scholar 

  66. Ullman, J.D.: Principles of Database and Knowledge Base Systems, vols. 1, 2. Computer Science Press, Potomac (1989)

    Google Scholar 

  67. Vardi, M.: The complexity of relational query languages. In: Proceedings of the 14th ACM SIGACT Symposium on Theory of Computing (STOC-82), pp. 137–146 (1982)

    Google Scholar 

  68. Vojtás, P.: Fuzzy logic aggregation for semantic web search for the best (top-\(k\)) answer. In: Sanchez, E. (ed.) Fuzzy Logic and the Semantic Web, Capturing Intelligence, Chap. 17, pp. 341–359. Elsevier, Amsterdam (2006)

    Chapter  Google Scholar 

  69. XML. In: W3C. http://www.w3.org/XML/

Download references

Author information

Authors and Affiliations

  1. ISTI-CNR, Via G. Moruzzi 1, 56124 , Pisa, PI, Italy

    Umberto Straccia

Authors
  1. Umberto Straccia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Umberto Straccia .

Editor information

Editors and Affiliations

  1. IRISA/ENSSAT, Université de Rennes 1, Lannion Cedex, France

    Olivier Pivert

  2. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland

    Sławomir Zadrożny

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Straccia, U. (2014). 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. Studies in Computational Intelligence, vol 497. Springer, Cham. https://doi.org/10.1007/978-3-319-00954-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-00954-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-00953-7

  • Online ISBN: 978-3-319-00954-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation