CN103678553A - Wireless terminal database establishing method based on shared memory design - Google Patents

Wireless terminal database establishing method based on shared memory design Download PDF

Info

Publication number
CN103678553A
CN103678553A CN201310655909.6A CN201310655909A CN103678553A CN 103678553 A CN103678553 A CN 103678553A CN 201310655909 A CN201310655909 A CN 201310655909A CN 103678553 A CN103678553 A CN 103678553A
Authority
CN
China
Prior art keywords
wireless terminal
shared drive
bitmap
terminal
shared memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201310655909.6A
Other languages
Chinese (zh)
Inventor
李少华
俞梦涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Huanchuang Communication Technology Co Ltd
Original Assignee
Shanghai Huanchuang Communication Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Huanchuang Communication Technology Co Ltd filed Critical Shanghai Huanchuang Communication Technology Co Ltd
Priority to CN201310655909.6A priority Critical patent/CN103678553A/en
Publication of CN103678553A publication Critical patent/CN103678553A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/21Design, administration or maintenance of databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2308Concurrency control
    • G06F16/2336Pessimistic concurrency control approaches, e.g. locking or multiple versions without time stamps
    • G06F16/2343Locking methods, e.g. distributed locking or locking implementation details
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5022Mechanisms to release resources

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a wireless terminal database establishing method based on shared memory design. The method comprises the following steps that 1) user tables of wireless terminals are divided, and the IDs of the wireless terminals are distributed through a bitmap; 2) the IDs distributed through the bitmap are used for identifying keywords of the wireless terminals, and a non-pointer chain table is used for sharing Hash tables in a memory in a traversal mode; and 3) a flag bit is set for each course in the shared memory and is used for identifying whether the course locks terminal data in the shared memory, after the course restarts to load the shared memory, whether the flag bit is locked is detected, and if yes, unlocking is carried out first. Compared with the prior art, the method has the advantages that memory space is saved, the phenomenon that multi-process space loading shared memory access border crossing caused by a pointer is avoided, and the problem that a critical zone information lock cannot be released forever caused by the fact that a critical zone, namely the shared memory is accessed in a multi-process mode is solved.

Description

