Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
In this paper we describe R-P2P, a novel system meant to support the search and retrieval of data in a given area. RP2P couples opportunistic wireless communications between mobil...
Francesco De Pellegrini, Iacopo Carreras, Daniele ...
Abstract. This paper describes CAP7, a system for searching and browsing in distributed document (metadata) collections. The system architecture is similar to Harvest, comprising g...