Please use this identifier to cite or link to this item:
|Title:||Multiway SLCA-based keyword search in XML data||Authors:||Sun, C.
|Keywords:||Keyword search query
Lowest common ancestor
|Issue Date:||2007||Citation:||Sun, C.,Chan, C.-Y.,Goenka, A.K. (2007). Multiway SLCA-based keyword search in XML data. 16th International World Wide Web Conference, WWW2007 : 1043-1052. ScholarBank@NUS Repository. https://doi.org/10.1145/1242572.1242713||Abstract:||Keyword search for smallest lowest common ancestors (SLCAs)in XML data has recently been proposed as a meaningful way to identify interesting data nodes inXML data where their subtrees contain an input set of keywords. In this paper, we generalize this useful search paradigm to support keyword search beyond the traditional AND semantics to include both AND and OR boolean operators as well. We first analyze properties of the LCA computation and propose improved algorithms to solve the traditional keyword search problem (with only AND semantics). We then extend our approach to handle general keyword search involving combinations of AND and OR boolean operators. The effectiveness of our new algorithms is demonstrated with a comprehensive experimental performance study.||Source Title:||16th International World Wide Web Conference, WWW2007||URI:||http://scholarbank.nus.edu.sg/handle/10635/40301||ISBN:||1595936548||DOI:||10.1145/1242572.1242713|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 15, 2019
checked on May 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.