公开(公告)号：US20150213107A1

公开(公告)日：2015-07-30

申请号：US14595138

申请日：2015-01-12

Applicant: Electronics and Telecommunications Research Institute

Inventor： Kyoung Hyun PARK ,  Mai Hai THANH ,  Hun Soon LEE ,  Chang Soo KIM ,  Mi Young LEE

IPC: G06F17/30

CPC classification number: G06F16/2365

Abstract: An apparatus of managing data according to the present invention includes a query processor, a page monitor, a page layout manager and a data storage manager. The query processor processes a user query. At the time of processing the user query, the page monitor collects accessed column information and selectivity information of accessed columns from the query processor and collects access page information from a data storage manager to create page monitoring information. The page layout manager creates page column group information by grouping columns adjacent to each other for each page at a predetermined time interval based on the page monitoring information. The data storage manager stores data in a main memory by reconfiguring a page based on the page column group information for a candidate page of which an access frequency is greater than a predetermined access frequency based on the page monitoring information.

Abstract translation: 根据本发明的管理数据的装置包括查询处理器，页面监视器，页面布局管理器和数据存储管理器。 查询处理器处理用户查询。 在处理用户查询时，页面监视器从查询处理器收集所访问列的访问列信息和选择性信息，并从数据存储管理器收集访问页面信息以创建页面监视信息。 页面布局管理器基于页面监视信息以预定的时间间隔对每个页面彼此相邻的列进行分组来创建页面列组信息。 数据存储管理器基于页面监视信息，基于用于访问频率大于预定访问频率的候选页面的页面列组信息重新配置页面来将数据存储在主存储器中。

公开(公告)号：US20190179818A1

公开(公告)日：2019-06-13

申请号：US16193419

申请日：2018-11-16

Applicant: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE

Inventor： Hun Soon LEE

IPC: G06F16/2455 ,  G06F7/14

Abstract: A merge join method by a merge join system including a database is provided. The merge join system unequally divides data after a current position of a join column participating in merge join in the database into K partitions, K being greater than 2, and compares the first value of each of remaining partitions excluding the first partition from the K partitions with a value to be searched for the merge join, in order to check whether the first value and the value to be searched satisfy a specific condition. Further, the merge join system determines a partition in which the value to be searched is expected to exist based on a comparison result, and applies a k-ary search to the determined partition.

公开(公告)号：US20150212741A1

公开(公告)日：2015-07-30

申请号：US14606916

申请日：2015-01-27

Applicant: Electronics and Telecommunications Research Institute

Inventor： Hun Soon LEE ,  Mi Young LEE ,  Chang Soo KIM ,  Kyoung Hyun PARK ,  Mai Hai THANH

IPC: G06F3/06

CPC classification number: G06F3/0613 ,  G06F3/0647 ,  G06F3/068 ,  G06F3/0685

Abstract: Disclosed is an apparatus for in-memory data management includes a hybrid memory including a plurality of types of memories with different characteristics and a storage engine. The storage engine rearranges data among the plurality of memories by the unit of a page by monitoring workloads for data stored in the memories and reconfigures a page layout by the unit of the page based on a data access characteristic of an application for each of pages constituting each of the plurality of memories.

Abstract translation: 公开了一种用于存储器内数据管理的装置，包括具有不同特性的多种类型的存储器和存储引擎的混合存储器。 存储引擎通过监视存储在存储器中的数据的工作负载来重新排列多个存储器中的数据，并通过基于页面单元的页面单元重新配置页面布局，每个页面构成 每个多个存储器。

公开(公告)号：US20180157711A1

公开(公告)日：2018-06-07

申请号：US15622451

申请日：2017-06-14

Applicant: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE

Inventor： Hun Soon LEE

IPC: G06F17/30

CPC classification number: G06F16/24545 ,  G06F16/2453 ,  G06F16/2455

Abstract: Disclosed herein are a method and an apparatus for processing a query based on a heterogeneous computing device. The method includes generating, by the apparatus for processing a query, an optimal query execution plan for processing the query using all of a plurality of computation resources included in a heterogeneous computation resource and dividing data corresponding to the query depending on a data division ration included in the query execution plan and allocating the divided data to each computation resource. Further, the divided data are each processed based on each computation resource.