Support for concept hierarchies in DHTs*

Asiki, A; Doka, K; Tsoumakos, D; Koziris, N

dc.contributor.author	Asiki, A	en
dc.contributor.author	Doka, K	en
dc.contributor.author	Tsoumakos, D	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T02:45:48Z
dc.date.available	2014-03-01T02:45:48Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32398
dc.subject	Concept Hierarchy	en
dc.subject	Data Warehouse	en
dc.subject	Indexation	en
dc.subject	Peer To Peer	en
dc.subject.other	Answering queries	en
dc.subject.other	Concept hierarchies	en
dc.subject.other	Querying datums	en
dc.subject.other	Administrative data processing	en
dc.subject.other	Data warehouses	en
dc.title	Support for concept hierarchies in DHTs*	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/P2P.2008.26	en
heal.identifier.secondary	http://dx.doi.org/10.1109/P2P.2008.26	en
heal.identifier.secondary	4627268	en
heal.publicationDate	2008	en
heal.abstract	Concept hierarchies greatly help in the organization and reuse of information and are widely used in a variety of applications, such as data warehouses. In this paper, we describe a method for efficiently storing and querying data organized into concept hierarchies and dispersed over a DHT. In our method, peers individually decide on the level of indexing according to the incoming queries. Roll-up and drill-down operations are performed on a per-node basis in order to minimize the number of floods for answering queries on varying levels of granularity. Initial experimental results support this argument on a variety of workloads. © 2008 IEEE.	en
heal.journalName	Proceedings - P2P'08, 8th International Conference on Peer-to-Peer Computing	en
dc.identifier.doi	10.1109/P2P.2008.26	en
dc.identifier.spage	121	en
dc.identifier.epage	124	en