785 search results - page 123 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
151
click to vote
AIA
2006
15 years 7 months ago
2006
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
196
click to vote
DOLAP
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
159
Voted
DEXA
2003
Springer
15 years 11 months ago
2003
Springer
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
137
click to vote
DEXA
2006
Springer
15 years 9 months ago
2006
Springer
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
254
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...