By Topic

Top-k query processing with multidimensional range search

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

2 Author(s)
Rudrani, S. ; Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol. Calicut, Calicut, India ; Saleena, N.

An m-dimensional top-k query (with m search conditions) is primarily processed by scanning the corresponding m index lists in descending score orders in an interleaved manner (and by making judicious random accesses to look up index entries of specific data items). In this paper a new algorithm is proposed that makes use of a data structure that facilitates multidimensional range search. An m-dimensional top-k query can be processed by searching for the data items that satisfies a range of score over each dimension. At every step of the algorithm a new set of ranges (one for each dimension) is specified such that more accurate tuples are added in the candidate top-k set. The process continues till we get the actual top-k data items. The incremented range set is specified with the help of the statistics of the distribution of data items in m-dimensional space. Thus, efficiency of the algorithm very much depends on the proper study and analysis of the distribution of the data items in the m-dimensional space and the data structure used.

Published in:

Methods and Models in Computer Science, 2009. ICM2CS 2009. Proceeding of International Conference on

Date of Conference:

14-15 Dec. 2009