220 search results - page 22 / 44 » Supporting Queries with Imprecise Constraints |
BNCOD
2004
13 years 9 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
IDA
2006
Springer
13 years 7 months ago
2006
Springer
Clustering or co-clustering techniques have been proved useful in many application domains. A weakness of these techniques remains the poor support for grouping characterization. ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an earlier paper. This paper develops a dat...
PVLDB
2010
13 years 6 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...