Sciweavers

164 search results - page 1 / 33
» Reverse Top-k Queries
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
12 years 11 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 6 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 6 months ago
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 investi...
Lei Zou, Lei Chen 0002
WWW
2006
ACM
14 years 5 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
13 years 10 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg