@inproceedings{7dd614f8f4184ba3831ad56b10512649,
title = "Nearest keyword search on probabilistic XML data",
abstract = "This paper pays attention to the nearest keyword (NK) problem on probabilistic XML data (NK-P). NK search occupies an important position in information discovery, information extraction and many other areas. Compared with traditional XML data, it is more expensive to answer NK-P search because of so many possible worlds. NK-P can be seen as an NK problem on many traditional XML documents. For a given node q and a keyword k, an NK-P query returns the node which is nearest to q among all the nodes associated with k in all the possible worlds. NK-P search is not only useful independent operator but also as an important part for keyword search. Firstly, we propose a new NK concept on probabilistic XML data based on possible worlds. Next, we present an indexing algorithm to answer an NK-P query efficiently. Finally, extensive experimental results show that our approach is an effective method on probabilistic XML data, and it could significantly reduce the execution time.",
keywords = "NK, NK-P, keyword search, possible world, probabilistic XML data",
author = "Yue Zhao and Ye Yuan and Guoren Wang",
year = "2014",
doi = "10.1007/978-3-319-11116-2\_43",
language = "English",
isbn = "9783319111155",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "485--493",
booktitle = "Web Technologies and Applications - 16th Asia-Pacific Web Conference, APWeb 2014, Proceedings",
address = "Germany",
note = "16th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2014 ; Conference date: 05-09-2014 Through 07-09-2014",
}