Abstract
Today telecom network is a growing complex. Although the amount of network performance data increased dramatically, telecom network operators require better performance on network performance data collection and analysis. Database is the important component in modern network management model. Since main memory database (MMDB) stores data in main physical memory and provides very high-speed access, MMDB can suffice the requirements on data intensive and real time response in network performance management system. This paper presents a novel lightweight design on MMDB for network performance data persistence. This design improves data access performance in following aspects. The data persistence mechanism employs user mode memory map provided by Unix OS. To reduce the cost of data copy and data interpretation, the data storage format is designed as consistent with binary format in application memory. The database is provided as program library and the application can access data in shared memory to avoid the cost on inter-process communication. Once data is updated in memory, query application can get updated data without disk I/O cost. The data access methods adopt multi-level RB-Tree structure. In best case, the algorithm complexity is O(N). In worst case, the algorithm complexity is O(N*lgN). In real performance data distribution scenarios, the complexity is nearly O(N).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bohannon P, Lieuwen D, Rastogi R et al (1997) The architecture of the dali main-memory storage manager. J Multim Tools Appl 4(2):115–151
Yang W, Zhang J (2005) Summary of main memory DB[J]. J Xi’an Coll Posts Telecomm 10(3):96–99
Garcia-Molina H, Salem K (1992) Main memory database systems: an overview. IEEE Trans Knowl Data Engineer 4(6):509–516
McDougall R, Mauro J (2006) Solarisâ„¢ Internals: Solaris 10 and open solaris kernel architecture. July 10, 2nd edition
Nicolai M. Josuttis (1999) C ++ Standard Library, August 06
Lu H,Yeung Ng Y, Tian Z (2000) T-tree or B-tree: main memory database index structure revisited, ADC 2000. In: Proceedings. 11th Australasian database conference, pp 65–73
Choi KR, Kim KC (1996) Real-Time computing systems and applications. In: Proceedings: third international workshop on 30 Oct-1 Nov, pp 81–88
Wilson PR, Johnstone MS, Neely M, Boles D (1995) Dynamic storage allocation a survey and critical review. In: international workshop on memory management, September
DeWitt DJ (1986) A study of index structures for main memory database management systems. In: Proceedings 12th conference on very large data bases pp 294–303
DeWitt DJ et al (1984) Implementation techniques for main memory database systems. In: Proc. ACM SIGMOD Conj
Whang KY, Krishnamurthy R (1990) Query optimization in a memory resident domain relational calculus system. ACM Trans Database Syst 15(1):67–95
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media B.V.
About this paper
Cite this paper
Lan, L. (2012). Lightweight Main Memory DB for Telecom Network Performance Management System. In: Yang, Y., Ma, M. (eds) Green Communications and Networks. Lecture Notes in Electrical Engineering, vol 113. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-2169-2_4
Download citation
DOI: https://doi.org/10.1007/978-94-007-2169-2_4
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-2168-5
Online ISBN: 978-94-007-2169-2
eBook Packages: EngineeringEngineering (R0)