1672 search results - page 214 / 335 » Optimizing Monitoring Queries over Distributed Data |
238
click to vote
SIGMOD
2012
ACM
13 years 8 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
166
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
275
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
229
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
159
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...