785 search results - page 36 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
CIKM
2009
Springer
14 years 23 days ago
2009
Springer
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
DPD
2006
13 years 8 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...
ICDE
2011
IEEE
13 years 8 days ago
2011
IEEE
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
DAMON
2008
Springer
13 years 10 months ago
2008
Springer
Comparisons between the merits of row-wise storage (NSM) and columnar storage (DSM) are typically made with respect to the persistent storage layer of database systems. In this pa...
VLDB
1989
ACM
14 years 26 days ago
1989
ACM
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...