WO2024016594A1 - Procédé et appareil de mise en œuvre de pseudo-colonne, dispositif électronique et support d'enregistrement - Google Patents

Procédé et appareil de mise en œuvre de pseudo-colonne, dispositif électronique et support d'enregistrement Download PDF

Info

Publication number
WO2024016594A1
WO2024016594A1 PCT/CN2022/141533 CN2022141533W WO2024016594A1 WO 2024016594 A1 WO2024016594 A1 WO 2024016594A1 CN 2022141533 W CN2022141533 W CN 2022141533W WO 2024016594 A1 WO2024016594 A1 WO 2024016594A1
Authority
WO
WIPO (PCT)
Prior art keywords
pseudo
statement
target data
operator
column information
Prior art date
Application number
PCT/CN2022/141533
Other languages
English (en)
Chinese (zh)
Inventor
蒋伟
唐钰杰
苏飞
周国剑
曾令江
Original Assignee
天翼云科技有限公司
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 天翼云科技有限公司 filed Critical 天翼云科技有限公司
Publication of WO2024016594A1 publication Critical patent/WO2024016594A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/221—Column-oriented storage; Management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/242—Query formulation
    • G06F16/2433—Query languages
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases

Definitions

  • This application relates to the field of cloud computing and big data platforms, and in particular to a pseudo-column implementation method, device, electronic equipment and storage medium.
  • Oracle Database (Oracle) is a commercial database. Oracle is a closed-source database. You cannot add additional pseudo columns that your business needs in Oracle, and using Oracle will increase software costs.
  • Relational database management system Postgre Structured Query Language, PostgreSQL is the world's most powerful open source relational database, with a strong academic atmosphere and a high degree of freedom. It is a free database software.
  • PostgreSQL does not support Structured Query Language (Structured Query) for Oracle pseudo column information. Language, SQL) syntax, but PostgreSQL's open source agreement allows free modification of the source code to implement the SQL syntax of Oracle pseudo columns.
  • SQL Structured Query Language
  • Embodiments of the present application provide a pseudo-column implementation method, device, electronic device, and storage medium for querying pseudo-column information and standardizing the implementation process of multiple pseudo-column information.
  • embodiments of the present application provide a pseudo-column implementation method, including:
  • Receive a query statement the query statement is used to query target data;
  • the query statement includes a first statement and a second statement;
  • the operator calculates the first statement to obtain the pseudo column information, and the operator calculates the second statement to obtain the target data; the operator stores an execution function for calculating the first statement and a function for calculating the first statement. Calculate the execution function of the second statement;
  • the pseudo column information and the target data are combined to generate a pseudo list of tuples.
  • the above method does not add any additional calculations during the query process of pseudo-column information, thus minimizing the performance impact of computing pseudo-column information on the system. Merge pseudo-column information and target data into tuples to standardize the implementation process of multiple pseudo-column information.
  • the method also includes:
  • the query statement includes a third statement; the third statement is used to define the projection specification of the tuple pseudo-list;
  • the third statement is calculated by the operator, and the pseudo-list of tuples is projected.
  • the above method achieves unified projection calculation by projecting the pseudo-list of tuples.
  • the operator is used to calculate the first statement to obtain the pseudo column information, and the operator is used to calculate the second statement to obtain the target data, which specifically includes:
  • the operator In the i-th calculation, the operator is used to calculate the first statement to obtain the i-th pseudo column information, and the operator is used to calculate the second statement to obtain the i-th target data;
  • the 1st calculation After the 1st calculation, obtain the 1st pseudo column information to the 1st pseudo column information, and the 1st target data to the 1st target data; the i is greater than or equal to 1 and less than or equal to 1 Integer; the I is an integer greater than or equal to 1.
  • the above method uses operators to calculate the first statement and the second statement, and the execution state structure stores the pseudo column information and target data, thereby minimizing the impact of calculation, statistics, and collection of pseudo column information on the performance of the system.
  • merging the pseudo column information and the target data to generate a tuple pseudo list specifically includes:
  • the pseudo column element and the target data element are combined to obtain the tuple pseudo list.
  • the above method stores pseudo-column information and target data through tuple pseudo-lists, merges pseudo-column information and target data into tuples, and realizes unified management of pseudo-column information.
  • the method also includes:
  • the tuple pseudo-list is stored in the tuple table slot management tuple included in the operator.
  • the above method realizes unified management of tuple pseudo-lists by managing tuples in tuple table slots.
  • embodiments of the present application provide a pseudo-column implementation device, including:
  • a receiving module configured to receive a query statement, which is used to query target data; the query statement includes a first statement and a second statement;
  • a calculation module used to calculate the first statement through an operator to obtain pseudo-column information, and to calculate the second statement through the operator to obtain the target data; the operator stores the information used to calculate the first statement.
  • a processing module configured to merge the pseudo column information and the target data to generate a pseudo list of tuples.
  • the computing module is also used to:
  • the query statement includes a third statement; the third statement is used to define the projection specification of the tuple pseudo-list;
  • the third statement is calculated by the operator, and the pseudo-list of tuples is projected.
  • embodiments of the present application also provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor implements the above Any pseudo-column implementation method in the first aspect.
  • embodiments of the present application further provide a computer-readable storage medium.
  • a computer program is stored in the computer-readable storage medium.
  • the pseudo-column implementation of the first aspect is realized. method.
  • embodiments of the present application further provide a computer program product, including a computer program, which is executed by a processor to implement the pseudo-column implementation method in any one of the above-mentioned first aspects.
  • Figure 1 is a schematic diagram of an application scenario of a pseudo-column implementation method provided by an embodiment of the present application
  • Figure 2 is a flow chart of a pseudo-column implementation method provided by an embodiment of the present application.
  • Figure 3 is a schematic diagram of a query sentence input interface provided by an embodiment of the present application.
  • Figure 4 is a schematic diagram of pseudo column information and target data provided by an embodiment of the present application.
  • Figure 5 is a schematic diagram of another pseudo-column information and target data provided by an embodiment of the present application.
  • Figure 6 is a schematic diagram of a pseudo column element provided by an embodiment of the present application.
  • Figure 7 is a schematic diagram of a target data element provided by an embodiment of the present application.
  • Figure 8 is a representation of a tuple pseudo-column provided by an embodiment of the present application.
  • Figure 9 is a complete flow chart of a pseudo-column implementation provided by the embodiment of the present application.
  • Figure 10 is a schematic diagram of a device for pseudo-column implementation provided by an embodiment of the present application.
  • Figure 11 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.
  • Pseudo column in the embodiment of this application is a database term, which means that this column does not exist physically and is only constructed during query. Pseudo columns are usually freely allocated and cannot be modified by users. For example, each row of data in an Oracle table has a unique identifier (RowID) field. You can use RowID to quickly locate a corresponding data, because it marks the physical address corresponding to the record, which is unique.
  • RowID unique identifier
  • tuple in the embodiment of this application is a basic concept in a relational database.
  • a relation is a table. Each row in the table (that is, each record in the database) is a tuple, and each column is an attribute. ;In a two-dimensional table, tuples are also called rows.
  • SQL Structured Query Language
  • SQL Structured Query Language
  • PostgreSQL does not support the SQL syntax of Oracle pseudo columns, but PostgreSQL's open source agreement allows you to freely modify the source code to implement the SQL syntax of Oracle pseudo columns and use it for production and commercial use. If multiple pseudo columns are added without corresponding specifications, subsequent program failures will occur. Therefore, it is necessary to implement the SQL syntax of Oracle pseudo columns in PostgreSQL, implement query of pseudo columns, and standardize the information of multiple pseudo columns.
  • embodiments of the present application provide a pseudo column implementation method, device, electronic device, and storage medium. For example, receive a query statement, which is used to query target data.
  • the query statement includes a first statement and a second statement.
  • the operator is used to calculate the first statement to obtain the pseudo column information, and the operator is used to calculate the second statement to obtain the target data.
  • the operator stores an execution function for calculating the first statement and an execution function for executing the second statement. Merge pseudo column information and target data to generate a pseudo list of tuples.
  • SQL syntax compatible with Oracle pseudo columns and customized pseudo column functions can be realized, the development of pseudo columns can be standardized, and the development efficiency of pseudo columns can be improved.
  • users can submit query statements through the client and query pseudo column information and target data on the server.
  • a schematic diagram of an application scenario of an optional pseudo-column implementation method in this embodiment of the application includes a server 100 and a terminal 101.
  • the server 100 and the terminal 101 can achieve a communicable connection through the network, so as to Implement the pseudo column implementation method of this application.
  • the user can use the server 100 to interact with the terminal 101 through the network, such as receiving or sending messages.
  • Various client applications can be installed on the terminal 101, such as programming applications, web browser applications, search applications, etc.
  • the terminal 101 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, desktop computers, and so on.
  • the client installed on the terminal 101 is used to respond to the query statement submitted by the user and send the query statement to the server, so that the server can query the pseudo column information and target data.
  • the server 100 is configured to receive a query statement, which is used to query target data; the query statement includes a first statement and a second statement.
  • the operator is used to calculate the first statement to obtain the pseudo column information, and the operator is used to calculate the second statement to obtain the target data.
  • the operator stores an execution function for calculating the first statement and an execution function for executing the second statement. Merge pseudo column information and target data to generate a pseudo list of tuples.
  • the server 100 can be implemented as an independent server or a server cluster composed of multiple servers.
  • a flow chart of a pseudo-column implementation method provided by an embodiment of the present application may specifically include the following steps:
  • Step S201 Receive a query statement, which is used to query target data; the query statement includes a first statement and a second statement;
  • Step S202 Use the operator to calculate the first statement to obtain the pseudo column information, and use the operator to calculate the second statement to obtain the target data; the operator stores an execution function for calculating the first statement and an execution function for calculating the second statement. ;
  • Step S203 Merge the pseudo column information and the target data to generate a tuple pseudo list.
  • the user can input the query statement through the client; the client sends the query statement submitted by the user to the server, and the server processes it.
  • the user when the target data needs to be queried, the user starts the client through the terminal's operation interface; for example, the user can double-click the client icon to start the client.
  • the query statement input interface is displayed in the client's display interface; as shown in Figure 3, the user can enter the query statement in this interface.
  • the query statement is a statement written by SQL.
  • step S201 the client receives the query statement submitted by the user, converts the query statement submitted by the user into a format according to the grammar parsing rules, and then provides the query statement for use by the operator.
  • the query statement submitted by the user includes a first statement and a second statement.
  • the first statement in the query statement is used to query the pseudo column information; the second statement in the query statement is used to query the target data.
  • step S202 in the i-th calculation, the operator is used to calculate the first statement to obtain the i-th pseudo column information, and the operator is used to calculate the second statement to obtain the i-th target data.
  • the 1st pseudo column information to the 1st pseudo column information, and the 1st target data to the 1st target data are obtained.
  • i is an integer greater than or equal to 1 and less than or equal to I
  • I is an integer greater than or equal to 1.
  • each operator includes an execution function, an execution status structure, and a tuple table slot management tuple.
  • the execution function is used to calculate the query statement entered by the user.
  • the execution status structure is used to save all the information from the 1st to the ith time when the execution function calculates the query statement.
  • Tuple table slot management tuples are used to store tuple tables containing different information, including tuple pseudo-lists.
  • operators include top-level operators, projection operators and other operators. Different types of operators are called for calculation according to different query statements.
  • the first pseudo column information is obtained by calculating the first statement in the query statement submitted by the user through an operator.
  • the first target data is obtained by calculating the second statement in the query statement submitted by the user through an operator. Save the first pseudo column information and the first target data in the execution status structure contained in the operator.
  • the operator is used to calculate the first statement in the query statement submitted by the user to obtain the second pseudo column information.
  • the second target data is obtained by calculating the second statement in the query statement submitted by the user through an operator. After the second calculation is completed, a row will be added to the tuple consisting of the pseudo-column information saved for the first time and the corresponding target data, and the second pseudo-column information and target data will be saved to the execution status structure contained in the operator. in the body.
  • the operator is used to calculate the first statement in the query statement submitted by the user to obtain the i-th pseudo column information; the operator is used to calculate the second statement in the query statement submitted by the user to obtain the i-th target data.
  • a row will be added to the tuple consisting of the pseudo-column information saved in the i-1 calculation and the corresponding target data, and the i-th pseudo-column information and target data will be saved to the tuple contained in the operator. in the execution status structure.
  • i is an integer greater than or equal to 1 and less than or equal to I.
  • the embodiment of this application integrates the calculation process of collecting pseudo-column information into the operator calculation query statement, without adding other additional calculations, reducing the time for calculating pseudo-column information, and minimizing the impact of calculation and statistics of pseudo-column information on the system's performance. , this impact can be ignored in practical applications.
  • the field data corresponding to the pseudo-column information in different calculation times is collected through sources such as the statistical information stored in the execution status structure and the historical record information of the execution status structure. Among them, I is an integer greater than or equal to 1.
  • the pseudo column information queried by the user may be an Oracle pseudo column (RowNum).
  • RowNum returns the serialized numeric number of each row of data in the result set.
  • ROWNUM is a sequence, which is the order in which Oracle reads data from the data file or buffer. The first record with a RowNum value is 1, the second record with a RowNum value is 2, and so on.
  • the user enters a query statement on the client that wants to query integers greater than or equal to 2000, less than or equal to 2004, and RowNum information.
  • the server receives the user's query statement and converts the query statement submitted by the user into a format according to the grammar parsing rules for calculation by the operator.
  • the first pseudo column information is 1 and the first target data is 2000.
  • the pseudo column information and target data are stored in the execution status structure contained in the operator. in the body.
  • the second pseudo column information is 2 and the second target data is 2001.
  • the second pseudo column information and target data are stored in the execution included in the operator. in the status structure.
  • step S203 the first pseudo-column information to the I-th pseudo-column information are combined to generate a pseudo-column element. Merge the first target data to the I-th target data to generate target data elements. Merge the pseudo column elements and the target data elements to obtain a pseudo list of tuples.
  • the first pseudo-column information to the I-th pseudo-column information are combined to generate pseudo-column elements.
  • the first pseudo-column information to the fifth pseudo-column information are: 1, 2, 3, 4, and 5 respectively.
  • the first to fifth target data are: 2000, 2001, 2002, 2003, and 2004 respectively.
  • the pseudo-column elements are 1, 2, 3, 4, and 5 and the target data elements are 2000, 2001, 2002, 2003, and 2004. Merge the pseudo column element with the target data element.
  • the tuple pseudo-list is stored in the tuple table slot management tuple included in the operator, and the tuple pseudo-list is managed uniformly.
  • pseudo column elements and target data elements are merged to obtain a tuple pseudo list.
  • Tuple binding is used to prevent duplication of implementation during the implementation of pseudo-column information, or the query statement is calculated and run separately without obtaining the pseudo-column information and target data through tuples, resulting in obtaining the wrong pseudo-column. information and the condition of the target data.
  • the tuple pseudo-list is projected accordingly according to the projection specification defined by the third statement in the query statement.
  • the embodiment of this application uses an operator to calculate the third statement and project the pseudo-list of tuples. Because the pseudo column information is the same before and after projection, the tuples are the same before and after projection. Therefore, only the target data can be projected according to the projection specification defined in the third statement. After projection, the query results with pseudo-column information are returned to the client, so that the user can obtain the query results with pseudo-column information.
  • the pseudo column elements in the tuple pseudo list are 1, 2, and 3; the target data elements are -2000, -2001, and -2002.
  • the projection specification defined in the third statement entered by the user is to find the absolute value of the target data; then the tuple pseudo-list is projected. Because the pseudo-column information is 1, 2, and 3 before projection, and the pseudo-column information is 1, 2, and 3 after projection, the pseudo-column information is unchanged.
  • the tuple is 3 rows before projection and 3 rows after projection, the tuple is unchanged. So only the target data element is projected. After projection, the target data elements become 2000, 2001, and 2002, and the query results with pseudo column information are returned to the client.
  • the pseudo-column information queried by the user may be an Oracle level (Level) pseudo-column.
  • Level represents the number of iterations of the operator.
  • a mark field is defined in the operator to save the Level information.
  • Hierarchical queries scan one level of nodes each iteration. Level is initialized to 1 when entering the initial node. For the initial value of Level, Level is incremented by 1 for each additional iteration.
  • the query statement submitted by the user contains the first statement for searching for Level information
  • the data corresponding to the above marked field is returned to the user as pseudo column information.
  • the query statement submitted by the user does not contain the first statement used to search for Level information
  • the Level information will also be calculated, but will not be returned to the user.
  • the query statement receives a query statement and converts the query statement submitted by the user into a format according to the grammar parsing rules for use by the operator.
  • the query statement includes a first statement for querying the Level pseudo-column, a second statement for querying the target data, and a third statement for defining the projection specification of the tuple pseudo-list.
  • the operator is used to calculate the first statement to obtain the pseudo column information, and the operator is used to calculate the second statement to obtain the target data.
  • the tuple pseudo-list is projected; after the projection is completed, the query result with pseudo-column information is returned to the client, so that the user can obtain the query result with pseudo-column information.
  • the query statement submitted by the user only needs the operator to be calculated once to obtain the pseudo column information and target data.
  • the first pseudo column information is obtained by calculating the first statement in the query statement submitted by the user through an operator.
  • the first target data is obtained by calculating the second statement in the query statement submitted by the user through an operator. Save the first pseudo column information and the first target data in the execution status structure contained in the operator. Merge the pseudo column information and target data to obtain a pseudo list of tuples.
  • the tuple pseudo-list is projected; after the projection is completed, the query result with pseudo-column information is returned to the client, so that the user can obtain the query result with pseudo-column information.
  • all pseudo-column information is added by merging the target data and pseudo-column information to generate a tuple pseudo-list, thereby standardizing the pseudo-column information development process.
  • the operator calls the execution function to calculate the corresponding query statement, and uniformly calculates, collects and projects the pseudo column information, thereby uniformly managing the interface for obtaining query results.
  • this application provides a complete flow chart of pseudo column implementation.
  • Step S901 Receive a query statement, which includes a first statement, a second statement and a third statement;
  • Step S902 the operator is used to calculate the first statement to obtain the i-th pseudo column information, and the operator is used to calculate the second statement to obtain the i-th target data; i is greater than or equal to 1;
  • Step S903 Store the i-th pseudo column information and the i-th target data into the execution status structure included in the operator;
  • Step S904 After the I-th calculation, obtain the first pseudo-column information to the I-th pseudo-column information, and the first to I-th target data; I is an integer greater than or equal to 1;
  • Step S905 Combine the first pseudo-column information to the I-th pseudo-column information to generate pseudo-column elements
  • Step S906 Merge the first target data to the I-th target data to generate target data elements
  • Step S907 Merge the pseudo column elements and the target data elements to obtain a tuple pseudo list
  • Step S908 Store the tuple pseudo-list in the tuple table slot management tuple included in the operator;
  • Step S909 Calculate the third statement through the operator and project the tuple pseudo-list.
  • the embodiment of the present application provides a device for pseudo-column implementation, as shown in Figure 10.
  • the device includes: a receiving module 1001, a computing module 1002, and a processing module 1003, wherein:
  • the receiving module 1001 is used to receive a query statement, the query statement is used to query target data; the query statement includes a first statement and a second statement;
  • the calculation module 1002 is used to calculate the first statement through an operator to obtain the pseudo column information, and calculate the second statement through the operator to obtain the target data; the operator stores information for calculating the first statement The execution function and the execution function used to execute the second statement;
  • the processing module 1003 is configured to merge the pseudo column information and the target data to generate a tuple pseudo list.
  • calculation module 1002 is also used to:
  • the query statement includes a third statement; the third statement is used to define the projection specification of the tuple pseudo-list;
  • the third statement is calculated by the operator, and the pseudo-list of tuples is projected.
  • the processing module 1003 specifically Used for:
  • the operator In the i-th calculation, the operator is used to calculate the first statement to obtain the i-th pseudo column information, and the operator is used to calculate the second statement to obtain the i-th target data;
  • the 1st calculation After the 1st calculation, obtain the 1st pseudo column information to the 1st pseudo column information, and the 1st target data to the 1th target data; the i is greater than or equal to 1 and less than or equal to 1 Integer; the I is an integer greater than or equal to 1.
  • the processing module 1003 is specifically used to:
  • the pseudo column element and the target data element are combined to obtain the tuple pseudo list.
  • processing module 1003 is also used to:
  • the tuple pseudo-list is stored in the tuple table slot management tuple included in the operator.
  • An embodiment of the present application also provides an electronic device.
  • the electronic device 110 according to this embodiment of the present application is described below with reference to FIG. 11 .
  • the electronic device 110 shown in FIG. 11 is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present application.
  • the electronic device 110 is embodied in the form of a general electronic device.
  • the components of the electronic device 110 may include, but are not limited to: the above-mentioned at least one processor 111, the above-mentioned at least one memory 112, and a bus 113 connecting different system components (including the memory 112 and the processor 111).
  • Bus 113 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a processor, or a local bus using any of a variety of bus structures.
  • Memory 112 may include readable media in the form of volatile memory, such as random access memory (RAM) 1121 and/or cache memory 1122 , and may further include read-only memory (ROM) 1123 .
  • RAM random access memory
  • ROM read-only memory
  • the memory 112 may also include a program/utility 1125 having a set of (at least one) program modules 1124 including, but not limited to: an operating system, one or more application programs, other program modules, and program data. Each of the examples, or some combination thereof, may include the implementation of a network environment.
  • Electronic device 110 may also communicate with one or more external devices 114 (e.g., keyboard, pointing device, etc.), with one or more devices that enable a user to interact with electronic device 110 , and/or with one or more devices that enable the electronic device 110 110 Any device (such as a router, modem, etc.) that can communicate with one or more other electronic devices. This communication may occur through input/output (I/O) interface 115 .
  • the electronic device 110 may also communicate with one or more networks (eg, a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet) through the network adapter 116 . As shown, network adapter 116 communicates with other modules for electronic device 110 via bus 113 .
  • network adapter 116 communicates with other modules for electronic device 110 via bus 113 .
  • a computer-readable storage medium including instructions such as a memory 112 including instructions, is also provided, and the instructions can be executed by the processor 111 to complete the above pseudo-column implementation method.
  • the storage medium may be a non-transitory computer-readable storage medium.
  • the non-transitory computer-readable storage medium may be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc. .
  • a computer program product including a computer program, which when executed by the processor 111 implements any of the pseudo-column implementation methods provided by this application.
  • various aspects of a pseudo-column implementation method provided by this application can also be implemented in the form of a program product, which includes program code.
  • the program product is run on a computer device, the program code is used to The computer device is caused to execute the steps in the pseudo-column implementation method described above in this specification according to various exemplary embodiments of the present application.
  • the Program Product may take the form of one or more readable media in any combination.
  • the readable medium may be a readable signal medium or a readable storage medium.
  • the readable storage medium may include, for example, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or devices, or any combination thereof. More specific examples (non-exhaustive list) of readable storage media include: electrical connection with one or more conductors, portable disk, hard disk, random access memory (RAM), read only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above.
  • the program product for the pseudo-column implementation method of the embodiment of the present application may adopt a portable compact disk read-only memory (CD-ROM) and include the program code, and may be run on an electronic device.
  • CD-ROM portable compact disk read-only memory
  • the program product of the present application is not limited thereto.
  • a readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, apparatus or device.
  • the readable signal medium may include a data signal propagated in baseband or as part of a carrier wave carrying readable program code therein. Such propagated data signals may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above.
  • a readable signal medium may also be any readable medium other than a readable storage medium that can send, propagate, or transport the program for use by or in connection with an instruction execution system, apparatus, or device.
  • Program code embodied on a readable medium may be transmitted using any suitable medium, including but not limited to wireless, wireline, optical cable, RF, etc., or any suitable combination of the foregoing.
  • the program code for performing the operations of the present application can be written in any combination of one or more programming languages, including object-oriented programming languages, such as Java, C++, etc., and also includes conventional procedural programming. language, such as "C" or a similar programming language.
  • the program code may execute entirely on the user's electronic device, partly on the user's electronic device, as a stand-alone software package, partly on the user's electronic device and partly on a remote electronic device, or entirely on the remote electronic device or service Executed on the terminal.
  • the remote electronic devices may be connected to the user electronic device through any kind of network, such as a local area network (LAN) or a wide area network (WAN), or may be connected to an external electronic device, such as provided by an Internet service Business comes via Internet connection.
  • LAN local area network
  • WAN wide area network
  • embodiments of the present application may be provided as methods, systems, or computer program products. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
  • computer-usable storage media including, but not limited to, disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable image scaling device to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means, the instructions
  • the device implements the functions specified in a process or processes in the flowchart and/or in a block or blocks in the block diagram.
  • These computer program instructions may also be loaded onto a computer or other programmable image scaling device, causing a series of operating steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby executing on the computer or other programmable device.
  • Instructions provide steps for implementing the functions specified in a process or processes of a flowchart diagram and/or a block or blocks of a block diagram.

Landscapes

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

Abstract

Procédé et appareil de mise en œuvre de pseudo-colonne, dispositif électronique et support d'enregistrement, se rapportant au domaine de l'informatique en nuage et des plateformes de mégadonnées. Le procédé comprend : la réception d'une instruction d'interrogation, l'instruction d'interrogation étant utilisée pour interroger des données cibles, et l'instruction d'interrogation comprenant une première instruction et une seconde instruction (S201) ; la réalisation d'un calcul sur la première instruction au moyen d'un opérateur pour obtenir des informations de pseudo-colonne, et la réalisation d'un calcul sur la seconde instruction au moyen de l'opérateur pour obtenir des données cibles, une fonction d'exécution pour effectuer un calcul sur la première instruction et une fonction d'exécution pour effectuer un calcul sur la seconde instruction étant enregistrées dans l'opérateur (S202) ; et la fusion des informations de pseudo-colonne et des données cibles pour générer une pseudo-liste de tuples (S203). Selon le procédé, dans le processus d'interrogation de mise en œuvre d'informations de pseudo-colonne, aucun autre calcul supplémentaire n'est effectué, ce qui permet de réduire au maximum l'effet de calcul d'informations de pseudo-colonne sur les performances d'un système. Les informations de pseudo-colonne et les données cibles sont combinées en un tuple, ce qui permet de normaliser le processus de mise en œuvre d'une pluralité d'éléments d'informations de pseudo-colonne.
PCT/CN2022/141533 2022-07-19 2022-12-23 Procédé et appareil de mise en œuvre de pseudo-colonne, dispositif électronique et support d'enregistrement WO2024016594A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210849650.8A CN115292313A (zh) 2022-07-19 2022-07-19 一种伪列实现方法、装置、电子设备及存储介质
CN202210849650.8 2022-07-19

Publications (1)

Publication Number Publication Date
WO2024016594A1 true WO2024016594A1 (fr) 2024-01-25

Family

ID=83824089

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/141533 WO2024016594A1 (fr) 2022-07-19 2022-12-23 Procédé et appareil de mise en œuvre de pseudo-colonne, dispositif électronique et support d'enregistrement

Country Status (2)

Country Link
CN (1) CN115292313A (fr)
WO (1) WO2024016594A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115292313A (zh) * 2022-07-19 2022-11-04 天翼云科技有限公司 一种伪列实现方法、装置、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060036592A1 (en) * 2004-08-11 2006-02-16 Oracle International Corporation System for ontology-based semantic matching in a relational database system
CN112948419A (zh) * 2021-03-02 2021-06-11 广州海量数据库技术有限公司 查询语句处理方法及装置
CN114579561A (zh) * 2020-12-02 2022-06-03 北京金山云网络技术有限公司 数据处理方法和装置、存储介质
CN114637752A (zh) * 2022-03-29 2022-06-17 上海达梦数据库有限公司 一种连接查询语句处理方法、装置、设备及存储介质
CN115292313A (zh) * 2022-07-19 2022-11-04 天翼云科技有限公司 一种伪列实现方法、装置、电子设备及存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060036592A1 (en) * 2004-08-11 2006-02-16 Oracle International Corporation System for ontology-based semantic matching in a relational database system
CN114579561A (zh) * 2020-12-02 2022-06-03 北京金山云网络技术有限公司 数据处理方法和装置、存储介质
CN112948419A (zh) * 2021-03-02 2021-06-11 广州海量数据库技术有限公司 查询语句处理方法及装置
CN114637752A (zh) * 2022-03-29 2022-06-17 上海达梦数据库有限公司 一种连接查询语句处理方法、装置、设备及存储介质
CN115292313A (zh) * 2022-07-19 2022-11-04 天翼云科技有限公司 一种伪列实现方法、装置、电子设备及存储介质

Also Published As

Publication number Publication date
CN115292313A (zh) 2022-11-04

Similar Documents

Publication Publication Date Title
US11681695B2 (en) Aggregation in dynamic and distributed computing systems
CN109491989B (zh) 数据处理方法及装置、电子设备、存储介质
WO2020238597A1 (fr) Procédé, dispositif, système et support de mise à jour de données basés sur hadoop
JP2021170409A (ja) ラベルデータ処理方法、装置、機器及び記憶媒体
CN111949693B (zh) 一种数据处理装置、数据处理方法、存储介质及电子设备
WO2018196729A1 (fr) Procédé de traitement de requête, procédé d'enregistrement de source de données et moteur d'interrogation
CN108363741B (zh) 大数据统一接口方法、装置、设备及存储介质
US11232105B2 (en) Unified metrics computation platform
WO2023056946A1 (fr) Procédé et appareil de mise en cache de données et dispositif électronique
WO2023051125A1 (fr) Procédé de gestion de version de données structurées, appareil, et dispositif associé
WO2018045610A1 (fr) Procédé et dispositif d'exécution de tâche informatique distribuée
CN112307062B (zh) 数据库聚合查询方法、装置及系统
CN111221851A (zh) 一种基于Lucene的海量数据查询、存储的方法和装置
WO2024016594A1 (fr) Procédé et appareil de mise en œuvre de pseudo-colonne, dispositif électronique et support d'enregistrement
US10915541B2 (en) Generic API
US11216477B2 (en) System and method for performing semantically-informed federated queries across a polystore
CN116860941A (zh) 问答方法、装置、电子设备及存储介质
US11855910B2 (en) Configuration management of cloud resources for multiple providers and frameworks
CN111352963A (zh) 一种数据统计方法及装置
CN115544081A (zh) 数据查询方法、装置、电子设备及存储介质
WO2022220982A1 (fr) Exécution d'une interrogation de base de données sur de multiples bases de données
CN114281842A (zh) 一种数据库分表查询的方法及设备
CN107066330B (zh) 模块化数据分布计划生成方法及系统
CN116561106B (zh) 一种配置项数据管理方法及系统
CN111753017B (zh) 基于Kylin系统的维表处理方法、装置、电子设备及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22951850

Country of ref document: EP

Kind code of ref document: A1