A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 17th International Conference on Data Engineering
PeerDB: peering into personal databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Distributed Caching and Adaptive Search in Multilayer P2P Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
iSky: Efficient and Progressive Skyline Computing in a Structured P2P Network
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Parallel Distributed Processing of Constrained Skyline Queries by Filtering
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
| Hi-index | 0.00 |
Skyline queries play an important role in applications such as multi-criteria decision making and user preference systems. Recently, more attention has been paid to the problem of efficient skyline computation in the P2P systems. Due to the high distribution of the P2P networks, the skyline computation incurs too many intermediate results transferred between peers, which consumes mass of the network bandwidth. Additionally, a large number of peers are involved in the skyline computation, which introduces both heavy communication cost and computational overhead. In this paper, we propose a novel Distributed Caching Mechanism (DCM) to efficiently improve the performance of the skyline calculation in the structured P2P networks, using a Distributed Caching Index (DCI) scheme and an advanced cache utilization strategy. The DCI scheme is employed to efficiently locate the cache that can properly answer a future skyline query. Exploring the property of entended skyline, we can optimize the utilization of the cached results for answering future skyline queries. Extensive evaluations on both synthetic and real dataset show that our approach can significantly reduce both bandwidth consumption and communication cost, and greatly shorten the response time.