Indexing views to route queries in a PDMS

Sidirourgos, L; Kokkinidis, G; Dalamagas, T; Christophides, V; Sellis, T

dc.contributor.author	Sidirourgos, L	en
dc.contributor.author	Kokkinidis, G	en
dc.contributor.author	Dalamagas, T	en
dc.contributor.author	Christophides, V	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T01:57:09Z
dc.date.available	2014-03-01T01:57:09Z
dc.date.issued	2008	en
dc.identifier.issn	09268782	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28366
dc.subject	Peer data management systems	en
dc.subject	Query processing	en
dc.subject	Query routing	en
dc.subject	View indexing	en
dc.subject.other	Distributed computer systems	en
dc.subject.other	Encoding (symbols)	en
dc.subject.other	Fault tolerance	en
dc.subject.other	Indexing (of information)	en
dc.subject.other	Query processing	en
dc.subject.other	Routing algorithms	en
dc.subject.other	Peer data management systems	en
dc.subject.other	Query routing	en
dc.subject.other	Routing hops	en
dc.subject.other	View indexing	en
dc.subject.other	Database systems	en
dc.title	Indexing views to route queries in a PDMS	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s10619-007-7021-0	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s10619-007-7021-0	en
heal.publicationDate	2008	en
heal.abstract	P2P computing gains increasing attention lately, since it provides the means for realizing computing systems that scale to very large numbers of participating peers, while ensuring high autonomy and fault-tolerance. Peer Data Management Systems (PDMS) have been proposed to support sophisticated facilities in exchanging, querying and integrating (semi-)structured data hosted by peers. In this paper, we are interested in routing graph queries in a very large PDMS, where peers advertise their local bases using fragments of community RDF/S schemes (i.e., views). We introduce an original encoding for these fragments, in order to efficiently check whether a peer view is subsumed by a query. We rely on this encoding to design an RDF/S view lookup service featuring a statefull and a stateless execution over a DHT-based P2P infrastructure. We finally evaluate experimentally our system to demonstrate its scalability for very large P2P networks and arbitrary RDF/S schema fragments, and to estimate the number of routing hops required by the two versions of our lookup service. © 2008 Springer Science+Business Media, LLC.	en
heal.journalName	Distributed and Parallel Databases	en
dc.identifier.doi	10.1007/s10619-007-7021-0	en
dc.identifier.volume	23	en
dc.identifier.issue	1	en
dc.identifier.spage	45	en
dc.identifier.epage	68	en