Tree Awareness for Relational DBMS Kernels: Staircase Join


Grust, Torsten and Keulen, Maurice van (2003) Tree Awareness for Relational DBMS Kernels: Staircase Join. In: H.M. Blanken & T. Grabs & H.-J. Schek & R. Schenkel & G. Weikum (Eds.), Intelligent Search on XML Data: Applications, Languages, Models, Implementations, and Benchmarks. Lecture Notes in Computer Science, 2818 . Springer, Berlin, Germany, pp. 231-245. ISBN 9783540407683

[img] PDF
Restricted to UT campus only

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 tau to tables and from operations on tau 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 tau.
Item Type:Book Section
Copyright:© 2003 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page