3932 search results - page 391 / 787 » Adaptive Index Structures |
318
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
379
Voted
ICDE
2001
IEEE
16 years 8 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...
422
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
196
click to vote
VIS
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper, we present an approach for monitoring the positions of vector field singularities in time-dependent datasets. The concept of singularity index is discussed and exte...
190
Voted
WWW
2003
ACM
16 years 7 months ago
2003
ACM
We consider the problem of building a P2P-based search engine for massive document collections. We describe a prototype system called ODISSEA (Open DIStributed Search Engine Archi...