Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
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. In this paper, we investigate the intrinsic connection between top-k queries and dominant relationship between records, and based on which, we pr...
Saved in:
Published in | 2008 IEEE 24th International Conference on Data Engineering pp. 536 - 545 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.04.2008
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!