301 search results - page 4 / 61 » Efficient Sketches for the Set Query Problem |
204
click to vote
ICDE
2008
IEEE
16 years 5 days ago
2008
IEEE
Digital videos are increasingly adopted in various multimedia applications where they are usually broadcasted or transmitted as video streams. Continuously monitoring copies on the...
100
click to vote
PODC
2006
ACM
15 years 4 months ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
220
click to vote
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
76
Voted
SIGMOD
2001
ACM
15 years 11 months ago
2001
ACM
We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query la...
VLDB
2001
ACM
15 years 3 months ago
2001
ACM
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...