Multidimensional binary search trees used for associative searching
Communications of the ACM
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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
PRISM: indexing multi-dimensional data in P2P networks using reference vectors
Proceedings of the 13th annual ACM international conference on Multimedia
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A hierarchical semantic overlay approach to P2P similarity search
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
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
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
A peer-to-peer architecture for media streaming
IEEE Journal on Selected Areas in Communications
An efficient peer-to-peer indexing tree structure for multidimensional data
Future Generation Computer Systems
Distributed and Parallel Databases
Proactive neighbor localization based on distributed geographic table
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications
International Journal of Communication Systems
Journal of Network and Computer Applications
Gossiping for resource discovering: An analysis based on complex network theory
Future Generation Computer Systems
| Hi-index | 0.24 |
We propose a P2P search solution, called EZSearch, that enables efficient multidimensional search for remotely located contents that best match the search criteria. EZSearch is a hierarchical approach; it organizes the network into a hierarchy in a way fundamentally different from existing search techniques. EZSearch is based on Zigzag, a P2P overlay architecture known for its scalability and robustness under network growth and dynamics. The indexing architecture of EZSearch is built on top of the Zigzag hierarchy, that allows both k-nearest-neighbor and range queries to be answered with low search overhead and worst-case search time logarithmic with the network size. The indices are fairly distributed over a small number of nodes at a modest cost for index storage and update. The performance results of EZSearch drawn from our performance study are encouraging.