中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

33 records (took 0.017 seconds)

    Efficient and non-disruptive online defragmentation with record locking
    1.
    发明授权
    Efficient and non-disruptive online defragmentation with record locking 有权

    公开(公告)号：US11204911B2

    公开(公告)日：2021-12-21

    申请号：US16824933

    申请日：2020-03-20

    Applicant: SAP SE

    Inventor： Ji Hoon Jang ,  Seungho Yoo ,  Yong Sik Kwon ,  Hyeong Seog Kim

    IPC: G06F16/23 ,  G06F9/46 ,  G06F9/52 ,  G06F16/25

    Abstract: Methods, systems, and computer-readable storage media for online defragmentation of memory in database systems by applying an IX-lock to each table having data stored in a marked page in a set of marked pages, generating a record map including key-value pairs, each being associated with a record location in a marked page, a value of each key-value pair initially set to a first value, iteratively executing the online defragmentation to delete data from marked pages and add the data to non-sparse pages, at least one iteration including applying a try-lock to a record in a marked page, and at iterations of the online defragmentation, updating the record map to change the value of at least one key-value pair from the first value to the second value, the second value representing that data of a marked page has been deleted from the marked page and added to a non-sparse page.

    FAST RESTART OF APPLICATIONS USING SHARED MEMORY
    4.
    发明申请
    FAST RESTART OF APPLICATIONS USING SHARED MEMORY 审中-公开

    公开(公告)号：US20190324648A1

    公开(公告)日：2019-10-24

    申请号：US16503122

    申请日：2019-07-03

    Applicant: SAP SE

    Inventor： Yong Sik Kwon ,  Jaeyun Noh ,  Juchang Lee ,  Ji Hoon Jang ,  Sang Kyun Cha

    IPC: G06F3/06 ,  G06F9/54 ,  G06F9/46

    Abstract: Technologies are described for restarting an application while maintaining data in memory (e.g., using shared memory). For example, shared memory can be associated with an application. The shared memory can also be associated with a holder process to maintain the shared memory from the time the application stops to the time the application starts again. When the application starts, the shared memory can be associated with the started application. In addition, restart of in-memory databases can be provided using shared memory. For example, in-memory data can be maintained when a database process or database management system stops and starts (e.g., during a restart).

    Hybrid database table stored as both row and column store
    5.
    发明授权
    Hybrid database table stored as both row and column store 有权

    公开(公告)号：US10346383B2

    公开(公告)日：2019-07-09

    申请号：US15260181

    申请日：2016-09-08

    Applicant: SAP SE

    Inventor： Yongsik Yoon ,  Chanho Jeong ,  Juchang Lee ,  Chang Bin Song ,  Yong Sik Kwon ,  Sang Kyun Cha

    IPC: G06F16/27 ,  G06F16/2453 ,  G06F16/2455 ,  G06F16/9535 ,  G06F16/23 ,  G06F16/22

    Abstract: A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.

    IN-MEMORY DATABASE FOR MULTI-TENANCY
    7.
    发明申请
    IN-MEMORY DATABASE FOR MULTI-TENANCY 有权

    公开(公告)号：US20230112355A1

    公开(公告)日：2023-04-13

    申请号：US18064924

    申请日：2022-12-12

    Applicant: SAP SE

    Inventor： Yong Sik Kwon ,  Yongsik Yoon ,  Joo Yeon Lee ,  Oliver M. Steinau ,  Markus Hartmann

    IPC: G06F16/22 ,  G06F16/27 ,  G06F16/21 ,  G06F16/248 ,  G06F16/951

    Abstract: An in-memory database server hosting a tenant of a multi-tenant software architecture can receive a definition of a custom data field that is unique to an organization having isolated access to the tenant. The custom data field can extend a standard table defined by central metadata stored at a system tenant of the multi-tenant software architecture. Tenant private metadata that includes the definition can be stored in memory accessible only to the tenant. A tenant-dependent table that includes the custom data field can be formed, for example by retrieving central metadata defining the standard table from the system tenant and adding the custom data field using the definition. The tenant-dependent table can be presented for access via a database client at the organization. Related systems, articles of manufacture, and computer-implemented methods are disclosed.

    EFFICIENT AND NON-DISRUPTIVE ONLINE DEFRAGMENTATION WITH RECORD LOCKING
    8.
    发明申请
    EFFICIENT AND NON-DISRUPTIVE ONLINE DEFRAGMENTATION WITH RECORD LOCKING 有权

    公开(公告)号：US20210294786A1

    公开(公告)日：2021-09-23

    申请号：US16824933

    申请日：2020-03-20

    Applicant: SAP SE

    Inventor： Ji Hoon Jang ,  Seungho Yoo ,  Yong Sik Kwon ,  Hyeong Seog Kim

    IPC: G06F16/23 ,  G06F16/25 ,  G06F9/52 ,  G06F9/46

    Abstract: Methods, systems, and computer-readable storage media for online defragmentation of memory in database systems by applying an IX-lock to each table having data stored in a marked page in a set of marked pages, generating a record map including key-value pairs, each being associated with a record location in a marked page, a value of each key-value pair initially set to a first value, iteratively executing the online defragmentation to delete data from marked pages and add the data to non-sparse pages, at least one iteration including applying a try-lock to a record in a marked page, and at iterations of the online defragmentation, updating the record map to change the value of at least one key-value pair from the first value to the second value, the second value representing that data of a marked page has been deleted from the marked page and added to a non-sparse page.

    OPTIMAL SORT KEY COMPRESSION AND INDEX REBUILDING
    9.
    发明申请
    OPTIMAL SORT KEY COMPRESSION AND INDEX REBUILDING 审中-公开

    公开(公告)号：US20190034467A1

    公开(公告)日：2019-01-31

    申请号：US15658671

    申请日：2017-07-25

    Applicant: SAP SE

    Inventor： Yong Sik Kwon ,  Kunsoo Park ,  Cheol Yoo

    IPC: G06F17/30

    CPC classification number: G06F16/2272 ,  G06F16/2228 ,  G06F16/23

    Abstract: A system and method, including determining, by a processor, distinction bit positions for index keys of a database index; determining, by the processor, concatenation of the bits of the index keys; and generating a record of the concatenation. Other systems and methods include collecting, by a processor, index keys of a database index in parallel, wherein data pages of a target table are evenly distributed to a plurality of processor cores; scanning, by each of the cores the data pages to extract compressed keys and corresponding record identifiers; sorting, by a plurality of the processor cores, pairs of the compressed key and corresponding record identifier in accordance with a parallel sorting algorithm; generating an index tree in a bottom-up fashion; and storing a record of the generated index tree.

Patent Agency Ranking