10182 search results - page 1617 / 2037 » Case Studies |
223
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
319
click to vote
VLDB
2006
ACM
16 years 7 months ago
2006
ACM
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
265
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
226
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
205
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...