CN105528397A - Data access method and system, and computing device - Google Patents
Data access method and system, and computing device Download PDFInfo
- Publication number
- CN105528397A CN105528397A CN201510866883.9A CN201510866883A CN105528397A CN 105528397 A CN105528397 A CN 105528397A CN 201510866883 A CN201510866883 A CN 201510866883A CN 105528397 A CN105528397 A CN 105528397A
- Authority
- CN
- China
- Prior art keywords
- value
- data
- individual
- layer data
- database table
- 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
- 238000000034 method Methods 0.000 title claims abstract description 85
- 241001269238 Data Species 0.000 claims description 49
- 230000008569 process Effects 0.000 claims description 33
- 238000012545 processing Methods 0.000 claims description 30
- 238000012163 sequencing technique Methods 0.000 claims description 7
- 238000010586 diagram Methods 0.000 description 19
- 238000004891 communication Methods 0.000 description 11
- 230000015654 memory Effects 0.000 description 7
- 230000006870 function Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000002093 peripheral effect Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000013316 zoning Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention discloses a data access method and system, and a computing device. The data access method is executed in the computing device, and is suitable for accessing a plurality of hierarchical data having hierarchical relationship, each hierarchical data having any number of lower data and no more than one upper data. The method comprises the steps of pre-establishing a database table including the following fields including data ID, hierarchy, left side ID, right side ID and data name; and accessing the hierarchical data by using the established database table, wherein for any one of the hierarchical data stored in the database table, the hierarchy value of the hierarchical data is equal to the hierarchy value of the upper data of the hierarchical data plus 1, a left side ID value of the hierarchical data is less than a right side ID value of the hierarchical data, the left side ID value of the hierarchical data is greater than a left ID value of the upper data of the hierarchical data, the right side ID value of the hierarchical data is less than a right side ID value of the upper data of the hierarchical data, and for the plurality of lower data corresponding to the same upper data, left side ID values and right side ID values of the lower data are increased progressively according to the storage time sequence of the lower data in the database table.
Description
Technical field
The present invention relates to computer application field, particularly a kind of data access method, system and computing equipment.
Background technology
Increasingly extensive and deep along with computer utility, technology development relevant to database in computer network and progress.Data due to database purchase store in planar fashion, is all generally to utilize recursive algorithm to represent hierarchical data.Recursive algorithm refers to the inside at function or subprocess, calls the algorithm of oneself directly or indirectly.When all low level data under a certain data will be obtained, need to classify from most top-level categories to the bottom successively point by point scanning, until each data are whole scannedly just can calculate required result.
If the level of data is comparatively dark, then use the number of times of recurrence can be considerable.And, in the process of recursive call, computer system can open up stack to store for the reentry point, local variable etc. of every one deck, if recurrence number of times is crossed easily cause stack overflow etc. at most, waste storage space, cause data redundancy, occupy the comparatively multiple resource of system, even cause system not have enough internal memories cannot calculate data needed for acquisition, operational efficiency is lower.
Summary of the invention
For this reason, the invention provides a kind of scheme of data access, to try hard to solve or at least alleviate Problems existing above.
According to an aspect of the present invention, a kind of data access method is provided, perform in computing equipment, be suitable for carrying out access process to multiple individual-layer datas with hierarchical relationship, wherein each individual-layer data has any number of lower data and a maximum upper layer data.First the method comprises the steps:, sets up a database table in advance, and this database table comprises following field: data ID, level, left side ID, right side ID and data name; The database table set up is utilized to carry out access process to individual-layer data, wherein for any individual-layer data stored in database table, its hierarchical value is that the hierarchical value of its upper layer data adds 1, left side ID value is less than right side ID value, left side ID value is greater than the left side ID value of its upper layer data, right side ID value is less than the right side ID value of its upper layer data, and for multiple lower data of same upper layer data, the time sequencing that on the left of it, ID value and right side ID value all store at database table according to lower data increases progressively.
Alternatively, in data access method according to the present invention, access process is carried out to individual-layer data and comprises newly-increased process, delete processing and query processing.
Alternatively, in data access method according to the present invention, newly-increased process is carried out to individual-layer data and comprises: the data name of newly-increased individual-layer data and the data ID value of its upper layer data that obtain input; If the data ID value of the upper layer data of newly-increased individual-layer data is 0, then obtains maximum right side ID value in database table and add 1 as the right side ID value increasing individual-layer data newly, and the hierarchical value of newly-increased individual-layer data is set to 1; If the data ID value of the upper layer data of newly-increased individual-layer data is not 0, from database table, then obtain the right side ID value of right side ID value as newly-increased individual-layer data of the upper layer data of this newly-increased individual-layer data, the hierarchical value obtaining the upper layer data of this newly-increased individual-layer data from database table adds 1 as the hierarchical value increasing individual-layer data newly; Right side ID value in database table is not less than the right side ID value increase by 2 of all individual-layer datas of the right side ID value of newly-increased individual-layer data, left side ID value in database table is greater than the left side ID value increase by 2 of all individual-layer datas of the right side ID value of newly-increased individual-layer data; Obtain the left side ID value of right side ID value as newly-increased individual-layer data of newly-increased individual-layer data, and by the right side ID value increase by 1 of newly-increased individual-layer data; Finally, newly-increased individual-layer data is inserted in database table.
Alternatively, in data access method according to the present invention, delete processing is carried out to individual-layer data and comprises: the data ID value obtaining the deleted individual-layer data of input; From database table, obtain left side ID value and the right side ID value of deleted individual-layer data, and on the left of right side ID value being subtracted, ID value adds 1 again as the first difference; The all individual-layer datas of delete database table middle left and right side ID value between the left and right side ID value of deleted individual-layer data; The right side ID value that right side ID value in database table is greater than all individual-layer datas of the right side ID value of deleted individual-layer data is deducted the first difference, and left side ID value left side ID value being greater than all individual-layer datas of the right side ID value of deleted individual-layer data deducts the first difference.
Alternatively, in data access method according to the present invention, query processing is carried out to individual-layer data and comprises: the data ID value obtaining the individual-layer data to be checked of input; The left and right side ID value of individual-layer data to be checked is obtained from database table; From database table, obtain the individual-layer data of left and right side ID value between the left and right side ID value of individual-layer data to be checked, the individual-layer data obtained is all low level data of individual-layer data to be checked.
Alternatively, in data access method according to the present invention, query processing is carried out to individual-layer data and comprises: the data ID value and the level that obtain the individual-layer data to be checked of input are poor; Left and right side ID value and the hierarchical value of individual-layer data to be checked is obtained from database table; From database table, obtain left and right side ID value between the left and right side ID value of individual-layer data to be checked and the difference of the hierarchical value of hierarchical value and individual-layer data to be checked is not more than the individual-layer data of the level difference of input, accessed individual-layer data is all low level data being not more than the level difference of input with its level difference of individual-layer data to be checked.
Alternatively, in data access method according to the present invention, carry out query processing to individual-layer data to comprise: obtain from database table left side ID value for right side ID value subtract 1 individual-layer data, the individual-layer data obtained is all individual-layer datas without lower data to be checked.
According to a further aspect of the invention, provide a kind of data access arrangement, be suitable for residing in computing equipment.This system comprises database table and sets up module and access processing module.Database table sets up module, is suitable for setting up a database table in advance, and this database table comprises following field: data ID, level, left side ID, right side ID and data name.Access processing module, be suitable for utilizing the database table set up to carry out access process to individual-layer data, wherein for any individual-layer data stored in database table, its hierarchical value is that the hierarchical value of its upper layer data adds 1, left side ID value is less than right side ID value, left side ID value is greater than the left side ID value of its upper layer data, right side ID value is less than the right side ID value of its upper layer data, and for multiple lower data of same upper layer data, the time sequencing that on the left of it, ID value and right side ID value all store at database table according to lower data increases progressively.
Alternatively, in data access arrangement according to the present invention, access processing module comprises newly-increased submodule, deletes submodule and inquiry submodule.
Alternatively, in data access arrangement according to the present invention, newly-increased submodule is further adapted for the data name of newly-increased individual-layer data and the data ID value of its upper layer data that obtain input; If the data ID value of the upper layer data of newly-increased individual-layer data is 0, then obtains maximum right side ID value in database table and add 1 as the right side ID value increasing individual-layer data newly, and the hierarchical value of newly-increased individual-layer data is set to 1; If the data ID value of the upper layer data of newly-increased individual-layer data is not 0, from database table, then obtain the right side ID value of right side ID value as newly-increased individual-layer data of the upper layer data of this newly-increased individual-layer data, the hierarchical value obtaining the upper layer data of this newly-increased individual-layer data from database table adds 1 as the hierarchical value increasing individual-layer data newly; Right side ID value in database table is not less than the right side ID value increase by 2 of all individual-layer datas of the right side ID value of newly-increased individual-layer data, left side ID value in database table is greater than the left side ID value increase by 2 of all individual-layer datas of the right side ID value of newly-increased individual-layer data; Obtain the left side ID value of right side ID value as newly-increased individual-layer data of newly-increased individual-layer data, and by the right side ID value increase by 1 of newly-increased individual-layer data; Finally, newly-increased individual-layer data is inserted in database table.
Alternatively, in data access arrangement according to the present invention, delete the data ID value that submodule is further adapted for the deleted individual-layer data obtaining input; From database table, obtain left side ID value and the right side ID value of deleted individual-layer data, and on the left of right side ID value being subtracted, ID value adds 1 again as the first difference; The all individual-layer datas of delete database table middle left and right side ID value between the left and right side ID value of deleted individual-layer data; The right side ID value that right side ID value in database table is greater than all individual-layer datas of the right side ID value of deleted individual-layer data is deducted the first difference, and left side ID value left side ID value being greater than all individual-layer datas of the right side ID value of deleted individual-layer data deducts the first difference.
Alternatively, in data access arrangement according to the present invention, inquiry submodule is further adapted for the data ID value of the individual-layer data to be checked obtaining input; The left and right side ID value of individual-layer data to be checked is obtained from database table; From database table, obtain the individual-layer data of left and right side ID value between the left and right side ID value of individual-layer data to be checked, the individual-layer data obtained is all low level data of individual-layer data to be checked.
Alternatively, in data access arrangement according to the present invention, inquiry submodule be further adapted for the data ID value of individual-layer data to be checked that obtains input and level poor; Left and right side ID value and the hierarchical value of individual-layer data to be checked is obtained from database table; From database table, obtain left and right side ID value between the left and right side ID value of individual-layer data to be checked and the difference of the hierarchical value of hierarchical value and individual-layer data to be checked is not more than the individual-layer data of the level difference of input, accessed individual-layer data is all low level data being not more than the level difference of input with its level difference of individual-layer data to be checked.
Alternatively, in data access arrangement according to the present invention, inquiry submodule be further adapted for obtain from database table left side ID value for right side ID value subtract 1 individual-layer data, the individual-layer data obtained is all individual-layer datas without lower data to be checked.
According to a further aspect of the invention, also provide a kind of computing equipment, comprise according to data access arrangement of the present invention.
According to the technical scheme of data access of the present invention, data ID is comprised by setting up, level, left side ID, the database table of right side ID and the above-mentioned field of data name, access process is carried out to multiple individual-layer datas with hierarchical relationship, according to hierarchical value, left side ID value and right side ID value just can determine the hierarchical relationship between each individual-layer data, make the relation between data more directly perceived, the individual-layer data inquiry realized based on this data access method has very big raising than the inquiry of recursive fashion in performance, especially the situation that the comparatively dark and data variation large data infrequently of level store is applicable to.
Accompanying drawing explanation
In order to realize above-mentioned and relevant object; combine description below and accompanying drawing herein to describe some illustrative aspect; these aspects indicate the various modes can putting into practice principle disclosed herein, and all aspects and equivalent aspect thereof are intended to fall in the scope of theme required for protection.Read detailed description below in conjunction with the drawings, above-mentioned and other object of the present disclosure, Characteristics and advantages will become more obvious.Throughout the disclosure, identical Reference numeral is often referred to for identical parts or element.
Fig. 1 is the block diagram according to Example Computing Device 100 of the present invention;
Fig. 2 shows the illustraton of model of individual-layer data in data access method according to an embodiment of the invention;
Fig. 3 shows hierarchical data structure schematic diagram in data access method according to an embodiment of the invention;
Fig. 4 shows individual-layer data in data access method according to an embodiment of the invention and increases the process flow diagram of process 200 newly;
Fig. 5 shows the hierarchical data structure schematic diagram in data access method according to an embodiment of the invention after newly-increased individual-layer data;
Fig. 6 shows the hierarchical data structure schematic diagram in data access method according to an embodiment of the invention after another newly-increased individual-layer data;
Fig. 7 shows the process flow diagram of individual-layer data delete processing 300 in data access method according to an embodiment of the invention;
Fig. 8 shows in data access method according to an embodiment of the invention hierarchical data structure schematic diagram after deleting individual-layer data;
Fig. 9 shows the process flow diagram of individual-layer data query processing 400 in data access method according to an embodiment of the invention; And
Figure 10 shows data access arrangement 500 schematic diagram according to an embodiment of the invention.
Embodiment
Below with reference to accompanying drawings exemplary embodiment of the present disclosure is described in more detail.Although show exemplary embodiment of the present disclosure in accompanying drawing, however should be appreciated that can realize the disclosure in a variety of manners and not should limit by the embodiment set forth here.On the contrary, provide these embodiments to be in order to more thoroughly the disclosure can be understood, and complete for the scope of the present disclosure can be conveyed to those skilled in the art.
Fig. 1 is the block diagram of Example Computing Device 100.In basic configuration 102, computing equipment 100 typically comprises system storage 106 and one or more processor 104.Memory bus 108 may be used for the communication between processor 104 and system storage 106.
Depend on the configuration of expectation, processor 104 can be the process of any type, includes but not limited to: microprocessor ((μ P), microcontroller (μ C), digital information processor (DSP) or their any combination.Processor 104 can comprise the high-speed cache of one or more rank of such as on-chip cache 110 and second level cache 112 and so on, processor core 114 and register 116.The processor core 114 of example can comprise arithmetic and logical unit (ALU), floating-point unit (FPU), digital signal processing core (DSP core) or their any combination.The Memory Controller 118 of example can use together with processor 104, or in some implementations, Memory Controller 118 can be an interior section of processor 104.
Depend on the configuration of expectation, system storage 106 can be the storer of any type, includes but not limited to: volatile memory (such as RAM), nonvolatile memory (such as ROM, flash memory etc.) or their any combination.System storage 106 can comprise operating system 120, one or more application 122 and routine data 124.In some embodiments, application 122 can be arranged as and utilize routine data 124 to operate on an operating system.
Computing equipment 100 can also comprise the interface bus 140 communicated contributed to from various interfacing equipment (such as, output device 142, Peripheral Interface 144 and communication facilities 146) to basic configuration 102 via bus/interface controller 130.The output device 142 of example comprises Graphics Processing Unit 148 and audio treatment unit 150.They can be configured to contribute to communicating with the various external units of such as display or loudspeaker and so on via one or more A/V port one 52.Example Peripheral Interface 144 can comprise serial interface controller 154 and parallel interface controller 156, they can be configured to the external unit contributed to via one or more I/O port one 58 and such as input equipment (such as, keyboard, mouse, pen, voice-input device, touch input device) or other peripheral hardwares (such as printer, scanner etc.) and so on and communicate.The communication facilities 146 of example can comprise network controller 160, and it can be arranged to is convenient to via one or more communication port 164 and the communication of one or more other computing equipments 162 by network communication link.
Network communication link can be an example of communication media.Communication media can be presented as computer-readable instruction, data structure, program module in the modulated data signal of such as carrier wave or other transmission mechanisms and so on usually, and can comprise any information delivery media." modulated data signal " can be such signal, the change of one or more or it of its data centralization can the mode of coded message in the signal be carried out.As nonrestrictive example, communication media can comprise the wire medium of such as cable network or private line network and so on, and such as sound, radio frequency (RF), microwave, infrared (IR) or other wireless medium are at interior various wireless mediums.Term computer-readable medium used herein can comprise both storage medium and communication media.
Computing equipment 100 can be implemented as a part for small size portable (or mobile) electronic equipment, and these electronic equipments can be such as cell phone, personal digital assistant (PDA), personal media player equipment, wireless network browsing apparatus, individual helmet, application specific equipment or the mixing apparatus that can comprise any function above.Computing equipment 100 can also be embodied as the personal computer comprising desktop computer and notebook computer configuration.In certain embodiments, computing equipment 100 is configured to perform according to data access method of the present invention.Application 122 comprises according to data access arrangement 500 of the present invention.
The method of data access is suitable for performing in computing equipment (computing equipment 100 such as shown in Fig. 1), and the method comprises sets up a database table in advance, comprising these five fields of data ID, level, left side ID, right side ID and data name; The database table set up is utilized to carry out access process to individual-layer data, wherein for any individual-layer data stored in database table, its hierarchical value is that the hierarchical value of its upper layer data adds 1, left side ID value is less than right side ID value, left side ID value is greater than the left side ID value of its upper layer data, right side ID value is less than the right side ID value of its upper layer data, and for multiple lower data of same upper layer data, the time sequencing that on the left of it, ID value and right side ID value all store at database table according to lower data increases progressively.
In embodiments of the present invention, the upper layer data of individual-layer data refers to the individual-layer data that the last layer of this individual-layer data is secondary; The lower data of individual-layer data refers to the individual-layer data of next level of this individual-layer data; The low level data of individual-layer data comprises the lower data of individual-layer data, the lower data again of lower data, by that analogy, until orlop data.
Fig. 2 shows the illustraton of model of individual-layer data in data access method according to an embodiment of the invention.In the present embodiment, the individual-layer data stored in database table comprises above-mentioned five fields of data ID, level, left side ID, right side ID and data name, specifically see Fig. 2.
Fig. 3 shows hierarchical data structure schematic diagram in data access method according to an embodiment of the invention.In the present embodiment, it is that the hierarchical value of its upper layer data adds 1 that all individual-layer datas all meet its hierarchical value, left side ID value is less than right side ID value, left side ID value is greater than the left side ID value of its upper layer data, right side ID value is less than the right side ID value of its upper layer data, and for multiple lower data of same upper layer data, the time sequencing that the left side ID value of these lower data and right side ID value all store at database table according to each lower data increases progressively.
Hierarchical data structure schematic diagram as shown in Figure 3, displaying be the Bedding storage of state administration zoning.The individual-layer data of most top layer is China, and its data ID value is 1, and hierarchical value is 1, and left side ID value is 1, and right side ID value is 2, and data name is Chinese, and its lower data has 3, and hierarchical value is 2.For ease of describing, all refer to corresponding individual-layer data with data name below.3 lower data of China are data ID value is respectively 2, and left side ID value is 2, and right side ID value is Beijing of 7, data ID value is 5, and left side ID value is 8, right side ID value be 17 Shanxi Province and data ID value be 10, left side ID value is 18, and right side ID value is the Shanghai City of 21.Beijing municipalization 2 lower data, hierarchical value is 3, be data ID value is respectively 3, and left side ID value is 3, right side ID value be 4 Dongcheng District and data ID value be 4, left side ID value is 5, and right side ID value is the Xicheng District of 6.There are 2 lower data Shanxi Province, and hierarchical value is 3, be data ID value is respectively 6, and left side ID value is 9, right side ID value be 10 Taiyuan City and data ID value be 7, left side ID value is 11, and right side ID value is the Yuncheng of 16.Wherein, Yuncheng municipalization 2 lower data, hierarchical value is 4, be data ID value be respectively 8, left side ID value is 12, right side ID value be 13 and data ID value be 9, left side ID value is 14, right side ID value is the Jishan County of 15, and Taiyuan City, Yuncheng, Yanhu District and Jishan County are all low level data of Shanxi Province.Municipalization 1 lower data in Shanghai is hierarchical value is 3, and data ID value is 11, and left side ID value is 19, and right side ID value is the Luwan District of 20.
Utilize the database table set up to carry out access process to individual-layer data and comprise newly-increased process, delete processing and query processing, data access process in the present embodiment all with the hierarchical data structure shown in Fig. 3 for benchmark, and for ease of describing, the left side ID value of individual-layer data pending in data access method represented with LID, right side ID value represents with RID.
Fig. 4 shows individual-layer data in data access method according to an embodiment of the invention and increases the process flow diagram of process 200 newly, and wherein LID is the left side ID value of newly-increased individual-layer data, and RID is the right side ID value of newly-increased individual-layer data.Method 200 starts from step S210.In step S210, first obtain the data name of the newly-increased individual-layer data of input and the data ID value of its upper layer data.The data name of the newly-increased individual-layer data inputted in the present embodiment is Wenxi County, and the data ID value of its upper layer data is 7.
Subsequently in step S220, be whether the judgement of 0 to the data ID value of the upper layer data of the Wenxi County obtained in step S210.If the data ID value of upper layer data is 0, then represent that this upper layer data is the individual-layer data of the superiors; Otherwise represent the individual-layer data of this upper layer data Bu Shi the superiors, this upper layer data also has the individual-layer data of more last layer.The data ID value of the upper layer data of Wenxi County is 7, is not 0, then RID is the right side ID value 16 of its upper layer data, and hierarchical value is that the hierarchical value of its upper layer data adds 1, is 4.In step S230, right side ID value is not less than RID, is namely not less than the right side ID value increase by 2 of all individual-layer datas of 16, and left side ID value is greater than RID, be namely greater than the left side ID value increase by 2 of all individual-layer datas of 16.The right side ID value of China, Shanxi Province, Yuncheng, Shanghai City and Luwan District is all not less than 16, and after therefore respectively increasing by 2, the right side ID value of China is 24, the right side ID value of Shanxi Province is 19, the right side ID value of Yuncheng is 18, and the right side ID value in Shanghai City is 23, and the right side ID value of Luwan District is 22.The left side ID value of Shanghai City and Luwan District is all greater than 16, and after therefore respectively increasing by 2, the left side ID value in Shanghai City is 20, and the left side ID value of Luwan District is 21.
In step S240 afterwards, renewal LID is RID, and namely LID is 16, and upgrading RID is that RID adds 1, and namely RID is 17.Finally, in step s 250 Wenxi County is inserted in database table.Fig. 5 shows the hierarchical data structure schematic diagram behind newly-increased individual-layer data Wenxi County, and wherein the data ID value 12 of Wenxi County inserts the ident value of the up-to-date generation that database table returns successfully.
To be more than the data ID value of the upper layer data of newly-increased individual-layer data be not 0 situation, the situation being 0 by the data ID value of the upper layer data to newly-increased individual-layer data is below described.Equally, in step S210, first obtain the data name of the newly-increased individual-layer data of input and the data ID value of its upper layer data, the data name of the newly-increased individual-layer data of input is the U.S., and the data ID value of its upper layer data is 0.
Whether subsequently in step S220, be the judgement of 0 to the data ID value of the upper layer data of the U.S. obtained in step S210, the data ID value of the upper layer data of the U.S. is 0, then RID is that right side ID value maximum in database table adds 1, and be 23, hierarchical value is 1.In step S230, right side ID value is not less than RID, is namely not less than the right side ID value increase by 2 of all individual-layer datas of 23, and left side ID value is greater than RID, be namely greater than the left side ID value increase by 2 of all individual-layer datas of 23.What do not meet above-mentioned condition in database table is divided into data, and therefore directly perform step S240, renewal LID is RID, and namely LID is 23, and upgrading RID is that RID adds 1, and namely RID is 24.Finally, in step s 250 the U.S. is inserted in database table.Fig. 6 shows the hierarchical data structure schematic diagram after the newly-increased individual-layer data U.S., and wherein the data ID value 12 of the U.S. inserts the ident value of the up-to-date generation that database table returns successfully.
The code sample that computing equipment increases individual-layer data newly is as follows:
Fig. 7 shows the process flow diagram of individual-layer data delete processing 300 in data access method according to an embodiment of the invention, and wherein LID is the left side ID value of deleted individual-layer data, and RID is the right side ID value of deleted individual-layer data.Method 300 starts from step S310.In step S310, first obtain the data ID value of the deleted individual-layer data of input.The data ID value of the deleted individual-layer data inputted in the present embodiment is 7.Subsequently in step s 320, from database table, obtain LID be 11, RID, and to be the 16, first difference be that RID subtracts LID adds 1 again, is 6.In step S330, by database table middle left and right side ID value between LID and RID, namely left side ID value is less than LID and all individual-layer datas that right side ID value is not more than RID are all deleted, that is delete left side ID value be not less than 11 and right side ID value be not more than 16 all individual-layer datas, then these three individual-layer datas of Yuncheng, Yanhu District and Jishan County are deleted.Finally, in step S340, the right side ID value that right side ID value in database table is greater than all individual-layer datas of RID is deducted the first difference, and all ID values left side ID value being greater than all individual-layer datas of RID deduct the first difference.The right side ID value of China, Shanxi Province, Shanghai City and Luwan District is greater than 16, therefore respectively deducts 6, then the right side ID value of China is 16, and the right side ID value of Shanxi Province is 11, and the right side ID value in Shanghai City is 15, and the right side ID value of Luwan District is 14.The left side ID value of Shanghai City and Luwan District is all greater than 16, therefore respectively deducts 6, then the left side ID value in Shanghai City is 12, and the left side ID value of Luwan District is 13.Fig. 8 shows the hierarchical data structure schematic diagram after deleting individual-layer data Yuncheng.
The code sample that computing equipment deletes individual-layer data is as follows:
With the hierarchical data structure of example in Fig. 3 for benchmark carries out query processing to database table.When individual-layer data query processing, LID represents the left side ID value of individual-layer data to be checked, and RID represents the right side ID value of individual-layer data to be checked.When all low level data of a certain individual-layer data of input will be inquired about, first obtain the data ID value of this individual-layer data.In the present embodiment, the data ID value of individual-layer data to be checked is 5.According to this data ID value, from database table, obtain LID and RID, data ID value is the LID of the individual-layer data of 5 be 8, RID is 17.Left and right side ID value individual-layer data of (left side ID value is greater than LID and right side ID value is less than RID) between LID and RID is obtained from database table, the individual-layer data obtained is all low level data (not comprising individual-layer data to be checked itself) of individual-layer data to be checked, namely obtain left side ID and be greater than 8 and the right side ID value individual-layer data that is less than 17, then these four individual-layer datas of the Taiyuan City obtained, Yuncheng, Yanhu District and Jishan County are all low level data of individual-layer data Shanxi Province to be checked.
Fig. 9 shows the process flow diagram of individual-layer data query processing 400 in data access method according to an embodiment of the invention.Method 400 starts from step S410.First, the data ID value and the level that obtain the individual-layer data to be checked of input are poor.In the present embodiment, the data ID value of individual-layer data to be checked is 5, and level difference is 1.Subsequently in the step s 420, from database table, obtain LID be 8, RID is 17, and the hierarchical value of individual-layer data to be checked is 2.Finally, from database table, left and right side ID value (left side ID value is greater than LID and right side ID value is less than RID) between LID and RID is obtained in step S430, namely left side ID is greater than 8 and right side ID value is less than 17 and the difference of the hierarchical value of hierarchical value and the individual-layer data to be checked level that is not more than input is poor, is namely not more than the individual-layer data of 1.Taiyuan City and these two individual-layer datas of Yuncheng meet the condition in step S430, be data Shanxi Province to be checked with the difference of its hierarchical value be not more than 1 all low level data (not comprising individual-layer data to be checked itself).
The code sample of computing equipment inquiry individual-layer data is as follows:
When wanting all individual-layer datas without lower data in Query Database table, only need obtain LID from database table is the individual-layer data that RID subtracts 1.The left side ID value of Dongcheng District, Xicheng District, Yanhu District, Jishan County and Luwan District subtracts 1 for right side ID value, and meeting above-mentioned condition, is all individual-layer datas not having lower data in database table.Correspond in state administration zoning, above-mentioned five individual-layer datas correspond to the administrative district of all minimal level.
Figure 10 shows data access arrangement 500 schematic diagram according to an embodiment of the invention.This system comprises database table and sets up module 510 and access processing module 520, and wherein tables of data is set up module 510 and is suitable for setting up a database table in advance, and this database table comprises following field: data ID, level, left side ID, right side ID and data name; Access processing module 520 is suitable for utilizing the database table set up to carry out access process to individual-layer data, for any individual-layer data stored in database table, its hierarchical value is that the hierarchical value of its upper layer data adds 1, left side ID value is less than right side ID value, left side ID value is greater than the left side ID value of its upper layer data, right side ID value is less than the right side ID value of its upper layer data, and for multiple lower data of same upper layer data, the time sequencing that on the left of it, ID value and right side ID value all store at database table according to lower data increases progressively.
Access processing module 520 comprises newly-increased submodule 521, deletes submodule 522 and inquiry submodule 523.Newly-increased submodule 521 is further adapted for the data name of newly-increased individual-layer data and the data ID value of its upper layer data that obtain input; If the data ID value of the upper layer data of newly-increased individual-layer data is 0, then obtains maximum right side ID value in database table and add 1 as the right side ID value increasing individual-layer data newly, and the hierarchical value of newly-increased individual-layer data is set to 1; If the data ID value of the upper layer data of newly-increased individual-layer data is not 0, from database table, then obtain the right side ID value of right side ID value as newly-increased individual-layer data of the upper layer data of this newly-increased individual-layer data, the hierarchical value obtaining the upper layer data of this newly-increased individual-layer data from database table adds 1 as the hierarchical value increasing individual-layer data newly; Right side ID value in database table is not less than the right side ID value increase by 2 of all individual-layer datas of the right side ID value of newly-increased individual-layer data, left side ID value in database table is greater than the left side ID value increase by 2 of all individual-layer datas of the right side ID value of newly-increased individual-layer data; Obtain the left side ID value of right side ID value as newly-increased individual-layer data of newly-increased individual-layer data, and by the right side ID value increase by 1 of newly-increased individual-layer data; Finally, newly-increased individual-layer data is inserted in database table.
Delete the data ID value that submodule 522 is further adapted for the deleted individual-layer data obtaining input; From database table, obtain left side ID value and the right side ID value of deleted individual-layer data, and on the left of right side ID value being subtracted, ID value adds 1 again as the first difference; The all individual-layer datas of delete database table middle left and right side ID value between the left and right side ID value of deleted individual-layer data; The right side ID value that right side ID value in database table is greater than all individual-layer datas of the right side ID value of deleted individual-layer data is deducted the first difference, and left side ID value left side ID value being greater than all individual-layer datas of the right side ID value of deleted individual-layer data deducts the first difference.
Inquiry submodule 523 is further adapted for the data ID value of the individual-layer data to be checked obtaining input; The left and right side ID value of individual-layer data to be checked is obtained from database table; From database table, obtain the individual-layer data of left and right side ID value between the left and right side ID value of individual-layer data to be checked, the individual-layer data obtained is all low level data of individual-layer data to be checked.
Inquiry submodule 523 be further adapted for the data ID value of individual-layer data to be checked that obtains input and level poor; Left and right side ID value and the hierarchical value of individual-layer data to be checked is obtained from database table; From database table, obtain left and right side ID value between the left and right side ID value of individual-layer data to be checked and the difference of the hierarchical value of hierarchical value and individual-layer data to be checked is not more than the individual-layer data of the level difference of input, accessed individual-layer data is all low level data being not more than the level difference of input with its level difference of individual-layer data to be checked.
Inquiry submodule 523 be further adapted for obtain from database table left side ID value for right side ID value subtract 1 individual-layer data, the individual-layer data obtained is all individual-layer datas without lower data to be checked.
About concrete steps and the embodiment of individual-layer data access in data access arrangement, open in detail in based on the description of Fig. 2 ~ 9, repeat no more herein.
In the prior art, for characterizing the hierarchical relationship between individual-layer data, need in individual-layer data, arrange the field being similar to pointer that is pointed to upper layer data, like this, carry out the access process of individual-layer data, such as, when inquiring about all low level data of certain individual-layer data, need to carry out recursive call.According to the individual-layer data access plan of the embodiment of the present invention, by setting up the database table comprising data ID, level, left side ID, right side ID and the above-mentioned field of data name, access process is carried out to multiple individual-layer datas with hierarchical relationship, the hierarchical relationship between each individual-layer data just can be determined according to hierarchical value, left side ID value and right side ID value, when the access process carrying out individual-layer data, only need the left side ID value of more each individual-layer data and the size of right side ID value just can complete, in performance, have very big raising than the inquiry of recursive fashion.
B10. the system as described in B9, described newly-increased submodule is further adapted for: the data name of newly-increased individual-layer data and the data ID value of its upper layer data that obtain input; If the data ID value of the upper layer data of newly-increased individual-layer data is 0, then obtains maximum right side ID value in database table and add 1 as the right side ID value increasing individual-layer data newly, and the hierarchical value of newly-increased individual-layer data is set to 1; If the data ID value of the upper layer data of newly-increased individual-layer data is not 0, from database table, then obtain the right side ID value of right side ID value as newly-increased individual-layer data of the upper layer data of this newly-increased individual-layer data, the hierarchical value obtaining the upper layer data of this newly-increased individual-layer data from database table adds 1 as the hierarchical value increasing individual-layer data newly; Right side ID value in database table is not less than the right side ID value increase by 2 of all individual-layer datas of the right side ID value of described newly-increased individual-layer data, and left side ID value in database table is greater than the left side ID value increase by 2 of all individual-layer datas of the right side ID value of described newly-increased individual-layer data; Obtain the left side ID value of right side ID value as newly-increased individual-layer data of described newly-increased individual-layer data, and by the right side ID value increase by 1 of newly-increased individual-layer data; Newly-increased individual-layer data is inserted in database table.
B11. the system as described in B9, described deletion submodule is further adapted for: the data ID value obtaining the deleted individual-layer data of input; From database table, obtain left side ID value and the right side ID value of deleted individual-layer data, and on the left of right side ID value being subtracted, ID value adds 1 again as the first difference; The all individual-layer datas of delete database table middle left and right side ID value between the left and right side ID value of deleted individual-layer data; The right side ID value that right side ID value in database table is greater than all individual-layer datas of the right side ID value of deleted individual-layer data is deducted described first difference, and left side ID value left side ID value being greater than all individual-layer datas of the right side ID value of deleted individual-layer data deducts described first difference.
B12. the system as described in B9, described inquiry submodule is further adapted for: the data ID value obtaining the individual-layer data to be checked of input; The left and right side ID value of individual-layer data to be checked is obtained from database table; From database table, obtain the individual-layer data of left and right side ID value between the left and right side ID value of individual-layer data to be checked, the individual-layer data obtained is all low level data of individual-layer data to be checked.
B13. the system as described in B9, described inquiry submodule is further adapted for: the data ID value and the level that obtain the individual-layer data to be checked of input are poor; Left and right side ID value and the hierarchical value of individual-layer data to be checked is obtained from database table; From database table, obtain left and right side ID value between the left and right side ID value of individual-layer data to be checked and the difference of the hierarchical value of hierarchical value and individual-layer data to be checked is not more than the individual-layer data of the level difference of input, accessed individual-layer data is all low level data being not more than the level difference of input with its level difference of individual-layer data to be checked.
B14. the system as described in B9, described inquiry submodule is further adapted for: obtain from database table left side ID value for right side ID value subtract 1 individual-layer data, the individual-layer data obtained is all individual-layer datas without lower data to be checked.
In instructions provided herein, describe a large amount of detail.But can understand, embodiments of the invention can be put into practice when not having these details.In some instances, be not shown specifically known method, structure and technology, so that not fuzzy understanding of this description.
Similarly, be to be understood that, in order to simplify the disclosure and to help to understand in each inventive aspect one or more, in the description above to exemplary embodiment of the present invention, each feature of the present invention is grouped together in single embodiment, figure or the description to it sometimes.But, the method for the disclosure should be construed to the following intention of reflection: namely the present invention for required protection requires than the feature more multiple features clearly recorded in each claim.Or rather, as claims below reflect, all features of disclosed single embodiment before inventive aspect is to be less than.Therefore, the claims following embodiment are incorporated to this embodiment thus clearly, and wherein each claim itself is as independent embodiment of the present invention.
Those skilled in the art are to be understood that the module of the equipment in example disclosed herein or unit or assembly can be arranged in equipment as depicted in this embodiment, or alternatively can be positioned in one or more equipment different from the equipment in this example.Module in aforementioned exemplary can be combined as a module or can be divided into multiple submodule in addition.
Those skilled in the art are appreciated that and adaptively can change the module in the equipment in embodiment and they are arranged in one or more equipment different from this embodiment.Module in embodiment or unit or assembly can be combined into a module or unit or assembly, and multiple submodule or subelement or sub-component can be put them in addition.Except at least some in such feature and/or process or unit be mutually repel except, any combination can be adopted to combine all processes of all features disclosed in this instructions (comprising adjoint claim, summary and accompanying drawing) and so disclosed any method or equipment or unit.Unless expressly stated otherwise, each feature disclosed in this instructions (comprising adjoint claim, summary and accompanying drawing) can by providing identical, alternative features that is equivalent or similar object replaces.
In addition, those skilled in the art can understand, although embodiments more described herein to comprise in other embodiment some included feature instead of further feature, the combination of the feature of different embodiment means and to be within scope of the present invention and to form different embodiments.Such as, in the following claims, the one of any of embodiment required for protection can use with arbitrary array mode.
In addition, some in described embodiment are described as at this can by the processor of computer system or the method implemented by other device performing described function or the combination of method element.Therefore, there is the device of processor formation for implementing the method or method element of the necessary instruction for implementing described method or method element.In addition, the element described herein of device embodiment is the example as lower device: this device is for implementing the function performed by the element of the object in order to implement this invention.
As used in this, unless specifically stated so, use ordinal number " first ", " second ", " the 3rd " etc. to describe plain objects and only represent the different instances relating to similar object, and be not intended to imply the object be described like this must have the time upper, spatially, sequence aspect or in any other manner to definite sequence.
Although the embodiment according to limited quantity describes the present invention, benefit from description above, those skilled in the art understand, in the scope of the present invention described thus, it is contemplated that other embodiment.In addition, it should be noted that the language used in this instructions is mainly in order to object that is readable and instruction is selected, instead of select to explain or limiting theme of the present invention.Therefore, when not departing from the scope and spirit of appended claims, many modifications and changes are all apparent for those skilled in the art.For scope of the present invention, be illustrative to disclosing of doing of the present invention, and nonrestrictive, and scope of the present invention is defined by the appended claims.
Claims (10)
1. a data access method, performs in computing equipment, is suitable for carrying out access process to multiple individual-layer datas with hierarchical relationship, and wherein each individual-layer data has any number of lower data and a maximum upper layer data, and described method comprises:
Set up a database table in advance, described database table comprises following field: data ID, level, left side ID, right side ID and data name;
The database table set up is utilized to carry out access process to individual-layer data, wherein for any individual-layer data stored in database table, its hierarchical value is that the hierarchical value of its upper layer data adds 1, left side ID value is less than right side ID value, left side ID value is greater than the left side ID value of its upper layer data, right side ID value is less than the right side ID value of its upper layer data, and for multiple lower data of same upper layer data, the time sequencing that on the left of it, ID value and right side ID value all store at database table according to lower data increases progressively.
2. data access method as claimed in claim 1, described to individual-layer data carry out access process comprise newly-increasedly to process, delete processing and query processing.
3. data access method as claimed in claim 2, the step of described newly-increased process comprises:
Obtain the data name of newly-increased individual-layer data and the data ID value of its upper layer data of input;
If the data ID value of the upper layer data of newly-increased individual-layer data is 0, then obtains maximum right side ID value in database table and add 1 as the right side ID value increasing individual-layer data newly, and the hierarchical value of newly-increased individual-layer data is set to 1; If the data ID value of the upper layer data of newly-increased individual-layer data is not 0, from database table, then obtain the right side ID value of right side ID value as newly-increased individual-layer data of the upper layer data of this newly-increased individual-layer data, the hierarchical value obtaining the upper layer data of this newly-increased individual-layer data from database table adds 1 as the hierarchical value increasing individual-layer data newly;
Right side ID value in database table is not less than the right side ID value increase by 2 of all individual-layer datas of the right side ID value of described newly-increased individual-layer data, and left side ID value in database table is greater than the left side ID value increase by 2 of all individual-layer datas of the right side ID value of described newly-increased individual-layer data;
Obtain the left side ID value of right side ID value as newly-increased individual-layer data of described newly-increased individual-layer data, and by the right side ID value increase by 1 of newly-increased individual-layer data;
Newly-increased individual-layer data is inserted in database table.
4. data access method as claimed in claim 2, the step of described delete processing comprises:
Obtain the data ID value of the deleted individual-layer data of input;
From database table, obtain left side ID value and the right side ID value of deleted individual-layer data, and on the left of right side ID value being subtracted, ID value adds 1 again as the first difference;
The all individual-layer datas of delete database table middle left and right side ID value between the left and right side ID value of deleted individual-layer data;
The right side ID value that right side ID value in database table is greater than all individual-layer datas of the right side ID value of deleted individual-layer data is deducted described first difference, and left side ID value left side ID value being greater than all individual-layer datas of the right side ID value of deleted individual-layer data deducts described first difference.
5. data access method as claimed in claim 2, the step of described query processing comprises:
Obtain the data ID value of the individual-layer data to be checked of input;
The left and right side ID value of individual-layer data to be checked is obtained from database table;
From database table, obtain the individual-layer data of left and right side ID value between the left and right side ID value of individual-layer data to be checked, the individual-layer data obtained is all low level data of individual-layer data to be checked.
6. data access method as claimed in claim 2, the step of described query processing comprises:
The data ID value and the level that obtain the individual-layer data to be checked of input are poor;
Left and right side ID value and the hierarchical value of individual-layer data to be checked is obtained from database table;
From database table, obtain left and right side ID value between the left and right side ID value of individual-layer data to be checked and the difference of the hierarchical value of hierarchical value and individual-layer data to be checked is not more than the individual-layer data of the level difference of input, accessed individual-layer data is all low level data being not more than the level difference of input with its level difference of individual-layer data to be checked.
7. data access method as claimed in claim 2, the step of described query processing comprises:
Obtain from database table left side ID value for right side ID value subtract 1 individual-layer data, the individual-layer data obtained is all individual-layer datas without lower data to be checked.
8. a data access arrangement, described system comprises:
Database table sets up module, is suitable for setting up a database table in advance, and described database table comprises following field: data ID, level, left side ID, right side ID and data name;
Access processing module, be suitable for utilizing the database table set up to carry out access process to individual-layer data, wherein for any individual-layer data stored in database table, its hierarchical value is that the hierarchical value of its upper layer data adds 1, left side ID value is less than right side ID value, left side ID value is greater than the left side ID value of its upper layer data, right side ID value is less than the right side ID value of its upper layer data, and for multiple lower data of same upper layer data, the time sequencing that on the left of it, ID value and right side ID value all store at database table according to lower data increases progressively.
9. system as claimed in claim 8, described access processing module comprises newly-increased submodule, deletes submodule and inquiry submodule.
10. a computing equipment, comprises the data access arrangement according to any one of claim 8 ~ 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510866883.9A CN105528397A (en) | 2015-12-01 | 2015-12-01 | Data access method and system, and computing device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510866883.9A CN105528397A (en) | 2015-12-01 | 2015-12-01 | Data access method and system, and computing device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105528397A true CN105528397A (en) | 2016-04-27 |
Family
ID=55770620
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510866883.9A Pending CN105528397A (en) | 2015-12-01 | 2015-12-01 | Data access method and system, and computing device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105528397A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6101512A (en) * | 1991-07-19 | 2000-08-08 | Enigma Information Systems Ltd. | Data processing system and method for generating a representation for and random access rendering of electronic documents |
| CN102819536A (en) * | 2011-09-27 | 2012-12-12 | 金蝶软件（中国）有限公司 | Processing method and device of tree type data |
| CN104598517A (en) * | 2014-12-09 | 2015-05-06 | 北京网梯科技发展有限公司 | Storage and inquiry technology for tree structure table based on ordinary database |
-
2015
- 2015-12-01 CN CN201510866883.9A patent/CN105528397A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6101512A (en) * | 1991-07-19 | 2000-08-08 | Enigma Information Systems Ltd. | Data processing system and method for generating a representation for and random access rendering of electronic documents |
| CN102819536A (en) * | 2011-09-27 | 2012-12-12 | 金蝶软件（中国）有限公司 | Processing method and device of tree type data |
| CN104598517A (en) * | 2014-12-09 | 2015-05-06 | 北京网梯科技发展有限公司 | Storage and inquiry technology for tree structure table based on ordinary database |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105094707B (en) | A kind of data storage, read method and device | |
| CN110263043A (en) | Date storage method, data query method, apparatus and storage medium | |
| CN113515517B (en) | Method and computer equipment for querying data set based on tree structure data | |
| CN111078689B (en) | Data processing method and system of discontinuous pre-ordering traversal tree algorithm | |
| CN110031761B (en) | Battery screening method, battery screening device and terminal equipment | |
| CN106452858B (en) | A kind of method, apparatus and calculating equipment of the identification network user | |
| CN110515951A (en) | A BOM standardization method, system, electronic equipment and storage medium | |
| CN105468719A (en) | Query error correction method and device, and computation equipment | |
| CN103294805A (en) | Creation method and device for data warehouse personalized dimension table | |
| CN106886568A (en) | One kind point table method, device and electronic equipment | |
| CN104111981B (en) | A kind of method and apparatus to release news for offer | |
| CN108319504B (en) | Memory occupation optimization method and device and readable storage medium | |
| CN115964002A (en) | Electric energy meter terminal file management method, device, equipment and medium | |
| CN107908676A (en) | A kind of data display update method, terminal and computer-readable medium | |
| CN110069523A (en) | A kind of data query method, apparatus and inquiry system | |
| CN102855278B (en) | A kind of emulation mode and system | |
| CN105430115A (en) | Method and apparatus for optimizing IP (Internet Protocol) library and computing device | |
| CN108897698A (en) | A kind of file data blocks addressing method, system and equipment and storage medium | |
| CN105528397A (en) | Data access method and system, and computing device | |
| Huang et al. | Exploring the intellectual structure of cloud patents using non-exhaustive overlaps | |
| CN105068850A (en) | Resource bundle loading device, method and computing device | |
| CN107943927B (en) | The memory module conversion method of multidimensional data in a kind of distributed memory system | |
| KR102343848B1 (en) | Method and operating device for searching conversion strategy using user status vector | |
| CN105138550A (en) | Method for browser to automatically update collected records, browser and calculation device | |
| CN116185305A (en) | Service data storage method, device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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: 20160427 |
|
| RJ01 | Rejection of invention patent application after publication |