Abstract

The use of intra-transaction parallelism within a multi-processor database system is well suited to meet the special requirements of complex transactions as known of the so-called non-standard database applications. This paper describes a mechanism for easily implementing and evaluating different parallel execution schemes for any given complex transaction. The key idea is to separate the algorithmic aspects of the computation from the description of the parallel execution plan. This approach supports in particular massive parallel database applications, which show a number of very favorable properties in regard to resource consumption in a multiprocessor database system (linear speedup and scaleup).KeywordsDatabase SystemParallel ExecutionComplex QueryMultiprocessor SystemDatabase ApplicationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Full Text

Published Version

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

Disclaimer: 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.