By Topic

Query processing in e-commerce environment using predictive partitioned relations

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
$33 $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)
Ying Wah Teh ; Fac. of Comput. Sci. & Inf. Technol., Malaya Univ., Kuala Lumpur, Malaysia ; A. Bakar Zaitun ; S. Peck Lee

Too many attributes in a relation are not relevant to fulfilling the user's requirement. Different clients may be interested different set of attributes in the relation. Given this situation, how can the Database Management Systems process relevant attributes instead of reading all attributes? In a data-warehousing environment, materialised view techniques are used and the relation can be vertically partitioned into different sets. If there is c number of clients, then c number of relations will be partitioned. In this paper, we discuss data mining techniques that select most relevant attributes in the relation using predictive partitioned relation. The goal of this research is to locate within a relation those areas of attributes containing tuples relevant to fulfilling the user's requirement. These areas can then be given to a human or automated system for extraction of information, thereby saving a user or query processing system from reading or processing the entire attributes

Published in:

Systems, Man, and Cybernetics, 2001 IEEE International Conference on  (Volume:5 )

Date of Conference: