The LEAPS Algorithm

Authors:
Don Batory
Affiliations:
-
Venue:
The LEAPS Algorithm
Year:
1994

Citing 0
Cited 8

Reengineering a complex application using a scalable data structure compiler

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
P2: A Lightweight DBMS Generator

Journal of Intelligent Information Systems
Components: a valuable investment for financial engineering, why derivative contracts should be active documents

PPPJ '06 Proceedings of the 4th international symposium on Principles and practice of programming in Java
Incremental pattern matching in the viatra model transformation system

Proceedings of the third international workshop on Graph and model transformations
Rule-Based Event Processing and Reaction Rules

RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
Adapting the rete-algorithm to evaluate F-logic rules

RuleML'07 Proceedings of the 2007 international conference on Advances in rule interchange and applications
Efficient matching of SPARQL subscriptions using rete

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Applying incremental graph transformation to existing models in relational databases

ICGT'12 Proceedings of the 6th international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

LEAPS is a state of the art production system compiler that produces the fastest sequential executable OPS5 rule sets. The performance of LEAPS is due to its reliance on complex data structures and search algorithms to speed rule processing. In this paper, we explain the LEAPS algorithms in terms of the programming abstractions of the P2 data structure compiler. THIS PAPER IS NOT AVAILABLE IN HARD COPY.