Skip to main content

Querying Temporal Databases via OWL 2 QL

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8741))

Abstract

SQL:2011, the most recently adopted version of the SQL query language, has unprecedentedly standardized the representation of temporal data in relational databases. Following the successful paradigm of ontology-based data access, we develop a practical approach to querying the SQL:2011-based temporal data model via the semantic layer of OWL 2 QL. The interval-based temporal query language (TQL), which we propose for this task, is based on naturally characterizable combinations of temporal logic with conjunctive queries. As the central contribution, we present rules for sound and complete rewriting of TQL queries into two-sorted first-order logic, and consequently, into corresponding SQL queries, which can be evaluated in any existing relational database management system compliant with the SQL:2011 temporal data model. Importantly, the proposed rewriting is based on the direct reuse of the standard rewriting techniques for conjunctive queries under OWL 2 QL. This renders our approach modular and easily implementable. As a notable corollary, we show that the data complexity of TQL query answering remains in AC0, i.e., as in the usual, non-temporal case.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Artale, A., Kontchakov, R., Lutz, C., Wolter, F., Zakharyaschev, M.: Temporalising tractable description logics. In: Proceedings of the Fourteenth International Symposium on Temporal Representation and Reasoning (2007)

    Google Scholar 

  2. Artale, A., Kontchakov, R., Wolter, F., Zakharyaschev, M.: Temporal description logic for ontology-based data access. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2013) (2013)

    Google Scholar 

  3. Baader, F., Borgwardt, S., Lippmann, M.: Temporalizing ontology-based data access. In: Bonacina, M.P. (ed.) CADE 2013. LNCS, vol. 7898, pp. 330–344. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Baader, F., Calvanese, D., Mcguinness, D.L., Nardi, D., Patel-Schneider, P.F.: The description logic handbook: theory, implementation, and applications. Cambridge University Press (2003)

    Google Scholar 

  5. Batsakis, S., Stravoskoufos, K., Petrakis, E.G.M.: Temporal Reasoning for Supporting Temporal Queries in OWL 2.0. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds.) KES 2011, Part I. LNCS, vol. 6881, pp. 558–567. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Böhlen, M.H., Snodgrass, R.T., Soo, M.D.: Coalescing in temporal databases. IEEE Computer 19, 35–42 (1996)

    Google Scholar 

  7. Borgwardt, S., Lippmann, M., Thost, V.: Temporal query answering in the description logic DL-Lite. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS, vol. 8152, pp. 165–180. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  9. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Eql-lite: Effective first-order query processing in description logics. In: Proc. of IJCAI 2007 (2007)

    Google Scholar 

  10. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of the ACM Symposium on Theory of Computing (STOC 1977) (1977)

    Google Scholar 

  11. Chomicki, J.: Temporal query languages: A survey. In: Gabbay, D.M., Ohlbach, H.J. (eds.) ICTL 1994. LNCS, vol. 827, pp. 506–534. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  12. Chomicki, J., Toman, D.: Temporal Databases. In: Handbook of Temporal Reasoning in Artificial Intelligence (Foundations of Artificial Intelligence), pp. 429–468. Elsevier Science Inc. (2005)

    Google Scholar 

  13. Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic SHIQ. Journal of Artificial Intelligence Research (2008)

    Google Scholar 

  14. Grandi, F.: T-SPARQL: a TSQL2-like temporal query language for RDF. In: Proc. of the International Workshop on Querying Graph Structured Data (2010)

    Google Scholar 

  15. Gutierrez, C., Hurtado, C.A., Vaisman, A.A.: Introducing time into RDF. IEEE Transactions onn Knowledge and Data Engineering 19(2), 207–218 (2007)

    Article  Google Scholar 

  16. Gutiérrez-Basulto, V., Klarman, S.: Towards a unifying approach to representing and querying temporal data in description logics. In: Krötzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol. 7497, pp. 90–105. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  17. Kawash, J.: Complex quantification in Structured Query Language (SQL): A tutorial using relational calculus. Journal of Computers in Mathematics and Science Teaching 23(2), 169–190 (2004)

    Google Scholar 

  18. Klarman, S., Meyer, T.: Prediction and explanation over DL-Lite data streams. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 536–551. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  19. Klarman, S., Meyer, T.: Querying temporal databases via OWL 2 QL. Tech. rep., CAIR, UKZN/CSIR Meraka (2014), http://klarman.synthasite.com/resources/KlaMeyRR14.pdf

  20. Kulkarni, K., Michels, J.E.: Temporal features in SQL:2011. SIGMOD Rec. 41(3) (2012)

    Google Scholar 

  21. Mohania, M., Konomi, S., Kambayashi, Y.: Incremental maintenance of materialized views. In: Tjoa, A.M. (ed.) DEXA 1997. LNCS, vol. 1308, pp. 551–560. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  22. Motik, B.: Representing and querying validity time in RDF and OWL: A logic-based approach. Journal of Web Semantics: Science, Services and Agents on the World Wide Web 57(5), 1–62 (2012)

    MathSciNet  Google Scholar 

  23. Reynolds, M.: The complexity of decision problems for linear temporal logics. Journal of Studies in Logic 3(1) (2010)

    Google Scholar 

  24. Snodgrass, R.T., Böhlen, M.H., Jensen, C.S., Steiner, A.: Transitioning temporal support in TSQL2 to SQL3. In: Etzion, O., Jajodia, S., Sripada, S. (eds.) Dagstuhl Seminar 1997. LNCS, vol. 1399, pp. 150–194. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  25. Toman, D.: Point vs. interval-based query languages for temporal databases. In: Proc. of the Symposium on Principles of Database Systems (PODS 1996) (1996)

    Google Scholar 

  26. Zhou, X., Wang, F., Zaniolo, C.: Efficient temporal coalescing query support in relational database systems. In: Bressan, S., Küng, J., Wagner, R. (eds.) DEXA 2006. LNCS, vol. 4080, pp. 676–686. Springer, Heidelberg (2006)

    Chapter  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

Klarman, S., Meyer, T. (2014). Querying Temporal Databases via OWL 2 QL. In: Kontchakov, R., Mugnier, ML. (eds) Web Reasoning and Rule Systems. RR 2014. Lecture Notes in Computer Science, vol 8741. Springer, Cham. https://doi.org/10.1007/978-3-319-11113-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11113-1_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11112-4

  • Online ISBN: 978-3-319-11113-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics