109 search results - page 2 / 22 » Evaluating top-k queries over incomplete data streams |
PODS
1999
ACM
13 years 9 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
IDEAS
2007
IEEE
13 years 11 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
PODS
2002
ACM
14 years 5 months ago
2002
ACM
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...