System Reorganization and Load Balancing of Parallel Database Rule Processing

In the coming decade, high-speed network computing using processors that are orders of magnitude faster than the platforms available today, will enable the integration and coalescing of vast amounts of information stored in diverse databases. This will provide unprecedented new opportunities for acquiring new knowledge by applying various inferential processes against such massive databases. Meeting this challenge requires significant advances in our understanding of how to build efficient, high-performance knowledge-base systems targeted to run on a variety of parallel and distributed hardware architectures.

[1]  Weining Zhang,et al.  A methodology for evaluating parallel graph algorithms and its application to single source reachability , 1993, [1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems.

[2]  Salvatore J. Stolfo,et al.  Performance of incremental update in database rule processing , 1994, Proceedings of IEEE International Workshop on Research Issues in Data Engineering: Active Databases Systems.

[3]  Salvatore J. Stolfo,et al.  Incremental evaluation of rules and its relationship to parallelism , 1991, SIGMOD '91.

[4]  Salvatore J. Stolfo,et al.  Improving Production System Performance on Parallel Architectures by Creating Constrained Copies of Rules , 1987 .

[5]  Ouri Wolfson,et al.  A new paradigm for parallel and distributed rule-processing , 1990, SIGMOD '90.

[6]  Salvatore J. Stolfo,et al.  PARULE: Parallel Rule Processing Using Meta-rules for Redaction , 1991, J. Parallel Distributed Comput..

[7]  Vipin Kumar,et al.  Scalable Load Balancing Techniques for Parallel Computers , 1994, J. Parallel Distributed Comput..

[8]  Jennifer Widom,et al.  An overview of production rules in database systems , 1993, The Knowledge Engineering Review.

[9]  Salvatore J. Stolfo.  Five Parallel Algorithms for Production System Execution on the DADO Machine , 1984, AAAI.