Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
An efficient nearest neighbor algorithm for P2P settings
dg.o '05 Proceedings of the 2005 national conference on Digital government research
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
On scalability of the similarity search in the world of peers
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
M-Grid: similarity searching in grid
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
A distributed incremental nearest neighbor algorithm
Proceedings of the 2nd international conference on Scalable information systems
Scalability comparison of Peer-to-Peer similarity search structures
Future Generation Computer Systems
A content-addressable network for similarity search in metric spaces
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Similarity grid for searching in metric spaces
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
Editorial: Special Section: Scalable information systems
Future Generation Computer Systems
A flexible framework to ease nearest neighbor search in multidimensional data spaces
Data & Knowledge Engineering
On the selectivity of multidimensional routing indices
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
The state of the art of searching for non-text data (e.g., images) is to use extracted metadata annotations or text, which might be available as a related information. However, supporting real content-based audiovisual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, such search exhibits linear scalability with respect to the dataset size, so parallel query execution is needed. In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset. The proposed algorithm is being used in two running projects: SAPIR and NeP4B.