Lightweight Main Memory DB for Telecom Network Performance Management System

  • Lina Lan
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 113)


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).


Network management operation administration, maintenance, provisioning (OAM&P) Performance management (PM) Main memory database system (MMDB) Disk-resident database system (DRDBS) RB-Tree 


  1. 1.
    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–151CrossRefGoogle Scholar
  2. 2.
    Yang W, Zhang J (2005) Summary of main memory DB[J]. J Xi’an Coll Posts Telecomm 10(3):96–99Google Scholar
  3. 3.
    Garcia-Molina H, Salem K (1992) Main memory database systems: an overview. IEEE Trans Knowl Data Engineer 4(6):509–516Google Scholar
  4. 4.
    McDougall R, Mauro J (2006) Solaris™ Internals: Solaris 10 and open solaris kernel architecture. July 10, 2nd editionGoogle Scholar
  5. 5.
    Nicolai M. Josuttis (1999) C ++ Standard Library, August 06Google Scholar
  6. 6.
    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–73Google Scholar
  7. 7.
    Choi KR, Kim KC (1996) Real-Time computing systems and applications. In: Proceedings: third international workshop on 30 Oct-1 Nov, pp 81–88Google Scholar
  8. 8.
    Wilson PR, Johnstone MS, Neely M, Boles D (1995) Dynamic storage allocation a survey and critical review. In: international workshop on memory management, SeptemberGoogle Scholar
  9. 9.
    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–303Google Scholar
  10. 10.
    DeWitt DJ et al (1984) Implementation techniques for main memory database systems. In: Proc. ACM SIGMOD ConjGoogle Scholar
  11. 11.
    Whang KY, Krishnamurthy R (1990) Query optimization in a memory resident domain relational calculus system. ACM Trans Database Syst 15(1):67–95CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  1. 1.School of Network EducationBeijing University of Posts and TelecommunicationsBeijingChina

Personalised recommendations