Sciweavers

467 search results - page 3 / 94
» Processing top k queries from samples
Sort
View
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
13 years 11 months ago
Privacy-Preserving Top-K Queries
Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the sam...
Jaideep Vaidya, Chris Clifton
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
13 years 11 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
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
VLDB
2007
ACM
229views Database» more  VLDB 2007»
13 years 11 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 9 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han