Abstract
We show how it is possible to exploit reduction theory of high level Petri net theory, for query optimization in deductive databases. For this we first present a model derived from high level Petri nets, called Deductive Coloured Petri Net (DCPN), which allows an efficient implementation of deductive database management systems. Thus, we give conditions of applying high level Petri net reduction techniques, and adapt them to the DCPN model. Finally, we illustrate through an example, the benefits of such reductions on the query evaluation in deductive databases.
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.
