On the construction of efficient match networks

Jack S.E. Tan, Jaideep Srivastava, Sashi Shekhar

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

Abstract

The performance of rule based systems are limited by the multiple pattern multiple object (MPMO) matching problem. Various efficiency heuristics have been applied manually to speed-up the solutions to MPMO. We address the problem of automatically determining the best match network for rule matching. We contribute simple conditions to guarantee the optimality of given network in presence of updates to the working memory.

Original languageEnglish
Title of host publicationApplied Computing
Subtitle of host publicationTechnological Challenges of the 1990's
PublisherPubl by ACM
Pages353-362
Number of pages10
ISBN (Print)089791502X
Publication statusPublished - 1 Dec 1992
EventProceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92 - Kansas City, KS, USA
Duration: 1 Mar 19923 Mar 1992

Publication series

NameApplied Computing: Technological Challenges of the 1990's

Other

OtherProceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92
CityKansas City, KS, USA
Period1/3/923/3/92

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Tan, J. S. E., Srivastava, J., & Shekhar, S. (1992). On the construction of efficient match networks. In Applied Computing: Technological Challenges of the 1990's (pp. 353-362). (Applied Computing: Technological Challenges of the 1990's). Publ by ACM.