LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
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
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
BestPeer: A Self-Configurable Peer-to-Peer System
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Querying peer-to-peer networks using P-trees
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
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
Efficient range queries and fast lookup services for scalable p2p networks
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Homeviews: peer-to-peer middleware for personal data sharing applications
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Range queries over skip tree graphs
Computer Communications
NBDT: an efficient P2P indexing scheme for web service discovery
International Journal of Web Engineering and Technology
Paths to stardom: calibrating the potential of a peer-based data management system
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
P3N: profiling the potential of a peer-based data management system
Proceedings of the VLDB Endowment
GRaSP: generalized range search in peer-to-peer networks
Proceedings of the 3rd international conference on Scalable information systems
Dynamic Web Service discovery architecture based on a novel peer based overlay network
Journal of Systems and Software
Alternatives to conjunctive query processing in peer-to-peer file-sharing systems
Proceedings of the 2009 ACM symposium on Applied Computing
Parallel Load Balancing Strategies for Tree-Structured Peer-to-Peer Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Building an efficient P2P overlay for energy-level queries in sensor networks
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Gchord: indexing for multi-attribute query in p2p system with low maintenance cost
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Load-balanced query dissemination in privacy-aware online communities
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Indexing multi-dimensional data in a cloud system
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient B-tree based indexing for cloud data processing
Proceedings of the VLDB Endowment
Load Balancing and Range Queries in P2P Systems Using P-Ring
ACM Transactions on Internet Technology (TOIT)
P2P-based multidimensional indexing methods: A survey
Journal of Systems and Software
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Cluster-K+: Network topology for searching replicated data in p2p systems
Information Processing and Management: an International Journal
FoXtrot: Distributed structural and value XML filtering
ACM Transactions on the Web (TWEB)
SART: speeding up query processing in sensor networks with an autonomous range tree structure
ACM SIGAPP Applied Computing Review
Behavioral modeling and formal verification of a resource discovery approach in Grid computing
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Peer-to-Peer systems have recently become a popular means to share resources. Effective search is a critical requirement in such systems, and a number of distributed search structures have been proposed in the literature. Most of these structures provide "log time search" capability, where the logarithm is taken base 2. That is, in a system with N nodes, the cost of the search is O(log2N).In database systems, the importance of large fanout index structures has been well recognized. In P2P search too, the cost could be reduced considerably if this logarithm were taken to a larger base. In this paper, we propose a multi-way tree search structure, which reduces the cost of search to O(logmN), where m is the fanout. The penalty paid is a larger update cost, but we show how to keep this penalty to be no worse than linear in m. We experimentally explore this tradeoff between search and update cost as a function of m, and suggest how to find a good trade-off point.The multi-way tree structure we propose, BATON*, is derived from the BATON structure that has recently been suggested. In addition to multi-way fanout, BATON* also adds support for multi-attribute queries to BATON.