56 search results - page 5 / 12 » Dynamic Structures for Top- k Queries on Uncertain Data |
SSDBM
2006
IEEE
15 years 3 months ago
2006
IEEE
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
189
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
CCCG
2010
14 years 11 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
86
Voted
ADC
2005
Springer
15 years 3 months ago
2005
Springer
Although data stored in XML is of increasing importance, most existing data repositories are still managed by relational database systems. In light of this, recent XML database re...