6846 search results - page 1068 / 1370 » Querying a summary of database |
200
Voted
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
195
Voted
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
175
click to vote
PODS
2005
ACM
16 years 7 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
190
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
204
Voted
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...