The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Content-Based Image Retrieval at the End of the Early Years
IEEE Transactions on Pattern Analysis and Machine Intelligence
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Time as essence for photo browsing through personal digital libraries
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
SIAM Journal on Computing
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
A Placement Scheme for Peer-to-Peer Networks Based on Principles from Geometry
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
PRISM: indexing multi-dimensional data in P2P networks using reference vectors
Proceedings of the 13th annual ACM international conference on Multimedia
| Hi-index | 0.24 |
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems, and some of the well-known potential scalability and search problems associated with unstructured P2P systems, we ask the following questions: are there applications where unstructured queries are still necessary (i.e. the underlying queries do not efficiently map onto any structured framework), and are there unstructured P2P systems that can deliver the high bandwidth and computing performance necessary to support such applications. Toward this end, we consider an image search application which supports queries based on image similarity metrics, such as color histogram intersection, and discuss why in this setting, standard DHT approaches are not directly applicable. We then study the feasibility of implementing such an image search system on two different unstructured P2P systems: power-law topology with percolation search, and an optimized super-node topology using structured broadcasts. We examine the average and maximum values for node bandwidth, storage and processing requirements in the percolation and super-node models, and show that current high-end computers and high-speed links have sufficient resources to enable deployments of large-scale complex image search systems, using these unstructured P2P technologies.