Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
In this work we address the issue of efficient processing of range queries in DHT-based P2P data networks. The novelty of the proposed approach lies on architectures, algorithms, ...
Nikos Ntarmos, Theoni Pitoura, Peter Triantafillou
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...
: 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 ...
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...