785 search results - page 129 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
158
click to vote
DKE
1998
15 years 5 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
286
click to vote
GIS
2006
ACM
16 years 6 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
156
Voted
IDEAS
2000
IEEE
15 years 10 months ago
2000
IEEE
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
276
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
185
click to vote
ICIP
2002
IEEE
16 years 7 months ago
2002
IEEE
In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed sha...