Abstract
Relational database management systems (RDBMSs) derive much of their efficiency from the versatility of their core data structure: tables of tuples. Such tables are simple enough to allow for an efficient representation on all levels of the memory hierarchy, yet sufficiently generic to host a wide range of data types. If one can devise mappings from a data type τ to tables and from operations on τ to relational queries, an RDBMS may be a premier implementation alternative. Temporal intervals, complex nested objects, and spatial data are sample instances for such types τ.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grust, T., van Keulen, M. (2003). Tree Awareness for Relational DBMS Kernels: Staircase Join. In: Blanken, H., Grabs, T., Schek, HJ., Schenkel, R., Weikum, G. (eds) Intelligent Search on XML Data. Lecture Notes in Computer Science, vol 2818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45194-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-45194-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40768-3
Online ISBN: 978-3-540-45194-5
eBook Packages: Springer Book Archive