Please use this identifier to cite or link to this item:
|Title:||A utilization of schema constraints to transform predicates in XPath query||Authors:||Thi Le, D.X.
XML Query Processing
|Issue Date:||2010||Citation:||Thi Le, D.X.,Bressan, S.,Pardede, E.,Taniar, D.,Rahayu, W. (2010). A utilization of schema constraints to transform predicates in XPath query. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6261 LNCS (PART 1) : 331-339. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-15364-8_28||Abstract:||A predicate in an XPath query expresses a condition to be fulfilled in addition to the structural constraint imposed by the path itself. The condition is a Boolean expression. It may involve comparisons between elements and values, path expressions denoting elements to be compared as well as further path expressions. In this paper, we are concerned with the semantic transformation of such predicates in the presence of a schema for the XML data. The goal of this semantic transformation is to eliminate the predicates from the XPath query if possible in order to avoid the early, unnecessary query processing. Otherwise, if predicates are retained, we show how they can be semantically transformed to boost efficiency and reduce resource utilization. An algorithm is proposed to determine whether predicates should be eliminated or retained. We implement the proposed transformations and empirically evaluate their efficiency and effectiveness as semantic query optimization devices. © 2010 Springer-Verlag.||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/41739||ISBN:||3642153631||ISSN:||03029743||DOI:||10.1007/978-3-642-15364-8_28|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.