Parallel Top-k Keyword Search Algorithm in Probabilistic XML Documents
Jun Zhang · 2013
Probabilistic XML can describe the uncertain data effectively,and Dewey code is the most important encoding method for indexing probabilistic XML documents.But during the keywords search in big probabilistic XML documents,it takes much time for comparing the Dewey code of keyword index frequently.To deal with the problem above,the probabilistic XML document was partitioned into several fragments,and a new Dewey encoding method of keyword index for probabilistic XML documents was designed,thus,a Parallel Top-k Keyword Search Algorithm(PTKS) was proposed.The experiment results show that the PTKS algorithm has low time complexity,especially,its efficiency is improved significantly when the structure of the document is complicated.