Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/40513
Title: PathStack: A holistic path join algorithm for path query with not-predicates on XML data
Authors: Jiao, E.
Ling, T.W. 
Chan, C.-Y. 
Issue Date: 2005
Source: Jiao, E.,Ling, T.W.,Chan, C.-Y. (2005). PathStack: A holistic path join algorithm for path query with not-predicates on XML data. Lecture Notes in Computer Science 3453 : 113-124. ScholarBank@NUS Repository.
Abstract: The evaluation of path queries forms the basis of complex XML query processing which has attracted a lot of research attention. However, none of these works have examined the processing of more complex queries that contain not-predicates. In this paper, we present the first study on evaluating path queries with not-predicates. We propose an efficient holistic path join algorithm, PathStack1, which has the following advantages: (1) it requires only one scan of the relevant data to evaluate path queries with not-predicates; (2) it does not generate any intermediate results; and (3) its memory space requirement is bounded by the longest path in the input XML document. We also present an improved variant of PathStack that further minimizes unnecessary computations. © Springer-Verlag Berlin Heidelberg 2005.
Source Title: Lecture Notes in Computer Science
URI: http://scholarbank.nus.edu.sg/handle/10635/40513
ISSN: 03029743
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

42
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.