2514 search results - page 149 / 503 » On the Computation of Approximations of Database Queries |
216
click to vote
GIS
2010
ACM
15 years 5 months ago
2010
ACM
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
155
click to vote
CIKM
2003
Springer
15 years 11 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
306
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
146
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
169
click to vote
ADC
2007
Springer
16 years 21 days ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...