Efficient processing of ranked queries with sweeping selection

Wen Jin, Martin Ester, Jiawei Han

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Existing methods for top-k ranked query employ techniques including sorting, updating thresholds and materializing views. In this paper, we propose two novel index-based techniques for top-k ranked query: (1) indexing the layered skyline, and (2) indexing microclusters of objects into a grid structure. We also develop efficient algorithms for ranked query by locating the answer points during the sweeping of the line/hyperplane of the score function over the indexed objects. Both methods can be easily plugged into typical multi-dimensional database indexes. The comprehensive experiments not only demonstrate that our methods outperform the existing ones, but also illustrate that the application of data mining technique (microclustering) is a useful and effective solution for database query processing.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages527-535
Number of pages9
DOIs
StatePublished - 2005
Event9th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2005 - Porto, Portugal
Duration: Oct 3 2005Oct 7 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3721 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2005
Country/TerritoryPortugal
CityPorto
Period10/3/0510/7/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Efficient processing of ranked queries with sweeping selection'. Together they form a unique fingerprint.

Cite this