Skip to main content
SpringerLink
Log in
Book cover

Description Logic, Theory Combination, and All That pp 639–660Cite as

On Bounded-Memory Stream Data Processing with Description Logics

  • Chapter
  • First Online:

  • 654 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11560))

Abstract

Various research groups of the description logic community, in particular the group of Franz Baader, have been involved in recent efforts on temporalizing or streamifying ontology-mediated query answering (OMQA). As a result, various temporal and streamified extensions of query languages for description logics with different expressivity were investigated. For practically useful implementations of OMQA systems over temporal and streaming data, efficient algorithms for answering continuous queries are indispensable. But, depending on the expressivity of the query and ontology language, finding an efficient algorithm may not always be possible. Hence, the aim should be to provide criteria for easily checking whether an efficient algorithm exists at all and, possibly, to describe such an algorithm for a given query. In particular, for stream data it is important to find simple criteria that help deciding whether a given OMQA query can be answered with sub-linear space w.r.t. the length of a growing stream prefix. An important special case dealt with under the term “bounded memory” is that of testing for constant space. This paper discusses known syntactical criteria for bounded-memory processing of SQL queries over relational data streams and describes how these criteria from the database community can be lifted to criteria of bounded-memory query answering in the streamified OMQA setting. For illustration purposes, a syntactic criterion for bounded-memory processing of queries formulated in a fragment of the stream-temporal query language STARQL is given.

This is a preview of subscription content, 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 EPUB and 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

Notes

  1. 1.

    https://www.w3.org/RDF/.

  2. 2.

    https://www.w3.org/TR/rdf-sparql-query/.

  3. 3.

    Note that we prefer to use the term “state” instead of the temporally connotated “stage”, because we allow in principle sequencing methods that are not temporal, e.g., sequencing by clustering.

  4. 4.

    We note that there is no fairness assumption for the interleavings in [3].

