skip to main content
10.1145/2245276.2245348acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Efficient matching of SPARQL subscriptions using rete

Published:26 March 2012Publication History

ABSTRACT

Ubiquitous domains such as smart spaces, location-aware mobile systems, or internet-of-things are characterized by large and volatile sets of heterogeneous and independently behaving entities like devices, services, and other identified objects. This study focuses on efficient implementation of an event processing system to manage interaction among these entities. The approach is based on expressive semantic representations: information sharing in RDF and content-based publish/subscribe with SPARQL as the subscription language. SPARQL can be used to construct elaborate queries for detecting complex states resulting from receiving events produced by multiple interrelated entities. The notification system should aim at short notification times while simultaneously allowing high throughput of events. We study incremental matching of SPARQL queries on RDF data using Rete algorithm. The results obtained demonstrate that an efficient and fast semantic notification framework can be implemented by representing SPARQL queries and RDF triples as rules and facts in a Rete engine.

References

  1. Kia Teymourian and Adrian Paschke. Towards semantic event processing. In Proceedings of the Third ACM International Conference on Distributed Event-Based Systems, DEBS '09, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Gero Mühl, Ludger Fiege, and Peter Pietzuch. Distributed Event-Based Systems. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Antti Lappeteläinen Jukka Honkola Kary Främling Roope Raisamo Juha-Pekka Soininen, Petri Liuha. Smart M3. Website, Aug 2011. www.tivit.fi/fi/dokumentit/64/DIEM+whitepaper.pdf.Google ScholarGoogle Scholar
  4. David C. Luckham. The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Martin Murth and Eva Kühn. A semantic event notification service for knowledge-driven coordination. 2011. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.7466.Google ScholarGoogle Scholar
  6. Charles L. Forgy. Rete: a fast algorithm for the many pattern/many object pattern match problem. pages 324--341. IEEE Computer Society Press, Los Alamitos, CA, USA, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Martin Murth, Dietmar Winkler, Stefan Biffl, Eva Kühn, and Thomas Moser. Performance testing of semantic publish/subscribe systems. In Proceedings of the 2010 international conference on On the move to meaningful internet systems, OTM'10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Tim Berners-lee, Dan Connolly, Lalana Kagal, Yosi Scharf, and Jim Hendler. N3logic: A logical framework for the world wide web. Theory Pract. Log. Program., 8, May 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Guoli Li and Hans-Arno Jacobsen. Composite subscriptions in content-based publish/subscribe systems. In Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware, Middleware '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Martin Murth and Eva Kühn. Knowledge-based coordination with a reliable semantic subscription mechanism. In Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, pages 1374--1380, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Daniel P. Miranker. Treat: A better match algorithm for ai production systems; long version. Technical report, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Don Batory. The leaps algorithm. Technical report, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Robert B. Doorenbos. Production matching for large learning systems. PhD thesis, 1995. UMI Order No. GAX95-22942. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Anoop Gupta. Parallelism in Production Systems. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Claudio Gutierrez, Carlos A. Hurtado, and Alejandro Vaisman. Introducing time into rdf. IEEE Trans. on Knowl. and Data Eng., 19, February 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Nuno Lopes, Axel Polleres, Umberto Straccia, and Antoine Zimmermann. Anql: Sparqling up annotated rdfs. In Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I, ISWC'10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Jonas Tappolet and Abraham Bernstein. Applied temporal rdf: Efficient temporal querying of rdf data with sparql. In Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications, ESWC 2009 Heraklion, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Darko Anicic, Paul Fodor, Sebastian Rudolph, and Nenad Stojanovic. Ep-sparql: a unified language for event processing and stream reasoning. In Proceedings of the 20th international conference on World wide web, WWW '11, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Davide Francesco Barbieri, Daniele Braga, Stefano Ceri, and Michael Grossniklaus. An execution environment for C-SPARQL queries. In Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10, Lausanne, Switzerland, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient matching of SPARQL subscriptions using rete

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
      March 2012
      2179 pages
      ISBN:9781450308571
      DOI:10.1145/2245276
      • Conference Chairs:
      • Sascha Ossowski,
      • Paola Lecca

      Copyright © 2012 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 26 March 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      SAC '12 Paper Acceptance Rate270of1,056submissions,26%Overall Acceptance Rate1,650of6,669submissions,25%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader