A new addressing scheme for discrimination networks easing development and testing

Rule Based Systems and Databased Management Systems are important tools for data storage and processing. Discrimination Networks (DNs) are an efficient way of matching conditions on data. DNs are based on the paradigm of dynamic programming and save intermediate computing results in network nodes. Therefore, an efficient scheme for addressing the data in the used memories is required. Currently used schemes are efficient but sophisticated in operation hindering the development of new approaches for structural and functional optimization of DNs. We introduce and discuss a new addressing scheme for fact referencing in DNs with aim to ease the development of optimization approaches for DNs. The scheme uses fact addresses computed from sets of edges between the nodes in a DN to reference data.