We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
—Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Prec...
Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel ...
An increasing number of temporally versioned text collections is available today with Web archives being a prime example. Search on such collections, however, is often not satisfa...
Klaus Berberich, Srikanta J. Bedathur, Thomas Neum...