Towards self-tuning data placement in parallel database systems
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Finding Data in the Neighborhood
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
P-tree: a p2p index for resource discovery applications
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
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
Guaranteeing correctness and availability in P2P range indices
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Delay aware querying with seaweed
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
P-ring: an efficient and robust P2P range index structure
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
P2P systems with transactional semantics
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Load-balanced query dissemination in privacy-aware online communities
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Load Balancing and Range Queries in P2P Systems Using P-Ring
ACM Transactions on Internet Technology (TOIT)
Zephyr: live migration in shared nothing databases for elastic cloud platforms
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Performance Evaluation of Range Queries in Key Value Stores
Journal of Grid Computing
Hi-index | 0.00 |
We describe a distributed index structure, in which data is distributed among multiple sites and indexes to the data are replicated over multiple sites. This permits good scalability as storage and accessing load are distributed over the sites and each site with an index replica has fast local access to the index structure, making remote requests at most for data at the leaves of the index tree. We call our method the dPi-tree because it is based on the Pi-tree. We replicate the index without the need for coherence messages. This works whether the index replica is persistent or a transient cached copy. We generalize a technique first used to provide recovery for Pi-tree indexes to independently and lazily maintain the index replicas. A further result is that each index replica is fully recoverable, an area not treated previously in replication schemes. We also show how the data in the leaves of the index can be distributed and re-distributed at very low cost.