@inbook{a01ef240595340fb8966fef12de1623e,
title = "Tree Awareness for Relational DBMS Kernels: Staircase Join",
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.",
keywords = "EWI-7668, DB-PRJPF: PATHFINDER, DB-XMLDB: XML DATABASES, IR-63610",
author = "Torsten Grust and {van Keulen}, Maurice",
year = "2003",
doi = "10.1007/978-3-540-45194-5_16",
language = "English",
isbn = "978-3-540-40768-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "231--245",
editor = "Henk Blanken and Torsten Grabs and Hans-J{\"o}rg Schek and Ralf Schenkel and Gerhard Weikum",
booktitle = "Intelligent Search on XML Data",
address = "Germany",
}