Results 1 -
8 of
8
iSky: Efficient and progressive skyline computing in a structured P2P network
- In Proceedings of ICDCS
, 2008
"... An interesting problem in peer-based data manage-ment is efficient support for skyline queries within a multi-attribute space. A skyline query retrieves from a set of multi-dimensional data points a subset of interesting points, com-pared to which no other points are better. Skyline queries play an ..."
Abstract
-
Cited by 9 (2 self)
- Add to MetaCart
(Show Context)
An interesting problem in peer-based data manage-ment is efficient support for skyline queries within a multi-attribute space. A skyline query retrieves from a set of multi-dimensional data points a subset of interesting points, com-pared to which no other points are better. Skyline queries play an important role in multi-criteria decision making and user preference applications. In this paper, we ad-dress the skyline computing problem in a structured P2P network. We exploit the iMinMax(θ) transformation to map high-dimensional data points to 1-dimensional values. All transformed data points are then distributed on a structured P2P network called BATON, where all peers are virtually organized as a balanced binary search tree. Subsequently, a progressive algorithm is proposed to compute skyline in the distributed P2P network. Further, we propose an adaptive skyline filtering technique to reduce both processing cost and communication cost during distributed skyline comput-ing. Our performance study, with both synthetic and real datasets, shows that the proposed approach can dramat-ically reduce transferred data volume and gain quick re-sponse time. 1.
Efficient skyline computation in structured peer-to-peer systems
- TKDE
"... Abstract—Peer-to-peer (P2P) computing systems have been thought of as a powerful paradigm for data sharing, and peer-based data management has attracted increasing interest from the database and information retrieval communities recently. In this paper, we investigate the multi-dimensional skyline c ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Peer-to-peer (P2P) computing systems have been thought of as a powerful paradigm for data sharing, and peer-based data management has attracted increasing interest from the database and information retrieval communities recently. In this paper, we investigate the multi-dimensional skyline computation problem on a structured peer-to-peer network. In order to achieve low communication cost and quick response time, we utilize the iMinMax(θ) method to transform high-dimensional data to 1-dimensional value and distribute the data in a structured peer-to-peer network called BATON. Thereafter, we propose a progressive algorithm with adaptive filter technique for efficient skyline computation in this environment. We further discuss some optimization techniques for the algorithm, and summarize the key principles of our algorithm into a query routing protocol with detailed analysis. Finally, we conduct an extensive experimental evaluation to demonstrate the efficiency of our approach.
Multi-dimensional Range Query for Data Management using Bloom Filters
"... Abstract—Providing range query as basic network services has received much research attention recently. Range query can exhibit all items located within a certain range. Previous approaches to represent and query items, such as Distributed Hash Tables (DHT) or R-tree structures, use too much storage ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Providing range query as basic network services has received much research attention recently. Range query can exhibit all items located within a certain range. Previous approaches to represent and query items, such as Distributed Hash Tables (DHT) or R-tree structures, use too much storage space to store and maintain items to achieve exact query results. Corresponding structures cannot effectively support operations on items that have multi-dimensional attributes. In this paper, we propose a simple and space-efficient structure, i.e., Multi-Dimensional Segment Bloom Filter (MDSBF), to support range query for data management. Our approach logically divides the range of multi-dimensional attributes into several segments to support fast and accurate lookups. We also develop a simple algorithm to achieve load balance among multiple segments and improve query accuracy. Through theoretical analysis and performance evaluation, we demonstrate that the MDSBF structure can efficiently support range query service for items with multidimensional attributes. I.
v Bochmann, “GeoP2P: An adaptive peer-to-peer overlay for efficient search and update of spatial information
- CoRR
"... This paper proposes a fully decentralized peer-to-peer overlay structure GeoP2P, to facilitate geographic location based search and retrieval of information. Certain limitations of centralized geographic indexes favor peerto-peer organization of the information, which, in addition to avoiding perfor ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
This paper proposes a fully decentralized peer-to-peer overlay structure GeoP2P, to facilitate geographic location based search and retrieval of information. Certain limitations of centralized geographic indexes favor peerto-peer organization of the information, which, in addition to avoiding performance bottleneck, allows autonomy over local information. Peer-to-peer systems for geographic or multidimensional range queries built on existing DHTs suffer from the inaccuracy in linearization of the multidimensional space. Other overlay structures that are based on hierarchical partitioning of the search space are not scalable because they use special super-peers to represent the nodes in the hierarchy. GeoP2P partitions the search space hierarchically, maintains the overlay structure and performs the routing without the need of any super-peers. Although similar fully-decentralized overlays have been previously proposed, they lack the ability to dynamically grow and retract the partition hierarchy when the number of peers change. GeoP2P provides such adaptive features with minimum perturbation of the system state. Such adaptation makes both the routing delay and the state size of each peer logarithmic to the total number of peers, irrespective of the size of the multidimensional space. Our analysis also reveals that the overlay structure and the routing algorithm are generic and independent of several aspects of the partitioning hierarchy, such as the geometric shape of the zones or the dimensionality of the search space. 1
Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays
"... Abstract—Distributed hash tables (DHT) are used for data management in P2P environments. However, since most hash functions ignore relations between items, DHTs are not efficient for operations on related items. In this paper, we modify a DHT into a distributed array (DA) that enables efficient oper ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Distributed hash tables (DHT) are used for data management in P2P environments. However, since most hash functions ignore relations between items, DHTs are not efficient for operations on related items. In this paper, we modify a DHT into a distributed array (DA) that enables efficient operations on logical arrays. The array elements of a DA are placed in a P2P overlay network according to a simple rule such that the load is balanced and the number of messages required to access elements sequentially is reduced. The number of messages required for array operations is much smaller than that for operations on DHTs. We demonstrate this theoretically and experimentally. I.
The 28th International Conference on Distributed Computing Systems LHT: A Low-Maintenance Indexing Scheme over DHTs
"... DHT is a widely-used building block in P2P systems, and complex queries are gaining popularity in P2P applications. To support efficient query processing over DHTs, effective indexing structures are essential. Recently, a number of indexing schemes have been proposed. However, these schemes have foc ..."
Abstract
- Add to MetaCart
(Show Context)
DHT is a widely-used building block in P2P systems, and complex queries are gaining popularity in P2P applications. To support efficient query processing over DHTs, effective indexing structures are essential. Recently, a number of indexing schemes have been proposed. However, these schemes have focused on improving query efficiency, and as a trade-off, sacrificed maintenance efficiency — an important performance measure in the P2P context, where frequent data updating and high peer dynamism are typically incurred. In this paper, we propose LHT, a Low maintenance Hash Tree, for efficient data indexing over DHTs. LHT employs a novel naming function and a tree summarization strategy to gracefully distribute its index structure. It is adaptable to any DHT substrates, and is easy to be implemented and deployed. Experiments show that in comparison with the state-of-the-art indexing technique, LHT saves up to 75 % (at least 50%) maintenance cost, and achieves better performance for exact-match queries and range queries. 1
Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks
"... Author’s declaration I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Peer-to-peer (P2P) has become a m ..."
Abstract
- Add to MetaCart
(Show Context)
Author’s declaration I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Peer-to-peer (P2P) has become a modern distributed computing architecture that supports massively large-scale data management and query processing. Complex query operators such as range operator and join operator are needed by various distributed applications, including content distribution, locality-aware services, computing resource sharing, and many others. This dissertation tackles a number of problems related to range and join query processing in P2P systems: fault-tolerant range query processing under structured P2P architecture, distributed range caching under unstructured P2P architecture, and integration of heterogeneous data under unstructured P2P architecture. To support fault-tolerant range query processing so as to provide strong performance guarantees in the presence of network churn, effective replication schemes are developed at either the overlay network level
unknown title
"... er al E e 1 reg w S fun lis functionality and allows for important performance improvements. This work presents a thorough comparison between these two related peer-to-peer overlay networks, their construction, search algorithms and properties. Being based on tree structures, skip tree graphs sup-P2 ..."
Abstract
- Add to MetaCart
(Show Context)
er al E e 1 reg w S fun lis functionality and allows for important performance improvements. This work presents a thorough comparison between these two related peer-to-peer overlay networks, their construction, search algorithms and properties. Being based on tree structures, skip tree graphs sup-P2P networks [1–4] provided a Distributed Hash Table (DHT) functionality. DHTs are based on consistent hash-based on the key ordering, including range queries and [6,7]. Grid monitoring and information services and dis-tributed data processing are some examples of these appli-resources or query about the free storage space on a subset of storage resources (aggregation queries summing up the corresponding attribute over a group or resources). Struc-tured P2P systems have been proposed as an efficient rout-ing platform for the provision of grid information services
