The KIPS Transactions:PartD (정보처리학회논문지D)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

The Rule Case Simplification Algorithm to be used in a Rule-Based System

규칙기반 시스템에 사용되는 규칙 간소화 알고리즘

  • ;
  • 여정모 (부경대학교 컴퓨터공학과)
  • Received : 2010.06.07
  • Accepted : 2010.09.18
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

A rule is defined as a case to determine the target values according to combination of various Business factors. The information system is used to represent enterprise's business, which includes and implements the amount of these rules to Rule-Based System. A Rule-Based System can be constructed by using the rules engine method or Relational Database technology. Because the rules engine method has some disadvantages, the Rule-Based System is mostly developed with Relational Database technology. When business scales become larger and more complex, a large number of various rule cases must be operated in system, and processing these rule cases requires additional time, overhead and storage space, and the speed of execution slows down. To solve these problems, we propose a simplification algorithm that converts a large amount of rule cases to simplification rule cases with same effects. The proposed algorithm is applied to hypothetical business rule data and a large number of simplification experiments and tests are conducted. The final results proved that the number of rows can be reduced to some extent. The proposed algorithm can be used to simplify business rule data for improving performance of the Rule-Based System implemented with the Relational Database.

다양한 업무요소들의 값의 조합에 따라 대상 값이 결정되는 것을 규칙이라고 한다. 업무를 표현한 기업의 정보시스템은 이러한 수많은 규칙들을 포함하는데, 이러한 규칙들을 구현한 서버 시스템을 규칙기반 시스템이라고 한다. 규칙기반 시스템은 규칙 엔진 기법을 사용하거나 직접 데이터베이스를 사용하여 구현된다. 규칙 엔진 기법은 많은 단점을 가지기 때문에 대부분 관계형 데이터베이스를 사용하여 규칙기반 시스템을 구현한다. 업무의 규모가 커지고 복잡하게 될수록 수많은 다양한 경우의 규칙이 존재하게 되므로 시간과 비용이 크게 증가하고, 대량의 저장공간을 요구하게 될 뿐만 아니라 수행속도의 저하 현상도 많이 발생한다. 따라서 본 연구에서는 이러한 수많은 경우의 규칙들을 동일한 효과를 가지는 간소화된 경우의 규칙들로 변환시킬 수 있는 알고리즘을 제안한다. 본 연구의 알고리즘을 가지고 다양한 업무 규칙 데이터에 적용하여 테스트한 결과 데이터 건수를 간소화시킬 수 있음을 입증하였다. 본 연구의 알고리즘을 사용하여 업무 규칙 데이터를 간소화하게 되면 데이터 베이스를 사용하여 구현된 규칙기반 시스템의 성능을 개선할 수 있다.

Keywords

References

  1. En-core consulting, “Rule Base Data Model”, 4th Seminar material, Apr. 2008.
  2. Janusz Kacprzyk, “Logical Functions for Rule-Base Systems, second edition”, Spinger, 2006.
  3. Ahmed T. Sadik, “Premises Reduction of Rule Based Expert System Using Association Rules Technique”, International Journal of Soft Computing, Vol.33, No.1, pp.195-200, 2008. https://doi.org/10.3923/ijscomp.2008.195.200
  4. Oracle Corp, “$Oracle{\circledR}$ Fusion Middleware User's Guide for Oracle Business Rules 11g Release 1 (11.1.1)”, Oracle White Paper, pp.1-56, 2009.
  5. Alison Cawsey, “The architecture of forward chaining Rule-Base System and backward chaining Rule-Base System”, Computing and Electrical Engineering Journal, Vol.14. No.3, pp.123-156, Dec., 2007.
  6. David C.Hay, “Data Model Patterns A Metadata Map”, Morgan Kaufmann Publishing, pp.273-338, 2007.
  7. Len Silverston & Paul Agnew, “The Data Model Resource Book”, Wiley Publishing, pp. 411-468, 2009.
  8. Steve Hoberman, “Data Modeling Master Class”, Steve Hoberman & Associates LLC, pp. 112-280, 2008.
  9. Stephande Faroult & Peter Robson, “The Art of SQL”, publishing House of electronics industry, pp.167-190, 2008.
  10. Lee Huw Sick, “New Written, Large Scale Database Solution”, Publishing En-core consulting, pp.1-636, 2005.
  11. Malcolm Chisholm, “From How to Build a Business Rules Engine: Extending Application Functionality through Metadata Engineering”, Morgan Kaufman Publishing, pp.1-50, 2004.
  12. L.Silverston, “The Model Resource Book Volumen1”, Wiley Publishing, pp.133-180, 2001.
  13. Graeme Simsion, “Data Modeling Theory and Practice”, Technics Publications LLC, pp.230-276, 2007.
  14. Kerry Patterson & Joseph Grenny, “Crucial Conversations: Tools for Talking When Stakes are High”, McGraw-Hill Publishing, pp.125-210, 2002.
  15. InSung Kang, “Tree-Based Index Overlay in Hybrid Peer-to-Peer Systems”, Journal of Computer Science and Technology, Vol.25, No.2, pp.179-180, 2009. https://doi.org/10.1007/s11390-010-9314-4
  16. P.W. Chandana Prasad, Azam Beg, Ashutosh Kumar Singh, “Effect of Quine-McCluskey Simplification on Boolean Space Complexity”, Conference on Innovative Technologies in Intelligent Systems and Industrial Applications, July, 2009.