171
click to vote
IDEAS
15 years 11 months ago
2006 IEEE 
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
158
click to vote
IDEAS
15 years 11 months ago
2006 IEEE
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
152
click to vote
IDEAS
15 years 11 months ago
2006 IEEE 
This paper proposes CADRE (Collaborative Allocation and Deallocation of Replicas with Efficiency), a dynamic replication scheme for improving the typically low data availability ...
143
click to vote
IDEAS
15 years 11 months ago
2006 IEEE 
This paper proposes techniques to query encrypted XML documents. Such a problem predominantly occurs in “Database as a Service” (DAS) architectures, where a client may outsour...
161
Voted
IDEAS
15 years 11 months ago
2006 IEEE
In several applications, data objects are assumed to move on predefined spatial networks such as road segments, railways, invisible air routes. Moving objects may exhibit similar...
|
Database