In this paper, we introduce the concept of a QA-Pagelet to refer to the content region in a dynamic page that contains query matches. We present THOR, a scalable and efficient min...
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which dete...
—In this paper, we have presented a novel algorithm for searching Peer-to-Peer (P2P) networks which forms power law topology. It is completely decentralized in nature and hence i...