Abstract
This paper presents a novel theoretical model for representing parallel relational query processing. It is based on two components. First, a scheme graph, called DPL graph, describes all possible execution dependencies between operators, including communication and run-time control mechanisms. Second, a timed high-level Petri net is used for modeling the data- and control flow of DPL graphs. Our model provides the framework for implementing a parallel query optimizer which is able to access sub-search spaces not yet considered. Furthermore, based on the DPL graphs and its related timed high-level Petri net, a simulation environment has been designed for testing run-time control strategies as well as query optimization methods.
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 call
