14548 search results - page 2578 / 2910 » The Optimal Path-Matching Problem |
283
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
298
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
290
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
276
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...
299
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...