Continuous Top-k Dominating Queries in Subspaces

被引：14

作者：

Kontaki, Maria ^{[1
]}

Papadopoulos, Apostolos N. ^{[1
]}

Manolopoulos, Yannis ^{[1
]}

机构：

[1] Aristotle Univ Thessaloniki, Dept Informat, GR-54006 Thessaloniki, Greece

来源：

PCI 2008: 12TH PAN-HELLENIC CONFERENCE ON INFORMATICS, PROCEEDINGS | 2008年

关键词：

D O I：

10.1109/PCI.2008.45

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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 tack-le 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. hi 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.

引用

页码：31 / 35

页数：5