LinkedPeers: A distributed system for interlinking multidimensional data

Asiki, A; Tsoumakos, D; Koziris, N

dc.contributor.author	Asiki, A	en
dc.contributor.author	Tsoumakos, D	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T02:53:20Z
dc.date.available	2014-03-01T02:53:20Z
dc.date.issued	2011	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36247
dc.subject.other	Answering queries	en
dc.subject.other	Communication cost	en
dc.subject.other	Distributed query processing	en
dc.subject.other	Distributed systems	en
dc.subject.other	Hierarchical data	en
dc.subject.other	Multidimensional data	en
dc.subject.other	Peer-to-peer overlays	en
dc.subject.other	Pre-computation	en
dc.subject.other	Distributed computer systems	en
dc.subject.other	Expert systems	en
dc.subject.other	Hierarchical systems	en
dc.subject.other	Indexing (of information)	en
dc.subject.other	Peer to peer networks	en
dc.subject.other	Query processing	en
dc.subject.other	Search engines	en
dc.subject.other	Systems analysis	en
dc.subject.other	Distributed database systems	en
dc.title	LinkedPeers: A distributed system for interlinking multidimensional data	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-23091-2_47	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-23091-2_47	en
heal.publicationDate	2011	en
heal.abstract	In this paper we present LinkedPeers, a distributed system designed for efficient distribution and processing of multidimensional hierarchical data over a Peer-to-Peer overlay. he system design aims at incorporating two important features, namely large-scale support for partially-structured data and high-performance, distributed query processing including multiple aggregates. To achieve that, LinkedPeers utilizes a conceptual chain of DHT rings that stores data in a hierarchy-preserving manner and is able to adjust both the granularity of indexing and the amount of pre-computation according to the incoming workload. Extensive experiments prove that our system is very efficient achieving over 85% precision in answering queries while minimizing communication cost and adapting its indexing to the incoming queries. © 2011 Springer-Verlag Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-23091-2_47	en
dc.identifier.volume	6861 LNCS	en
dc.identifier.issue	PART 2	en
dc.identifier.spage	527	en
dc.identifier.epage	543	en