Wireless terminal data base construction method based on shared drive design
Technical field
The present invention relates to a kind of wireless terminal data base construction method, especially relate to a kind of wireless terminal data base construction method based on shared drive design.
Background technology
In wireless terminal data management, the mac of terminal, ip, flow, duration etc. need to be supervised, and a plurality of business process are used shared drives to access the data message of these terminals, and relatively and other storage medium, shared drive access speed has larger lifting.
If tradition shared drive free space distributes, use chain table method, this body structure of chained list additionally need to take a large amount of internal memories at shared drive, for critical section shared drive in short supply, needs more reasonably to optimize shared drive size.
Tradition shared memory space is by multi-process load address or be the address space Random assignment according to each process free time, to specify the address that will be loaded into each process, for these two kinds of load modes, Random assignment or after the load address of appointment is loaded by this process, some indicator index in wireless terminal data, to there will be deviation, cause out-of-bounds access.
Tradition shared drive mutual exclusion lock, can play effective protection for solving normal multi-process access critical section, if obtain the process of lock, now collapses, and directly causes the lock in shared drive forever cannot be released.
Summary of the invention
Object of the present invention is exactly to provide a kind of wireless terminal data base construction method based on shared drive design in order to overcome the defect that above-mentioned prior art exists, the multi-process space of save memory headroom, avoiding bringing due to pointer load shared drive Access Violation situation, solved the problem that this critical section information lock that multi-process access this piece critical section of shared drive causes cannot discharge forever.
Object of the present invention can be achieved through the following technical solutions:
A wireless terminal data base construction method based on shared drive design, is characterized in that, comprises the following steps:
1) subscriber's meter of each wireless terminal is divided, and with bitmap, distributed the ID of each wireless terminal;
2) ID that utilizes bitmap to distribute identifies the key word of wireless terminal, and travels through the Hash table in shared drive by non-pointer chained list;
3) in shared drive for each process arranges a zone bit, for identifying this process, whether shared drive terminal data is locked, in process, restart and load after shared drive, check whether this zone bit locks, if lock, first carry out and discharge this lock.
The described subscriber's meter to each wireless terminal is divided, and distributes the ID of each wireless terminal to be specially with bitmap:
Wireless terminal sends the associated message of authentication after reaching the standard grade, essential information through the access of radio access module notification terminal administration module terminal, in shared drive, utilize bitmap data structure, with bit, identify this ID and whether be assigned with away, search out the end message memory location not being assigned with away of ID minimum;
Utilizing afterwards terminal MAC to carry out Hash hashes in MAC Hash table, set up terminal storage positional information associated with MAC Hash table, wait for the IP distribution module notification terminal administration module IP information of DHCP or other-end, IP information is carried out to Hash and hash in the Hash table of IP, set up terminal storage positional information associated with IP Hash table.
The described Hash table that utilizes non-pointer chained list to travel through in shared drive is specially:
The ID that in shared drive, chained list utilizes bitmap to distribute replaces next and the prev pointer of MAC Hash and IP ltsh chain table, by MAC and IP, index the chained list of this key assignments of traversal after Hash bucket, this chained list is not stored next or a upper pointer that is hashing onto the terminal of identical key assignments, but the ID that bitmap distributes.
End message storage is stored in the middle of shared drive jointly with Hash table.
Compared with prior art, the present invention has the following advantages:
1) bitmap is used for identifying shared drive allocation scheme and user structure information, with respect to traditional chained list, has not only saved memory headroom, more can adapt to the shared drive of whole pointer-free.
2) design of non-pointer Hash table and chained list, avoids the multi-process space of bringing due to pointer to load the situation of shared drive Access Violation.
3) multi-process enciphered information can well be avoided abnormal in the critical section access in shared drive of multi-process.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of basic chained list;
Fig. 2 is shared drive and the relationship memory schematic diagram of different processes.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail.
Embodiment
A wireless terminal data base construction method based on shared drive design, comprises the following steps:
1) subscriber's meter of each wireless terminal is divided, and with bitmap, distributed the ID of each wireless terminal;
2) the pointer deviation causing for load address space bias, the ID that the present invention utilizes bitmap to distribute carrys out the key word of marking terminal, do not use class Hash table and the class chained list of pointer, and encapsulation outgoing interface calls to other modules, overcome because load address is inconsistent, cause according to the failure of indicator index access terminal information;
For the key word MAC of wireless terminal and IP etc., provide corresponding index, other modules can directly find corresponding wireless terminal information by MAC with IP from shared drive, thereby reached to have reduced, use the time of searching other media storages and spending more expense, again can be correct have access to internal storage data.
3) cannot release And Spread of Solute for the lock causing due to process collapse in shared drive, in shared drive for each process arranges a zone bit, whether be used for identifying this process locks to shared drive terminal data, in process, restart and load after shared drive, check whether this zone bit locks, if lock, first carry out and discharge this lock, even if process is restarted, the lock that this end message is added still can discharge, thereby guarantees the lock characteristic of shared drive.
As shown in Figure 1, basic chained list leaves in wireless terminal information, in figure, next and prev all find terminal location with the ID that bitmap distributes, be provided with the chained list that a stature caudal knot point identifies non-pointer under this Hash key assignments simultaneously, search terminal and realize by key messages such as traversal chained list comparison MAC/IP.
As shown in Figure 2, the relationship memory that represents shared drive and different processes, because the memory address space of operating system is the linear address space of a 4G, 3G is the kernel state process space above, and shared drive application internal memory out leaves in the following linear address space of 3G of operating system.The common process address space is a separate 4G space, is not on linear address, and other processes arrive this memory-mapped in the address space of oneself by address mapping techniques; In Fig. 2, customer data base is used for identifying the position of really depositing user profile, and its below is a Hash bucket of depositing MAC and IP, and different processes get end message memory location according to demand from Hash bucket, and then goes access.Process A, B, X have been mapped to this piece shared drive respectively in own different address spaces, user data is conducted interviews, owing to not storing pointer in whole shared drive, so, when index search end message, can be because each process is mapped to different failure or the Access Violation of accessing of own address space by shared drive.Fig. 2 below is a module lock of depositing disparate modules, is used for identifying which module and is accessing shared drive data.
The present invention with respect to the advantage of existing scheme is:
(1) bitmap, in the subscriber's meter of a 8192*128 size, with respect to the whole shared memory space of 500M, can be saved the memory headroom of 20M.
(2) with respect to assigned address load mode, at internal memory, use in high process, specify the address loading to be used and cause loading to be offset;
With respect to Random assignment mode, for solving multi-process loading shared drive at offset information of shared drive reservation, each process is offset this problem, and the present invention can not cause because calculations of offset mistake causes the problem of crossing the border of introducing in addition.
(3) solved the problem that this critical section information lock that multi-process access shared drive this piece critical section causes cannot discharge forever.

Claims (3)

