Article

Free access

A predicate matching algorithm for database rule systems

Authors:

Eric N. Hanson,

Moez Chaabouni,

Yu-Wang WangAuthors Info & Claims

SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

Pages 271 - 280

https://doi.org/10.1145/93597.98736

Published: 01 May 1990 Publication History

Abstract

Forward-chaining rule systems must test each newly asserted fact against a collection of predicates to find those rules that match the fact. Expert system rule engines use a simple combination of hashing and sequential search for this matching. We introduce an algorithm for finding the matching predicates that is more efficient than the standard algorithm when the number of predicates is large. We focus on equality and inequality predicates on totally ordered domains. This algorithm is well-suited for database rule systems, where predicate-testing speed is critical. A key component of the algorithm is the interval binary search tree (IBS-tree). The IBS-tree is designed to allow efficient retrieval of all intervals (e.g. range predicates) that overlap a point, while allowing dynamic insertion and deletion of intervals. The algorithm could also be used to improve the performance of forward-chaining inference engines for large expert systems applications.

References

[1]

G M Adel'son-Vel'skn and E M Landis An algorithm for the organization of reformation Somet Math Dokl, 3, 1962

[2]

P~ Bayer Symetnc binary B-trees data structure and maintenance algorithms Acta InJormat- 8ca, 1, 1972

[3]

Virginia E Barker and Denms E O'Connor Expert systems for configuration at Digital XCON and beyond CACM, 32(3), March 1989

Digital Library

[4]

Larry Colhns Informal survey of relational database apphcatlons at Wright-Patterson AFB 1989 (personal commumcatlon)

[5]

U Dayal, B Blaustem, A Buchmann, et al The HIPAC project Combining active databases and timing constraints SIGMOD Record, 17(1)51- 70, March 1988

Digital Library

[6]

Lois M L Delcambre and James N Etheredge The relational production language A production language for relational databases In Proceedmgs of the Second International Conference on Expert Database Systems, pages 153-162, April 1988

[7]

Charles L Forgy OPS5 User's Manual Techmcal Report CMU-CS-81-135, Carnegm-Mellon Umverslty, Pittsburgh, PA 15213, 3uly 1981

[8]

C L Forgy Rete A fast algorithm for the many pattern/many object pattern match problem Art2ficsal Intellsgence, 19 17-37, 1982

Digital Library

[9]

L J Gulbas and R Sedgewlck A dichromatic framework for balanced binary trees In Proc 19th Annual IEEE Sympos,um on Foundat, ons of Computer Sczence, 1978

[10]

A Guttman R-trees A dynamic mdexstructure for spahal searching In Proceed, ngs of the 1984 A CM-SIGMOD Conference on Management of Data, June 1984

Digital Library

[11]

Eric N Hanson An initial report on the design of Arml a DBMS with an xntegrated produchon rule system SIGMOD Record, 18(3), September 1989

Digital Library

[12]

Enc N Hanson and Moez Chaaboum The IBS Tree A Data Structure .for Fsn&ng All Intervals That Overlap a Posnt Technical Report, Wright State Umverslty, March 1989

[13]

Michael A Kelly and Rudolph E Sevlora An evaluahon of DRete on CUPID for OPS5 In Procee&ngs o/ the Eleventh Internatzonal Josnt Conference on Artsficsal Intellzgence, 1989

[14]

Edward M McCrelght Pnonty search trees SIAM Journal o/ Computzng, 14(2) 257-278, 1985

[15]

Darnel P Mlranker TREAT a better match algonthm for AI produchon systems In Proceed-,ngs of AAAI 87 Conference on Artsfic,al intelligence, pages 42-47, August 1987

[16]

P Sehnger et al Access path selection in a relational database management system In Proceedzngs of the 1979 A CM-SIGMOD Internat,onal Conference on Management of Data, June 1979

Digital Library

[17]

I-Ianan Samet Hierarchical representations of collectmns of small rectangles A CM Computing Surveys, 20(4) 271-309, December 1988

Digital Library

[18]

I-Ianan Samet The Des,gn and Analys,s of Spat, al Data Structures Addmmn Wesley, 1990

Digital Library

[19]

Michael Stonebraker, Enc Hanson, and Splros Potamlanos The POSTGRES rule manager IEEE Transact, ons on Software Eng, neemng, 14(7) 897-907, July 1988

Digital Library

[20]

Tlmos Selhs, Chlh-Chen Lm, and Lomqa Raschld Data mteslve productmn systems the DIPS approach SIGMOD Record, September 1989

Digital Library

[21]

M Stonebraker, T Selhs, and E Hanson An analysis of rule mderang lmplementatmns in data base systems In Proceed,ngs o/ the F, rst Annual Conference on Expert Database Systems, April 1986

[22]

Robert Endre Tarjan Data Structures and Network Algor,thms Socmty for Industnal and Apphed Mathemahcs, 1983

Digital Library

Cited By

