56 search results - page 10 / 12 » Dynamic Structures for Top- k Queries on Uncertain Data |
177
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
175
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
IKE
2010
14 years 7 months ago
2010
: Over the years, DataWarehousing has gone through a number of evolutions from a relatively simple reporting database to sophisticated analytical applications such as analyzing cus...
183
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
167
Voted
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...