2514 search results - page 10 / 503 » On the Computation of Approximations of Database Queries |
VLDB
2008
ACM
14 years 7 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
SSD
2005
Springer
14 years 26 days ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
SSDBM
2006
IEEE
14 years 1 months ago
2006
IEEE
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...