Qing Zhou Zhiyong Xiong Rong Hong Tao You Nan Jiang (2015)Hybrid content-based publish/subscribe system2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)10.1109/FSKD.2015.7382279(2122-2126)Online publication date: Aug-2015
https://doi.org/10.1109/FSKD.2015.7382279
Sadoghi MJacobsen H(2013)Analysis and optimization for boolean expression indexingACM Transactions on Database Systems10.1145/2487259.248726038:2(1-47)Online publication date: 4-Jul-2013
https://dl.acm.org/doi/10.1145/2487259.2487260
Sadoghi MJacobsen HSellis TMiller RKementsietsidis AVelegrakis Y(2011)BE-treeProceedings of the 2011 ACM SIGMOD International Conference on Management of data10.1145/1989323.1989390(637-648)Online publication date: 12-Jun-2011
https://dl.acm.org/doi/10.1145/1989323.1989390
Show More Cited By

Index Terms

A predicate matching algorithm for database rule systems

Recommendations

A predicate matching algorithm for database rule systems

Forward-chaining rule systems must test each newly asserted fact against a collection of predicates to find those rules that match the fact. Expert system rule engines use a simple combination of hashing and sequential search for this matching. We ...
Peirce's rule in natural deduction

In stark contrast to Natural Deduction for Intuitionistic Logic, Natural Deduction for Classical Logic suffers from some well-known limitations: although normalisation can be proved, the standard proof of Prawitz (Natural deduction. A proof Theoretical ...
An Intuitionistic Completeness Theorem for Classical Predicate Logic

This paper presents an intuitionistic proof of a statement which under a classical reading is logically equivalent to Gödel's completeness theorem for classical predicate logic.

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

May 1990

398 pages

ISBN:0897913655

DOI:10.1145/93597

Chairman:
Hector Garcia-Molina
Princeton Univ., Princeton, NJ

ACM SIGMOD Record Volume 19, Issue 2
Jun. 1990
392 pages
ISSN:0163-5808
DOI:10.1145/93605
Editor:
H. V. Jagadish
AT&T Bell Laboratories, Murray Hill, NJ
Issue’s Table of Contents

Copyright © 1990 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]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD 90

Sponsor:

SIGMOD

SIGMOD 90: SIGMOD'90

May 23 - 26, 1990

New Jersey, Atlantic City, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

117
Total Citations
View Citations
1,163
Total Downloads

Downloads (Last 12 months)96
Downloads (Last 6 weeks)25

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Qing Zhou Zhiyong Xiong Rong Hong Tao You Nan Jiang (2015)Hybrid content-based publish/subscribe system2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)10.1109/FSKD.2015.7382279(2122-2126)Online publication date: Aug-2015
https://doi.org/10.1109/FSKD.2015.7382279
Sadoghi MJacobsen H(2013)Analysis and optimization for boolean expression indexingACM Transactions on Database Systems10.1145/2487259.248726038:2(1-47)Online publication date: 4-Jul-2013
https://dl.acm.org/doi/10.1145/2487259.2487260
Sadoghi MJacobsen HSellis TMiller RKementsietsidis AVelegrakis Y(2011)BE-treeProceedings of the 2011 ACM SIGMOD International Conference on Management of data10.1145/1989323.1989390(637-648)Online publication date: 12-Jun-2011
https://dl.acm.org/doi/10.1145/1989323.1989390
Kamra ABertino E(2011)Design and Implementation of an Intrusion Response System for Relational DatabasesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2010.15123:6(875-888)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1109/TKDE.2010.151
Lee JKang SLee YLee SSong J(2009)BMQ-ProcessorIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2008.14021:2(234-252)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1109/TKDE.2008.140
Hanson EWidom J(2009)An overview of production rules in database systemsThe Knowledge Engineering Review10.1017/S02698889000001268:2(121-143)Online publication date: 7-Jul-2009
https://doi.org/10.1017/S0269888900000126
Shen H(2009)Content-Based Publish/Subscribe SystemsHandbook of Peer-to-Peer Networking10.1007/978-0-387-09751-0_49(1333-1366)Online publication date: 15-Oct-2009
https://doi.org/10.1007/978-0-387-09751-0_49
Bittner SHinze AJacobsen H(2007)The arbitrary Boolean publish/subscribe modelProceedings of the 2007 inaugural international conference on Distributed event-based systems10.1145/1266894.1266938(226-237)Online publication date: 20-Jun-2007
https://dl.acm.org/doi/10.1145/1266894.1266938
Park JHong BBan C(2007)A Continuous Query Index for Processing Queries on RFID Data StreamProceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications10.1109/RTCSA.2007.5(138-145)Online publication date: 21-Aug-2007
https://dl.acm.org/doi/10.1109/RTCSA.2007.5
Bittner SHinze A(2006)Pruning subscriptions in distributed publish/subscribe systemsProceedings of the 29th Australasian Computer Science Conference - Volume 4810.5555/1151699.1151722(197-206)Online publication date: 1-Jan-2006
https://dl.acm.org/doi/10.5555/1151699.1151722
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents