1672 search results - page 155 / 335 » Optimizing Monitoring Queries over Distributed Data |
156
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...
161
click to vote
IRI
2009
IEEE
16 years 1 months ago
2009
IEEE
Formulating and executing queries over distributed, autonomous and heterogeneous resources is an important research area. The advent of the Internet and the Web and their inherent...
257
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
174
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
263
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...