Replica-aware, multi-dimensional range queries in Distributed Hash Tables

Chazapis, A; Asiki, A; Tsoukalas, G; Tsoumakos, D; Koziris, N

dc.contributor.author	Chazapis, A	en
dc.contributor.author	Asiki, A	en
dc.contributor.author	Tsoukalas, G	en
dc.contributor.author	Tsoumakos, D	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T01:34:27Z
dc.date.available	2014-03-01T01:34:27Z
dc.date.issued	2010	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20735
dc.subject	Distributed Hash Tables	en
dc.subject	Multi-dimensional data	en
dc.subject	Peer-to-peer systems	en
dc.subject	Range queries	en
dc.subject	Replication	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Application scenario	en
dc.subject.other	Data items	en
dc.subject.other	Data replica	en
dc.subject.other	DHT routing	en
dc.subject.other	Distributed Hash Table	en
dc.subject.other	Distributed hash tables	en
dc.subject.other	Dynamic characteristics	en
dc.subject.other	Monitoring structures	en
dc.subject.other	Multi-dimensional range queries	en
dc.subject.other	Multidimensional data	en
dc.subject.other	Peer-to-Peer system	en
dc.subject.other	Prototype implementations	en
dc.subject.other	Query engines	en
dc.subject.other	Query execution	en
dc.subject.other	Query paths	en
dc.subject.other	Range query	en
dc.subject.other	Semantic relationships	en
dc.subject.other	Client server computer systems	en
dc.subject.other	Software prototyping	en
dc.subject.other	Peer to peer networks	en
dc.title	Replica-aware, multi-dimensional range queries in Distributed Hash Tables	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comcom.2010.01.024	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comcom.2010.01.024	en
heal.language	English	en
heal.publicationDate	2010	en
heal.abstract	In this paper, we present and evaluate a protocol that enables fast and accurate range-query execution in Distributed Hash Tables (DHTs). Range queries are of particular importance when the network is populated with groups or collections of data items, whose respective identifiers are generated in a way that encodes semantic relationships into key distances. Contrary to related work in the same direction, our proposed query engine is aware of data replicas at the DHT level and by grouping related nodes into replica neighborhoods, resolves queries with the minimum amount of messaging overhead. Moreover, we suggest pairing respective operations with the core DHT routing mechanics, which allows for reusing existing management and monitoring structures and automatically adapting the query path to the dynamic characteristics of the overlay. We also present an application scenario and the respective deployment details of a prototype implementation in the context of the Gredia project. (C) 2010 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/j.comcom.2010.01.024	en
dc.identifier.isi	ISI:000278157300010	en
dc.identifier.volume	33	en
dc.identifier.issue	8	en
dc.identifier.spage	984	en
dc.identifier.epage	996	en