HEAL DSpace

SDQNET: Semantic distributed querying in loosely coupled data sources

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Spyropoulou, E en
dc.contributor.author Dalamagas, T en
dc.date.accessioned 2014-03-01T02:44:11Z
dc.date.available 2014-03-01T02:44:11Z
dc.date.issued 2006 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/31734
dc.subject Distributed Data Management en
dc.subject Query Processing en
dc.subject Web Community en
dc.subject.classification Computer Science, Theory & Methods en
dc.subject.other Data sources en
dc.subject.other Distributed data management en
dc.subject.other Semantic query processing en
dc.subject.other Computer architecture en
dc.subject.other Data reduction en
dc.subject.other Data structures en
dc.subject.other Distributed computer systems en
dc.subject.other Mathematical models en
dc.subject.other Semantics en
dc.subject.other Query languages en
dc.title SDQNET: Semantic distributed querying in loosely coupled data sources en
heal.type conferenceItem en
heal.identifier.primary 10.1007/11827252_7 en
heal.identifier.secondary http://dx.doi.org/10.1007/11827252_7 en
heal.language English en
heal.publicationDate 2006 en
heal.abstract Web communities involve networks of loosely coupled data sources. Members in those communities should be able to pose queries and gather results from all data sources in the network, where available. At the same time, data sources should have limited restrictions on how to organize their data. If a global schema is not available for such a network, query processing is strongly based on the existence of (hard to maintain) mapping rules between pairs of data sources. If a global schema is available, local schemas of data sources have to follow strict modelling restrictions posed by that schema. In this paper, we suggest an architecture to provide better support for distributed data management in loosely coupled data sources. In our approach, data sources can maintain diverse schemas. No explicit mapping rules between data sources are needed to facilitate query processing. Data sources can join and leave the network any time, at no cost for the community. We demonstrate our approach, describing SDQNET, a prototype platform to support semantic query processing in loosely coupled data sources. © Springer-Verlag Berlin Heidelberg 2006. en
heal.publisher SPRINGER-VERLAG BERLIN en
heal.journalName Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) en
heal.bookName LECTURE NOTES IN COMPUTER SCIENCE en
dc.identifier.doi 10.1007/11827252_7 en
dc.identifier.isi ISI:000241467200004 en
dc.identifier.volume 4152 LNCS en
dc.identifier.spage 55 en
dc.identifier.epage 70 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής