Reducing the cost of the linear growth effect using adaptive rules with unlinking and lazy rule evaluation

Mark Proctor, Mario Fusco, Davide Sottara, Tibor Zimányi

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The match cost of Rete [8] increases significantly and approximately linearly with the number of rules [2]. A major part of that cost is the eager creation of cross products within the join nodes in an attempt to materialize rule instantiations. This paper builds on the idea of adaptive rules [1] using the unlinking of nodes, segments of nodes and rules to delay join attempts, which helps mitigate some aspects of the linear growth effect. By delaying the evaluation of a rule until after it’s linked and restricting the propagation to a single path, a lazy goal-driven evaluation behaviour is introduced. The algorithm also preserves node sharing by organising the network into segments and paths of segments; with memory now at node, segment and path levels. This paper presents the design and implementation of this work within the popular Open Source Drools rule engine. Drools also provides a baseline Rete implementation, without these enhancements, against which this work can be benchmarked. The evaluation of the results shows positive improvements over Rete, with no downsides.

    Original languageEnglish (US)
    Title of host publicationOn the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences
    Subtitle of host publicationCoopIS, C and TC, and ODBASE 2018, Proceedings
    EditorsDumitru Roman, Claudio Agostino Ardagna, Robert Meersman, Hervé Panetto, Christophe Debruyne, Henderik A. Proper
    PublisherSpringer Verlag
    Pages592-601
    Number of pages10
    ISBN (Print)9783030026707
    DOIs
    StatePublished - Jan 1 2018
    EventConfederated International Conferences: Cooperative Information Systems, CoopIS 2018, Ontologies, Databases, and Applications of Semantics, ODBASE 2018, and Cloud and Trusted Computing, C and TC, held as part of OTM 2018 - Valletta, Malta
    Duration: Oct 22 2018Oct 26 2018

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume11230 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    OtherConfederated International Conferences: Cooperative Information Systems, CoopIS 2018, Ontologies, Databases, and Applications of Semantics, ODBASE 2018, and Cloud and Trusted Computing, C and TC, held as part of OTM 2018
    CountryMalta
    CityValletta
    Period10/22/1810/26/18

    Keywords

    • Pattern matching
    • Production rules
    • Refraction
    • RETE
    • Rule engines

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Reducing the cost of the linear growth effect using adaptive rules with unlinking and lazy rule evaluation'. Together they form a unique fingerprint.

  • Cite this

    Proctor, M., Fusco, M., Sottara, D., & Zimányi, T. (2018). Reducing the cost of the linear growth effect using adaptive rules with unlinking and lazy rule evaluation. In D. Roman, C. A. Ardagna, R. Meersman, H. Panetto, C. Debruyne, & H. A. Proper (Eds.), On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences: CoopIS, C and TC, and ODBASE 2018, Proceedings (pp. 592-601). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11230 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-02671-4_38