By Topic

Parallel processing the keyword search in uncertain environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bo Ning ; Sch. of Inf. Sci. & Technol., Dalian Maritime Univ., Dalian, China ; Xiaoping Zhou ; Yimin Shi

XML is nature to express the uncertainty in real world, therefore the data in uncertain environment can be stored it the format of XML. For improving the efficiency of keyword search in uncertain environment, we use dewey code for indexing the XML elements, which is a kind of prefix-based encoding method. When dealing with big data, the lengths of element's Dewey codes are quit big, which leads to low efficiency of judging the relationships among the elements and needs large storage space. Thus, the big XML data and complicated XML schema are the bottlenecks of keyword search. In this paper, we incorporate the map-reduce mechanism to manage the uncertain data with partition, and design a parallel method to process information retrieve. The different XML fragments are stored in distributed network, and these can be parallel processed to retrieve the Smallest Lowest Common Ancestors (SLCAs) and return the k results with the largest probabilistic values. In our experiment, the result shows that our approach can improve the efficiency of executing parallel keyword search.

Published in:

System Science and Engineering (ICSSE), 2012 International Conference on

Date of Conference:

June 30 2012-July 2 2012