1. the wireless terminal data base construction method based on shared drive design, is characterized in that, comprises the following steps:
1) subscriber's meter of each wireless terminal is divided, and with bitmap, distributed the ID of each wireless terminal;
2) ID that utilizes bitmap to distribute identifies the key word of wireless terminal, and travels through the Hash table in shared drive by non-pointer chained list;
3) in shared drive for each process arranges a zone bit, for identifying this process, whether shared drive terminal data is locked, in process, restart and load after shared drive, check whether this zone bit locks, if lock, first carry out and discharge this lock.
2. wireless terminal data base construction method according to claim 1, is characterized in that, the described subscriber's meter to each wireless terminal is divided, and distributes the ID of each wireless terminal to be specially with bitmap:
Wireless terminal sends the associated message of authentication after reaching the standard grade, essential information through the access of radio access module notification terminal administration module terminal, in shared drive, utilize bitmap data structure, with bit, identify this ID and whether be assigned with away, search out the end message memory location not being assigned with away of ID minimum;
Utilizing afterwards terminal MAC to carry out Hash hashes in MAC Hash table, set up terminal storage positional information associated with MAC Hash table, wait for the IP distribution module notification terminal administration module IP information of DHCP or other-end, IP information is carried out to Hash and hash in the Hash table of IP, set up terminal storage positional information associated with IP Hash table.
3. wireless terminal data base construction method according to claim 1, is characterized in that, the described Hash table that utilizes non-pointer chained list to travel through in shared drive is specially:
The ID that in shared drive, chained list utilizes bitmap to distribute replaces next and the prev pointer of MAC Hash and IP ltsh chain table, by MAC and IP, index the chained list of this key assignments of traversal after Hash bucket, this chained list is not stored next or a upper pointer that is hashing onto the terminal of identical key assignments, but the ID that bitmap distributes.
CN201310655909.6A 2013-12-06 2013-12-06 Wireless terminal database establishing method based on shared memory design Pending CN103678553A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310655909.6A CN103678553A (en) 2013-12-06 2013-12-06 Wireless terminal database establishing method based on shared memory design

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310655909.6A CN103678553A (en) 2013-12-06 2013-12-06 Wireless terminal database establishing method based on shared memory design

Publications (1)

Publication Number Publication Date
CN103678553A true CN103678553A (en) 2014-03-26

Family

ID=50316098

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310655909.6A Pending CN103678553A (en) 2013-12-06 2013-12-06 Wireless terminal database establishing method based on shared memory design

Country Status (1)

