765 search results - page 115 / 153 » Query Processing over Incomplete Autonomous Databases |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
169
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
177
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
174
click to vote
GIS
2007
ACM
15 years 11 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...