735 search results - page 39 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
220
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
136
click to vote
ICDE
2005
IEEE
15 years 7 months ago
2005
IEEE
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
212
click to vote
GIS
2007
ACM
16 years 2 months ago
2007
ACM
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
150
Voted
CLOUDCOM
2010
Springer
14 years 11 months ago
2010
Springer
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...
108
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...