Relational Approach to Logical Query Optimization of XPath

Maurice van Keulen, V.M. Mihajlovic (Editor), Djoerd Hiemstra (Editor)

Research output: Contribution to conferencePaperAcademicpeer-review

17 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 languageUndefined
Pages57-63
Number of pages7
Publication statusPublished - 21 Jun 2004

Keywords

  • EWI-7272
  • IR-66451
  • DB-XMLDB: XML DATABASES
  • DB-PRJPF: PATHFINDER

Cite this

@conference{87c69276ae3a41858fec1290f01fa73a,
title = "Relational Approach to Logical Query Optimization of XPath",
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.",
keywords = "EWI-7272, IR-66451, DB-XMLDB: XML DATABASES, DB-PRJPF: PATHFINDER",
author = "{van Keulen}, Maurice and V.M. Mihajlovic and Djoerd Hiemstra",
note = "Imported from EWI/DB PMS [db-utwente:inpr:0000003587], http://www.cs.utwente.nl/~tdm/?tdm=04",
year = "2004",
month = "6",
day = "21",
language = "Undefined",
pages = "57--63",

}

Relational Approach to Logical Query Optimization of XPath. / van Keulen, Maurice; Mihajlovic, V.M. (Editor); Hiemstra, Djoerd (Editor).

2004. 57-63.

Research output: Contribution to conferencePaperAcademicpeer-review

TY - CONF

T1 - Relational Approach to Logical Query Optimization of XPath

AU - van Keulen, Maurice

A2 - Mihajlovic, V.M.

A2 - Hiemstra, Djoerd

N1 - Imported from EWI/DB PMS [db-utwente:inpr:0000003587], http://www.cs.utwente.nl/~tdm/?tdm=04

PY - 2004/6/21

Y1 - 2004/6/21

N2 - 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.

AB - 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.

KW - EWI-7272

KW - IR-66451

KW - DB-XMLDB: XML DATABASES

KW - DB-PRJPF: PATHFINDER

M3 - Paper

SP - 57

EP - 63

ER -