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

Fingerprint

Evaluation
Costs
Vertex of a graph
Engines
Data storage equipment
Path
Join
Cross product
Open Source
Baseline
Sharing
Engine
Enhancement
Linearly
Propagation

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Reducing the cost of the linear growth effect using adaptive rules with unlinking and lazy rule evaluation. / Proctor, Mark; Fusco, Mario; Sottara, Davide; Zimányi, Tibor.

On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences: CoopIS, C and TC, and ODBASE 2018, Proceedings. ed. / Dumitru Roman; Claudio Agostino Ardagna; Robert Meersman; Hervé Panetto; Christophe Debruyne; Henderik A. Proper. Springer Verlag, 2018. p. 592-601 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11230 LNCS).

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

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, CA Ardagna, R Meersman, H Panetto, C Debruyne & HA Proper (eds), On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences: CoopIS, C and TC, and ODBASE 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11230 LNCS, Springer Verlag, pp. 592-601, Confederated 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, 10/22/18. https://doi.org/10.1007/978-3-030-02671-4_38
Proctor M, Fusco M, Sottara D, Zimányi T. Reducing the cost of the linear growth effect using adaptive rules with unlinking and lazy rule evaluation. In Roman D, Ardagna CA, Meersman R, Panetto H, Debruyne C, Proper HA, editors, On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences: CoopIS, C and TC, and ODBASE 2018, Proceedings. Springer Verlag. 2018. p. 592-601. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-02671-4_38
Proctor, Mark ; Fusco, Mario ; Sottara, Davide ; Zimányi, Tibor. / Reducing the cost of the linear growth effect using adaptive rules with unlinking and lazy rule evaluation. On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences: CoopIS, C and TC, and ODBASE 2018, Proceedings. editor / Dumitru Roman ; Claudio Agostino Ardagna ; Robert Meersman ; Hervé Panetto ; Christophe Debruyne ; Henderik A. Proper. Springer Verlag, 2018. pp. 592-601 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ceb98cea01e747449cd4f6431ce3266d,
title = "Reducing the cost of the linear growth effect using adaptive rules with unlinking and lazy rule evaluation",
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.",
keywords = "Pattern matching, Production rules, Refraction, RETE, Rule engines",
author = "Mark Proctor and Mario Fusco and Davide Sottara and Tibor Zim{\'a}nyi",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-02671-4_38",
language = "English (US)",
isbn = "9783030026707",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "592--601",
editor = "Dumitru Roman and Ardagna, {Claudio Agostino} and Robert Meersman and Herv{\'e} Panetto and Christophe Debruyne and Proper, {Henderik A.}",
booktitle = "On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences",

}

TY - GEN

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

AU - Proctor, Mark

AU - Fusco, Mario

AU - Sottara, Davide

AU - Zimányi, Tibor

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Pattern matching

KW - Production rules

KW - Refraction

KW - RETE

KW - Rule engines

UR - http://www.scopus.com/inward/record.url?scp=85055953370&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055953370&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-02671-4_38

DO - 10.1007/978-3-030-02671-4_38

M3 - Conference contribution

SN - 9783030026707

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 592

EP - 601

BT - On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences

A2 - Roman, Dumitru

A2 - Ardagna, Claudio Agostino

A2 - Meersman, Robert

A2 - Panetto, Hervé

A2 - Debruyne, Christophe

A2 - Proper, Henderik A.

PB - Springer Verlag

ER -