87 search results - page 2 / 18 » Efficient Computation of Temporal Aggregates with Range Pred... |
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract-- We present COLR-Tree, an abstraction layer designed to support efficient spatio-temporal queries on live data gathered from a large collection of sensors. We use COLR-Tr...
DEXA
2010
Springer
13 years 5 months ago
2010
Springer
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...