On-Demand Index for Efficient Structural Joins

  • Kun-Lung Wu
  • Shyh-Kwei Chen
  • Philip S. Yu
Conference paper

DOI: 10.1007/11775300_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4016)
Cite this paper as:
Wu KL., Chen SK., Yu P.S. (2006) On-Demand Index for Efficient Structural Joins. In: Yu J.X., Kitsuregawa M., Leong H.V. (eds) Advances in Web-Age Information Management. WAIM 2006. Lecture Notes in Computer Science, vol 4016. Springer, Berlin, Heidelberg

Abstract

A structural join finds all occurrences of structural, or containment, relationship between two sets of XML node elements: ancestor and descendant. Prior approaches to structural joins mostly focus on maintaining offline indexes on disks or requiring the elements in both sets to be sorted. However, either one can be expensive. More important, not all node elements are beforehand indexed or sorted. We present an on-demand, in-memory indexing approach to performing structural joins. There is no need to sort the elements. We discover that there are similarities between the problems of structural joins and stabbing queries. However, previous work on stabbing queries, although efficient in search time, is not directly applicable to structural joins because of high storage costs. We develop two storage reduction techniques to alleviate the problem of high storage costs. Simulations show that our new method outperforms prior approaches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kun-Lung Wu
    • 1
  • Shyh-Kwei Chen
    • 1
  • Philip S. Yu
    • 1
  1. 1.IBM T.J. Watson Research Center 

Personalised recommendations