Fast structural join with a location function

Nan Tang, Jeffrey Xu Yu, Kam Fai Wong, Haifeng Jiang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

A structural join evaluates structural relationship (parentchild or ancestor-descendant) between XML elements. It serves as an important computation unit in XML pattern matching, such as twig joins. There exists many work on efficient structural joins. In particular, indexes can expedite structural joins by skipping unmatchable elements. A typical use of indexes is to retrieve, for a given element, all its ancestor (or descendant) elements from an indexed set. However we observed two possible limitations with such index probes, namely false hit and false locate. A false hit means that an index probe touches unnecessary data besides real results; a false locate stands for a (wasted) probe that has zero answers. Obviously false hit and false locate can affect negatively the efficiency of structural joins. In this paper, we challenge ourselves to develop new structural join algorithm with no false hit and no false locate. We illustrate that R-Tree has the no false hit property (in contrast to B+-Tree) and hence is a good candidate for our algorithm. For no false locate, we propose a new function called Location which tells the probing points that will result in matches. We design and implement the Location function using a space-efficient structure, and present our algorithm using R-Tree together with the Location function. Extensive experiments show the efficiency of our algorithm.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings
Pages777-786
Number of pages10
DOIs
Publication statusPublished - 7 Jul 2006
Externally publishedYes
Event11th International Conference on Database Systems for Advanced Applications, DASFAA 2006 - Singapore, Singapore
Duration: 12 Apr 200615 Apr 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3882 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Conference on Database Systems for Advanced Applications, DASFAA 2006
CountrySingapore
CitySingapore
Period12/4/0615/4/06

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tang, N., Yu, J. X., Wong, K. F., & Jiang, H. (2006). Fast structural join with a location function. In Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings (pp. 777-786). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3882 LNCS). https://doi.org/10.1007/11733836_55