Country Link
CN (1) CN103678553A (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104954351A (en) * 2014-05-23 2015-09-30 腾讯科技(深圳)有限公司 Data detection method and apparatus
CN106663062A (en) * 2014-04-30 2017-05-10 甲骨文国际公司 System and method for providing distributed transaction lock in transactional middleware machine environment
CN107797864A (en) * 2017-10-19 2018-03-13 浪潮金融信息技术有限公司 Process resource method and device, computer-readable recording medium, terminal
CN110019232A (en) * 2017-12-27 2019-07-16 中移(杭州)信息技术有限公司 A kind of message store method and device
CN113032162A (en) * 2021-03-23 2021-06-25 重庆智行者信息科技有限公司 Multi-process communication method based on shared memory backup mechanism
CN113297114A (en) * 2021-05-21 2021-08-24 清创网御(合肥)科技有限公司 Method for supporting multiple processes and multiple threads based on PCIE (peripheral component interface express) independent IO (input/output) of encryption card
CN113342805A (en) * 2021-04-21 2021-09-03 湖北微源卓越科技有限公司 System and method for sharing data by multiple processes
CN113515527A (en) * 2021-09-13 2021-10-19 成都数默科技有限公司 Method for establishing and applying aggregation type IP index
CN113688068A (en) * 2021-10-25 2021-11-23 支付宝(杭州)信息技术有限公司 Graph data loading method and device
CN111061724B (en) * 2019-11-08 2023-11-14 珠海许继芝电网自动化有限公司 High-speed real-time database management method and device for power distribution automation system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6578131B1 (en) * 1999-04-27 2003-06-10 Microsoft Corporation Scaleable hash table for shared-memory multiprocessor system
CN101676906A (en) * 2008-09-18 2010-03-24 中兴通讯股份有限公司 Method of managing memory database space by using bitmap
CN102195853A (en) * 2010-03-09 2011-09-21 杭州华三通信技术有限公司 Method and device for storing bitmap
US20130097357A1 (en) * 2011-10-18 2013-04-18 Industrial Technology Research Institute Method for identifying memory of virtual machine and computer system thereof
CN103117931A (en) * 2013-02-21 2013-05-22 烽火通信科技股份有限公司 Media access control (MAC) address hardware learning method and system based on hash table and ternary content addressable memory (TCAM) table

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6578131B1 (en) * 1999-04-27 2003-06-10 Microsoft Corporation Scaleable hash table for shared-memory multiprocessor system
CN101676906A (en) * 2008-09-18 2010-03-24 中兴通讯股份有限公司 Method of managing memory database space by using bitmap
CN102195853A (en) * 2010-03-09 2011-09-21 杭州华三通信技术有限公司 Method and device for storing bitmap
US20130097357A1 (en) * 2011-10-18 2013-04-18 Industrial Technology Research Institute Method for identifying memory of virtual machine and computer system thereof
CN103117931A (en) * 2013-02-21 2013-05-22 烽火通信科技股份有限公司 Media access control (MAC) address hardware learning method and system based on hash table and ternary content addressable memory (TCAM) table

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106663062A (en) * 2014-04-30 2017-05-10 甲骨文国际公司 System and method for providing distributed transaction lock in transactional middleware machine environment
CN106663062B (en) * 2014-04-30 2019-08-16 甲骨文国际公司 The system and method for distributed transaction lock are provided in transactional middleware machine environment
CN104954351B (en) * 2014-05-23 2018-05-04 腾讯科技(深圳)有限公司 data detection method and device
CN104954351A (en) * 2014-05-23 2015-09-30 腾讯科技(深圳)有限公司 Data detection method and apparatus
CN107797864A (en) * 2017-10-19 2018-03-13 浪潮金融信息技术有限公司 Process resource method and device, computer-readable recording medium, terminal
CN110019232A (en) * 2017-12-27 2019-07-16 中移(杭州)信息技术有限公司 A kind of message store method and device
CN111061724B (en) * 2019-11-08 2023-11-14 珠海许继芝电网自动化有限公司 High-speed real-time database management method and device for power distribution automation system
CN113032162A (en) * 2021-03-23 2021-06-25 重庆智行者信息科技有限公司 Multi-process communication method based on shared memory backup mechanism
CN113032162B (en) * 2021-03-23 2023-10-24 重庆兰德适普信息科技有限公司 Multi-process communication method based on shared memory backup mechanism
CN113342805A (en) * 2021-04-21 2021-09-03 湖北微源卓越科技有限公司 System and method for sharing data by multiple processes
CN113297114B (en) * 2021-05-21 2022-12-06 清创网御(合肥)科技有限公司 Method for supporting multiple processes and multiple threads based on PCIE (peripheral component interface express) independent IO (input/output) of encryption card
CN113297114A (en) * 2021-05-21 2021-08-24 清创网御(合肥)科技有限公司 Method for supporting multiple processes and multiple threads based on PCIE (peripheral component interface express) independent IO (input/output) of encryption card
CN113515527A (en) * 2021-09-13 2021-10-19 成都数默科技有限公司 Method for establishing and applying aggregation type IP index
CN113688068A (en) * 2021-10-25 2021-11-23 支付宝(杭州)信息技术有限公司 Graph data loading method and device
CN113688068B (en) * 2021-10-25 2022-02-15 支付宝(杭州)信息技术有限公司 Graph data loading method and device

Similar Documents

Publication Publication Date Title
CN103678553A (en) Wireless terminal database establishing method based on shared memory design
CN102331993B (en) Data migration method of distributed database and distributed database migration system
CA3154919A1 (en) Data object identification generating method, device, computer equipment and storage medium
US20080243966A1 (en) System and method for managing temporary storage space of a database management system
TW201800967A (en) Method and device for processing distributed streaming data
CN105677578A (en) Control method and system for 3D flash memory
CN105260314A (en) Memory leak monitoring method
US9047174B2 (en) Method and system for hierarchically managing storage resources
CN105320654A (en) Dynamic bloom filter and element operating method based on same
CN105426321A (en) RDMA friendly caching method using remote position information
CN102088484A (en) Write lock method of distributed file system and a system thereof
CN104731799A (en) Memory database management device
CN101714167B (en) Method and device for accessing monofile database
CN104331453A (en) Distributed file system and constructing method thereof
WO2020168522A1 (en) System on chip, routing method for access command and terminal
CN103383690A (en) Distributed data storage method and system
CN102567225A (en) Method and device for managing system memory
CN109032817B (en) Method for realizing shared memory of power quality management system
CN104598615A (en) Memory access method and device supporting data persistence
CN103970678B (en) Catalogue designing method and device
CN103218305A (en) Distribution method of memory space
CN104679816A (en) Application method of SQLITE database in embedded system
US20120206981A1 (en) Method and device for writing data
US20220107752A1 (en) Data access method and apparatus
WO2016131175A1 (en) Method and device for accessing data visitor directory in multi-core system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20140326

RJ01 Rejection of invention patent application after publication