Please use this identifier to cite or link to this item:
|Title:||Related axis: The extension to xpath towards effective xml search||Authors:||Zhou, J.-F.
|Issue Date:||2012||Citation:||Zhou, J.-F., Ling, T.W., Bao, Z.-F., Meng, X.-F. (2012). Related axis: The extension to xpath towards effective xml search. Journal of Computer Science and Technology 27 (1) : 195-212. ScholarBank@NUS Repository. https://doi.org/10.1007/s11390-012-1217-0||Abstract:||We investigate the limitations of existing XML search methods and propose a new semantics, related relation- ship, to effectively capture meaningful relationships of data elements from XML data in the absence of structural constraints. Then we make an extension to XPath by introducing a new axis, related axis, to specify the related relationship between query nodes so as to enhance the flexibility of XPath. We propose to reduce the cost of computing the related relationship by a new schema summary that summarizes the related relationship from the original schema without any loss. Based on this schema summary, we introduce two indices to improve the performance of query processing. Our algorithm shows that the evaluation of most queries can be equivalently transformed into just a few selection and value join operations, thus avoids the costly structural join operations. The experimental results show that our method is effective and efficient in terms of comparing the effectiveness of the related relationship with existing keyword search semantics and comparing the efficiency of our evaluation methods with existing query engines. © 2012 Springer Science+Business Media, LLC & Science Press, China.||Source Title:||Journal of Computer Science and Technology||URI:||http://scholarbank.nus.edu.sg/handle/10635/39706||ISSN:||10009000||DOI:||10.1007/s11390-012-1217-0|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 23, 2020
checked on Mar 22, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.