CONNECTION CONTROL METHOD AND CONNECTION CONTROL APPARATUS

    公开(公告)号:US20190327129A1

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

    申请号:US16368164

    申请日:2019-03-28

    Abstract: A connection control apparatus includes a memory and a processor coupled to the memory. The processor is configured to identify, upon detecting a change of a state of one or more servers included in a server group, a server in a synchronous standby state with respect to a primary server after the detection of the change from servers included in the server group after the detection of the change. The processor is configured to request, upon receiving an access request from a terminal, the terminal to connect to the identified server.

    Code processing technique
    2.
    发明授权
    Code processing technique 有权
    代码处理技术

    公开(公告)号:US09223809B2

    公开(公告)日:2015-12-29

    申请号:US13899878

    申请日:2013-05-22

    CPC classification number: G06F17/30292 H03M7/4031

    Abstract: A disclosed data structure of a phrase tree includes, as data of each node in the phrase tree, a data block including a first area for holding a code for a character or a character string, a second area for holding, for each character that will be used, an appearance sequential number of a second character that appears next to the character or the character string, and a third area for holding, according to the appearance sequential number, a number of appearances or a code corresponding to a character string comprising the character or the character string and the second character when the number of appearances exceeds a threshold.

    Abstract translation: 短语树的公开的数据结构包括作为短语树中的每个节点的数据的数据块,包括用于保存用于字符或字符串的代码的第一区域,用于保存每个字符的第二区域, 被使用,出现在字符或字符串旁边的第二个字符的外观顺序号,以及第三区域,用于根据外观顺序号保存与包括该字符串的字符串相对应的外观数或代码 字符或字符串和第二个字符,当出现次数超过阈值时。

    CODE PROCESSING TECHNIQUE
    3.
    发明申请
    CODE PROCESSING TECHNIQUE 有权
    代码处理技术

    公开(公告)号:US20140006457A1

    公开(公告)日:2014-01-02

    申请号:US13899878

    申请日:2013-05-22

    CPC classification number: G06F17/30292 H03M7/4031

    Abstract: A disclosed data structure of a phrase tree includes, as data of each node in the phrase tree, a data block including a first area for holding a code for a character or a character string, a second area for holding, for each character that will be used, an appearance sequential number of a second character that appears next to the character or the character string, and a third area for holding, according to the appearance sequential number, a number of appearances or a code corresponding to a character string comprising the character or the character string and the second character when the number of appearances exceeds a threshold.

    Abstract translation: 短语树的公开的数据结构包括作为短语树中的每个节点的数据的数据块,包括用于保存用于字符或字符串的代码的第一区域,用于保存每个字符的第二区域, 使用,出现在字符或字符串旁边的第二个字符的外观顺序号,以及第三区域,用于根据外观顺序号保存与包括该字符串的字符串相对应的外观数或代码 字符或字符串和第二个字符,当出现次数超过阈值时。

Patent Agency Ranking