Processing Top-K Queries Using Indexing Structure

Free registration required

Executive Summary

Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest .The intrinsic connection between top-k queries and dominant relationships between records, based on which, an efficient layer-based indexing structure, Pareto-based Dominant Graph (DG), is proposed to improve the query efficiency. Specifically, DG is built offline to express the dominant relationship between records and top-k query is implemented as a graph traversal problem, i.e., Traveler algorithm.

  • Format: PDF
  • Size: 375.29 KB