Tree Awareness for Relational DBMS Kernels: Staircase Join

Torsten Grust, Maurice van Keulen

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

51 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationIntelligent Search on XML Data
Subtitle of host publicationApplications, Languages, Models, Implementations, and Benchmarks
EditorsHenk Blanken, Torsten Grabs, Hans-Jörg Schek, Ralf Schenkel, Gerhard Weikum
Place of PublicationBerlin, Germany
PublisherSpringer
Pages231-245
Number of pages15
ISBN (Print)978-3-540-40768-3
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume2818
ISSN (Print)0302-9743

Keywords

  • EWI-7668
  • DB-PRJPF: PATHFINDER
  • DB-XMLDB: XML DATABASES
  • IR-63610

Fingerprint Dive into the research topics of 'Tree Awareness for Relational DBMS Kernels: Staircase Join'. Together they form a unique fingerprint.

Cite this