An adaptive online system for efficient processing of hierarchical 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:45:57Z
dc.date.available	2014-03-01T02:45:57Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32478
dc.subject	Adaptive indexing	en
dc.subject	Concept hierarchies	en
dc.subject	Distributed hash table	en
dc.subject	Grid information system	en
dc.subject.other	Aggregation level	en
dc.subject.other	Answering queries	en
dc.subject.other	Concept hierarchies	en
dc.subject.other	Distributed Hash Table	en
dc.subject.other	Drill-down	en
dc.subject.other	Grid information systems	en
dc.subject.other	Grid systems	en
dc.subject.other	Hierarchical data	en
dc.subject.other	Information systems application	en
dc.subject.other	Large amounts of data	en
dc.subject.other	Low costs	en
dc.subject.other	Sudden change	en
dc.subject.other	Computer science	en
dc.subject.other	Data processing	en
dc.subject.other	Die casting	en
dc.subject.other	Hierarchical systems	en
dc.subject.other	Indexing (of information)	en
dc.subject.other	Online systems	en
dc.subject.other	Information systems	en
dc.title	An adaptive online system for efficient processing of hierarchical data	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1551609.1551627	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1551609.1551627	en
heal.identifier.secondary	1551627	en
heal.publicationDate	2009	en
heal.abstract	Concept hierarchies greatly help in the organization and reuse of information and are widely used in a variety of information systems applications. 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 granularity of the incoming queries. Roll-up and drill-down operations are performed on a per-node basis in order to minimize the required bandwidth for answering queries on variable aggregation levels. We motivate our approach by applying it on a large-scale Grid system: Specifi-cally, we plan to apply our fully decentralized scheme that creates, queries and updates large volumes of hierarchical data on-line and replace the traditional centralized and strictly indexed information systems. Our extensive experimental results support this argument on many diverse configurations: Our system proves very efficient in skewed workloads, both over single and multiple hierarchy levels at the same time. It adapts to sudden changes in popularity and effectively stores and updates large amounts of data at very low cost. Copyright 2009 ACM.	en
heal.journalName	Proc. 18th ACM International Symposium on High Performance Distributed Computing, HPDC 09, Co-located with the 2009 International Symposium on High Performance Distributed Computing Conf., HPDC'09	en
dc.identifier.doi	10.1145/1551609.1551627	en
dc.identifier.spage	71	en
dc.identifier.epage	80	en