期刊文献+

信令监控系统中数据存储检索功能的设计 被引量:3

Design of Data Storage Retrieval Function in Signaling Monitoring System
下载PDF
导出
摘要 针对信令数据自身的特殊性,在考虑了计算机配置、网络速度等硬件因素的情况下,通过建立多级索引结构,并借鉴数据库分区的概念,使用多线程查询等方式,为信令数据存储和检索提供一种有效解决方案,可以对监控系统的海量信令信息进行组织、存储,并实现对海量数据的快速便捷检索。此外,它还具有极高的耦合度,易于扩展,能够与其他系统快速兼容。 For the particularity of the signaling data itself,in consideration of hardware factors such as computer configuration and network speed,by establishing a multi-level index structure,and drawing on the concept of database partitioning,using multi-thread query,an effective solution for signaling data storage and retrieval is presented.The scheme can organize and store the massive signaling information of the monitoring system,and realize fast and convenient retrieval of massive data.In addition,it has a very high degree of coupling,is easy to expand,and is quickly compatible with other systems.
作者 刘皎 曹荣荣 武立 LIU Jiao;CAO Rongrong;WU Li(College of Electronic Information and Electrical Engineering, Shangluo University, Shangluo, Shanxi 726000, China;Shangluo Sports Centre, Shangluo, Shanxi 726000, China)
出处 《微型电脑应用》 2020年第6期37-39,共3页 Microcomputer Applications
基金 陕西省大学生创新创业训练项目(S201911396058) 陕西省教育厅专项项目(19JK0256) 商洛市科技计划项目(SK2019-78) 商洛学院教育教学改革项目(19jyjx112) 2018年第一批产学合作协同育人项目(201801082072)。
关键词 信令监控 封包数据 数据存储 数据检索 signaling monitoring packet data data storage data retrieval
  • 相关文献

参考文献12

二级参考文献55

  • 1Bader D A,Madduri K. Designing Multithreaded Algo- rithms for Breadth-first Search and st-connectivity on the Cray MTA-2 [ C ]//Proceedings of ICPP' 06. Washington D. C. , USA : IEEE Press ,2006:523-530.
  • 2Bader D A,Madduri K. Parallel Algorithms for Evaluat- ing Centrality Indices in Real-world Networks[C]// Proceedings of ICPP' 06. Washington D. C. , USA: IEEE Press ,2006:539-550.
  • 3Zhao Xiaohan, Sala A, Zheng Haitao, et al. Efficient Shortest Paths on Massive Social Graphs[Cl// Proceedings of the 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing. Orlando, USA: [ s. n. ] ,2011:77-86.
  • 4Hardin D S, Hardin S S. ACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-pairs Shortest Path Algorithm in ACL2 [ C ]//Proceedings of ACL2' 13. [ S. 1. ] :EPTCS,2013:127-142.
  • 5Pandey M, Pandey H, Sharma S. In-place Recursive Approach for All-pairs Shortest-path Problem Using OPENCL I C 1//Proceedings of ICIT' 13. Washington D. C, , USA :IEEE Press ,2013.
  • 6Ortega-Arranz H,Torres Y, Llanos D R, et al. The All- pair Shortest-path Problem in Shared-memory Hetero- geneous Systems E EB/OL]. (2013-01-03). http://www. infor, uva. es/- yuri. torres/docs/hector_Complex_2013, pdf.
  • 7Sariyiice A E. Betweenness Centrality on GPUs and Heterogeneous Architectures [ C ]//Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units. New York, USA: ACM Press ,2013.
  • 8Aapo K, Blelloch G E, Guestrin C. GraphChi: Large- scale Graph Computation on Just a PC [ C ]// Proceedings of OSDI' 12. Washington D. C., USA: IEEE Press ,2012:31-46.
  • 9Ediger D, Jiang K, Riedy J, et al. GraphCT: Multi- threaded Algorithms for Massive Graph Analysis[J]. IEEE Transactions on Parallel and Distributed Systems, 2013,24( 11 ) :2220-2229.
  • 10Kang U, Tsourakakis C E. PEGASUS: A Peta-scale Graph Mining System Implementation and Observa- tions[ C]//Proceedings of ICDM' 09. Washington D. C. , USA: IEEE Press,2009 : 229-238.

共引文献56

同被引文献29

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部