Tree Awareness for Relational DBMS Kernels: Staircase Join

Grust, Torsten and Keulen van, Maurice (2003) Tree Awareness for Relational DBMS Kernels: Staircase Join. In: 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

PDF
Restricted to UT campus only
182Kb

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
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Databases (DB)
Link to this item:	http://purl.utwente.nl/publications/63610
Official URL:	http://dx.doi.org/10.1007/b13249
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page