Abstract: Disclosed is a computer program stored in a computer-readable storage medium including encoded commands according to an exemplary embodiment of the present disclosure. When the computer program is executed by one or more processors, the computer program allows the one or more processors to perform a method for managing undo information in a database management system (DBMS). The method may include: forming undo information corresponding to an update request by a first transaction in response to the update request by the first transaction in the database management system (DBMS); determining an undo memory chunk to be allocated to the undo information from an undo memory pool on a memory, the undo memory chunk having a variable size; and maintaining the undo information on a space of the memory by using the determined undo memory chunk.

Abstract: Disclosed is a non-transitory computer readable medium storing computer program which is executable by one or more processors. The computer program allows the one or more processors to execute the following operations for performing a pivot query when the computer program is executed by one or more processors and the operations may include: identifying one or more classification factors from a query when receiving the query from a client; generating a search table for filtering records corresponding to at least one row of a table corresponding to the query based on the one or more classification factors; and generating a result table by performing an aggregation of a plurality of records included in the table based on the search table.

Abstract: According to an exemplary embodiment of the present disclosure, a computer program stored in a computer readable storage medium is disclosed. The computer program causes one or more processors to perform operations below for performing calibration when the one or more processors are executed, and the operations may include: an operation of inputting an image to an object detection model and performing object detection by using the object detection model; an operation of acquiring bounding box information on the detected object; and an operation of performing calibration on an image acquisition device based on at least a part of the bounding box information.

Abstract: According to one exemplary embodiment of the present disclosure, disclosed is a computer program stored in a computer readable storage medium. The computer program causes operations for improving data retrieval performance to be performed when the computer program is executed by one or more processors of a computing device, and the operations include: an operation of initiating an index search for retrieving a target index key from a root node of an index tree; an operation of performing an index tree search to a child node along a link connected to the child node; and an operation of reading a currently searched node and determining whether to change an index search route.

Abstract: Disclosed is a method for a hub module to perform flow-based processing, which includes: receiving a flow including at least one task; a stored procedure generation allowance step for allowing a DBMS module to generate a stored procedure based on the flow when the received flow is not a previously processed flow, wherein the stored procedure includes at least one of a flow query, meta information, and exception handling information, and the meta information includes execution time of the flow query, execution results, and user information; and a stored procedure call allowance step for allowing the DBMS module to call the stored procedure corresponding to a previously processed flow when the received flow is the previously processed flow.

Abstract: Provided are a method, an apparatus, and a computer program stored in a computer readable medium for conducting an arithmetic operation efficiently in a database management server.

Abstract: Disclosed is a computer program stored in a computer readable storage medium, which includes encoded commands, in which when the computer program is executed by one or more processors of a computer system, the computer program allows the one or more processor to perform the following steps for indexing. The steps may include: deciding that a first leaf node is split in a tree index data structure including a parent node including one or more indexes, and the first leaf node and a second leaf node which are leaf nodes linked with the parent node through a pointer; generating a 1-2nd leaf node which is a next node of the first leaf node; storing in the 1-2nd leaf node an index to be split among indexes stored in the first leaf node; and linking the 1-2nd leaf node and the second leaf node to the pointer.

Abstract: Disclosed is a method performed by a database management system (DBMS) according to an exemplary embodiment of the present disclosure. The method may create a database index structure for pointing a data storage location based on monitoring result information depending on a monitoring algorithm in the database management system. The database index structure may at least partially include a sub index structure of a first level and a sub index structure of a second level which is lower than the first level, the second level sub index structure may include a plurality of columns, a first column among the plurality of columns of the second level sub index structure may include key values, a second column among the plurality of columns of the second level sub index structure may include ROWID values corresponding to rows of a data block, and a third column among the plurality of columns of the second level sub index structure may include optimized index values set based on the monitoring result information.

Abstract: Disclosed is a computer program stored in a computer readable medium according to an exemplary embodiment of the present disclosure. The computer program performs the following method for moving an extent when being executed by one or more processors of a computing device and the method may include: deciding, by the processor, movement of an extent stored in a first disk in a disk space in which the disk space includes at least two disks; determining, by the processor, whether there is writing work for the extent based on extent mapping information for the extent; changing, by the processor, a state of the extent to read-only in the extent mapping information when there is no writing work for the extent; moving, by the processor, the extent positioned in the first disk to a second disk; and updating, by the processor, the extent mapping information based on completion of the disk movement of the extent.

Abstract: Provided is a computer program stored in a computer readable storage medium, which includes encoded commands, wherein when the computer program is executed by one or more processors of a computer system, the computer program allows the one or more processor to perform the following steps for generating a balanced parse tree having an optimized height, the steps including: receiving a token stream including at least one token—the token stream meets an associate law—; determining whether an n-ary parse tree is full—the n-ary parse tree includes at least one node and the at least one node each includes n or less child nodes; a first node generating operation of generating a node while increasing a height of the parse tree based on the token stream when the n-ary parse tree is full; and a second node generating operation of generating the node while maintaining the height of the parse tree based on the token stream when the n-ary parse tree is not full.

