Abstract
The Internet has become increasingly important to many emerging application such as Blog, Wikis, podcasts, and others Web-based communities and social-networking services, i.e. Web 2.0. Behind the scenes, added functionalities depend on the ability of users to work with the data stored on servers, i.e. DBMSs. However, the unpredictability and fluctuations of requests could result in overload, which can substantially degrade the quality of service. It is a challenging task to provide quality of service with inexpensive and scalable infrastructure. In this paper, we look at a new architectural design dimension, POEMS, that is online transformable between a single-node server and peer-based service network architectures. POEMS operates as a conventional DBMS under normal load conditions and transforms to peer-to-peer operation mode for processing under heavy load. In contrast to traditional distributed DBMSs, all nodes contribute their spare capacities for data manipulation. This is achieved without the need to install any DBMS at any of the contributing nodes. Data are partitioned online and operators are distributed to nodes similarly. The effectiveness of query processing is achieved by node cooperation. POEMS allows processes or operators to be dismissed online, so a user can fully utilise his/her resources.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anderson, T.E., Culler, D.E., Paterson, D.A.: A case for NOW (network of workstations). IEEE Micro 15(1), 54–64 (1994)
Becker, D.J., Sterling, T., Savarese, D., Dorband, E., Ranawake, U.A., Packer, C.V.: BEOWULF: A Parallel Workstation for Scientific Computation. In: ICPP, pp. 11–14 (1995)
Copeland, G., Alexander, W., Boughter, E., Keller, T.: Data Placement in Bubba. In: ACM SIGMOD, pp. 99–108 (1995)
Epema, D.H.J., Livny, M., van Dantzig, R., Evers, X., Pruyne, J.: A Worldwide Flock of Condors: Load Sharing Among Workstation Clusters. Journal on Future Generation Computer Systems 12(1), 53–65 (1996)
Halevy, A.Y., Ives, Z.G., Suciu, D., Tatarinov, I.: Schema Mediation in Peer Data Management Systems. In: ICDE, pp. 505–516 (2003)
Halevy, A.Y., Ives, Z.G., Madhavan, J., Mork, P., Suciu, D., Tatarinov, I.: The Piazza Peer Data Management System. IEEE Transactions on Knowledge and Data Engineering 16(7), 787–798 (2004)
Halevy, A.Y., Rajaraman, A., Ordille, J.: Data Integration: The Teenage Years. In: VLDB, pp. 9–16 (2006)
Haas, L.M., Miller, R.J., Niswonger, B., Roth, M.T., Schwarz, P.M., Wimmers, E.L.: Transforming Heterogeneous Data with Database Middleware: Beyond Integration. IEEE Data Engineering Bulletin 22(1), 31–36 (1999)
Helal, A., Yuan, D., El-Rewini, H.: Dynamic Data Reallocation for Skew Management in Shared-nothing Parallel Databases. Distributed and Parallel Databases 5(3), 271–288 (1997)
Kementsietsidis, A., Arenas, M., Miller, R.J.: Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues. In: ACM SIGMOD, pp. 325–336 (2003)
Kephart, J.O., Chess, D.M.: The Vision of Autonomic Computing. IEEE Computer 36(1), 41–50 (2003)
Manjhi, A., Ailamaki, A., Maggs, B.M., Mowry, T.C., Olston, C., Tomasic, A.: Simultaneous Scalability and Security for Data-intensive Web Applications. In: ACM SIGMOD, pp. 241–252 (2006)
Ng, W.S., Ooi, B.C., Tan, K.-L., Zhou, A.: PeerDB: A P2P-based System for Distributed Data Sharing. In: ICDE, pp. 633–644 (2003)
Olston, C., Manjhi, A., Garrod, C., Ailamaki, A., Maggs, B.M., Mowry, T.C.: A Scalability Service for Dynamic Web Applications. In: CIDR, pp. 56–69 (2005)
Parent, C., Spaccapietra, S.: Database Integration: An Overview of Issues and Approaches. Communications of the ACM 41(5), 166–178 (1998)
Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load Balancing in Structured P2P Systems. In: International Workshop on Peer-to-Peer Systems (2003)
Stonebraker, M.: A Case for Shared Nothing. Database Engineering 9(1), 4–9 (1986)
Scheuermann, P., Weikum, G., Zabback, P.: Data Partitioning and Load Balancing in Parallel Disk Systems. VLDB Journal 7(1), 48–66 (1998)
Tomasic, A., Raschid, L., Valduriez, P.: Scaling Heterogeneous Databases and the Design of Disco. In: ICDCS, pp. 449–457 (1996)
Liang, J., Gu, X.H., Nahrstedt, K.: Self-configuring Information Management for Large-scale Service Overlays. In: IEEE INFOCOM, pp. 472–480 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, W.S., Kalnis, P., Tan, KL., Kirchberg, M. (2008). POEMS: Peer-Based Overload Management. In: Bailey, J., Maier, D., Schewe, KD., Thalheim, B., Wang, X.S. (eds) Web Information Systems Engineering - WISE 2008. WISE 2008. Lecture Notes in Computer Science, vol 5175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85481-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-85481-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85480-7
Online ISBN: 978-3-540-85481-4
eBook Packages: Computer ScienceComputer Science (R0)