Toward scalable indexing for top-κ queries

Jongwuk Lee, Hyunsouk Cho, Sunyou Lee, Seungwon Hwang

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A top-κ query retrieves the best κ tuples by assigning scores for each tuple in a target relation with respect to a user-specific scoring function. This paper studies the problem of constructing an indexing structure for supporting top-κ queries over varying scoring functions and retrieval sizes. The existing research efforts can be categorized into three approaches: list-, layer-, and view-based approaches. In this paper, we mainly focus on the layer-based approach that pre-materializes tuples into consecutive multiple layers. We first propose a dual-resolution layer that consists of coarse-level and fine-level layers. Specifically, we build coarse-level layers using skylines, and divide each coarse-level layer into fine-level sublayers using convex skylines. To make our proposed dual-resolution layer scalable, we then address the following optimization directions: 1) index construction; 2) disk-based storage scheme; 3) the design of the virtual layer; and 4) index maintenance for tuple updates. Our evaluation results show that our proposed method is more scalable than the state-of-the-art methods.

Original languageEnglish
Article number6587712
Pages (from-to)3103-3116
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume26
Issue number12
DOIs
Publication statusPublished - 2014 Dec 1

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Lee, Jongwuk ; Cho, Hyunsouk ; Lee, Sunyou ; Hwang, Seungwon. / Toward scalable indexing for top-κ queries. In: IEEE Transactions on Knowledge and Data Engineering. 2014 ; Vol. 26, No. 12. pp. 3103-3116.
@article{1a31f487371847979d870abefb7af341,
title = "Toward scalable indexing for top-κ queries",
abstract = "A top-κ query retrieves the best κ tuples by assigning scores for each tuple in a target relation with respect to a user-specific scoring function. This paper studies the problem of constructing an indexing structure for supporting top-κ queries over varying scoring functions and retrieval sizes. The existing research efforts can be categorized into three approaches: list-, layer-, and view-based approaches. In this paper, we mainly focus on the layer-based approach that pre-materializes tuples into consecutive multiple layers. We first propose a dual-resolution layer that consists of coarse-level and fine-level layers. Specifically, we build coarse-level layers using skylines, and divide each coarse-level layer into fine-level sublayers using convex skylines. To make our proposed dual-resolution layer scalable, we then address the following optimization directions: 1) index construction; 2) disk-based storage scheme; 3) the design of the virtual layer; and 4) index maintenance for tuple updates. Our evaluation results show that our proposed method is more scalable than the state-of-the-art methods.",
author = "Jongwuk Lee and Hyunsouk Cho and Sunyou Lee and Seungwon Hwang",
year = "2014",
month = "12",
day = "1",
doi = "10.1109/TKDE.2013.149",
language = "English",
volume = "26",
pages = "3103--3116",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "12",

}

Toward scalable indexing for top-κ queries. / Lee, Jongwuk; Cho, Hyunsouk; Lee, Sunyou; Hwang, Seungwon.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 26, No. 12, 6587712, 01.12.2014, p. 3103-3116.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Toward scalable indexing for top-κ queries

AU - Lee, Jongwuk

AU - Cho, Hyunsouk

AU - Lee, Sunyou

AU - Hwang, Seungwon

PY - 2014/12/1

Y1 - 2014/12/1

N2 - A top-κ query retrieves the best κ tuples by assigning scores for each tuple in a target relation with respect to a user-specific scoring function. This paper studies the problem of constructing an indexing structure for supporting top-κ queries over varying scoring functions and retrieval sizes. The existing research efforts can be categorized into three approaches: list-, layer-, and view-based approaches. In this paper, we mainly focus on the layer-based approach that pre-materializes tuples into consecutive multiple layers. We first propose a dual-resolution layer that consists of coarse-level and fine-level layers. Specifically, we build coarse-level layers using skylines, and divide each coarse-level layer into fine-level sublayers using convex skylines. To make our proposed dual-resolution layer scalable, we then address the following optimization directions: 1) index construction; 2) disk-based storage scheme; 3) the design of the virtual layer; and 4) index maintenance for tuple updates. Our evaluation results show that our proposed method is more scalable than the state-of-the-art methods.

AB - A top-κ query retrieves the best κ tuples by assigning scores for each tuple in a target relation with respect to a user-specific scoring function. This paper studies the problem of constructing an indexing structure for supporting top-κ queries over varying scoring functions and retrieval sizes. The existing research efforts can be categorized into three approaches: list-, layer-, and view-based approaches. In this paper, we mainly focus on the layer-based approach that pre-materializes tuples into consecutive multiple layers. We first propose a dual-resolution layer that consists of coarse-level and fine-level layers. Specifically, we build coarse-level layers using skylines, and divide each coarse-level layer into fine-level sublayers using convex skylines. To make our proposed dual-resolution layer scalable, we then address the following optimization directions: 1) index construction; 2) disk-based storage scheme; 3) the design of the virtual layer; and 4) index maintenance for tuple updates. Our evaluation results show that our proposed method is more scalable than the state-of-the-art methods.

UR - http://www.scopus.com/inward/record.url?scp=84910092069&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910092069&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2013.149

DO - 10.1109/TKDE.2013.149

M3 - Article

VL - 26

SP - 3103

EP - 3116

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 12

M1 - 6587712

ER -