6650 search results - page 1107 / 1330 » Mutating database queries |
170
Voted
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
109
Voted
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Transportation?related problems, like road congestion, parking, and pollution, are increasing in most cities. In order to reduce traffic, recent work has proposed methods for vehi...
105
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
139
Voted
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
162
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Data stream management systems usually have to process many long-running queries that are active at the same time. Multiple queries can be evaluated more efficiently together tha...