CN102096711A - Method for constructing tree structural directory in database - Google Patents
Method for constructing tree structural directory in database Download PDFInfo
- Publication number
- CN102096711A CN102096711A CN 201110025142 CN201110025142A CN102096711A CN 102096711 A CN102096711 A CN 102096711A CN 201110025142 CN201110025142 CN 201110025142 CN 201110025142 A CN201110025142 A CN 201110025142A CN 102096711 A CN102096711 A CN 102096711A
- Authority
- CN
- China
- Prior art keywords
- tree
- directory
- node
- database
- description
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method for constructing a tree structural directory in a database, which relates to the method for constructing the tree structural directory in the database. The method comprises the following steps of: establishing a commonly used directory structure module used for describing a tree structure and a commonly used configuration module used for describing the information related to nodes in the tree structure in the database; and when establishing the tree structure, storing the information related to the tree structure to be established into the directory structure module and the configuration module first and then establishing a specific information-containing tree structural directory by combining the information stored in the directory structure module and the configuration module. By using the method for establishing the tree structural directory of the database, a large amount of redundant data in data storage space is reduced so that various information tables can adapt to various classification structures conveniently. Therefore, the utilization rate of the storage space such as a hard disk and/or a buffer memory and the like is improved extremely, the system development and maintenance workload is obviously reduced and the stability of the system is enhanced.
Description
Technical field
The present invention relates to make up in a kind of database the method for catalogue, make up the method for tree-structured directory in a kind of specifically database.
Background technology
All need various information is carried out the stagewise directory management in many application systems in present each field, particularly this demand is more obvious in large scale system.The combination of tree structure, tableau format, hierarchical structure (as: constantly ejecting subwindow or sublink) or simple structure etc. is arranged in common hierarchy, and wherein relation is widely used tree structure between each data because of it can must represent very by all means.
In database, each information is set up at present the method for tree-like relation, constructed tree structure with the classification relationship that forms between data thereby need when design database, all add the father node field information usually to every information table.The shortcoming of doing like this is:
1, all need all will add the redundant information of father node field with the information that tree structure represents.Every information all will make up the processing of tree structure from the database table to the page, wherein comprised much repeated work.
2, show management when certain information has both needed tree structure, in the time of again need be, need carry out particular design, take into account the needs of plurality of data structures management as a table being split as two or more tight forms to database with other structure management.This has just increased design difficulty greatly, has also increased the risk of workload and system stability.
Summary of the invention
In order to solve the shortcoming of above appearance, the invention provides a kind of method that makes up tree-structured directory at database, make up directory tree by this method and no longer carry out special processing at tree structure, do not need to add redundant informations such as father node in the information table of its database yet, its design also need not take into account the constraint of data structure, optimize storage space, greatly reduced the workload of system development and maintenance.
Make up the method for tree-structured directory in the database of the present invention, in database, set up the bibliographic structure module that tree structure is described in general being used to; With
The configuration module of the associated information of node in the general description tree structure; When making up tree structure, in described bibliographic structure module and configuration module, deposit the associated information of tree structure that to set up in earlier,, make up a tree-structured directory that comprises specifying information again in conjunction with the information of depositing in bibliographic structure module and the configuration module.
In database, set up general module and set up tree shape model, make each concrete information table form tree-like relational structure by unified step by this model, thus modification/the deletion of all directory tree is all only operated this tree shape model, the related information that in the specifying information unit that constitutes by each specifying information table, no longer comprises level, reduced database redundancy, not only improved the utilization rate of system memory space, also improved the performance of system, the speed that generates the tree construction catalogue at subscription client is faster, safeguards simpler.
On the basis of above scheme, comprise general structrual description unit, general node description unit and general associative cell in the described bibliographic structure module; In described structrual description unit, comprise description to the structure attribute of tree-structured directory, comprise the description to the nodal community of tree-structured directory in the described node description unit, described associative cell comprises the related description of the associated specifying information of node and node.By tree structure attribute and nodal community, can intactly express a directory tree.
A kind of preferred scheme comprises the coding of catalog code and specifying information unit title in the configuration module.The effect of configuration module is to describe the associated information of each node in the tree structure.This is comprising the description of a plurality of table names in the associated database of the branches and leaves node of a node and this node, reason is that directory tree is made up of a plurality of tables of database, as: the product node comprises product table information, its subordinate's node comprises contents such as the facility information table of product and service information table again, at this moment will write down these information with configuration module, when making up directory tree, handle accordingly by inquiring about these information.
Further, the node number of the arbitrary grade of catalogue of branch sum of series that comprises that catalog code, directory tree are total is described in the structrual description unit to the structure attribute of tree structure; The node description unit comprises catalog code, nodes encoding and father node coding to the attribute description of arbitrary node in the tree structure; In the associative cell node is comprised the coding of nodes encoding, specifying information unit title and the record coding in the specifying information unit with the related description of specifying information shown in the node.Because catalog code and nodes encoding all are unduplicated in the record of entire database, just has uniqueness, therefore node has formed many-to-one relation by the record of catalog code attribute and bibliographic structure module, makes each node form the incidence relation of classification in database by nodes encoding and father node coding again.Specifying information shown in the node is related with the node in the directory tree by nodes encoding attribute in the associative cell, each node finds the database table of record specifying information by the encoded attributes of specifying information unit title in the associative cell, specifying information record coding attribute by associative cell is associated with a specifying information at last, forms in the tree structure from doing the integral framework of leaf.
A kind of mode of preferred structure tree-structured directory comprises step:
In described bibliographic structure module, determine the structural model of directory tree earlier by described structrual description unit;
Related by configuration module with the specifying information unit;
By described node description unit is constructed concrete directory tree structure through recursive algorithm;
When making up node,, this node is associated with specifying information in this specifying information unit by associative cell according to the specifying information unit of configuration module association.
When calling database on the client and make up directory tree, can adopt disposable whole directory tree to be built, this mode all is bigger to the consumption of database burden and internal memory.Therefore also can adopt the mode of asynchronous call to make up directory tree, its basic process is when making up directory tree first, only construct first order catalogue, when sending the instruction of catalogue or content once of this grade of inquiry in client, system calls database once more, construct second level catalogue or content, by that analogy.Obviously, meeting of database and internal memory all is minimized when making up directory tree by this way, saved resource, and the response speed of its client also is improved.
For the process that makes up directory tree is more optimized, when making up tree-structured directory, check in the described configuration module whether the relevant information of the directory tree that will make up is arranged earlier, carry out if having then continue; Otherwise stop to carry out and require the information in the configuration module is configured.Write down many Back ground Informations to be processed when making up directory tree in the configuration module, if there is not these information, directory tree possibly can't make up or make up mistake, therefore should guarantee at first whether corresponding information is arranged in the configuration module when making up directory tree.For these reasons, the required various information of system's reply are checked before making up directory tree, if lack some Back ground Information, system makes up directory tree after can pointing out these information being replenished again, guarantees that in this way directory tree can correctly make up.
Further preferred scheme is to include the description to supplementary in described bibliographic structure module and configuration module.Except the information that record is necessary in database table, the process that makes up directory tree will further be simplified in the record of supplementary, thereby construct directory tree more quickly.From the above, general structrual description unit, general node description unit and general associative cell have been comprised in the bibliographic structure module.The supplementary of wherein general structrual description unit comprises area, picture and/or remarks etc.; The supplementary of general node description unit comprises serial number (the front and back order when handling a plurality of child node under the father node), description and/or title etc.; The supplementary of general associative cell comprises serial number and/or description etc.The supplementary of configuration module comprises description, tree construction pattern (single table schema or multilist pattern), specific condition (describe the special circumstances of tree construction, as: certain situation node adds two, perhaps must be leaf node) and/or remarks etc.Be appreciated that thus the supplementary description in each module can comprise abundanter information, its objective is in order to adapt to various forms of directory trees and the faster directory tree that constructs exactly.
According to the database design principle, each database table in bibliographic structure module and the configuration module is equipped with major key field.Major key is meant to have a column data that does not repeat with uniqueness in database table, its objective is when this table is operated, can be corresponding with unique data by major key field.Common major key is by progressive whole number or has the regular character string that changes and constitute.
Traditional directory tree need carry out the field setting of tree construction to all database tables when making up, so not only make databases waste storage space in a large amount of redundancies, also make when directory tree being carried out the integral body modification very difficult, for example the literal of all nodes in the directory tree to be added icon, just need make amendment to all correlation tables and record, workload is big well imagines, and because various data loaded down with trivial details in the database is easy to occur mistake to modifications such as tree constructions the time.If the identical information content needs multiple expression mode, as form etc., the design of database is difficulty very, and also will have more substantial redundant data, and this all is great waste for various resources.And all information tables of directory tree that make up by method of the present invention all make up tree structure by general module, database table content then brief introduction is single, no longer include a large amount of redundant datas, greatly degree has improved operating factor of memory space and system effectiveness, and has also reduced much repeated work in database design with in revising.Be the top example that the literal of all nodes in the directory tree will be added icon equally, only " picture " field of general structrual description unit need be revised as " very " with method of the present invention and get final product, very convenient.Even will carry out multiple expression mode to the identical information content, also need not make amendment to information table, only, simplified development difficulty greatly with adding corresponding general module.
Be appreciated that thus, make up the tree-structured directory of database by method of the present invention, no longer carry out special processing at tree structure, do not need to add redundant informations such as father node in the information table of its database yet, its design also need not take into account the constraint of data structure, greatly must improve operating factor of memory space such as hard disk and/or buffer memory, the obvious workload that must reduce system development and maintenance has strengthened the stability of system.
Embodiment by the following examples is described in further detail foregoing of the present invention again.But this should be interpreted as that the scope of the above-mentioned theme of the present invention only limits to following example.Do not breaking away under the above-mentioned technological thought situation of the present invention, various replacements or change according to ordinary skill knowledge and customary means are made all should comprise within the scope of the invention.
Embodiment
Make up the method for tree-structured directory in the database of the present invention, in database, set up the bibliographic structure module that tree structure is described in general being used to; With
The configuration module of the associated information of node in the general description tree structure; Wherein in the bibliographic structure module, comprise general structrual description unit, general node description unit and general associative cell; In described structrual description unit, comprised major key, catalog code, to the description of the node number of directory tree total arbitrary grade of catalogue of branch sum of series, also comprise description to supplementarys such as area, picture and/or remarks shown in the directory tree; The node description unit comprises major key, catalog code, nodes encoding and father node coding to the description of arbitrary node in the directory tree, also comprises the description to supplementarys such as serial number (front and back when handling a plurality of child node under the father node in proper order), description and/or titles; Describe the incidence relation between the specifying information shown in node and the node in the associative cell, comprised coding and the specifying information record coding of major key, nodes encoding, specifying information unit title, also comprised supplementarys such as node sequence number and/or description.
The effect of configuration module is to describe the associated information of each node in the tree structure, therefore in configuration module, comprised basic description to the coding of catalog code and specifying information unit title, comprised that in addition the supplementary that a plurality of table names are described in the associated database of the branches and leaves node of a node and this node comprises descriptions, tree construction pattern (single table schema or multilist pattern), the specific condition (special circumstances of description tree construction, as: certain situation node adds two, perhaps must be leaf node) and/or remarks etc.
Nodes encoding in catalog code in the bibliographic structure module and the node description unit all is unduplicated in the record of entire database, just has uniqueness, therefore node has formed many-to-one relation by the record of catalog code attribute and bibliographic structure module, makes each node form the incidence relation of classification in database by nodes encoding and father node coding again.Specifying information shown in the node is related with the node in the directory tree by nodes encoding attribute in the associative cell, each node finds the database table of record specifying information by the encoded attributes of the specifying information unit title of associative cell, specifying information record coding attribute by associative cell is associated with a specifying information at last, forms in the tree structure from doing the integral framework of leaf.
When making up tree-structured directory, check in the described configuration module whether the relevant information of the directory tree that will make up is arranged earlier, carry out if having then continue; Otherwise stop to carry out and require the information in the configuration module is configured.Write down many Back ground Informations to be processed when making up directory tree in the configuration module, if there is not these information, directory tree possibly can't make up or make up mistake, therefore should guarantee at first whether corresponding information is arranged in the configuration module when making up directory tree.For these reasons, the required various information of system's reply are checked before making up directory tree, if lack some Back ground Information, system can make up directory tree again after prompting replenishes these information as forms such as dialog boxes, guarantee that in this way directory tree can correctly make up.After system validation has enough structure conditions, call the bibliographic structure module, determine the structural model of directory tree earlier by general structrual description unit, the structrual description unit is by the recorded information of catalog code Attribute Association in the configuration module, by the related specifying information unit relevant of the coding of specifying information unit title in this recorded information, again by general node description unit is made up each node of directory tree through recursive algorithm with node.When making up node, in conjunction with the associated specifying information unit of above-mentioned configuration module, by nodes encoding attribute in the associative cell and the record coding attribute in the specifying information unit, this node is associated with specifying information in the specifying information unit, construct complete tree-structured directory.
Claims (8)
1. make up the method for tree-structured directory in the database, it is characterized by and in database, set up the bibliographic structure module that tree structure is described in general being used to; With
The configuration module of the associated information of node in the general description tree structure; When making up tree structure, in described bibliographic structure module and configuration module, deposit the associated information of tree structure that to set up in earlier,, make up a tree-structured directory that comprises specifying information again in conjunction with the information of depositing in bibliographic structure module and the configuration module.
2. make up the method for tree-structured directory in the database as claimed in claim 1, it is characterized by and in described bibliographic structure module, comprise general structrual description unit, general node description unit and general associative cell; In described structrual description unit, comprise description to the structure attribute of tree-structured directory, comprise the description to the nodal community of tree-structured directory in the described node description unit, described associative cell comprises the related description of the associated specifying information of node and node.
3. make up the method for tree-structured directory in the database as claimed in claim 1, it is characterized by the coding that comprises catalog code and specifying information unit title at described configuration module.
4. make up the method for tree-structured directory in the database as claimed in claim 2, it is characterized by the arbitrary grade of catalogue of branch sum of series that comprises that catalog code, directory tree are total described in the structrual description unit to the structure attribute of tree structure node number; Described node description unit comprises catalog code, nodes encoding and father node coding to the attribute description of arbitrary node in the tree structure; In the described associative cell node is comprised the coding of nodes encoding, specifying information unit title and the record coding in the specifying information unit with the related description of specifying information shown in the node.
5. comprise step as making up the method for tree-structured directory in the described database of one of claim 2 to 4, it is characterized by:
In described bibliographic structure module, determine the structural model of directory tree earlier by described structrual description unit;
Related by configuration module with the specifying information unit;
By described node description unit is constructed concrete directory tree structure through recursive algorithm;
When making up node,, this node is associated with specifying information in this specifying information unit by associative cell according to the specifying information unit of configuration module association.
6. make up the method for tree-structured directory in the database as claimed in claim 1, it is characterized by when making up tree-structured directory, check in the described configuration module whether the relevant information of the directory tree that will make up is arranged earlier, carry out if having then continue; Otherwise stop to carry out and require the information in the configuration module is configured.
7. as making up the method for tree-structured directory in the described database of one of claim 1 to 6, it is characterized by the description that in described bibliographic structure module and configuration module, includes supplementary.
8. make up the method for tree-structured directory in the database as claimed in claim 7, each database table that it is characterized by in bibliographic structure module and the configuration module is equipped with major key field.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110025142 CN102096711A (en) | 2011-01-24 | 2011-01-24 | Method for constructing tree structural directory in database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110025142 CN102096711A (en) | 2011-01-24 | 2011-01-24 | Method for constructing tree structural directory in database |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102096711A true CN102096711A (en) | 2011-06-15 |
Family
ID=44129806
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110025142 Pending CN102096711A (en) | 2011-01-24 | 2011-01-24 | Method for constructing tree structural directory in database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102096711A (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646111A (en) * | 2012-02-16 | 2012-08-22 | 中国测绘科学研究院 | Knowledge base-based fast construction method of common correlation information query tree |
| CN102819558A (en) * | 2012-06-28 | 2012-12-12 | 用友软件股份有限公司 | Data display device and data display method |
| CN102902811A (en) * | 2012-10-19 | 2013-01-30 | 北京金和软件股份有限公司 | Database design method for quickly generating tree structure |
| CN103761273A (en) * | 2014-01-08 | 2014-04-30 | 兴天通讯技术（天津）有限公司 | Tree structure node attribute configuration method and system |
| CN104133900A (en) * | 2014-08-04 | 2014-11-05 | 浪潮通用软件有限公司 | Definition description method of 360-degree treeview |
| CN105096202A (en) * | 2014-05-19 | 2015-11-25 | 中国石油化工股份有限公司 | Method for processing resource evaluation data |
| CN106484591A (en) * | 2016-09-23 | 2017-03-08 | 上海爱数信息技术股份有限公司 | A kind of collecting method based on distributed system and acquisition system |
| CN107705209A (en) * | 2017-08-25 | 2018-02-16 | 重庆康洲大数据有限公司 | The big data association analysis method and device of medical insurance catalogue |
| CN108228694A (en) * | 2017-06-30 | 2018-06-29 | 勤智数码科技股份有限公司 | Catalogue generation method based on refining data item |
| CN108268650A (en) * | 2018-01-26 | 2018-07-10 | 北京金雨科创自动化技术股份有限公司 | The method and system of construction product database |
| CN108694261A (en) * | 2017-04-10 | 2018-10-23 | 中国石油天然气股份有限公司 | Method and device for constructing equipment model |
| CN109491997A (en) * | 2018-09-30 | 2019-03-19 | 中铁第勘察设计院集团有限公司 | The method of structure category tree is quickly generated in management platform based on BIM technology |
| CN109729407A (en) * | 2018-12-10 | 2019-05-07 | 视联动力信息技术股份有限公司 | A kind of catalog indication method and device |
| CN110084564A (en) * | 2019-04-24 | 2019-08-02 | 李振 | ICE framework for item data management |
| CN110222050A (en) * | 2019-05-15 | 2019-09-10 | 中广核工程有限公司 | Method and system is transferred for nuclear power plant's three-dimensional database instrument association items |
| CN111159273A (en) * | 2019-12-31 | 2020-05-15 | 中国联合网络通信集团有限公司 | Data stream processing method, device, server and storage medium |
| CN111506552A (en) * | 2019-01-30 | 2020-08-07 | 宁波创元信息科技有限公司 | Dynamic database design method and system of tree structure |
| CN113377895A (en) * | 2021-05-13 | 2021-09-10 | 王宇 | Network knowledge point organization method and device based on directory tree |
| CN114281823A (en) * | 2021-12-17 | 2022-04-05 | 北京百度网讯科技有限公司 | Table processing method, device, equipment, storage medium and product |
| CN116720490A (en) * | 2023-08-11 | 2023-09-08 | 北京久其金建科技有限公司 | Data importing method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001008045A1 (en) * | 1999-07-22 | 2001-02-01 | Ori Software Development Ltd. | Method for organizing directories |
| CN101826088A (en) * | 2009-03-05 | 2010-09-08 | 中兴通讯股份有限公司 | Device and method for configuring and storing information model |
| CN101840427A (en) * | 2010-04-15 | 2010-09-22 | 北京数码大方科技有限公司 | Data processing method and device |
-
2011
- 2011-01-24 CN CN 201110025142 patent/CN102096711A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001008045A1 (en) * | 1999-07-22 | 2001-02-01 | Ori Software Development Ltd. | Method for organizing directories |
| CN101826088A (en) * | 2009-03-05 | 2010-09-08 | 中兴通讯股份有限公司 | Device and method for configuring and storing information model |
| CN101840427A (en) * | 2010-04-15 | 2010-09-22 | 北京数码大方科技有限公司 | Data processing method and device |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646111A (en) * | 2012-02-16 | 2012-08-22 | 中国测绘科学研究院 | Knowledge base-based fast construction method of common correlation information query tree |
| CN102819558A (en) * | 2012-06-28 | 2012-12-12 | 用友软件股份有限公司 | Data display device and data display method |
| CN102902811A (en) * | 2012-10-19 | 2013-01-30 | 北京金和软件股份有限公司 | Database design method for quickly generating tree structure |
| CN102902811B (en) * | 2012-10-19 | 2016-09-14 | 北京金和软件股份有限公司 | A kind of database design method quickly generating tree construction |
| CN103761273A (en) * | 2014-01-08 | 2014-04-30 | 兴天通讯技术（天津）有限公司 | Tree structure node attribute configuration method and system |
| CN105096202A (en) * | 2014-05-19 | 2015-11-25 | 中国石油化工股份有限公司 | Method for processing resource evaluation data |
| CN104133900A (en) * | 2014-08-04 | 2014-11-05 | 浪潮通用软件有限公司 | Definition description method of 360-degree treeview |
| CN106484591A (en) * | 2016-09-23 | 2017-03-08 | 上海爱数信息技术股份有限公司 | A kind of collecting method based on distributed system and acquisition system |
| CN108694261A (en) * | 2017-04-10 | 2018-10-23 | 中国石油天然气股份有限公司 | Method and device for constructing equipment model |
| CN108228694A (en) * | 2017-06-30 | 2018-06-29 | 勤智数码科技股份有限公司 | Catalogue generation method based on refining data item |
| CN107705209A (en) * | 2017-08-25 | 2018-02-16 | 重庆康洲大数据有限公司 | The big data association analysis method and device of medical insurance catalogue |
| CN108268650A (en) * | 2018-01-26 | 2018-07-10 | 北京金雨科创自动化技术股份有限公司 | The method and system of construction product database |
| CN109491997A (en) * | 2018-09-30 | 2019-03-19 | 中铁第勘察设计院集团有限公司 | The method of structure category tree is quickly generated in management platform based on BIM technology |
| CN109491997B (en) * | 2018-09-30 | 2022-04-01 | 中铁第一勘察设计院集团有限公司 | Method for rapidly generating structure directory tree in management platform based on BIM technology |
| CN109729407A (en) * | 2018-12-10 | 2019-05-07 | 视联动力信息技术股份有限公司 | A kind of catalog indication method and device |
| CN111506552B (en) * | 2019-01-30 | 2023-10-31 | 宁波创元信息科技有限公司 | Dynamic database design method and system of tree structure |
| CN111506552A (en) * | 2019-01-30 | 2020-08-07 | 宁波创元信息科技有限公司 | Dynamic database design method and system of tree structure |
| CN110084564A (en) * | 2019-04-24 | 2019-08-02 | 李振 | ICE framework for item data management |
| CN110084564B (en) * | 2019-04-24 | 2021-07-02 | 李振 | ICE architecture for project data management |
| CN110222050A (en) * | 2019-05-15 | 2019-09-10 | 中广核工程有限公司 | Method and system is transferred for nuclear power plant's three-dimensional database instrument association items |
| CN111159273A (en) * | 2019-12-31 | 2020-05-15 | 中国联合网络通信集团有限公司 | Data stream processing method, device, server and storage medium |
| CN113377895A (en) * | 2021-05-13 | 2021-09-10 | 王宇 | Network knowledge point organization method and device based on directory tree |
| CN114281823B (en) * | 2021-12-17 | 2023-08-29 | 北京百度网讯科技有限公司 | Form processing method, device, equipment, storage medium and product |
| CN114281823A (en) * | 2021-12-17 | 2022-04-05 | 北京百度网讯科技有限公司 | Table processing method, device, equipment, storage medium and product |
| US11954084B2 (en) | 2021-12-17 | 2024-04-09 | Beijing Baidu Netcom Science Technology Co., Ltd. | Method and apparatus for processing table, device, and storage medium |
| CN116720490A (en) * | 2023-08-11 | 2023-09-08 | 北京久其金建科技有限公司 | Data importing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102096711A (en) | Method for constructing tree structural directory in database | |
| Nayak et al. | Type of NOSQL databases and its comparison with relational databases | |
| CN103902544B (en) | A kind of data processing method and system | |
| CN102033954B (en) | Full text retrieval inquiry index method for extensible markup language document in relational database | |
| CN102122285B (en) | Data cache system and data inquiry method | |
| WO2015106711A1 (en) | Method and device for constructing nosql database index for semi-structured data | |
| CN106227800A (en) | The storage method of the big data of a kind of highlights correlations and management system | |
| Chauhan et al. | Using the advantages of NOSQL: a case study on MongoDB | |
| CN103646111A (en) | System and method for realizing real-time data association in big data environment | |
| CN104915450A (en) | HBase-based big data storage and retrieval method and system | |
| CN102737033A (en) | Data processing equipment and data processing method thereof | |
| CN104598840A (en) | Multi-data-source data processing method and system based on HTTP (hyper text transport protocol) | |
| CN102890678A (en) | Gray-code-based distributed data layout method and query method | |
| CN103678550A (en) | Mass data real-time query method based on dynamic index structure | |
| CN105069109A (en) | Dilatation method and system of distributed database | |
| Hlupić et al. | An overview of current data lake architecture models | |
| CN108153759B (en) | Data transmission method of distributed database, intermediate layer server and system | |
| CN104008205A (en) | Content routing inquiry method and system | |
| CN106777111B (en) | Time sequence retrieval index system and method for super-large scale data | |
| CN116775605A (en) | Industrial data management and sharing platform based on artificial intelligence | |
| CN115237914A (en) | Tamper-resistant index structure and construction, storage and query methods thereof | |
| CN108628969B (en) | Spatial keyword indexing method and platform and storage medium | |
| CN107992292A (en) | A kind of method defined by schema forms progress database | |
| Ma et al. | A transparent data middleware in support of multi-tenancy | |
| CN108984631A (en) | A kind of generation of big data and call method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110615 |