Abstract
Parallel database technology makes it possible to handle ever-increasing data volumes. However, this is not sufficient to process complex queries on large databases fastly. For queries that must apply complex algorithms to the data and especially for those that correlate data from several tables, it is essential to enable an efficient and completely parallel evaluation of these algorithms within the DBMS. For example, as we have shown in chapter 5, new tailored join algorithms can increase the performance for certain operations like spatial joins, etc. by orders of magnitude. But, as we have already pointed out there, it is not yet possible for third-party developers to implement efficient user-defined join algorithms in current commercial ORDBMS. In fact, one cannot implement any new database operators. UDF cannot be used to implement new operators, as they are invoked by built-in database operators. The limitation of UDTF is obvious: although they can produce an entire output table, they can only have scalar arguments. Hence, UDTF are helpful in accessing external data sources [21] etc., but cannot be used to implement new database operators like new join algorithms.
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). User-Defined Table Operators. 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_6
Download citation
DOI: https://doi.org/10.1007/3-540-45507-8_6
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