Sciweavers

2546 search results - page 28 / 510
» Managing long-running queries
Sort
View
BTW
2005
Springer
113views Database» more  BTW 2005»
15 years 3 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...
FOIKS
2006
Springer
15 years 1 months ago
Iterative Modification and Incremental Evaluation of Preference Queries
Abstract. We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: ...
Jan Chomicki
101
Voted
HUC
2009
Springer
15 years 2 months ago
Privately querying location-based services with SybilQuery
To usefully query a location-based service, a mobile device must typically present its own location in its query to the server. This may not be acceptable to clients that wish to ...
Pravin Shankar, Vinod Ganapathy, Liviu Iftode
172
Voted
GIS
2005
ACM
15 years 11 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
97
Voted
ICEBE
2005
IEEE
168views Business» more  ICEBE 2005»
15 years 3 months ago
Frequency Operators for Condensative Queries over Data Streams
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
Lisha Ma, Werner Nutt