346 search results - page 53 / 70 » Towards Declarative Queries on Adaptive Data Structures |
ICDE
2007
IEEE
14 years 9 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...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
ICDT
2011
ACM
12 years 11 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...