Abstract
An important aspect of integration of AI and DBMS technology is identifying functional similarities in database processing and reasoning with rules. In this paper, we focus on applying concurrency techniques to rule-based production systems. We tailor DBMS concurrent execution to a production system environment and investigate the resulting concurrent execution strategies for productions. This research is in conjunction with a novel DBMS mechanism for testing if the left hand side conditions of productions are satisfied. This set-oriented mechanism uses a special data structure implemented using relational tables. To demonstrate the equivalence of a serial and a concurrent (interleaved) execution strategy, for a set of productions, we assume a locking scheme to enforce serializability and specify what locks must be obtained. We define a logical commit point for a production. After this point the execution of a production is independent of all other (executing) productions. We compare the number of possible serial and parallel execution schedules.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
