1091 search results - page 161 / 219 » Approximation in Databases |
213
Voted
SIGMOD
2009
ACM
16 years 2 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...
208
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...
147
click to vote
SIGMOD
2001
ACM
16 years 2 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
135
Voted
IDEAS
2008
IEEE
15 years 9 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
131
click to vote
ICDT
2005
ACM
15 years 8 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...