Resource Discovery Considering Semantic Properties in Data Grid Environments

Ketata, Imen; Mokadem, Riad; Morvan, Franck

doi:10.1007/978-3-642-22947-3_6

Cited by 4 publications

(14 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, semantic-based models have led to a new field of research on GRD, and many studies are focusing on incorporating the semantic technique into the grid [32][33][34][35]. On the one hand, semantic technology is used to describe grid resources, known as semantic information of resources [36][37][38][39][40]. On the other hand, the resource registries are distributed semantically so that the distribution of the resource queries during the discovery process will be based on those semantic sub-registries [41].…”

Section: Related Workmentioning

confidence: 99%

Data resource discovery model based on hybrid architecture in data grid environment

Lü

Shi

et al. 2014

Concurrency and Computation

View full text Add to dashboard Cite

SummaryToday, the management of massive data collections draws much attention as data grids have been developed to deal with large computational problems and provide the opportunity for sharing geographically distributed resources for large‒scale data‒intensive applications. Therefore, finding an effective approach to discover data resources in order to promote better interactions between application communities or virtual organizations becomes a critical challenge. Traditional grid resource discovery models are mostly based on central and hierarchical architecture that can lead to bottlenecking with the expansion of the grid scale. Although the Peer‒to‒Peer (P2P) technique is integrated into the grid in order to improve the performance in recent years, each P2P structure still has drawbacks that require several compensatory strategies. In this paper, based on the unstructured super‒node‒based architecture from the P2P system, we design a structured logic resource tree in each domain in order to effectively alleviate the load on the super‒node, and we propose a query recording learning algorithm based on this hybrid architecture to reduce traffic in the network and greatly shorten the response time. The model and algorithm are validated by simulations and compared with the traditional super‒peer model and the flooding‒based approach. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Section: Related Workmentioning

confidence: 99%

Data resource discovery model based on hybrid architecture in data grid environment

Lü

Shi

et al. 2014

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The PAIRSE data integration system has a hybrid peer-to-peer infrastructure [14], where peers form communities of interest, called Virtual Organizations VOs. Each VO has a common domain ontology modeling its expertise, and peer members that may have relations with members from other VOs.…”

Section: Pairse's Architecturementioning

confidence: 99%

“…Then, our system exploits the defined RDF views (added as annotations to service description files) to select and compose the relevant services using an RDF query rewriting algorithm that we have devised for that purpose. Queries may necessitate the use of remote data services, in which case an efficient P2P service discovery algorithm [14] is used to locate and retrieve the descriptions of relevant services from remote peers. The system generates then an execution plan for the composition and executes it to provide the user with the requested data.…”

Section: Pairse's Architecturementioning

confidence: 99%

“…In PAIRSE, users' queries are resolved by composing relevant data services on the fly. Each virtual organization in PAIRSE's hybrid P2P architecture has a DHT (Distributed Hash Table) to index its published services [14]. Services are indexed according to the ontological concepts used in their RPVs.…”

Section: Service-based Query Resolutionmentioning

confidence: 99%

“…The algorithm relieves users from having to manually select and com-pose services, tasks that would generally require important programming skills. We proposed also an efficient algorithm to locate relevant services in a P2P environment [14].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Pairse

et al. 2013

Self Cite

View full text Add to dashboard Cite

Privacy is among the key challenges to data integration in many sectors, including healthcare, e-government, etc. The PAIRSE project aims at providing a flexible, looselycoupled and privacy-preserving data integration system in P2P environments. The project exploits recent Web standards and technologies such as Web services and ontologies to export data from autonomous data providers as reusable services, and proposes the use of service composition as a viable solution to answer data integration needs on the fly. The project proposed new composition algorithms and service/composition execution models that preserve privacy of data manipulated by services and compositions. The proposed integration system was demonstrated at EDBT 2013 and VLDB 2011.

show abstract

DSD: A DaaS Service Discovery Method in P2P Environments

Mokadem¹,

Morvan²,

Ghedira-Guegan³

et al. 2014

Advances in Intelligent Systems and Computing

Self Cite

View full text Add to dashboard Cite

Exposing data sources through Daas (Data as a Service) services become increasingly important. The DaaS service discovery constitutes a real challenge in P2P environments. Although several data source discovery methods take into account the semantic heterogeneity problems by using several domain ontologies (DOs), most of them imposed a topology on the graph formed by DOs and mapping links. In this paper, we propose a DaaS Service Discovery (DSD) method without imposing any topology on this graph. Peers, using a common DO, are grouped in a Virtual Organization (VO) and connected in a Distributed Hash Table (DHT). Then, lookups within a same VO consists in a classical search in a DHT. Regarding the inter-VO discovery process, we propose an addressing system, based on the existing mapping links between DOs, to interconnect VOs. Furthermore, a lazy maintenance is adopted in order to reduce the number of messages required to update the system.

show abstract

Resource Discovery Considering Semantic Properties in Data Grid Environments

Cited by 4 publications

References 25 publications

Data resource discovery model based on hybrid architecture in data grid environment

Data resource discovery model based on hybrid architecture in data grid environment

Pairse

DSD: A DaaS Service Discovery Method in P2P Environments

Contact Info

Product

Resources

About