Please use this identifier to cite or link to this item:
|Title:||A path-based labeling scheme for efficient structural join||Authors:||Li, H.
|Issue Date:||2005||Citation:||Li, H.,Lee, M.L.,Hsu, W. (2005). A path-based labeling scheme for efficient structural join. Lecture Notes in Computer Science 3671 : 34-48. ScholarBank@NUS Repository.||Abstract:||The structural join has become a core operation in XML query processing. This work examines how path information in XML can be utilized to speed up the structural join operation. We introduce a novel approach to pre-filter path expressions and identify a minimal set of candidate elements for the structural join. The proposed solution comprises of a path-based node labeling scheme and a path join algorithm. The former associates every node in an XML document with its path type, while the latter greatly reduces the cost of subsequent element node join by filtering out elements with irrelevant path types. Comparative experiments with the state-of-the-art holistic join algorithm clearly demonstrate that the proposed approach is efficient and scalable for queries ranging from simple paths to complex branch queries. © Springer-Verlag Berlin Heidelberg 2005.||Source Title:||Lecture Notes in Computer Science||URI:||http://scholarbank.nus.edu.sg/handle/10635/40776||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 28, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.