CN1585553A - Method for processing to VLR user data - Google Patents
Method for processing to VLR user data Download PDFInfo
- Publication number
- CN1585553A CN1585553A CN 200410009161 CN200410009161A CN1585553A CN 1585553 A CN1585553 A CN 1585553A CN 200410009161 CN200410009161 CN 200410009161 CN 200410009161 A CN200410009161 A CN 200410009161A CN 1585553 A CN1585553 A CN 1585553A
- Authority
- CN
- China
- Prior art keywords
- index
- record
- vlr
- user data
- handled
- 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
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The method includes following steps: an object oriented design method is set, and a VLR data base is designed with form of memory data base for storing subscriber data in the VLR data base; the mobile subscriber data stored in VLR data base is edited and visited. The method can fast store and visit subscriber data.
Description
Technical field
The present invention relates to a kind of method that mobile communication system VLR (Visitor Location Register, Visited Location Registor) user data is handled, relate in particular to a kind of method that realizes the processing of VLR user data by memory database.
Background technology
VLR is a pith in the mobile communication system, be responsible for store M SC (Moblie SwitchCenter, mobile switching centre) mobile subscriber's related data in the institute compass of competency comprises: parameters such as the location area information of Subscriber Number, travelling carriage, User Status and the obtainable service of user.VLR is dynamic subscriber's database, and user data can change owing to it moves and call out continuous the generation.Along with the development of mobile communication system, the mobile subscriber is also progressively increasing, and this just requires can quick storage and visit to the data among the VLR, thereby further improves the performance of system.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of method that the VLR user data is handled, and this method can be carried out the storage and the visit of user data apace, and has favorable expansibility.
To achieve these goals, the invention provides a kind of method that the VLR user data is handled, comprise the steps:
One VLR database that adopts OO design and design with the memory database form is set, is used for storage of subscriber data at described VLR database;
The mobile user data that is stored in the described VLR database is carried out editing and processing;
Mobile user data in the described VLR database is conducted interviews.
The above-mentioned method that the VLR user data is handled, wherein, the step that described VLR database is designed further comprises:
Design table object, index object and chain table object, described table object, be used to store the record group that comprises field information, have data dictionary and management accounts busy-idle record chained list, and writing down field information and the index handle that is established index about field information; Described index object is used for the length of recording indexes type, index field and index field; Described chain table object is used for discontinuous record on the memory space is stringed together with pointer, forms a chain;
Create table object example, chained list object instance and index object example.
The above-mentioned method that the VLR user data is handled wherein, in the step of creating the table object example, is at first created the data dictionary of table example, and according to the capacity allocation space of showing.
The above-mentioned method that the VLR user data is handled wherein, in the step of creating the chained list object instance, is created idle record chain table object example, and is its allocation space.
The above-mentioned method that the VLR user data is handled, wherein, in the step of creating the index object example, at first in index object, register the relevant information of index field, heavily loaded then hash chain allocation index method, and the space of distribution Hash table space and hash index bucket.
The above-mentioned method that the VLR user data is handled, wherein, described editing and processing process comprises: record of deletion from internal memory; Perhaps, revise in the internal memory certain field in a certain the record.
The above-mentioned method that the VLR user data is handled wherein, when one in needs deletions internal memory record, at first navigates to this and is recorded in position in the internal memory, and put deleted marker, then recording mechanism is inserted into the idle afterbody that writes down chained list; And after deletion record the further hash index of this record of deletion.
The above-mentioned method that the VLR user data is handled, wherein, when one of storage records in the internal memory, get an idle recording mechanism in the gauge outfit of the free time of this table record chained list earlier, leave recorded content in this position, and this record is made as effectively, idle record chain gauge outfit moves to the next position automatically.
The above-mentioned method that the VLR user data is handled wherein, navigates to the position that is recorded in the internal memory according to index key, according to the side-play amount of data dictionary calculated field, revises the value of field.
The above-mentioned method that the VLR user data is handled, wherein, in the step of carrying out data access, obtain Hash entry address table according to index key and hash function, the recording mechanism of storing in the first address according to the conflict formation of storage in the table of Hash entry address is located the record in the internal memory again, if relatively the index key that should write down is identical with given key value, then return relevant information, otherwise, continue to search the next queue element (QE) that the first address of conflict formation points to, compare again, up to the rear of queue of conflict formation.
The invention has the beneficial effects as follows: because mobile user data upgrades in VLR database frequently, adopt memory database and OO data managing method, can a certain user's data of fast access, and upgrade, thereby reach the purpose that improves systematic function.
Description of drawings
Fig. 1 is the flow chart that the present invention realizes the method for VLR storage of subscriber data and visit;
Fig. 2 is the hash chain allocation index hoist pennants in the data storage procedure of the present invention.
Embodiment
In Fig. 1, the present invention has disclosed the flow process of the method for a kind of VLR of realization storage of subscriber data and visit, and it comprises the steps:
Step S100, system design three objects, be respectively table object, index object and queue object.These objects have attribute and method separately.Table object is used to store the record group that comprises field information, has data dictionary and record chained list of busy not busy free time of management accounts about field information, and is writing down field information and the index handle that is established index; Relevant method comprises the operations such as insertion deletion to record.The length of index object recording indexes type, index field and index field; Relevant method comprises hash chain allocation index method.The chain table object is used for discontinuous record on the memory space is stringed together with pointer, forms a chain, on the one hand can efficent use of resources, can quicken the application process of resource on the other hand.
Step S200, each table in the database forms a table example when creating, and it inherits the attribute and the corresponding method of table object, and the heavy duty table distinctive method of example (step S300), such as inserting and delet method; Also form a chained list object instance simultaneously, this object instance is managed the not idle record of usefulness, makes things convenient for the user can apply for idle record fast; Also create an index object example (step S400) in addition, it inherits the attribute and the corresponding method of index object, and its distinctive method of heavy duty.
Step S500 according to the method for table example, just can carry out the visit of data.The visit of data is searched according to the indexing means of index key and index object example, just can obtain corresponding recorded content.
Be example further below, describe the storage and the access process of data in detail with a table example.Before storage and visit, at first need to carry out following two steps during system start-up:
The first, create table example and idle record chain table object example
In this step, at first create the data dictionary of table example, and according to the capacity allocation space of showing, the space size is that byte number is the capacity of tables of data and the product of record length.Next create idle record chain table object example, and allocation space for it, byte number is 4 times of capacity of tables of data, and the content of storage is idle recording mechanism.
The second, create the index object example
In this step, at first in the index object example, register the relevant information of index field, heavily loaded then hash chain allocation index method, and the space of distribution Hash table space and hash index bucket.
The 3rd, carry out the storage of data, storing step is as follows:
1, one of storage records in the internal memory
When one of needs storage records internal memory, at first get an idle recording mechanism in the gauge outfit of the free time of this table record chained list, leave recorded content in this position, and this record is changed to effectively, the gauge outfit of idle record chained list is automatically moved to the next position.For the convenience of later visit data, also need to insert the hash index of this record.The hash index table is a table of setting up index key and recording mechanism one-to-one relationship, sees Fig. 2.The left side of Fig. 2 is a Hash entry address table, and the number of element is N in the table, and N is the mould value, what deposit in the Hash entry address table is physical record number, the right-hand component of Fig. 2 is the Hash bucket, and the element number of Hash bucket is the capacity of table, and what deposit in the Hash bucket is physical record number.The conflict formation is to form like this, as shown in Figure 2, suppose that obtaining the Hash entry address by the keyword delivery is i, first element of depositing in the table of entry address is that recording mechanism is 1098 record, the record of next conflict is the physical record deposited on the 1098th the position in the Hash bucket number, if be 0, rear of queue has been arrived in expression.
The method for building up of hash index is as follows:
For an index key, suppose that mould is 1,000,000, at first obtain one 0～(1,000,000-1) Hash address Ni, find the first address Li of the conflict formation of storage in the Hash entry address table, this recording mechanism is deposited in the rear of queue of location headed by the Li by Ni by mould 1,000,000 hash algorithms.
2, record of deletion from internal memory
When one in needs deletions internal memory record, at first navigate to this and be recorded in position in the internal memory, and put deleted marker, then recording mechanism is inserted into the idle afterbody that writes down chained list.Also need to delete the hash index of this record after the deletion record.At first obtain the entry address of hash index table, in the table of entry address, find the address of the conflict formation at this record place again, in the conflict formation, this address is deleted according to index key.
3, revise in the internal memory certain field in a certain the record
Navigate to the position that is recorded in the internal memory according to index key,, revise the value of field, just finished the modification of field according to the side-play amount of data dictionary calculated field.
The 4th, carry out the data accessing.Access method is as follows:
Obtain Hash entry address table according to index key and hash function, the recording mechanism of storing in the first address according to the conflict formation of storage in the table of Hash entry address is located the record in the internal memory again, if relatively the index key that should write down is identical with given key value, then return relevant information, otherwise, continue to search the next queue element (QE) that the first address of conflict formation points to, compare again, up to the rear of queue of conflict formation.
Use method of the present invention, can store fast and the calling party data, can effectively improve the performance of mobile communication system.
The method that the present invention proposes is easy to expand to other embedded systems and uses in the equipment of memory database.Meaning of the present invention is the simple effectively storage and the fast access of VLR memory database, and has favorable expansibility.
Foregoing only is an optimum implementation of the present invention, and it is not to be used for limiting the specific embodiment of the present invention, and all modification and changes of carrying out according to the main inventive concept of this method all should belong to the desired protection range of claims of the present invention.
Claims (10)
1, a kind of method that the VLR user data is handled comprises the steps:
One VLR database that adopts OO design and design with the memory database form is set, is used for storage of subscriber data at described VLR database;
The mobile user data that is stored in the described VLR database is carried out editing and processing;
Mobile user data in the described VLR database is conducted interviews.
2, according to the described method that the VLR user data is handled of claim 1, it is characterized in that the step that described VLR database is designed further comprises:
Design table object, index object and chain table object, described table object, be used to store the record group that comprises field information, have data dictionary and management accounts busy-idle record chained list, and writing down field information and the index handle that is established index about field information; Described index object is used for the length of recording indexes type, index field and index field; Described chain table object is used for discontinuous record on the memory space is stringed together with pointer, forms a chain;
Create table object example, chained list object instance and index object example.
3, according to the described method that the VLR user data is handled of claim 2, it is characterized in that, in the step of creating the table object example, at first create the data dictionary of table example, and according to the capacity allocation space of showing.
4, according to the described method that the VLR user data is handled of claim 2, it is characterized in that, in the step of creating the chained list object instance, create idle record chain table object example, and be its allocation space.
5, according to the described method that the VLR user data is handled of claim 2, it is characterized in that, in the step of creating the index object example, at first in index object, register the relevant information of index field, heavily loaded then hash chain allocation index method, and the space of distribution Hash table space and hash index bucket.
6, according to claim 1,2,3, the 4 or 5 described methods that the VLR user data is handled, it is characterized in that described editing and processing process comprises: record of deletion from internal memory; In internal memory, insert a record; Perhaps, revise in the internal memory certain field in a certain the record.
7, according to the described method that the VLR user data is handled of claim 6, it is characterized in that, when one in needs deletions internal memory record, at first navigate to this and be recorded in position in the internal memory, and put deleted marker, then recording mechanism is inserted into the afterbody of idle record chained list; And after deletion record the further hash index of this record of deletion.
8, according to the described method that the VLR user data is handled of claim 6, it is characterized in that, when one of storage records in the internal memory, get an idle recording mechanism in the gauge outfit of the free time of this table record chained list earlier, leave recorded content in this position, and this record is made as effectively, idle record chain gauge outfit moves to the next position automatically.
9, according to the described method that the VLR user data is handled of claim 6, it is characterized in that, navigate to the position that is recorded in the internal memory,, revise the value of field according to the side-play amount of data dictionary calculated field according to index key.
10, according to the described method that the VLR user data is handled of claim 6, it is characterized in that, in the step of carrying out data access, obtain Hash entry address table according to index key and hash function, the recording mechanism of storing in the first address according to the conflict formation of storage in the table of Hash entry address is located the record in the internal memory again, if relatively the index key that should write down is identical with given key value, then return relevant information, otherwise, continue to search the next queue element (QE) that the first address of conflict formation points to, compare again, up to the rear of queue of conflict formation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410009161 CN1585553A (en) | 2004-05-31 | 2004-05-31 | Method for processing to VLR user data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410009161 CN1585553A (en) | 2004-05-31 | 2004-05-31 | Method for processing to VLR user data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1585553A true CN1585553A (en) | 2005-02-23 |
Family
ID=34600219
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200410009161 Pending CN1585553A (en) | 2004-05-31 | 2004-05-31 | Method for processing to VLR user data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1585553A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106980665A (en) * | 2017-03-21 | 2017-07-25 | 广东神马搜索科技有限公司 | Data dictionary implementation method, device and data dictionary management system |
-
2004
- 2004-05-31 CN CN 200410009161 patent/CN1585553A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106980665A (en) * | 2017-03-21 | 2017-07-25 | 广东神马搜索科技有限公司 | Data dictionary implementation method, device and data dictionary management system |
| CN106980665B (en) * | 2017-03-21 | 2020-06-12 | 广东神马搜索科技有限公司 | Data dictionary implementation method and device and data dictionary management system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106096023B (en) | Method for reading data, method for writing data and data server | |
| US6611898B1 (en) | Object-oriented cache management system and method | |
| US9047301B2 (en) | Method for optimizing the memory usage and performance of data deduplication storage systems | |
| CN101187901B (en) | High speed cache system and method for implementing file access | |
| CN100583832C (en) | Data management method and system | |
| CN1740978A (en) | Method for realing sharing internal stored data base and internal stored data base system | |
| CN111198856B (en) | File management method, device, computer equipment and storage medium | |
| WO2008084341A1 (en) | Database management methodology | |
| US20050076018A1 (en) | Sorting result buffer | |
| US11151081B1 (en) | Data tiering service with cold tier indexing | |
| CN100338607C (en) | Method for organizing and accessing distributive catalogue of document system | |
| CN1471327A (en) | Apparatus and method for managing storage of mobile communication terminal | |
| CN104598394A (en) | Data caching method and system capable of conducting dynamic distribution | |
| CN101042703A (en) | Method for managing metadata of file system using dbms | |
| CN102163232A (en) | SQL (Structured Query Language) interface implementing method supporting IEC61850 object query | |
| CN109690522A (en) | A kind of data-updating method, device and storage device based on B+ tree index | |
| CN100347705C (en) | Method for file merge | |
| CN1845093A (en) | Attribute extensible object file system | |
| US7310719B2 (en) | Memory management tile optimization | |
| WO2021016050A1 (en) | Multi-record index structure for key-value stores | |
| US20070260579A1 (en) | Method of designing query classification component for multilevel dbms | |
| US20180011897A1 (en) | Data processing method having structure of cache index specified to transaction in mobile environment dbms | |
| US7421446B1 (en) | Allocation of storage for a database | |
| CN1585553A (en) | Method for processing to VLR user data | |
| CN109213760B (en) | High-load service storage and retrieval method for non-relational data storage |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |