Incremental evaluation of top-k combinatorial metric skyline query

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

19 Scopus Citations
View graph of relations

Author(s)

  • Tao Jiang
  • Bin Zhang
  • Dan Lin
  • Yunjun Gao
  • Qing Li

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)89-105
Journal / PublicationKnowledge-Based Systems
Volume74
Online published15 Nov 2014
Publication statusPublished - Jan 2015

Abstract

In this paper, we define a novel type of skyline query, namely top-k combinatorial metric skyline (kCMS) query. The kCMS query aims to find k combinations of data points according to a monotonic preference function such that each combination has the query object in its metric skyline. The kCMS query will enable a new set of location-based applications that the traditional skyline queries cannot offer. To answer the kCMS query, we propose two efficient query algorithms, which leverage a suite of techniques including the sorting and threshold mechanisms, reusing technique, and heuristics pruning to incrementally and quickly generate combinations of possible query results. We have conducted extensive experimental studies, and the results demonstrate both effectiveness and efficiency of our proposed algorithms.

Research Area(s)

  • Algorithm, Combinational skyline, Metric skyline, Query processing, Spatial database

Citation Format(s)

Incremental evaluation of top-k combinatorial metric skyline query. / Jiang, Tao; Zhang, Bin; Lin, Dan et al.

In: Knowledge-Based Systems, Vol. 74, 01.2015, p. 89-105.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review