Abstract
Our main contribution in this chapter is to show how a broad class of user-defined functions can be processed in parallel. This class includes both, user-defined scalar functions and user-defined aggregate functions. To this aim we propose a framework covering both the necessary interfaces that allow the appropriate registration of userdefined aggregate functions with the ORDBMS and their parallel processing. Parallel computing of user-defined aggregate functions is especially useful for application domains like decision support (e.g. based on a data warehouse that stores traditional as well as non-traditional data, like spatial, text or image data), as decision support queries often must compute complex aggregates. For example, in the TPC-D Benchmark 15 out of the 17 queries contain aggregate operations [99]. In addition, if scalar functions with a global context are processed in parallel, caution is needed in order to get semantically correct results. Our framework can help in this case, too. Furthermore, we show that some aggregate functions can easily be implemented, if their input is sorted, and they can thus profit from parallel sorting.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2001). Parallel of User-Defined Functions. In: New Concepts for Parallel Object-Relational Query Processing. Lecture Notes in Computer Science, vol 2169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45507-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-45507-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42781-0
Online ISBN: 978-3-540-45507-3
eBook Packages: Springer Book Archive