An adaptive online system for efficient processing of hierarchical data

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An adaptive online system for efficient processing of hierarchical data

Full text

Pdf (598 KB)

Source

High Performance Distributed Computing archive
Proceedings of the 18th ACM international symposium on High performance distributed computing table of contents

Garching, Germany

SESSION: Grid middleware and distributed algorithms table of contents

Pages 71-80

Year of Publication: 2009

ISBN:978-1-60558-587-1

Authors

Athanasia Asiki	National Technical University of Athens , Athens, Greece
Dimitrios Tsoumakos	National Technical University of Athens , Athens, Greece
Nectarios Koziris	National Technical University of Athens , Athens, Greece

Sponsors

ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 41, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1551609.1551627 What is a DOI?

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: Specifically, 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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Egee accounting portal. http://www3.egee.cesga.es/gridsite/accounting/CESGA/.
	2	Ganglia Monitoring System. http://ganglia.info/.
	3	GT Information Services: Monitoring and Discovery System (MDS). http://www.globus.org/toolkit/mds/.
	4	Hawkeye: A Monitoring and Management Tool for Distributed Systems. http://www.cs.wisc.edu/condor/hawkeye/.
	5	R-GMA: Relational Grid Monitoring Architecture. http://www.r-gma.org/.
	6	The Globus Toolkit. http://www.globus.org/.
	7	Karl Aberer , Philippe Cudré-Mauroux , Manfred Hauswirth, The chatty web: emergent semantics through gossiping, Proceedings of the 12th international conference on World Wide Web, May 20-24, 2003, Budapest, Hungary [doi>10.1145/775152.775180]
	8	K. Aberer, P. Cudre-Mauroux, M. Hauswirth, and T. V. Pelt. Gridvine:Building internet-scale semantic overlay networks. In International Semantic Web Conference, 2004.
	9	OLAP Council APB-1 OLAP Benchmark. http://www.olapcouncil.org/research/resrchly.htm.
	10	M. Ester, J. Kohlhammer, and P. Kriegel. The dc-tree: A fully dynamic index structure for data warehouses. In ICDE, 2000.
	11	R. B. et.al. Apel: An implementation of grid accounting using r-gma. In UK e-Science All Hands Conference, 2005.
	12	FreePastry. http://freepastry.rice.edu/FreePastry.
	13	Ryan Huebsch , Joseph M. Hellerstein , Nick Lanham , Boon Thau Loo , Scott Shenker , Ion Stoica, Querying the internet with PIER, Proceedings of the 29th international conference on Very large data bases, p.321-332, September 09-12, 2003, Berlin, Germany
	14	Verena Kantere , Dimitrios Tsoumakos , Timos Sellis , Nick Roussopoulos, GrouPeer: Dynamic clustering of P2P databases, Information Systems, v.34 n.1, p.62-86, March, 2009 [doi>10.1016/j.is.2008.04.002]
	15	G. Koloniari and E. Pitoura. Content-based routing of path quieries in peer-to-peer systems. In EDBT, 2004.
	16	Laks V. S. Lakshmanan , Jian Pei , Yan Zhao, QC-trees: an efficient summary structure for semantic OLAP, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California [doi>10.1145/872757.872768]
	17	B. Ooi, Y. Shu, K. Tan, and A. Zhou. PeerDB: A P2P-based System for Distributed Data Sharing. In ICDE, 2003.
	18	Yannis Sismanis , Antonios Deligiannakis , Yannis Kotidis , Nick Roussopoulos, Hierarchical dwarfs for the rollup cube, Proceedings of the 6th ACM international workshop on Data warehousing and OLAP, November 07-07, 2003, New Orleans, Louisiana, USA [doi>10.1145/956060.956064]
	19	Chunqiang Tang , Zhichen Xu , Sandhya Dwarkadas, Peer-to-peer information retrieval using self-organizing semantic overlay networks, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29, 2003, Karlsruhe, Germany [doi>10.1145/863955.863976]
	20	Igor Tatarinov , Alon Halevy, Efficient query reformulation in peer data management systems, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France [doi>10.1145/1007568.1007629]
	21	W. Wang, H. Lu, J. Feng, and J. X. Yu. Condensed Cube: An Effective Approach to Reducing Data Cube Size. In ICDE, 2002.
	22	Xuehai Zhang , Jeffrey L. Freschl , Jennifer M. Schopf, Scalability analysis of three monitoring and information systems: MDS2, R-GMA, and Hawkeye, Journal of Parallel and Distributed Computing, v.67 n.8, p.883-902, August, 2007 [doi>10.1016/j.jpdc.2007.03.006]