Abstract: An exemplary embodiment of the present disclosure discloses a management method of a main memory database which is performed in a computing apparatus including one or more processors and a main memory which stores commands executable in the processors. The management method of the main memory database includes: generating a first log including information of change, which includes at least one of a data insert, an update, and a deletion of data recorded in the main memory, in the main memory; recording the first log in a permanent storing device to generate a first log file; and performing log compaction on the first log to generate a second log including only effective change information among change information on data in order to reduce a size of the log.

Abstract: Disclosed are a message scheduling method performed by one or more processors of a computing device and a device thereof. The message scheduling method performed by one or more processors of the computing device may include: receiving, by a control thread, a message from a client; adding, by the control thread, a flag to the received message based on contents of the message; storing, by the control thread, the message with the flag added in a queue; and allocating, by the control thread, the message stored in the queue to each worker thread based on the flag.

Abstract: Disclosed is a method for processing a query in a database management system (DBMS). The method includes: receiving a main query including a subquery; identifying an indication to independently manage a processing result for the subquery in the received main query by parsing the received main query—the indication including storing type information for the processing result of the subquery; determining a storing type for independently storing the processing result for the subquery based on the indication; and storing the processing result for the subquery independently from the processing result for the main query while performing processing for the main query according to the determined storing type.

Abstract: According to an exemplary embodiment of the present invention, disclosed is a method for synchronizing query results between databases executed in a first database server. The method may include: determining synchronization of a materialized view present in a second database server which is remotely located from the first database server in which the materialized view refers to a master table present in the first database server and the first database server and the second database server are heterogeneous; generating a synchronization command to be transmitted to the second database server in response to determination of synchronization; and transmitting the generated synchronization command to the second database server to allow the second database server to synchronize the materialized view present in the second database server and the master table present in the first database server.

Abstract: Provided is a method for executing a query in a DBMS. The method may include: receiving a query statement including a pivot operator—the query statement being associated with an original table; executing a pivot operation for the original table in response to reception of the query statement; generating BLOB data by serializing at least a part of an execution result of the pivot operation to a BLOB type; and storing the generated BLOB data in a pivot table.

Abstract: Provided is a method for executing a query in a DBMS. The method may include: receiving a query statement for requesting BLOB data serialized to a binary large object (BLOB) type and stored in a pivot table; determining name information for one or more columns generated as a result of a pivot operation included in respective pivot columns of the pivot table by querying a pivot name table for the pivot table; determining internal storage type information of the pivot table by querying a pivot meta table for the pivot table; and generating output information for the BLOB data corresponding to the query statement based on the determined name information and internal storage type information.

Abstract: A query complier analyzes a query to identify a correlated scalar subquery. The query complier transforms the query having the correlated scalar subquery into a query of AGGREGATION INNER/OUTER JOIN or MAX1ROW INNER/OUTER JOIN depending on a result type of the correlated scalar subquery. The AGGREGATION INNER/OUTER JOIN performs JOIN on the rows of the correlated scalar subquery with the rows of a main query and AGGREGATE on the joined rows and returns a result of the joined rows of the main query and aggregation value thereof. The MAX1ROW INNER/OUTER JOIN performs JOIN on the rows of the correlated scalar subquery with the rows of a main query, raises Error when the number of joined rows of the subquery is two or more and returns a result of the row of the main query and the joined row of the subquery.

Abstract: The present invention provides an apparatus and method for processing a query in a relational database system having a hybrid storage of a memory tablespace and a disk tablespace, with the configuration of the present invention, by extending a table partitioning technology in order for the relational database system to use the disk tablespace and memory tablespace in a hybrid manner, it is possible to implement data discrimination due to different data storages in one logical table and create scan plans in compliance with the difference in the storages, thereby establishing an optimal scan plan to the query intended to access the storages having different properties.

Abstract: Disclosed is a program for security management in a database, which is stored in a computer readable medium to allow a computer to perform steps including: reading one or more data encrypted at a column level from a persistent storage medium or a memory; decrypting one or more data encrypted at the column level to generate one or more decrypted data; generating an index table based on the one or more generated decrypted data; and performing an operation of encrypting the generated index table at a block level.

Abstract: A node search method, comprising: setting a current time value as a traversing time value; searching descendent nodes to perform a traversing from a root node to a leaf node according to a tree index data structure; determining whether a preset traversing condition is satisfied by comparing an update time value, which indicates a time when a change to a searched descendent node is made, with the traversing time value; depending on whether the traversing proceeding condition is satisfied, re-performing a traversing from a parent node or continuing traversing to the searched descendent node; and terminating the traversing at a leaf node where no descendent node exists.