3625 search results - page 577 / 725 » On choosing |
197
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
191
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
187
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
198
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
231
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....