By Topic

Continuous Top-k Dominating Queries in Subspaces

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)
Kontaki, M. ; Dept. of Inf. Aristotle, Univ. Thessaloniki, Thessaloniki ; Papadopoulos, A.N. ; Manolopoulos, Y.

Dominating queries are significant tools for preference-based query processing in databases and decision support applications. An important preference-based query is the top-k dominating query, which reports the k most important objects according to their domination capabilities (score). In this paper, we address the following issues to tackle two limitations of previously proposed approaches: (i) we allow dominating queries to be expressed in a subset of the available dimensions and (ii) we provide the necessary techniques to enable continuous processing of multiple queries. We use a grid-based indexing scheme to facilitate efficient search and update operations, avoiding expensive reorganization costs. In addition, several optimizations are proposed to enhance efficiency. Performance evaluation results, based on real-life and synthetic data sets, show the efficiency and scalability of the proposed scheme.

Published in:

Informatics, 2008. PCI '08. Panhellenic Conference on

Date of Conference:

28-30 Aug. 2008