236 search results - page 10 / 48 » Multi-Dimensional Range Query over Encrypted Data |
105
click to vote
VLDB
2000
ACM
15 years 3 months ago
2000
ACM
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
106
click to vote
ICWS
2009
IEEE
14 years 9 months ago
2009
IEEE
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
SOFSEM
2005
Springer
15 years 5 months ago
2005
Springer
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
109
click to vote
DPD
2006
14 years 11 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...
EDBT
2006
ACM
15 years 1 months ago
2006
ACM
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash ...