An Enhanced RETE Algorithm for Large Scale Data Access.

Nobuhiro Ajitomi, Hiroyasu Kurose: An Enhanced RETE Algorithm for Large Scale Data Access. DASFAA 1989: 117-124
  author    = {Nobuhiro Ajitomi and
               Hiroyasu Kurose},
  editor    = {Sukho Lee and
               Hideko S. Kunii and
               Won Kim and
               In Sup Paik and
               Yahiko Kambayashi},
  title     = {An Enhanced RETE Algorithm for Large Scale Data Access},
  booktitle = {International Symposium on Database Systems for Advanced Applications,
               Seoul, Korea, April 10-12, 1989},
  publisher = {Dept. of Computer Science, KAIST, P.O. Box 150, ChongRyang, Seoul,
               131-650, Korea},
  year      = {1989},
  pages     = {117-124},
  ee        = {db/conf/dasfaa/AjitomiK89.html},
  crossref  = {DBLP:conf/dasfaa/89},
  bibsource = {DBLP,}


This paper introduces the OD-RETE pattern matching algorithm which is obtained by incorporating the on-demand evaluation mechanism into the RETE algorithm and which is suitable for production systems accessing to large scale data. It allows the construction of both a "data-driven" network simulating an ordinary RETE network and a "request-driven" network performing on-demand formula evaluation. The latter network can treat large data without loading the entire data into the network. This paper describes the OD-RETE algorithm by defining nodes as "objects" which exchange messages between one another, it also discusses the ways to utilize this algorithm with DBMSs.

Copyright © 1989 by The Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. Permission to copy without all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the DASFAA copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Organizing Commitee of the International Symposium on Database Systems for Advanced Applications. To copy otherwise, or to republish, requires a fee and/or special permission from the Organizing Commitee.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX


Michel E. Adiba, Bruce G. Lindsay: Database Snapshots. VLDB 1980: 86-91 BibTeX
José A. Blakeley, Per-Åke Larson, Frank Wm. Tompa: Efficiently Updating Materialized Views. SIGMOD Conference 1986: 61-71 BibTeX
Upen S. Chakravarthy, Jack Minker: Multiple Query Processing in Deductive Databases using Query Graphs. VLDB 1986: 384-391 BibTeX
Charles Forgy: Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem. Artif. Intell. 19(1): 17-37(1982) BibTeX
Bruce G. Lindsay, Laura M. Haas, C. Mohan, Hamid Pirahesh, Paul F. Wilms: A Snapshot Differential Refresh Algorithm. SIGMOD Conference 1986: 53-60 BibTeX
Claudia Bauzer Medeiros, Frank Wm. Tompa: Understanding the Implications of View Update Policies. VLDB 1985: 316-323 BibTeX
Daniel P. Miranker: TREAT: A Better Match Algorithm for AI Production System Matching. AAAI 1987: 42-47 BibTeX
Jean-Marie Nicolas: Logic for Improving Integrity Checking in Relational Data Bases. Acta Inf. 18: 227-253(1982) BibTeX
Marshall I. Schor, Timothy Daly, Ho Soo Lee, Beth Tibbitts: Advances in Rete Pattern Matching. AAAI 1986: 225-232 BibTeX
Timos K. Sellis: Multiple-Query Optimization. ACM Trans. Database Syst. 13(1): 23-52(1988) BibTeX
Oded Shmueli, Alon Itai: Maintenance of Views. SIGMOD Conference 1984: 240-255 BibTeX
Kazimierz Subieta, Wiktor Rzeczkowski: Query Optimization by Stored Queries. VLDB 1987: 369-380 BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:05:12 2009