Skip to main content

Web Stream Reasoning in Practice: On the Expressivity vs. Scalability Tradeoff

  • Conference paper
  • First Online:
Web Reasoning and Rule Systems (RR 2015)

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

Included in the following conference series:

Abstract

Advances in the Internet of Things and the Web of Data created huge opportunities for developing applications that can generate actionable knowledge out of streaming data. The trade-off between scalability and expressivity is a key challenge in this setting, and more investigation is required to identify what are the relevant features in optimizing this trade-off, and what role do they have in the optimization. In this paper we motivate the need for heuristics to design adaptive solutions and, following an empirical approach, we highlight some key concepts and ideas that can guide the design of heuristics for adaptive optimization of Web Stream Reasoning.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

Notes

  1. 1.

    Note that in ASP, the expressivity of the language is strictly related to the computational complexity, therefore we refer to expressivity and (computational) complexity interchangeably throughout the paper.

  2. 2.

    In this paper we only consider non-overlapping windows. For overlapping windows, the formula \( T_\omega (S, W) \) should hold also when duplicating events in overlapping parts.

  3. 3.

    Note that this is different from the total processing time, which includes the time required for query processing (first tier). In this paper, we mainly focus on the reasoning time only, relying on the extensive evaluation of query processing engines for the query processing time [1].

  4. 4.

    Note that this is different from the streaming size.

  5. 5.

    In the current implementation we evaluate criticality mainly based on how close an event is to the user location, and how fast is the user moving. In future work we plan to extend this contextual characterization to consider not only location but also other features such as the user transportation type, user’s health condition etc.

  6. 6.

    Algorithms to perform such splits are under investigation and will be the subject of future work.

  7. 7.

    Note that our goal is not to find the minimum, we just want to find one split.

  8. 8.

    Note that this assumption needs to be formally characterized and more investigation is ongoing in this direction.

References

  1. 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., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011, Part I. LNCS, vol. 7031, pp. 370–388. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Barbieri, D.F., Braga, D., Ceri, S., Valle, E.D., Grossniklaus, M.: Querying RDF streams with C-SPARQL. ACM SIGMOD Rec. 39(1), 20–26 (2010)

    Article  Google Scholar 

  3. Calbimonte, J.-P., Corcho, O., Gray, A.J.G.: Enabling ontology-based access to streaming data sources. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 96–111. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  5. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T.: Stream reasoning with answer set programming: preliminary report. In: KR, vol. 12, pp. 613–617 (2012)

    Google Scholar 

  6. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T.: Answer set programming for stream reasoning. CoRR (2013)

    Google Scholar 

  7. Beck, H., Dao-Tran, M., Eiter, T., Fink, M.: Lars: A logic-based framework for analyzing reasoning over streams. In: AAAI (2015)

    Google Scholar 

  8. Do, T.M., Loke, S.W., Liu, F.: Answer set programming for stream reasoning. In: Butz, C., Lingras, P. (eds.) Canadian AI 2011. LNCS, vol. 6657, pp. 104–109. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Mileo, A., Abdelrahman, A., Policarpio, S., Hauswirth, M.: StreamRule: a nonmonotonic stream reasoning system for the semantic web. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 247–252. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Acknowledgments

This research has been partially supported by Science Foundation Ireland (SFI) under grant No. SFI/12/RC/2289 and EU FP7 CityPulse Project under grant No.603095. http://www.ict-citypulse.eu

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefano Germano .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Germano, S., Pham, TL., Mileo, A. (2015). Web Stream Reasoning in Practice: On the Expressivity vs. Scalability Tradeoff. In: ten Cate, B., Mileo, A. (eds) Web Reasoning and Rule Systems. RR 2015. Lecture Notes in Computer Science(), vol 9209. Springer, Cham. https://doi.org/10.1007/978-3-319-22002-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22002-4_9

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics