CN113127502B - Method, device and terminal equipment for dynamic expansion of relational database - Google Patents

Method, device and terminal equipment for dynamic expansion of relational database Download PDF

Info

Publication number
CN113127502B
CN113127502B CN201911425680.0A CN201911425680A CN113127502B CN 113127502 B CN113127502 B CN 113127502B CN 201911425680 A CN201911425680 A CN 201911425680A CN 113127502 B CN113127502 B CN 113127502B
Authority
CN
China
Prior art keywords
sub
information
target
relational database
access
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.)
Active
Application number
CN201911425680.0A
Other languages
Chinese (zh)
Other versions
CN113127502A (en
Inventor
彭程
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Intellifusion Technologies Co Ltd
Original Assignee
Shenzhen Intellifusion Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Intellifusion Technologies Co Ltd filed Critical Shenzhen Intellifusion Technologies Co Ltd
Priority to CN201911425680.0A priority Critical patent/CN113127502B/en
Publication of CN113127502A publication Critical patent/CN113127502A/en
Application granted granted Critical
Publication of CN113127502B publication Critical patent/CN113127502B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/242Query formulation
    • G06F16/243Natural language query formulation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Artificial Intelligence (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application is applicable to the technical field of computers, and provides a method, a device and terminal equipment for dynamically expanding a relational database, wherein the method comprises the following steps: acquiring an initial access statement and pre-established sub-table data information; analyzing the initial access statement to obtain access information; according to the access information, table structure information of the target sub-table is searched in the sub-table data information; modifying the initial access statement according to the table structure information and the access information of the target sub-table; and accessing the relational database by adopting the modified initial access statement. The method comprises the steps of searching the table structure information of the target sub-table in the sub-table data information, modifying the initial access statement according to the table structure information of the target sub-table, enabling the table structure field in the modified initial access statement to meet the table structure information of the relational database, accessing the relational database by adopting the modified initial access statement, reducing the error rate of access, and enabling the dynamic expansion of the relational database to be more convenient.

Description

Method, device and terminal equipment for dynamic expansion of relational database
Technical Field
The application belongs to the technical field of computers, and particularly relates to a method, a device and terminal equipment for dynamically expanding a relational database.
Background
In big data application, the storage of data is an important component, the database is a warehouse for storing data, and along with the development of products or projects, the data of the database needs to be updated and iterated, and a user can perform operations such as adding, inquiring, updating, deleting and the like on the data in the file.
The databases include relational databases and non-relational databases. The non-relational database can better use dynamic expansion of the data structure, and when the dynamic expansion requirement of the data structure exists, the data storage generally selects the non-relational database for storage, but the non-relational database has a complex structure, SQL support is not provided, and complex query is inconvenient. The relational database has simple structure, provides SQL support and convenient inquiry, but the dynamic expansion of the relational database is difficult.
Disclosure of Invention
The embodiment of the application provides a method, a device and terminal equipment for dynamically expanding a relational database, which can solve the problem of difficult dynamic expansion of the relational database.
In a first aspect, an embodiment of the present application provides a method for dynamically expanding a relational database, including:
Acquiring pre-created sub-table data information and an initial access statement for accessing a relational database, wherein the table structure information in the relational database is the same as the table structure information in the sub-table data information;
analyzing the initial access statement to obtain access information;
searching table structure information of a target sub-table in the sub-table data information according to the access information, wherein the target sub-table is the sub-table in which the information to be queried contained in the access information is located;
modifying the initial access statement according to the table structure information and the access information of the target sub-table to obtain a target access statement;
And accessing the relational database by adopting the target access statement.
Illustratively, searching the table structure information of the target sub-table in the sub-table data information according to the access information includes:
determining the creation time of the sub-table where the information to be queried is located according to the keywords;
according to the creation time, searching a table number of a target sub-table in a sub-table management table;
and according to the table number of the target sub-table, inquiring the table structure information corresponding to the table number in the table structure management table.
Illustratively, creating the sub-table data information includes:
and creating a primary key of the sub-table, wherein the primary key comprises a timestamp of the creation time of the sub-table.
Illustratively, after creating the sub-table data information, further comprising:
the sub-table data information is associated with the data route using the creation time of the sub-table.
In a second aspect, an embodiment of the present application provides a dynamic expansion device for a relational database, including: the system comprises a sub-table creating device and a data analyzing device, wherein the sub-table creating device is connected with the data analyzing device, and the data analyzing device is connected with a relational database, and the data analyzing device is used for:
The information acquisition module is used for acquiring pre-created sub-table data information and initial access sentences used for accessing a relational database, wherein the table structure information in the relational database is the same as the table structure information in the sub-table data information;
the data analysis module is used for analyzing the initial access statement to obtain access information;
The information query module is used for searching the table structure information of the target sub-table in the sub-table data information according to the access information, wherein the target sub-table is the sub-table in which the information to be queried contained in the access information is located;
the information reorganization module is used for modifying the initial access statement according to the table structure information of the target sub-table and the access information to obtain a target access statement;
And the data access module is used for accessing the relational database by adopting the target access statement.
In a third aspect, an embodiment of the present application provides a terminal device, including: a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the method of dynamic expansion of a relational database according to any of the first aspects above when executing the computer program.
In a fourth aspect, an embodiment of the present application provides a computer readable storage medium storing a computer program, where the computer program when executed by a processor implements a method for dynamically expanding a relational database according to any one of the first aspects.
In a fifth aspect, an embodiment of the present application provides a computer program product, which when run on a terminal device, causes the terminal device to perform the method for dynamic extension of a relational database according to any one of the first aspects above.
It will be appreciated that the advantages of the second to fifth aspects may be found in the relevant description of the first aspect, and are not described here again.
Compared with the prior art, the embodiment of the application has the beneficial effects that: according to the initial access statement, the table structure information of the target sub-table where the information to be queried is contained in the access information is searched in the sub-table data information, the initial access statement is modified according to the table structure information of the target sub-table, so that the table structure field in the modified initial access statement meets the table structure information of the relational database, the relational database is accessed by adopting the modified initial access statement, and the access statement of the relational database is adjusted according to the table structure of the target sub-table, so that the relational database can correctly execute the target access statement to perform data query and the like, the problem that the access table field does not exist or returns the data field is avoided, the access error rate is reduced, and the dynamic expansion of the relational database is more convenient.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a method application scenario for dynamic expansion of a relational database according to an embodiment of the present application;
FIG. 2 is a flow chart of a method for dynamic expansion of a relational database according to an embodiment of the present application;
FIG. 3 is a flow chart of a method for creating sub-table data information according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a dynamic expansion device for relational database and peripheral connection structure thereof according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a data analysis device according to an embodiment of the present application;
FIG. 6 is a schematic diagram of a table creating apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a terminal device according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a computer to which a method for dynamically expanding a relational database according to an embodiment of the present application is applicable.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth such as the particular system architecture, techniques, etc., in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
It should be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It should also be understood that the term "and/or" as used in the present specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes such combinations.
As used in the present description and the appended claims, the term "if" may be interpreted as "when..once" or "in response to a determination" or "in response to detection" depending on the context. Similarly, the phrase "if a determination" or "if a [ described condition or event ] is detected" may be interpreted in the context of meaning "upon determination" or "in response to determination" or "upon detection of a [ described condition or event ]" or "in response to detection of a [ described condition or event ]".
Furthermore, the terms "first," "second," "third," and the like in the description of the present specification and in the appended claims, are used for distinguishing between descriptions and not necessarily for indicating or implying a relative importance.
Reference in the specification to "one embodiment" or "some embodiments" or the like means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," and the like in the specification are not necessarily all referring to the same embodiment, but mean "one or more but not all embodiments" unless expressly specified otherwise. The terms "comprising," "including," "having," and variations thereof mean "including but not limited to," unless expressly specified otherwise.
At present, big data application is continuously improved, data storage is very important in big data application scenes, and along with continuous updating and increasing of data, a data structure needs to be dynamically expanded. At present, because of the difficulty in dynamic expansion of a relational database, people often select a non-relational database with easier dynamic expansion, but the phenanthrene relational database has the defects of no support of SQL, higher cost, low query speed and the like.
In order to solve the problems, the application provides a dynamic expansion method of a relational database, which is characterized in that table structure information of a target sub-table is queried in the sub-table data information in advance when the relational database is required to be accessed by establishing the sub-table data information, an initial access statement is modified according to the table structure information of the target sub-table, and the modified initial access statement is used for accessing the relational database, so that the inherent advantages of the relational database are reserved, and the problem of difficult dynamic expansion of the relational database is solved.
Fig. 1 is an application scenario schematic diagram of a method for dynamically expanding a relational database according to an embodiment of the present application, and referring to fig. 1, the method for dynamically expanding a relational database may be used to access a relational database. The user terminal 10 is configured to input an initial access statement, that is, information that the user needs to query, where the user terminal 10 sends the initial access statement to the server 20, the server 20 receives the initial access statement and parses the initial access statement, then modifies the initial access statement according to the parsed initial access statement and the sub-table data information, and finally accesses the relational database in the server 20 with the modified initial access statement.
Specifically, the server 20 may be specifically configured to obtain an initial access statement, parse the initial access statement, and obtain access information; according to the access information, table structure information of a target sub-table is searched in the sub-table data information; and modifying the initial access statement according to the table structure information of the target sub-table and the access information to obtain a target access statement.
The method for dynamically expanding the relational database according to the embodiment of the application is described in detail below with reference to fig. 1.
Fig. 2 is a schematic flow chart of a method for dynamically expanding a relational database provided by the application, and referring to fig. 2, the method for dynamically expanding the relational database is described in detail as follows:
S101, acquiring pre-created sub-table data information and an initial access statement for accessing a relational database, wherein the table structure information in the relational database is the same as the table structure information in the sub-table data information.
In this embodiment, the initial access statement is an access statement of information in the relational database that needs to be acquired, which is sent by the user, and because of the structural characteristics of the relational database, if the direct access to the relational database is easy to generate an error, the sub-table data information identical to the table structure information in the relational database is created in advance so as to facilitate the query of the table structure information in the relational database.
By way of example: the 3 month table structure information in one sales table of 2017 in the relational database includes: outputting a single person, an auditor and a signer; the 3 month table structure information in the 2017 sales table corresponding to the sub-table data information also includes: single person, auditor and signatory.
S102, analyzing the initial access statement to obtain access information;
In this embodiment, the parsing of the initial access statement refers to parsing of an SQL (structured query language-Structured Query Language) access statement, and parsing of the meaning of the SQL. The access information may include: key words, table structure fields in the initial access statement, expansion modes and other information. The specific content of the table structure to be queried can be determined according to the parsed table structure field, and the subsequent modification of the initial access statement is facilitated.
Alternatively, parsing the initial access statement may use SQL parsing means.
By way of example, keywords may be 2017, 3, 15, etc., and the table structure field may include name, number, course, person out, seller, etc., and the expansion may include data query, data augmentation, data modification, etc.
For example, if the user needs to query for the information of the person and auditor who are out of 3 months in 2017 and 7 months in 2017, the corresponding keywords are "3 months in 2017" and "7 months in 2017", the table structure field in the initial access sentence is the person and auditor, and the expansion manner is the query.
If the user needs to query 2016-level student names and numbers, the corresponding keywords are "2016-level", the table structure fields in the initial access sentence are student names and numbers, and the expansion mode is query.
It should be noted that, the dynamic extension manner of the relational database may include data query, data deletion, data addition, data modification, and the like. The data query refers to searching required information in a relational library, and extracting the required information from the relational database. Data deletion refers to deleting data present in a relational database. Data augmentation refers to adding some data to a relational database such that the added data exists in the relational database. Data modification refers to modifying data already present in a relational database.
S103, according to the access information, table structure information of a target sub-table is searched in the sub-table data information, wherein the target sub-table is the sub-table in which the information to be queried contained in the access information is located.
In one possible implementation manner, the implementation manner of step S103 may specifically be: and searching the table structure information of the target sub-table in the sub-table information data according to the key words.
Specifically, determining the creation time of a sub-table in which information to be queried is located according to the keywords;
Determining the table number of the sub-table according to the creation time;
And searching the table structure information of the target sub-table according to the table number of the sub-table.
In this embodiment, effective query information can be quickly extracted through the keywords, and then the target sub-table can be quickly positioned according to the keywords, so as to obtain table structure information of the target sub-table.
By way of example: if the user needs to inquire the information of the out person and the auditor in 2017 month 3 and 2017 month 7, the corresponding keywords are the information of the out person and the auditor in 2017 month 3 and 2017 month, the table structure field in the initial access statement is the information of the out person and the auditor, the expansion mode is the inquiry, the table structure information inquired in the sub-table information data according to the keyword of the information of 2017 month 3 is the information of the out person, the auditor and the auditor, and the table structure information inquired in the sub-table information data according to the keyword of 2017 month 7 is the information of the out person and the auditor.
In one possible implementation manner, the method for obtaining the target sub-table may include:
and searching a sub-table in which the information to be queried is located in the sub-table data information according to the access information to obtain a target sub-table.
Specifically, according to the keywords in the access information, searching the sub-table in which the information to be queried is located in the sub-table data information to obtain the target sub-table. The target sub-table can be one or a plurality of target sub-tables.
Since one sub-table characterizes information in one time range, if keywords in the access information exist in one time range in the sub-table data information, only one target sub-table exists, and if keywords in the access information exist in two or more time ranges in the sub-table data information, a plurality of target sub-tables exist.
For example: the No. 1 sub-table represents information of 1 month to 3 months in 2017, and the No. 2 sub-table represents information of 4 months to 6 months in 2017. If the keywords are "2017 month 1" and "2017 month 3", the corresponding sub-table is found to be the sub-table No. 1 according to the keyword "2017 month 1", and the corresponding sub-table is found to be the sub-table No. 1 according to the keyword "2017 month 3", and the target sub-table is the sub-table No. 1. If the keywords are "2017 month 1" and "2017 month 5", the corresponding sub-table is found to be the sub-table 1 according to the keyword "2017 month 1", and the corresponding sub-table is found to be the sub-table 2 according to the keyword "2017 month 5", and the target sub-table is the sub-table 1 and the sub-table 2.
In one possible implementation manner, the method for obtaining the target sub-table may include:
determining the creation time of the sub-table where the information to be queried is located according to the keywords;
and determining the table number of the sub-table according to the creation time to obtain the target sub-table.
In this embodiment, one sub-table corresponds to one table number, one table number corresponds to one creation time, and the creation time of the sub-table is associated with a keyword, so that the creation time of the target sub-table can be obtained by determining the keyword of the query, the table number of the target sub-table can be determined according to the creation time, and then the target sub-table is obtained, so that the query is more accurate and rapid.
By way of example: if the keyword is 2017 month 3, it can be determined that the time of creating the sub-table in which the information of 2017 month 3 is located is 2017 month 9 according to 2017 month 3, and the table number of the sub-table created in 2017 month 9 is 1, so that the information of 2017 month 3 to be queried is in the sub-table in which the table number is 1, and the sub-table in which the table number is 1 is the target sub-table.
In one possible implementation manner, the implementation manner of step S103 may specifically be:
determining the creation time of the sub-table where the information to be queried is located according to the keywords;
according to the creation time, searching a table number of a target sub-table in a sub-table management table;
and according to the table number of the target sub-table, inquiring the table structure information corresponding to the table number in the table structure management table.
S104, modifying the initial access statement according to the table structure information of the target sub-table and the access information to obtain a target access statement.
In one possible implementation, the implementation procedure of step S104 may include:
and modifying the initial access statement according to the table structure information of the target sub-table, the table structure field and the expansion mode to obtain a target access statement.
In one possible implementation, a method for obtaining a target access statement may include:
Deleting a corresponding table structure field of the information to be queried in the initial access statement to obtain a first candidate access statement under the condition that the information to be queried does not exist in the table structure information of the target sub-table;
under the condition that a target table structure field corresponding to the table structure information of the target sub-table cannot be searched in the initial access statement, adding the target table structure field in the initial access statement to obtain a second candidate access statement, wherein the table structure information of the target sub-table is the table structure information of the sub-table where the information to be queried in the initial access statement is located;
And recording the first candidate access statement and/or the second candidate access statement as the target access statement.
Specifically, each target sub-table corresponds to an initial access statement, if the table structure field in the initial access statement is the same as the table structure information of the target sub-table after query, the initial access statement of the current target sub-table is not modified, the initial access statement which is not modified is marked as a first sub-table access statement, if the table structure field in the initial access statement is different from the table structure information of the target sub-table, the initial access statement is required to be modified, and the modified initial access statement is marked as a second sub-table access statement. And finally, combining all the first sub-table access sentences and all the second sub-table access sentences to obtain a final access sentence of the relational database, and marking the final access sentence as a target access sentence.
In this embodiment, by deleting the table structure field corresponding to the information to be queried in the initial access statement and adding the corresponding target table structure field in the initial access statement to modify the initial access statement, the table structure field in the modified initial access statement can be matched with the table structure information of the relational database, so that the relational database can correctly execute the target access statement to query data, and the problem that the access table field does not exist or returns data field is avoided.
As an example, if a client needs to query for the out-person and auditor information in 2017, 3 months and 2017, 7 months, then the keywords in the access information are 2017, 3 months and 2017, the table structure field in the initial access statement is the out-person and auditor, and the expansion way is the query. When the sub-table data information is inquired that the table structure information of 3 months in 2017 has single person and auditor, the initial access statement of 3 months in 2017 is not modified; only a single person inquires the table structure information of 7 months in 2017 according to the sub-table data information, and then the table structure field of an auditor in an initial access statement for accessing 7 months in 2017 is deleted; the 7 months initial access statement and the 3 months initial access statement of the table structure field of the auditor are deleted to form a target access statement.
If the client needs to query the information of 3 months and 7 months in 2017, but does not specifically specify what information is, the table structure information of 3 months in 2017 is queried in the sub-table data information, and the table structure fields of the single person and the auditor are added in the initial access statement for accessing 3 months in 2017; when the sub-table data information is queried that only one single table structure information of 7 months in 2017 is found, a single field is added in the initial access statement of 7 months in 2017, and the initial access statement of 7 months after the table structure field is added and the initial access statement of 3 months after the table structure field is added are combined together to form a target access statement.
S105, accessing the relational database by adopting the target access statement.
In this embodiment, since the data information is not actually stored in the sub-table data information, the data information to be queried is still to be queried in the relational database. The table structure field in the target access statement corresponds to the table structure information of the table in the relational database where the data to be queried is located, so that the error rate during query is reduced, and the query efficiency is improved.
According to the embodiment of the application, through creating the sub-table data information, when a client needs to inquire the relational database, according to the initial access statement of the relational database sent by the client, firstly, the table structure information of the target sub-table is searched in the sub-table data information, the initial access statement is modified according to the table structure information, and finally, the modified initial access statement is used for accessing the relational database. The application has the advantages that the skill enjoys the functions and convenience of the relational database, the problem of difficult dynamic expansion of the relational database is solved, and the relational database can correctly execute the target access statement to perform data query without the problem that the access table field does not exist or returns data fields due to the fact that the access statement of the relational database is adjusted according to the table structure of the target sub table.
In one possible implementation, as shown in fig. 3, before acquiring the initial access statement and the pre-created sub-table data information, the method may further include:
s201, user data information is acquired.
In this embodiment, the user data information may be provided by the user, for example, the user data information may be a sales order of 2017 of the user or a sales order of 2017 of 3 months.
S202, creating sub-table data information according to the user data information.
In the present embodiment, the sub-table data information includes sub-tables, sub-table management tables, and table structures of sub-tables.
In this embodiment, creating the sub-table data information according to the user data information can ensure that the table structure information of the sub-table data information is identical to the table structure information of the data stored in the relational database. Creating sub-table data information can provide a bridge between the initial access statement and the relational database, so that the relational database is ensured to be smoother when accessed, and the error rate is low.
In one possible implementation manner, the implementation manner of step S202 may specifically be:
s2201, creating at least one sub-table by adopting a time sub-table strategy according to the user data information, and setting the table number of the sub-table, wherein one sub-table represents information in a time range.
In this embodiment, the time slicing strategy may be daily, weekly, monthly, yearly, etc.
By way of example: the user data information provided by the user is a sales table of 1 month to 5 months in 2017, wherein the sales table of 1 month and 2 months comprises single person and auditors, and the sales table of 3 months to 5 months only comprises single person. For the user information, when creating the sub-table, one sub-table can be created in one month, namely, one sub-table is created in 1 month and is marked as a sub-table 1, one sub-table is created in 2 months and is marked as a sub-table 2, one sub-table is created in 3 months and is marked as a sub-table 3, one sub-table is created in 4 months and is marked as a sub-table 4, and one sub-table is created in 5 months and is marked as a sub-table 5; two sub-tables may also be created, for example, 1-2 months to create a sub-table denoted as sub-table 1 and 3-5 months to create a sub-table denoted as sub-table 2. Of course, a sub-table divided by other time sub-tables may also be created for the above user data information.
The specific contents of the sales order are not described in the sub-table, but only what form of contents are included in each time in the sales order, for example: in the sales order of 2017, 1 month of the sub-table is recorded, and 1 month later is recorded with the single person and the auditor, but specific information such as the name of the single person and the name of the auditor is not recorded, namely, only one table structure is recorded in the sub-table, specific content is not recorded in the table structure, and the specific content is required to be searched or is required to be searched in a relational database. In addition, when dividing the time range of the division table, the same table structure information can be divided into one division table according to the table structure division, for example, the table structure information of 1 month to 3 months is the same, and 1-3 months is created as a table No. 1. The time ranges in which the sub-tables are created may differ from time ranges in the relational database, for example: in the relational database, the table 1 is the table 1, the table 2 is the table 2, the table 3 is the table three, and the table structure information of 1-3 months is the same, so that 1-3 months can be created into 1 sub-table when creating the sub-table.
In one possible implementation manner, step S2201 further includes:
and creating a primary key of the sub-table, wherein the primary key comprises a timestamp of the creation time of the sub-table.
In this embodiment, the primary key is created and the timestamp is added to the primary key to ensure that the creation time of the sub-table can be calculated through the primary key, so as to connect the sub-table data information with the data route creation, and facilitate the subsequent query or modification of the sub-table.
By way of example, the timestamp of 2019, 11, 8, 12:00:00 is 1573185600; the main key is 64-bit long type, when the main key is constructed, the time stamp can be stored in the high 32 bits, the random number + self-increment value can be stored in the low 32 bits, so that the uniqueness of the main key is not affected, and meanwhile, the time created by the main key can be obtained by shifting the main key to the right by 32 bits.
S2202, creating a sub-table management table for storing a table number corresponding to the sub-table and a time range of the sub-table, wherein the table number of the sub-table is associated with the creation time of the sub-table.
In this embodiment, since one sub-table pair uses one table number, one sub-table characterizes the information within a period of time, a sub-table management table is created, the table number of the sub-table and the time range of the sub-table are correspondingly stored, and after the specific table number of the sub-table can be located through the creation time of the sub-table, the information corresponding to the sub-table can be quickly found through the sub-table management table.
By way of example, the sales table in 2017, 1-2 months, is identified as the table 1, so the 1 st inner characterizes the sales information of 1 month and 2 months, the 3-5 months is identified as the table 2, and the 2 nd table characterizes the sales information of 3 months, 4 months and 5 months; if the time created by calculating the sub-table of the information to be queried according to the primary key is 5 months in 2017, the table number of the sub-table created in 5 months in 2017 can be obtained to be the sub-table No. 2, and the target sub-table to be queried can be positioned to be the sub-table No. 2.
S2203, creating a table structure of each sub-table and a table structure management table of each sub-table according to the user data information, wherein the table structure information is stored in the table structure.
In this embodiment, the table structure management table stores the table numbers of the sub-tables and the table structures of the corresponding sub-tables in the inner side. Because one sub-table corresponds to one table structure information, the creation of the table structure management table can quickly inquire the table structure information of the sub-table through the positioned table number of the sub-table. For example, the list is positioned to the sub-list No. 2, and the list structure management list can know that the list structure of the sub-list No. 2 is single. In one possible implementation, after step S202, the method may further include:
the sub-table data information is associated with the data route using the creation time of the sub-table.
In this embodiment, the function of the data route is to provide route scheduling of data, one sub-table corresponds to one creation time, the creation time of the sub-table is used to create a relationship between the data route and the sub-table data information, and the data route can be used to locate the target sub-table faster according to the creation time of the information to be queried. If no data route is used for inquiring data, more sub-tables may need to be inquired to inquire the target sub-table to be inquired, and if the data route is used for knowing which sub-table the data to be inquired is in, the corresponding sub-table can be directly inquired.
It should be understood that the sequence number of each step in the foregoing embodiment does not mean that the execution sequence of each process should be determined by the function and the internal logic, and should not limit the implementation process of the embodiment of the present application.
Corresponding to the method for dynamically expanding a relational database described in the above embodiments, fig. 4 shows a block diagram of a relational database dynamic expansion device according to an embodiment of the present application, and for convenience of explanation, only the relevant parts of the embodiment of the present application are shown.
Referring to fig. 4, the apparatus 100 includes: a sub-table creating means 110 and a data analyzing means 120, the sub-table creating means 110 being connected to the data analyzing means 120, the data analyzing means 120 being connected to a relational database, the sub-table creating means being further connected to an external data routing means, wherein, as shown in fig. 5, the data analyzing means 120 comprises:
an information acquisition module 121, a data analysis module 122, an information query module 123, an information reorganization module 124, and a data access module 125;
The information acquisition module 121 is configured to acquire pre-created sub-table data information and an initial access statement for accessing a relational database, where table structure information in the relational database is the same as table structure information in the sub-table data information;
the data analysis module 122 is configured to parse the initial access statement to obtain access information;
The information query module 123 is configured to search table structure information of a target sub-table in the sub-table data information according to the access information, where the target sub-table is a sub-table in which information to be queried included in the access information is located;
The information reorganizing module 124 is configured to modify the initial access statement according to the table structure information of the target sub-table and the access information, so as to obtain a target access statement;
and the data access module 125 is used for accessing the relational database by adopting the target access statement.
As shown in fig. 6, in one possible implementation, the sub-table creating device 110 includes:
a data acquisition module 111 for acquiring user data information;
The data creation module 112 is configured to create sub-table data information according to the user data information.
In one possible implementation, the sub-table data information includes a sub-table, a sub-table management table, and a table structure of the sub-table.
In one possible implementation, the data creation module 112 is specifically configured to:
The sub-table strategy unit is used for creating at least one sub-table by adopting a time sub-table strategy according to the user data information and setting the table number of the sub-table, wherein one sub-table represents information in a time range;
a sub-table management unit, configured to create a sub-table management table for storing a table number corresponding to the sub-table and a time range of the sub-table, where the table number of the sub-table is associated with the creation time of the sub-table;
And the table structure management unit is used for creating a table structure of each sub-table and a table structure management table of each sub-table according to the user data information, wherein the table structure information is stored in the table structure.
In one possible implementation, connected to the information query module 123 further comprises:
And the target query module is used for searching the sub-table where the information to be queried is in the sub-table data information according to the access information to obtain a target sub-table.
In one possible implementation, the access information includes: a key word, a table structure field in the initial access statement and an extension mode.
Optionally, searching the sub-table in which the information to be queried is located in the sub-table data information according to the access information to obtain a target sub-table may include:
And searching a sub-table in which the information to be queried is located in the sub-table data information according to the keywords to obtain a target sub-table.
Optionally, the searching the table structure information of the target sub-table in the sub-table data information according to the access information may include:
and searching the table structure information of the target sub-table in the sub-table information data according to the key words.
Optionally, modifying the initial access statement according to the table structure information of the target sub-table and the access information to obtain the target access statement may include:
and modifying the initial access statement according to the table structure information of the target sub-table, the table structure field and the expansion mode to obtain a target access statement.
Optionally, searching the sub-table in which the information to be queried is located in the sub-table data information according to the keyword to obtain the target sub-table may include:
determining the creation time of the sub-table where the information to be queried is located according to the keywords;
and determining the table number of the sub-table according to the creation time to obtain the target sub-table.
In one possible implementation, the information reorganizing module 124 may specifically be configured to:
Deleting a corresponding table structure field of the information to be queried in the initial access statement to obtain a first candidate access statement under the condition that the information to be queried does not exist in the table structure information of the target sub-table, wherein the first candidate access statement is an access statement after the table structure field is deleted by the initial access statement;
Under the condition that a target table structure field corresponding to the table structure information of the target sub-table cannot be searched in the initial access statement, adding the target table structure field in the initial access statement to obtain a second candidate access statement, wherein the table structure information of the target sub-table is the table structure information of the sub-table where the information to be queried in the initial access statement is located, and the second candidate access statement is an access statement after adding the target table structure field to the initial access statement;
And recording the first candidate access statement and/or the second candidate access statement as the target access statement.
It should be noted that, because the content of information interaction and execution process between the above devices/units is based on the same concept as the method embodiment of the present application, specific functions and technical effects thereof may be referred to in the method embodiment section, and will not be described herein.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-described functions. The functional units and modules in the embodiment may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit, where the integrated units may be implemented in a form of hardware or a form of a software functional unit. In addition, the specific names of the functional units and modules are only for distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working process of the units and modules in the above system may refer to the corresponding process in the foregoing method embodiment, which is not described herein again.
The embodiment of the present application also provides a terminal device, referring to fig. 7, the terminal device 400 may include: at least one processor 410, a memory 420, and a computer program stored in the memory 420 and executable on the at least one processor 410, the processor 410, when executing the computer program, performing the steps of any of the various method embodiments described above, such as steps S101 to S105 in the embodiment shown in fig. 2. Or the processor 410, when executing the computer program, performs the functions of the modules/units in the above-described device embodiments, such as the functions of the modules 121 to 125 shown in fig. 5.
By way of example, a computer program may be partitioned into one or more modules/units that are stored in memory 420 and executed by processor 410 to perform the present application. The one or more modules/units may be a series of computer program segments capable of performing specific functions for describing the execution of the computer program in the terminal device 400.
It will be appreciated by those skilled in the art that fig. 7 is merely an example of a terminal device and is not limiting of the terminal device, and may include more or fewer components than shown, or may combine certain components, or different components, such as input-output devices, network access devices, buses, etc.
The Processor 410 may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (DIGITAL SIGNAL Processor, DSP), application SPECIFIC INTEGRATED Circuit (ASIC), off-the-shelf Programmable gate array (Field-Programmable GATE ARRAY, FPGA) or other Programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 420 may be an internal storage unit of the terminal device, or may be an external storage device of the terminal device, such as a plug-in hard disk, a smart memory card (SMART MEDIA CARD, SMC), a Secure Digital (SD) card, a flash memory card (FLASH CARD), or the like. The memory 420 is used for storing the computer program as well as other programs and data required by the terminal device. The memory 420 may also be used to temporarily store data that has been output or is to be output.
The bus may be an industry standard architecture (Industry Standard Architecture, ISA) bus, an external device interconnect (PERIPHERAL COMPONENT, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, the buses in the drawings of the present application are not limited to only one bus or to one type of bus.
The method for dynamically expanding the relational database provided by the embodiment of the application can be applied to terminal equipment such as computers, tablet computers, notebook computers, netbooks, personal Digital Assistants (PDAs) and the like, and the embodiment of the application does not limit the specific type of the terminal equipment.
Taking the terminal device as a computer as an example. Fig. 8 is a block diagram showing a part of the structure of a computer provided with an embodiment of the present application. Referring to fig. 8, a computer includes: communication circuit 510, memory 520, input unit 530, display unit 540, audio circuit 550, wireless fidelity (WIRELESS FIDELITY, wiFi) module 560, processor 570, and power supply 580.
The following describes the components of the computer in detail with reference to fig. 8:
The communication circuit 510 may be used for receiving and transmitting signals during the process of receiving and transmitting information or communication, in particular, after receiving an image sample transmitted by the image acquisition device, processing the image sample by the processor 570; in addition, an image acquisition instruction is sent to the image acquisition apparatus. Typically, the communication circuitry includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier (Low Noise Amplifier, LNA), a duplexer, and the like. In addition, the communication circuit 510 may also communicate with networks and other devices through wireless communication. The wireless communication may use any communication standard or protocol including, but not limited to, global system for mobile communications (Global System of Mobile communication, GSM), general Packet Radio Service (GPRS), code division multiple access (Code Division Multiple Access, CDMA), wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA), long term evolution (Long Term Evolution, LTE)), email, short message Service (Short MESSAGING SERVICE, SMS), and the like.
The memory 520 may be used to store software programs and modules, and the processor 570 performs various functional applications and data processing of the computer by executing the software programs and modules stored in the memory 520. The memory 520 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, application programs required for at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data created according to the use of the computer (such as audio data, phonebooks, etc.), and the like. In addition, memory 520 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.
The input unit 530 may be used to receive input numeric or character information and to generate key signal inputs related to user settings and function control of the computer. In particular, the input unit 530 may include a touch panel 531 and other input devices 532. The touch panel 531, also referred to as a touch screen, may collect touch operations thereon or thereabout by a user (e.g., operations of the user on the touch panel 531 or thereabout by using any suitable object or accessory such as a finger, a stylus, etc.), and drive the corresponding connection device according to a predetermined program. Alternatively, the touch panel 531 may include two parts, a touch detection device and a touch controller. The touch detection device detects the touch azimuth of a user, detects a signal brought by touch operation and transmits the signal to the touch controller; the touch controller receives touch information from the touch detection device and converts it into touch point coordinates, which are then sent to the processor 570 and can receive commands from the processor 570 and execute them. In addition, the touch panel 531 may be implemented in various types such as resistive, capacitive, infrared, and surface acoustic wave. The input unit 530 may include other input devices 532 in addition to the touch panel 531. In particular, other input devices 532 may include, but are not limited to, one or more of a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a trackball, mouse, joystick, etc.
The display unit 540 may be used to display information input by a user or information provided to the user and various menus of a computer. The display unit 540 may include a display panel 541, and optionally, the display panel 541 may be configured in the form of a Liquid crystal display (Liquid CRYSTAL DISPLAY, LCD), an Organic Light-Emitting Diode (OLED), or the like. Further, the touch panel 531 may cover the display panel 541, and when the touch panel 531 detects a touch operation thereon or thereabout, the touch operation is transferred to the processor 570 to determine a type of a touch event, and then the processor 570 provides a corresponding visual output on the display panel 541 according to the type of the touch event. Although in fig. 8, the touch panel 531 and the display panel 541 implement input and output functions of the computer as two independent components, in some embodiments, the touch panel 531 and the display panel 541 may be integrated to implement input and output functions of the computer.
Audio circuitry 550 may provide an audio interface between the user and the computer. The audio circuit 550 may convert the received audio data into an electrical signal, transmit the electrical signal to a speaker, and convert the electrical signal into a sound signal for output; on the other hand, the microphone converts the collected sound signals into electrical signals, which are received by the audio circuit 550 and converted into audio data, which are processed by the audio data output processor 570 and sent to, for example, another computer via the communication circuit 510, or which are output to the memory 520 for further processing.
WiFi belongs to a short-distance wireless transmission technology, and a computer can help a user to send and receive e-mails, browse web pages, access streaming media and the like through the WiFi module 560, so that wireless broadband Internet access is provided for the user. Although fig. 8 shows a WiFi module 560, it is understood that it does not belong to the essential constitution of a computer, and can be omitted entirely as required within the scope of not changing the essence of the invention.
The processor 570 is a control center of the computer and connects various parts of the entire computer using various interfaces and lines, and performs various functions of the computer and processes data by running or executing software programs and/or modules stored in the memory 520, and calling data stored in the memory 520, thereby performing overall monitoring of the computer. Optionally, the processor 570 may include one or more processing units; preferably, the processor 570 may integrate an application processor primarily handling operating systems, user interfaces, applications, etc., and a modem processor primarily handling wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 570.
The computer also includes a power supply 580 (e.g., a battery) for powering the various components, and preferably the power supply 580 can be logically coupled to the processor 570 via a power management system so as to provide for managing charging, discharging, and power consumption by the power management system.
Embodiments of the present application also provide a computer readable storage medium storing a computer program which, when executed by a processor, implements the steps of the various embodiments of a method for dynamically expanding a relational database as described above.
Embodiments of the present application provide a computer program product which, when run on a mobile terminal, causes the mobile terminal to perform the steps in the various embodiments of the method that enable dynamic expansion of a relational database as described above.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the present application may implement all or part of the flow of the method of the above embodiments, and may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include at least: any entity or device capable of carrying computer program code to a photographing device/terminal apparatus, recording medium, computer Memory, read-Only Memory (ROM), random access Memory (RAM, random Access Memory), electrical carrier signals, telecommunications signals, and software distribution media. Such as a U-disk, removable hard disk, magnetic or optical disk, etc. In some jurisdictions, computer readable media may not be electrical carrier signals and telecommunications signals in accordance with legislation and patent practice.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and in part, not described or illustrated in any particular embodiment, reference is made to the related descriptions of other embodiments.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus/network device and method may be implemented in other manners. For example, the apparatus/network device embodiments described above are merely illustrative, e.g., the division of the modules or units is merely a logical functional division, and there may be additional divisions in actual implementation, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection via interfaces, devices or units, which may be in electrical, mechanical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.

Claims (10)

1. A method for dynamic expansion of a relational database, comprising:
acquiring pre-created sub-table data information and an initial access statement for accessing a relational database, wherein the table structure information in the relational database is the same as the table structure information in the sub-table data information, and the sub-table data information comprises sub-tables, sub-table management tables and sub-table structures;
analyzing the initial access statement to obtain access information, wherein the access information comprises an expansion mode and a table structure field in the initial access statement;
searching table structure information of a target sub-table in the sub-table data information according to the access information, wherein the target sub-table is the sub-table in which the information to be queried contained in the access information is located;
modifying the initial access statement according to the table structure information and the access information of the target sub-table to obtain a target access statement;
Accessing the relational database by adopting the target access statement;
The modifying the initial access statement according to the table structure information and the access information of the target sub-table to obtain a target access statement comprises the following steps:
and modifying the initial access statement according to the table structure information of the target sub-table, the table structure field and the expansion mode to obtain a target access statement.
2. The method for dynamic expansion of a relational database according to claim 1, further comprising, prior to obtaining the pre-created sub-table data information and the initial access statement for accessing the relational database:
Acquiring user data information;
creating sub-table data information according to the user data information.
3. The method of dynamic expansion of a relational database of claim 2, wherein creating sub-table data information from the user data information comprises:
Creating at least one sub-table by adopting a time sub-table strategy according to the user data information, and setting a table number of the sub-table, wherein one sub-table represents information in a time range;
creating a sub-table management table for storing a table number corresponding to the sub-table and a time range of the sub-table, wherein the table number of the sub-table is associated with the creation time of the sub-table;
And creating a table structure of each sub-table and a table structure management table of each sub-table according to the user data information, wherein the table structure information is stored in the table structure.
4. A method of dynamically expanding a relational database according to any of claims 1 to 3, further comprising, prior to said looking up table structure information of a target sub-table in sub-table data information based on said access information:
and searching a sub-table in which the information to be queried is located in the sub-table data information according to the access information to obtain a target sub-table.
5. The method for dynamic expansion of a relational database of claim 4, wherein the access information comprises: a keyword;
searching the sub-table in which the information to be queried is located in the sub-table data information according to the access information to obtain a target sub-table, wherein the method comprises the following steps:
searching a sub-table in which the information to be queried is located in the sub-table data information according to the keywords to obtain a target sub-table;
According to the access information, searching the table structure information of the target sub-table in the sub-table data information, including:
and searching the table structure information of the target sub-table in the sub-table information data according to the key words.
6. The method for dynamically expanding a relational database according to claim 5, wherein searching the sub-table in which the information to be queried is located in the sub-table data information according to the keyword to obtain a target sub-table comprises:
determining the creation time of the sub-table where the information to be queried is located according to the keywords;
and determining the table number of the sub-table according to the creation time to obtain the target sub-table.
7. The method for dynamically expanding a relational database according to claim 5, wherein modifying the initial access statement according to the table structure information of the target sub-table and the access information to obtain a target access statement comprises:
Deleting a corresponding table structure field of the information to be queried in the initial access statement to obtain a first candidate access statement under the condition that the information to be queried does not exist in the table structure information of the target sub-table;
under the condition that a target table structure field corresponding to the table structure information of the target sub-table cannot be searched in the initial access statement, adding the target table structure field in the initial access statement to obtain a second candidate access statement, wherein the table structure information of the target sub-table is the table structure information of the sub-table where the information to be queried in the initial access statement is located;
And recording the first candidate access statement and/or the second candidate access statement as the target access statement.
8. A relational database dynamic expansion device, comprising: the system comprises a sub-table creating device and a data analyzing device, wherein the sub-table creating device is connected with the data analyzing device, the data analyzing device is connected with a relational database, and the data analyzing device is used for:
The information acquisition module is used for acquiring pre-created sub-table data information and initial access sentences used for accessing a relational database, wherein the table structure information in the relational database is the same as the table structure information in the sub-table data information, and the sub-table data information comprises sub-tables, sub-table management tables and sub-table structures;
the data analysis module is used for analyzing the initial access statement to obtain access information, wherein the access information comprises an expansion mode and a table structure field in the initial access statement;
The information query module is used for searching the table structure information of the target sub-table in the sub-table data information according to the access information, wherein the target sub-table is the sub-table in which the information to be queried contained in the access information is located;
the information reorganization module is used for modifying the initial access statement according to the table structure information of the target sub-table and the access information to obtain a target access statement;
the data access module is used for accessing the relational database by adopting the target access statement;
The modifying the initial access statement according to the table structure information and the access information of the target sub-table to obtain a target access statement comprises the following steps:
and modifying the initial access statement according to the table structure information of the target sub-table, the table structure field and the expansion mode to obtain a target access statement.
9. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements a method of dynamic expansion of a relational database according to any one of claims 1 to 7 when executing the computer program.
10. A computer readable storage medium storing a computer program, wherein the computer program when executed by a processor implements a method of dynamic expansion of a relational database according to any one of claims 1 to 7.
CN201911425680.0A 2019-12-31 2019-12-31 Method, device and terminal equipment for dynamic expansion of relational database Active CN113127502B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911425680.0A CN113127502B (en) 2019-12-31 2019-12-31 Method, device and terminal equipment for dynamic expansion of relational database

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911425680.0A CN113127502B (en) 2019-12-31 2019-12-31 Method, device and terminal equipment for dynamic expansion of relational database

Publications (2)

Publication Number Publication Date
CN113127502A CN113127502A (en) 2021-07-16
CN113127502B true CN113127502B (en) 2024-05-03

Family

ID=76771532

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911425680.0A Active CN113127502B (en) 2019-12-31 2019-12-31 Method, device and terminal equipment for dynamic expansion of relational database

Country Status (1)

Country Link
CN (1) CN113127502B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103823815A (en) * 2012-11-19 2014-05-28 中国联合网络通信集团有限公司 Server and database access method
CN108920607A (en) * 2018-06-27 2018-11-30 中国建设银行股份有限公司 Field finds method, apparatus and electronic equipment
CN109408526A (en) * 2018-10-12 2019-03-01 平安科技(深圳)有限公司 SQL statement generation method, device, computer equipment and storage medium
CN109614427A (en) * 2018-10-23 2019-04-12 平安科技(深圳)有限公司 The access method and device of Various database, storage medium and electronic equipment

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103823815A (en) * 2012-11-19 2014-05-28 中国联合网络通信集团有限公司 Server and database access method
CN108920607A (en) * 2018-06-27 2018-11-30 中国建设银行股份有限公司 Field finds method, apparatus and electronic equipment
CN109408526A (en) * 2018-10-12 2019-03-01 平安科技(深圳)有限公司 SQL statement generation method, device, computer equipment and storage medium
CN109614427A (en) * 2018-10-23 2019-04-12 平安科技(深圳)有限公司 The access method and device of Various database, storage medium and electronic equipment

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
关系数据库细粒度访问控制设计与实现;时杰;朱虹;周淳;胡红清;;华中科技大学学报(自然科学版)(10);全文 *
刘华杰 ; 丁斌 ; 王珏 ; .基于存储结构解析的Caché数据库可视化SQL查询研究与实现.硅谷.2013,(10),全文. *

Also Published As

Publication number Publication date
CN113127502A (en) 2021-07-16

Similar Documents

Publication Publication Date Title
CN105988996B (en) Index file generation method and device
CN107741937B (en) Data query method and device
US7756868B2 (en) Method for providing search results list based on importance information and system thereof
WO2018010527A1 (en) Data processing method, apparatus and system, and storage medium
US20090055398A1 (en) Retrieving mobile user context information using tokenized virtual dictionaries
CN107690637B (en) Connecting semantically related data using large-table corpus
CN108427761B (en) News event processing method, terminal, server and storage medium
US20160321268A1 (en) Entity-driven logic for improved name-searching in mixed-entity lists
CN111078986A (en) Data retrieval method, device and computer readable storage medium
CN111932198B (en) File auditing method and related products
US8489590B2 (en) Cross-market model adaptation with pairwise preference data
CN104636386A (en) Information monitoring method and device
EP3387556B1 (en) Providing automated hashtag suggestions to categorize communication
CN114840565A (en) Sampling query method, device, electronic equipment and computer readable storage medium
CN108491502B (en) News tracking method, terminal, server and storage medium
US20110208772A1 (en) Method and Apparatus for Providing a Search Tool in Connection with Address Management
CN113704291A (en) Data query method and device, storage medium and electronic equipment
CN113127502B (en) Method, device and terminal equipment for dynamic expansion of relational database
CN108012558B (en) Telephone number normalization and information discoverability
CN110532231B (en) File query method, file query device and terminal equipment
CN110300222B (en) Short message display method, system, terminal equipment and computer readable storage medium
KR101781995B1 (en) A method of updating points of interest database using key-word search log file
CN115344688B (en) Business data display method and device, electronic equipment and computer readable medium
US11609955B2 (en) Method and terminal device for managing application snippet
CN112883307B (en) Cache updating method and device and social network system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant