By Topic

A High Efficiency Approach to Querying Rough Data

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)
Xinglei Hu ; Shandong Univ., Jinan ; Xiaoguang Hong ; Yan Yuan

Any attribute in rough relational database (RRDB) can be multi-valued, and has an indiscernibility relation in its domain. Currently, the research on rough data querying mainly discussed some simple select-querying. That is, selecting the tuples whose attribute's value is equal to a constant from a single table. The main idea of its implementation is to expand the original search conditions according to the indiscernibility relation in attribute's domain. Because the search conditions after being expanded need more calculation, the querying becomes very slow. In this paper, we present a solution called rough data querying based on encoding. Firstly encode the data of multi-valued attribute into the single-valued data according to the indiscernibility relation in attribute's domain, and then execute the querying on the single-valued data despite the indiscernibility relation to make the implementation of rough data querying much simpler and more efficient.

Published in:

Fuzzy Systems and Knowledge Discovery, 2007. FSKD 2007. Fourth International Conference on  (Volume:2 )

Date of Conference:

24-27 Aug. 2007