• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Efficient Queries on XML Data Through Partitioning

Olli Luoma, Efficient Queries on XML Data Through Partitioning. In: Joaquim Filipe, José Cordeiro (Eds.), Web Information Systems and Technologies, Lecture Notes in Business Information Processing 8, 98–108, Springer-Verlag Berlin Heidelberg, 2008.

Abstract:

The query evaluation algorithms of practically all XML management
systems are based on structural joins, i.e., operations which determine
all occurrences of parent/child, ancestor/descendant, preceding/
following etc. relationships between node sets. In this paper, we
present a simple method for accelerating structural joins which is very
easy to implement on different platforms. Our idea is to split the nodes
into disjoint partitions and use this information to avoid unnecessary
structural joins. Despite its simplicity, our proposal can considerably
accelerate XPath evaluation on different XML management systems. To
exemplify this, we describe two implementation options of our method -
one built from the scratch and one based on a relational database - and
present the results of our experiments.

BibTeX entry:

@INPROCEEDINGS{inpLuoma08a,
  title = {Efficient Queries on XML Data Through Partitioning},
  booktitle = {Web Information Systems and Technologies},
  author = {Luoma, Olli},
  volume = {8},
  series = {Lecture Notes in Business Information Processing},
  editor = {Filipe, Joaquim and Cordeiro, José},
  publisher = {Springer-Verlag Berlin Heidelberg},
  pages = {98–108},
  year = {2008},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Publication Forum rating of this publication: level 1

Edit publication