Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40919
Title: A path-based approach for efficient structural join with not-predicates
Authors: Li, H. 
Lee, M.L. 
Hsu, W. 
Li, L. 
Issue Date: 2007
Citation: Li, H.,Lee, M.L.,Hsu, W.,Li, L. (2007). A path-based approach for efficient structural join with not-predicates. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4443 LNCS : 31-42. ScholarBank@NUS Repository.
Abstract: There has been much research on XML query processing. However, there has been little work on the evaluation of XML queries involving not-predicates. Such queries are useful and common in many real-life applications. In this paper, we present a model called XQuery tree to model queries involving not-predicates and describe a path-based method to evaluate such queries efficiently. A comprehensive set of experiments is carried out to demonstrate the effectiveness and efficiency of the proposed solution. © Springer-Verlag Berlin Heidelberg 2007.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/40919
ISBN: 9783540717027
ISSN: 03029743
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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