Fast SLCA and ELCA Computation for XML Keyword Query Based on Set Intersection Operation
| dc.contributor.author | ZHOU, Junfeng | en_US |
| dc.contributor.author | BAO, Zhifeng | en_US |
| dc.contributor.author | WANG, Wei | en_US |
| dc.contributor.author | TOK, Wang Ling | en_US |
| dc.contributor.author | CHEN, Ziyang | en_US |
| dc.contributor.author | LIN, Xudong | en_US |
| dc.contributor.author | GUO, Jingfeng | en_US |
| dc.date.accessioned | 2011-07-21T08:22:45Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:05Z | |
| dc.date.available | 2011-07-21T08:22:45Z | en_US |
| dc.date.available | 2017-01-23T07:00:05Z | |
| dc.date.issued | 2011-07-21T08:22:45Z | en_US |
| dc.description.abstract | In this paper, we focus on efficient keyword query processing on XML data based on SLCA and ELCA semantics. We have an elaborate design of the keyword inverted list to efficiently locate the nodes that directly or indirectly contain a given keyword. We propose a family of algorithms that are based on set intersection operation to accelerate SLCA and ELCA computation. In essence, the problem of SLCA and ELCA computation becomes finding a set of common nodes that appear in all inverted lists and checking their satisfiability. We show that any existing set intersection algorithms can be adopted for SLCA and ELCA computation, and our optimization techniques can be used together with any existing search method to improve the overall performance. Experiments verify that the performance of our methods outperforms existing methods by more than 2 orders of magnitude in most cases. | en_US |
| dc.format.extent | 358453 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/3479 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRB7/11 | en_US |
| dc.title | Fast SLCA and ELCA Computation for XML Keyword Query Based on Set Intersection Operation | en_US |
| dc.type | Technical Report | en_US |