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: Technological Challenges of the 1990's
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages353-362
Number of pages10
ISBN (Print)089791502X
Publication statusPublished - 1992
Externally publishedYes
EventProceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92 - Kansas City, KS, USA
Duration: 1 Mar 19923 Mar 1992

Other

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

Fingerprint

Knowledge based systems
Data storage equipment

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). New York, NY, United States: Publ by ACM.

On the construction of efficient match networks. / Tan, Jack S E; Srivastava, Jaideep; Shekhar, Sashi.

Applied Computing: Technological Challenges of the 1990's. New York, NY, United States : Publ by ACM, 1992. p. 353-362.

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

Tan, JSE, Srivastava, J & Shekhar, S 1992, On the construction of efficient match networks. in Applied Computing: Technological Challenges of the 1990's. Publ by ACM, New York, NY, United States, pp. 353-362, Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing - SAC '92, Kansas City, KS, USA, 1/3/92.
Tan JSE, Srivastava J, Shekhar S. On the construction of efficient match networks. In Applied Computing: Technological Challenges of the 1990's. New York, NY, United States: Publ by ACM. 1992. p. 353-362
Tan, Jack S E ; Srivastava, Jaideep ; Shekhar, Sashi. / On the construction of efficient match networks. Applied Computing: Technological Challenges of the 1990's. New York, NY, United States : Publ by ACM, 1992. pp. 353-362
@inproceedings{59fbf96362e845c6812ef465951e877b,
title = "On the construction of efficient match networks",
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.",
author = "Tan, {Jack S E} and Jaideep Srivastava and Sashi Shekhar",
year = "1992",
language = "English",
isbn = "089791502X",
pages = "353--362",
booktitle = "Applied Computing: Technological Challenges of the 1990's",
publisher = "Publ by ACM",

}

TY - GEN

T1 - On the construction of efficient match networks

AU - Tan, Jack S E

AU - Srivastava, Jaideep

AU - Shekhar, Sashi

PY - 1992

Y1 - 1992

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:0026984914

SN - 089791502X

SP - 353

EP - 362

BT - Applied Computing: Technological Challenges of the 1990's

PB - Publ by ACM

CY - New York, NY, United States

ER -