173 search results - page 15 / 35 » Efficient Rank Based KNN Query Processing Over Uncertain Dat... |
DPD
2006
13 years 7 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
TKDE
2008
13 years 7 months ago
2008
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...