Relational Approach to Logical Query Optimization of XPath

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

20 Downloads (Pure)

Abstract

To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great potential. Recently, effective relational storage schemes and index structures have been proposed as well as special-purpose join operators to speed up querying of XML data using XPath/XQuery. In this paper, we address the topic of query plan construction and logical query optimization. The claim of this paper is that standard relational algebra extended with special-purpose join operators suffices for logical query optimization. We focus on the XPath accelerator storage scheme and associated staircase join operators, but the approach can be generalized easily.
Original languageEnglish
Title of host publicationFirst Twente Data Management Workshop (TDM 2004) on XML Databases and Information Retrieval, Enschede, The Netherlands, June 21, 2004
EditorsVojkan Mihajlović, Djoerd Hiemstra
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Pages57-63
Number of pages7
Publication statusPublished - 2004
Event1st Twente Data Management Workshop on XML Databases and Information Retrieval, TDM 2004TDMTDM - University of Twente, Enschede, Netherlands
Duration: 21 Jun 200421 Jun 2004
Conference number: 1

Publication series

NameCTIT workshop proceedings series
PublisherCTIT
NumberWP04-1
ISSN (Print)1574-0846
ISSN (Electronic)0929-0672

Workshop

Workshop1st Twente Data Management Workshop on XML Databases and Information Retrieval, TDM 2004TDMTDM
Abbreviated titleTDM
CountryNetherlands
CityEnschede
Period21/06/0421/06/04

Keywords

  • DB-XMLDB: XML DATABASES
  • DB-PRJPF: PATHFINDER

Fingerprint

Dive into the research topics of 'Relational Approach to Logical Query Optimization of XPath'. Together they form a unique fingerprint.

Cite this