References

  1. Aggarwal, C.C. (ed.): Data Streams: Models and Algorithms. Advances in Database Systems, vol. 31. Springer, Heidelberg (2007). https://doi.org/10.1007/978-0-387-47534-9

    Book  MATH  Google Scholar 

  2. Agrawal, J., Diao, Y., Gyllstrom, D., Immerman, N.: Efficient pattern matching over event streams. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 147–160, SIGMOD 2008. ACM, New York (2008)

    Google Scholar 

  3. Arasu, A., Babcock, B., Babu, S., McAlister, J., Widom, J.: Characterizing memory requirements for queries over continuous data streams. ACM Trans. Database Syst. 29(1), 162–194 (2004)

    Article  Google Scholar 

  4. Arasu, A., Babu, S., Widom, J.: The CQL continuous query language: semantic foundations and query execution. VLDB J. 15, 121–142 (2006)

    Article  Google Scholar 

  5. Artale, A., Kontchakov, R., Wolter, F., Zakharyaschev, M.: Temporal description logic for ontology-based data access. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013, pp. 711–717. AAAI Press (2013). http://dl.acm.org/citation.cfm?id=2540128.2540232

  6. Baader, F., Borgwardt, S., Lippmann, M.: Temporalizing ontology-based data access. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 330–344. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38574-2_23

    Chapter  Google Scholar 

  7. Bauer, A., Küster, J.-C., Vegliach, G.: From propositional to first-order monitoring. In: Legay, A., Bensalem, S. (eds.) RV 2013. LNCS, vol. 8174, pp. 59–75. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40787-1_4

    Chapter  MATH  Google Scholar 

  8. Bienvenu, M.: Ontology-mediated query answering: harnessing knowledge to get more from data. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9–15 July 2016, pp. 4058–4061. IJCAI/AAAI Press (2016). http://www.ijcai.org/Abstract/16/600

  9. 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 (LNAI), vol. 8152, pp. 165–180. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40885-4_11

    Chapter  Google Scholar 

  10. Borgwardt, S., Lippmann, M., Thost, V.: Temporalizing rewritable query languages over knowledge bases. J. Web Semant. 33, 50–70 (2015). https://doi.org/10.1016/j.websem.2014.11.007. http://www.sciencedirect.com/science/article/pii/S157082681400119X

    Article  Google Scholar 

  11. Calbimonte, J.P., Jeung, H., Corcho, O., Aberer, K.: Enabling query technologies for the semantic sensor web. Int. J. Semant. Web Inf. Syst. 8(1), 43–63 (2012). https://doi.org/10.4018/jswis.2012010103

    Article  Google Scholar 

  12. Chomicki, J.: Efficient checking of temporal integrity constraints using bounded history encoding. ACM Trans. Database Syst. 20(2), 149–186 (1995)

    Article  Google Scholar 

  13. Chomicki, J., Toman, D.: Temporal databases. In: Handbook of Temporal Reasoning in Artificial Intelligence, vol. 1, pp. 429–467. Elsevier (2005)

    Google Scholar 

  14. Cormode, G.: The continuous distributed monitoring model. SIGMOD Rec. 42(1), 5–14 (2013)

    Article  Google Scholar 

  15. Della Valle, E., Ceri, S., Barbieri, D., Braga, D., Campi, A.: A first step towards stream reasoning. In: Domingue, J., Fensel, D., Traverso, P. (eds.) Future Internet - FIS 2008. Lecture Notes in Computer Science, vol. 5468, pp. 72–81. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Gurevich, Y., Leinders, D., Van den Bussche, J.: A theory of stream queries. In: Arenas, M., Schwartzbach, M.I. (eds.) DBPL 2007. LNCS, vol. 4797, pp. 153–168. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75987-4_11

    Chapter  Google Scholar 

  17. Kharlamov, E., et al.: Towards analytics aware ontology based access to static and streaming data. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9982, pp. 344–362. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46547-0_31

    Chapter  Google Scholar 

  18. Kharlamov, E., et al.: An ontology-mediated analytics-aware approach to support monitoring and diagnostics of static and streaming data. J. Web Seman. (2018, in print)

    Google Scholar 

  19. Kharlamov, E., et al.: Semantic access to streaming and static data at Siemens. Web Semant.: Sci. Serv. Agents World Wide Web 44, 54–74 (2017). https://doi.org/10.1016/j.websem.2017.02.001

    Article  Google Scholar 

  20. Kharlamov, E., et al.: How semantic technologies can enhance data access at siemens energy. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 601–619. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11964-9_38

    Chapter  Google Scholar 

  21. Özçep, Ö.L., Möller, R.: Ontology based data access on temporal and streaming data. In: Koubarakis, M., et al. (eds.) Reasoning Web 2014. LNCS, vol. 8714, pp. 279–312. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10587-1_7

    Chapter  Google Scholar 

  22. Özçep, Ö.L., Möller, R., Neuenstadt, C., Zheleznyakov, D., Kharlamov, E.: Deliverable D5.1 - a semantics for temporal and stream-based query answering in an OBDA context. Deliverable FP7-318338, EU, October 2013

    Google Scholar 

  23. Özçep, Ö.L., Möller, R., Neuenstadt, C.: A stream-temporal query language for ontology based data access. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 183–194. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11206-0_18

    Chapter  Google Scholar 

  24. Özçep, Ö.L., Möller, R., Neuenstadt, C.: Stream-query compilation with ontologies. In: Pfahringer, B., Renz, J. (eds.) AI 2015. LNCS (LNAI), vol. 9457, pp. 457–463. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26350-2_40

    Chapter  Google Scholar 

  25. Patnaik, S., Immerman, N.: Dyn-FO: a parallel, dynamic complexity class. J. Comput. Syst. Sci. 55(2), 199–209 (1997)

    Article  MathSciNet  Google Scholar 

  26. Le-Phuoc, D., Dao-Tran, M., Xavier Parreira, J., Hauswirth, M.: A native and adaptive approach for unified processing of linked streams and linked data. In: Aroyo, L., et al. (eds.) ISWC 2011. LNCS, vol. 7031, pp. 370–388. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25073-6_24

    Chapter  Google Scholar 

  27. Thost, V.: Using ontology-based data access to enable context recognition in the presence of incomplete information. Ph.D. thesis, TU Dresden (2017)

    Article  Google Scholar 

  28. Turhan, A., Zenker, E.: Towards temporal fuzzy query answering on stream-based data. In: Nicklas, D., Özçep, Ö.L. (eds.) Proceedings of the 1st Workshop on High-Level Declarative Stream Processing Co-located with the 38th German AI Conference (KI 2015), CEUR Workshop Proceedings, Dresden, Germany, 22 September 2015, vol. 1447, pp. 56–69. CEUR-WS.org (2015). http://ceur-ws.org/Vol-1447/paper5.pdf

Download references

Author information

Authors and Affiliations

  1. Institute of Information Systems (IFIS), University of Lübeck, Lübeck, Germany

    Özgür Lütfü Özçep & Ralf Möller

Authors
  1. Özgür Lütfü Özçep
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Möller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Özgür Lütfü Özçep .

Editor information

Editors and Affiliations

  1. University of Bremen, Bremen, Germany

    Carsten Lutz

  2. University of Manchester, Manchester, UK

    Uli Sattler

  3. University of Iowa, Iowa City, IA, USA

    Cesare Tinelli

  4. TU Dresden, Dresden, Germany

    Anni-Yasmin Turhan

  5. University of Liverpool, Liverpool, UK

    Frank Wolter

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Özçep, Ö.L., Möller, R. (2019). On Bounded-Memory Stream Data Processing with Description Logics. In: Lutz, C., Sattler, U., Tinelli, C., Turhan, AY., Wolter, F. (eds) Description Logic, Theory Combination, and All That. Lecture Notes in Computer Science(), vol 11560. Springer, Cham. https://doi.org/10.1007/978-3-030-22102-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22102-7_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22101-0

  • Online ISBN: 978-3-030-22102-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation