1091 search results - page 142 / 219 » Approximation in Databases |
219
Voted
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
229
Voted
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
205
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
204
Voted
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
209
Voted
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...