137 search results - page 3 / 28 » Efficient Processing of Top-k Spatial Preference Queries |
EDBT
2009
ACM
13 years 9 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
TKDE
2010
13 years 3 months ago
2010
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
SSD
1993
Springer
13 years 9 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
ADBIS
2000
Springer
13 years 9 months ago
2000
Springer
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...