.png){kind=icon}
.png){kind=icon}
Return
An efficient MapReduce-based rule matching method for production system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2015.03.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Production systems based on knowledge rules have been widely used for reasoning both in industry and academia. However, rule matching in production system is time-consuming too much and it always incur the system crash when the massive knowledge exceeds the limitations of memory and computing capacity of one single computer. The advent of cloud computing a new on-demand computing model brings us an inspiring perspective to address this problem. In this paper, a MapReduce-based rule matching method was proposed. It decomposes the task of rule matching and maps subtasks to different computers in a distributed and parallel computing environment, and gets the final matching result after reduce phase. An experimental evaluation shows the high efficiency of the method. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
MapReduce
Production system
Rule matching
Distributed
Parallel
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W