CN102360359A - Data management device and data management method - Google Patents
Data management device and data management method Download PDFInfo
- Publication number
- CN102360359A CN102360359A CN2011102955719A CN201110295571A CN102360359A CN 102360359 A CN102360359 A CN 102360359A CN 2011102955719 A CN2011102955719 A CN 2011102955719A CN 201110295571 A CN201110295571 A CN 201110295571A CN 102360359 A CN102360359 A CN 102360359A
- Authority
- CN
- China
- Prior art keywords
- data
- relationship information
- contrast relationship
- stored
- level
- 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
Abstract
The invention provides a data management device and a data management method. The data management device comprises an acquisition module, a recording module and a query module, wherein the acquisition module acquires two-level data with superior-subordinate relationship among all combination from a pre-stored tree-structure data; the recording module takes parent-item data, parent-item levels, sub-item data and sub-item levels in the two-level data among all the combination as comparison relationship information to record; and the query module sets query conditions according to the recorded comparison relationship information so as to query the needed data at one or more than one of levels. In the invention, the levels and data nodes (in a tree structure) can be designated in the query conditions so as to easily query the data at any level and above or below any node.
Description
Technical field
The present invention relates to field of computer technology, in particular to a kind of data administrator and a kind of data managing method.
Background technology
At present; When application data base carries out storing and inquiring about for the data of tree-like storage organization (storage organization that has the superior and the subordinate's hierarchical relationship); Usually the storage higher level ID (Identity of subordinate that adopt more; The identification presentation number) storage means is specially: for each level is distributed the ID sign respectively, directly write down higher level's ID in subordinate's record.For example, Fig. 1 is a kind of common tree structure figure of the organization structure of the enterprise, and " our department " is highest tissue, is assigned ID sign " 1 "; " our department " divides into distribution bodies at different levels and agency, is assigned ID sign " 2～14...... " respectively.Be the higher level's corresponding of organizations at different levels corresponding relation shown in the following table 1 with it.
Table 1 is certain " our department " each subordinate organization's node structure storage:
| ID | Tissue | Higher level's organization id | Describe |
| 1 | Our department | NULL | Root node |
| 2 | North Da Qu | 1 | The ID of higher level's organization id record our department |
| 3 | South Da Qu | 1 | The ID of higher level's organization id record our department |
| 4 | Western Da Qu | 1 | The ID of higher level's organization id record our department |
| 5 | International Da Qu | 1 | The ID of higher level's organization id record our department |
| 6 | Shandong first-level agent | 2 | Higher level's organization id writes down the ID of northern Da Qu |
| 7 | Beijing first-level agent | 2 | Higher level's organization id writes down the ID of northern Da Qu |
| 8 | Shenzhen first-level agent | 3 | Higher level's organization id writes down the ID of southern Da Qu |
| 9 | Xinjiang first-level agent | 4 | Higher level's organization id writes down the ID of western Da Qu |
| 10 | Hong Kong first-level agent | 5 | Higher level's organization id writes down the ID of international Da Qu |
| 11 | Jinan secondary agent | 6 | The ID of higher level's organization id record Shandong one-level |
| 12 | Qingdao secondary agent | 6 | The ID of higher level's organization id record Shandong one-level |
| 13 | Three grades of agencies of Laoshan | 12 | The ID of higher level's organization id record Qingdao secondary |
| 14 | The three grades of agencies in four directions | 12 | The ID of higher level's organization id record Qingdao secondary |
| …… | …… | …… | …… |
When using database storing structure as shown in table 1,, during for the immediate superior of searching certain one-level or direct subordinate, be very effective owing to only store the relation of an order of the superior and the subordinate.But during for all higher levels that want to inquire about certain one-level or all subordinates, efficient will be very low.When for example searching all subordinates of certain one-level, can only be through finding its direct subordinate, and then look for its direct subordinate again through subordinate, move in circles, till having no a subordinate again.Then, also to make up all Query Results, thereby obtain the information of all subordinates.Sum up, this mode can cause a large amount of inquiries, and inefficiency, code complexity also can increase greatly.
Afterwards, occurred improvement project again, increased all higher level ID of certain one-level of path field record of a redundancy, like table 2 for this type of problem.
Table 2 is that certain " our department " each subordinate organization's node increases the path storage organization:
| ID | Tissue | Higher level's organization id | Path | Describe |
| 1 | Our department | NULL | 1； | |
| 2 | North Da Qu | 1 | 1；2； | |
| 3 | South Da Qu | 1 | 1；3； | |
| 4 | Western Da Qu | 1 | 1；4； | |
| 5 | International Da Qu | 1 | 1；5； | |
| 6 | Shandong first-level agent | 2 | 1；2；6； | |
| 7 | Beijing first-level agent | 2 | 1；2；7； | |
| 8 | Shenzhen first-level agent | 3 | 1；3；8； | |
| 9 | Xinjiang first-level agent | 4 | 1；4；9； | |
| 10 | Hong Kong first-level agent | 5 | 1；5；10； | |
| 11 | Jinan secondary agent | 6 | 1；2；6；11 | |
| 12 | Qingdao secondary agent | 6 | 1；2；6；12 | |
| 13 | Three grades of agencies of Laoshan | 12 | 1；2；6；12；13 | |
| 14 | The three grades of agencies in four directions | 12 | 1；2；6；12；14 |
When using database storing structure as shown in table 2, solved all higher levels' that want to inquire about certain one-level problem, can once find the result; In like manner, increase all ID of subordinate of certain one-level of path field record again, can solve the problem of all subordinates that want to inquire about certain one-level.But can only obtain all higher levels or subordinate; Higher level or subordinate for the inquiry arbitrary number of level is inferior are then powerless; As the problem of inquiring about which level under certain father's item (level is inferior fixing); Specifically inquire about like inquiry northern Da Qu (2 grades of units) following three grades of agencies (4 grades) and not needing below 4 grades, then powerless.
Therefore, need a kind of new technical scheme, manage the data that have relationship between superior and subordinate, assurance can be at high speed, the data message of arbitrary number of level time is provided for the user once, improves the efficient of user data query.
Summary of the invention
Technical scheme to be solved by this invention is, a kind of new technical scheme is provided, and manages the data that have relationship between superior and subordinate, and assurance can be at high speed, the data message of arbitrary number of level time is provided for the user once, improves the efficient of user data query.
In view of this, the present invention provides a kind of data administrator, comprising: acquisition module, from the tree structure data of pre-stored, obtain two grade data with relationship between superior and subordinate of all combinations; Logging modle, inferior to the father's association in two grade data of said all combinations, father Xiang Jici, subitem data and subitem level as contrast relationship information, carry out record; Enquiry module is according to the said contrast relationship information setting querying condition that has write down, to inquire the required inferior data of one or more levels.Through this technical scheme, can be in querying condition assigned stages time, specific data node (in the tree structure), can inquire easily on any level time, any node or under data.
In technique scheme, preferably, also comprise: memory module, said contrast relationship information is stored; Said enquiry module is provided with said querying condition according to the said contrast relationship information of having stored, and from the said contrast relationship information of having stored, inquires the said required inferior data of one or more levels.Through this technical scheme, after the contrast relationship information stores, can guarantee once to put in order contrast relationship information, realize repeatedly inquiry.
In technique scheme, preferably, also comprise: update module; When the data in said tree structure tree are modified or delete; From all contrast relationship information of having stored, find the pairing contrast relationship information of the data that are modified or delete, and make amendment or delete.Through this technical scheme, immediate updating contrast relationship information can guarantee the accuracy of user's fetched data.
In technique scheme; Preferably, also comprise: the verification module, judge said contrast relationship information whether with said tree structure in corresponding two grade data and relationship between superior and subordinate be complementary; And only in judged result when being, allow said memory module to store said contrast relationship information.Through this technical scheme, the accuracy of the contrast relationship information that has guaranteed to be stored.
In technique scheme, preferably, said logging modle is also added one or more information of predefined type in said contrast relationship information.Through this technical scheme, support contrast relationship information is expanded, and further increase information such as describing content.
The present invention also provides a kind of data managing method, comprising: step 302, from the tree structure data of pre-stored, obtain two grade data with relationship between superior and subordinate of all combinations; Step 304, inferior to the father's association in two grade data of said all combinations, father Xiang Jici, subitem data and subitem level as contrast relationship information, carry out record; Step 306 is according to the said contrast relationship information setting querying condition that has write down, to inquire the required inferior data of one or more levels.Through this technical scheme, can be in querying condition assigned stages time, specific data node (in the tree structure), can inquire easily on any level time, any node or under data.
In technique scheme, preferably, before said step 306, also comprise: step 305, said contrast relationship information is stored; Said step 306 specifically comprises: the said contrast relationship information according to having stored is provided with said querying condition, and from the said contrast relationship information of having stored, inquires the said required inferior data of one or more levels.Through this technical scheme, after the contrast relationship information stores, can guarantee once to put in order contrast relationship information, realize repeatedly inquiry.
In technique scheme; Preferably, also comprise: when the data in said tree structure tree are modified or delete, from all contrast relationship information of having stored; Find the pairing contrast relationship information of the data that are modified or delete, and make amendment or delete.Through this technical scheme, immediate updating contrast relationship information can guarantee the accuracy of user's fetched data.
In technique scheme; Preferably, before said step 305, also comprise: judge said contrast relationship information whether with said tree structure in corresponding two grade data and relationship between superior and subordinate be complementary; And only in judged result when being, get into said step 305.Through this technical scheme, the accuracy of the contrast relationship information that has guaranteed to be stored.
In technique scheme, preferably, said step 304 also comprises: one or more information of in said contrast relationship information, adding predefined type.Through this technical scheme, support contrast relationship information is expanded, and further increase information such as describing content.
Through above technical scheme; Can realize a kind of data administrator and a kind of data managing method; Manage the data that have relationship between superior and subordinate, assurance can be at high speed, the data message of arbitrary number of level time is provided for the user once, improves the efficient of user data query.
Description of drawings
Fig. 1 is the schematic diagram data of tree-like storage organization;
Fig. 2 is the block diagram of data administrator according to an embodiment of the invention;
Fig. 3 is the process flow diagram of data managing method according to an embodiment of the invention;
Fig. 4 is the block diagram of data administrator according to an embodiment of the invention.
Embodiment
In order more to be expressly understood above-mentioned purpose of the present invention, feature and advantage, the present invention is further described in detail below in conjunction with accompanying drawing and embodiment.
Set forth a lot of details in the following description so that make much of the present invention, still, the present invention can also adopt other to be different from other modes described here and implement, and therefore, the present invention is not limited to the restriction of following disclosed specific embodiment.
Fig. 2 is the block diagram of data administrator according to an embodiment of the invention.
As shown in Figure 2, the present invention provides a kind of data administrator 200, comprising: acquisition module 202, from the tree structure data of pre-stored, obtain two grade data with relationship between superior and subordinate of all combinations; Logging modle 204, inferior to the father's association in two grade data of said all combinations, father Xiang Jici, subitem data and subitem level as contrast relationship information, carry out record; Enquiry module 206 is according to the said contrast relationship information setting querying condition that has write down, to inquire the required inferior data of one or more levels.Through this technical scheme, can be in querying condition assigned stages time, specific data node (in the tree structure), can inquire easily on any level time, any node or under data.
In technique scheme, also comprise: memory module 208, said contrast relationship information is stored; Said enquiry module 206 is provided with said querying condition according to the said contrast relationship information of having stored, and from the said contrast relationship information of having stored, inquires the said required inferior data of one or more levels.Through this technical scheme, after the contrast relationship information stores, can guarantee once to put in order contrast relationship information, realize repeatedly inquiry.
In technique scheme; Also comprise: update module 210, when the data in said tree structure tree are modified or delete, from all contrast relationship information of having stored; Find the pairing contrast relationship information of the data that are modified or delete, and make amendment or delete.Through this technical scheme, immediate updating contrast relationship information can guarantee the accuracy of user's fetched data.
In technique scheme; Also comprise: verification module 212; Judge said contrast relationship information whether with said tree structure in corresponding two grade data and relationship between superior and subordinate be complementary, and only in judged result when being, allow the said contrast relationship information of said memory module 208 storages.Through this technical scheme, the accuracy of the contrast relationship information that has guaranteed to be stored.
In technique scheme, said logging modle 204 is also added one or more information of predefined type in said contrast relationship information.Through this technical scheme, support contrast relationship information is expanded, and further increase information such as describing content.
Fig. 3 is the process flow diagram of data managing method according to an embodiment of the invention.
As shown in Figure 3, the present invention also provides a kind of data managing method, comprising: step 302, from the tree structure data of pre-stored, obtain two grade data with relationship between superior and subordinate of all combinations; Step 304, inferior to the father's association in two grade data of said all combinations, father Xiang Jici, subitem data and subitem level as contrast relationship information, carry out record; Step 306 is according to the said contrast relationship information setting querying condition that has write down, to inquire the required inferior data of one or more levels.Through this technical scheme, can be in querying condition assigned stages time, specific data node (in the tree structure), can inquire easily on any level time, any node or under data.
In technique scheme, before said step 306, also comprise: step 305, said contrast relationship information is stored; Said step 306 specifically comprises: the said contrast relationship information according to having stored is provided with said querying condition, and from the said contrast relationship information of having stored, inquires the said required inferior data of one or more levels.Through this technical scheme, after the contrast relationship information stores, can guarantee once to put in order contrast relationship information, realize repeatedly inquiry.
In technique scheme, also comprise: when the data in said tree structure tree are modified or delete, from all contrast relationship information of having stored, find the pairing contrast relationship information of the data that are modified or delete, and make amendment or delete.Through this technical scheme, immediate updating contrast relationship information can guarantee the accuracy of user's fetched data.
In technique scheme, before said step 305, also comprise: judge said contrast relationship information whether with said tree structure in corresponding two grade data and relationship between superior and subordinate be complementary, and only in judged result when being, get into said step 305.Through this technical scheme, the accuracy of the contrast relationship information that has guaranteed to be stored.
In technique scheme, said step 304 also comprises: one or more information of in said contrast relationship information, adding predefined type.Through this technical scheme, support contrast relationship information is expanded, and further increase information such as describing content.
Through following embodiment, specify technical scheme of the present invention.
A kind of data managing method of the full rank based on tree structure is provided in the present embodiment, can simplifies query script, and satisfy for the search request full rank of the superior and the subordinate, arbitrary number of level time for the data that adopt the tree structure storage.
Data managing method in the present embodiment is through increasing father's item, the subitem table of comparisons, the relation of record father item, subitem, and the level of father's item, subitem time.Through the relation of father's item, subitem, and the corresponding level of father's item, subitem time, can inquire about the higher level or the subordinate of arbitrary number of level time.To tree structure data shown in Figure 1, handle obtaining table 3.
Table 3 is certain " our department " father item, subitem table of comparisons storage organization:
| Father's item ID | Subitem ID | Father Xiang Jici | The subitem level is inferior | Describe |
| 1 | 2 | 1 | 2 | Our department-northern Da Qu |
| 1 | 3 | 1 | 2 | Our department-austral region |
| 1 | 4 | 1 | 2 | Our department-western Da Qu |
| 1 | 5 | 2 | 3 | North Da Qu-international Da Qu |
| 2 | 6 | 2 | 3 | North Da Qu-Shandong first-level agent |
| 2 | 7 | 2 | 3 | North Da Qu-Beijing first-level agent |
| 6 | 11 | 3 | 4 | Shandong one-level-Jinan secondary agent |
| 6 | 12 | 3 | 4 | One-level-Qingdao, Shandong |
| 12 | 13 | 4 | 5 | Three grades of Qingdao secondary agent-Laoshans |
| 12 | 14 | 4 | 5 | Three grades of Qingdao secondary agents-four directions |
| 1 | 6 | 1 | 3 | Our department-Shandong first-level agent |
| 1 | 7 | 1 | 3 | Our department-Beijing first-level agent |
| 1 | 9 | 1 | 4 | Our department-Shenzhen first-level agent |
| 1 | 10 | 1 | 4 | Our department district-Hong Kong first-level agent |
| …… | …… | …… | …… |
In the described storage organization of table 3, each father and son, father grandson, descendants's etc. are done exhaustive, set up contrast relationship, independently represent its place level time simultaneously, thereby can directly obtain the inferior higher level of arbitrary number of level or subordinate's information of arbitrary node.As: northern Da Qu ID=2; Inquire about its 4th grade of unit; Then can pass through following SQL (Structured Query Language; SQL) statement: " Select subitem ID from table of comparisons where father item ID=2 and subitem level time=4 ", just can find its 4th grade of unit of northern Da Qu (ID=2) through one query.Give one example again; North Da Qu ID=2 level inferior 2; Notify its one-level and secondary agent (subordinate's level is inferior to be 3,4) meeting; Secondary following agency do not notify, then can be through following SQL: " Select subitem ID from table of comparisons where father item ID=2 and subitem level time＜=4 ", just can find all units of its subordinate of northern Da Qu (ID=2) through one query by the end of three grades of agencies.
Two kinds of methods in the contrast background technology, the data managing method in the present embodiment can disposablely easily be found the inferior the superior and the subordinate of arbitrary number of level, effectively reduce complexity and have promoted search efficiency greatly.
A kind of data administrator 400 also is provided in the embodiments of the invention simultaneously, comprises:
First acquisition module 402 (corresponding aforesaid acquisition module 202, logging modle 204 and enquiry module 206) is used for obtaining the contrast relationship information of the expression relationship between superior and subordinate of said database nodes at different levels in tree-like storage organization, specifically comprises:
Read module 4022 (corresponding aforesaid logging modle 204) is used to read the contrast relationship information of the relationship between superior and subordinate of having preserved, and said contrast relationship information comprises the ID of parent node and the ID of sub level node, and parent and the residing level of sub level time.
Enquiry module 4024 (corresponding aforesaid enquiry module 206) is used for according to said contrast relationship information, the arbitrary number of level time higher level or the next node of said certain grade of node of inquiry.
Second memory module 404 (corresponding aforesaid memory module 208, update module 210 and verification module 212); Be used for said contrast relationship information is preserved; Said contrast relationship information comprises the ID of parent node and the ID of sub level node, and the residing level of parent and sub level time, specifically comprises:
Modified module 4042 (corresponding aforesaid update module 210) is used for when the higher level of certain grade of node or downstream site change, and the contrast relationship information of then this node having been preserved is made amendment;
Removing module 4044 (corresponding aforesaid update module 210) is used for when the higher level of certain grade of node or downstream site change, and the contrast relationship information of then this node having been preserved is deleted;
Verification module 4046 (corresponding aforesaid verification module 212), whether be used for the said contrast relationship information of verification corresponding with the superior and the subordinate's storage relation of node, if, then preserve successfully, if not, then preserve failure.
Can know that to sum up technical scheme of the present invention has the following advantages and characteristics:
The newly-increased expansion table of comparisons carries out association on data with existing storage organization basis; The relation of representing the superior and the subordinate clearly is inferior with the level at their places; When inferior higher level of the arbitrary number of level of certain grade of tissue of inquiry or subordinate; Can be directly a contrast relationship and the level time disposable completion of information through having set up, improved the search efficiency of data in the tree-like storage organization database greatly, reduced complicacy.And prior art, then can not direct disposable completion, perhaps need circulate and obtain or need carry out complicated resolving.The present invention realizes making product configurable everywhere, and curstomer-oriented has greatly enriched user's application scenarios, thereby made product function more powerful flexibly.
The above is merely the preferred embodiments of the present invention, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a data administrator is characterized in that, comprising:
Acquisition module from the tree structure data of pre-stored, is obtained two grade data with relationship between superior and subordinate of all combinations;
Logging modle, inferior to the father's association in two grade data of said all combinations, father Xiang Jici, subitem data and subitem level as contrast relationship information, carry out record;
Enquiry module is according to the said contrast relationship information setting querying condition that has write down, to inquire the required inferior data of one or more levels.
2. data administrator according to claim 1 is characterized in that, also comprises:
Memory module is stored said contrast relationship information;
Said enquiry module is provided with said querying condition according to the said contrast relationship information of having stored, and from the said contrast relationship information of having stored, inquires the said required inferior data of one or more levels.
3. data administrator according to claim 2 is characterized in that, also comprises:
Update module when the data in said tree structure tree are modified or delete, from all contrast relationship information of having stored, finds the pairing contrast relationship information of the data that are modified or delete, and makes amendment or delete.
4. data administrator according to claim 2 is characterized in that, also comprises:
The verification module, judge said contrast relationship information whether with said tree structure in corresponding two grade data and relationship between superior and subordinate be complementary, and only in judged result when being, allow said memory module to store said contrast relationship information.
5. according to each described data administrator in the claim 1 to 4, it is characterized in that said logging modle is also added one or more information of predefined type in said contrast relationship information.
6. a data managing method is characterized in that, comprising:
Step 302 from the tree structure data of pre-stored, obtains two grade data with relationship between superior and subordinate of all combinations;
Step 304, inferior to the father's association in two grade data of said all combinations, father Xiang Jici, subitem data and subitem level as contrast relationship information, carry out record;
Step 306 is according to the said contrast relationship information setting querying condition that has write down, to inquire the required inferior data of one or more levels.
7. data managing method according to claim 6 is characterized in that, before said step 306, also comprises:
Step 305 is stored said contrast relationship information;
Said step 306 specifically comprises: the said contrast relationship information according to having stored is provided with said querying condition, and from the said contrast relationship information of having stored, inquires the said required inferior data of one or more levels.
8. data managing method according to claim 7 is characterized in that, also comprises:
When the data in said tree structure tree are modified or delete, from all contrast relationship information of having stored, find the pairing contrast relationship information of the data that are modified or delete, and make amendment or delete.
9. data managing method according to claim 7 is characterized in that, before said step 305, also comprises:
Judge said contrast relationship information whether with said tree structure in corresponding two grade data and relationship between superior and subordinate be complementary, and only in judged result when being, get into said step 305.
10. according to each described data managing method in the claim 6 to 9, it is characterized in that said step 304 also comprises:
In said contrast relationship information, add one or more information of predefined type.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102955719A CN102360359A (en) | 2011-09-29 | 2011-09-29 | Data management device and data management method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011102955719A CN102360359A (en) | 2011-09-29 | 2011-09-29 | Data management device and data management method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102360359A true CN102360359A (en) | 2012-02-22 |
Family
ID=45585688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011102955719A Pending CN102360359A (en) | 2011-09-29 | 2011-09-29 | Data management device and data management method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102360359A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102789488A (en) * | 2012-06-29 | 2012-11-21 | 用友软件股份有限公司 | Data query processing system and data query processing method |
| CN103049553A (en) * | 2012-12-28 | 2013-04-17 | 华为技术有限公司 | Method, device and system for searching route storage |
| CN104331491A (en) * | 2014-11-14 | 2015-02-04 | 北京久其软件股份有限公司 | Method and device for displaying organization |
| CN106570017A (en) * | 2015-10-09 | 2017-04-19 | 北大方正集团有限公司 | Data caching method and system |
| CN108241684A (en) * | 2016-12-26 | 2018-07-03 | 航天信息股份有限公司 | A kind of data-updating method and group system |
| CN111475482A (en) * | 2020-04-03 | 2020-07-31 | 北京东方金信科技有限公司 | HDFS (Hadoop distributed File System) data display method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101482873A (en) * | 2008-12-18 | 2009-07-15 | 华为技术有限公司 | Method and device for data access |
| CN101655871A (en) * | 2009-09-25 | 2010-02-24 | 金蝶软件（中国）有限公司 | Method and device for storing and inquiring data |
| CN101727502A (en) * | 2010-01-25 | 2010-06-09 | 中兴通讯股份有限公司 | Data query method, data query device and data query system |
-
2011
- 2011-09-29 CN CN2011102955719A patent/CN102360359A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101482873A (en) * | 2008-12-18 | 2009-07-15 | 华为技术有限公司 | Method and device for data access |
| CN101655871A (en) * | 2009-09-25 | 2010-02-24 | 金蝶软件（中国）有限公司 | Method and device for storing and inquiring data |
| CN101727502A (en) * | 2010-01-25 | 2010-06-09 | 中兴通讯股份有限公司 | Data query method, data query device and data query system |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102789488A (en) * | 2012-06-29 | 2012-11-21 | 用友软件股份有限公司 | Data query processing system and data query processing method |
| CN102789488B (en) * | 2012-06-29 | 2016-05-04 | 用友网络科技股份有限公司 | Data query treatment system and data query processing method |
| CN103049553A (en) * | 2012-12-28 | 2013-04-17 | 华为技术有限公司 | Method, device and system for searching route storage |
| CN103049553B (en) * | 2012-12-28 | 2016-03-02 | 华为技术有限公司 | Method, Apparatus and system that a kind of searching route stores |
| CN104331491A (en) * | 2014-11-14 | 2015-02-04 | 北京久其软件股份有限公司 | Method and device for displaying organization |
| CN104331491B (en) * | 2014-11-14 | 2018-01-05 | 北京久其软件股份有限公司 | The methods of exhibiting and device of a kind of organization |
| CN106570017A (en) * | 2015-10-09 | 2017-04-19 | 北大方正集团有限公司 | Data caching method and system |
| CN108241684A (en) * | 2016-12-26 | 2018-07-03 | 航天信息股份有限公司 | A kind of data-updating method and group system |
| CN108241684B (en) * | 2016-12-26 | 2021-08-24 | 航天信息股份有限公司 | Data updating method and cluster system |
| CN111475482A (en) * | 2020-04-03 | 2020-07-31 | 北京东方金信科技有限公司 | HDFS (Hadoop distributed File System) data display method and device |
| CN111475482B (en) * | 2020-04-03 | 2023-09-05 | 北京东方金信科技股份有限公司 | HDFS data display method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102521416B (en) | Data correlation query method and data correlation query device | |
| CN101840400B (en) | Multilevel classification retrieval method and system | |
| US11573941B2 (en) | Systems, methods, and data structures for high-speed searching or filtering of large datasets | |
| CN102467521B (en) | Easily-extensible multi-level classification search method and system | |
| CN101655871A (en) | Method and device for storing and inquiring data | |
| US9852453B2 (en) | High-throughput message generation | |
| CN102360359A (en) | Data management device and data management method | |
| CN107977396B (en) | Method and device for updating data table of KeyValue database | |
| US20130254240A1 (en) | Method of processing database, database processing apparatus, computer program product | |
| CN105488050A (en) | Database multi-index method, apparatus and system | |
| CN102270225A (en) | Data change log monitoring method and device | |
| CN102402602A (en) | B+ tree indexing method and device of real-time database | |
| CN102193983B (en) | Relation path-based node data filtering method of graphic database | |
| US20210250218A1 (en) | Abstraction layer for streaming data sources | |
| CN110570928A (en) | HBase and ozone based medical image file access method | |
| CN108319608A (en) | The method, apparatus and system of access log storage inquiry | |
| CN103365987B (en) | Clustered database system and data processing method based on shared-disk framework | |
| CN101963993B (en) | Method for fast searching database sheet table record | |
| CN102750384A (en) | Device and method for acquiring data from multidatabase engine | |
| CN103605797A (en) | Data storage and inquiry devices and data storage and inquiry methods | |
| EP3514695B1 (en) | Integrated database table access | |
| CN107766355B (en) | Hierarchical data management method, hierarchical data management system and instant messaging system | |
| CN104699815A (en) | Data processing method and system | |
| CN101840427A (en) | Data processing method and device | |
| CN101430707A (en) | Verification method, system and equipment for record deletion operation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20160201 Address after: 100094 Beijing City, North Road, Haidian District, No. 68, building 2, floor 2 Applicant after: You Pu Information Technology Co., Ltd of UFSOFT Address before: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Applicant before: UFIDA Software Co., Ltd. |
|
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20120222 |