会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明申请
    • PAGED COLUMN DICTIONARY
    • US20150142818A1
    • 2015-05-21
    • US14333224
    • 2014-07-16
    • Colin FlorendoCarsten ThielIvan SchreterMihnea AndreiAnil Kumar Goel
    • Colin FlorendoCarsten ThielIvan SchreterMihnea AndreiAnil Kumar Goel
    • G06F17/30
    • G06F17/30312
    • A request for an entry of a dictionary having multiple dictionary blocks may be received, where the dictionary stores string values associated with corresponding value identifiers (IDs) for dictionary compression. One of the dictionary blocks may be selectively loaded into memory, and the dictionary block that has been loaded into memory may be searched. A value ID directory may be constructed in memory, where the value ID directory includes last value IDs for the dictionary blocks, and each of the last value IDs is mapped to an index of one of the dictionary blocks that includes a string value for that last value ID. A separator directory may also be constructed in memory, where the separator directory includes separators for the dictionary blocks, and each of the separators is mapped to an index of one of the dictionary blocks that includes a string value for that separator.
    • 可以接收对具有多个字典块的字典的输入的请求,其中字典存储与用于字典压缩的相应值标识符(ID)相关联的字符串值。 一个字典块可以被选择性地加载到存储器中,并且可以搜索已经加载到存储器中的字典块。 值ID目录可以在存储器中构造,其中值ID目录包括字典块的最后值ID,并且每个最后的值ID被映射到包括该最后一个的字符串值的字典块之一的索引 值ID。 分隔符目录也可以在内存中构建,其中分隔符目录包括字典块的分隔符,并且每个分隔符都映射到包含该分隔符的字符串值的字典块之一的索引。
    • 16. 发明申请
    • MOVING TABLES ACROSS NODES IN AN IN-MEMORY DATABASE INSTANCE
    • 内存数据库中的动态表格
    • US20160147748A1
    • 2016-05-26
    • US14549806
    • 2014-11-21
    • Colin FlorendoIvan Schreter
    • Colin FlorendoIvan Schreter
    • G06F17/30
    • G06F17/303G06F17/30339G06F17/30958
    • The present disclosure involves systems, software, and computer implemented methods for moving a table from a source node to a destination node. In one example, the method includes receiving metadata associated with an in-memory database table stored at a source node. A table container is created responsive to receiving the metadata. The destination node sequentially requests, from the source node, portions of the table, wherein the table is serialized at the source node to provide a serialized sequence of table portions. Sequentially requesting comprises sending a request for a next portion of the table after processing a received portion, which includes receiving a portion of the serialized table, deserializing the received portion, adding the deserialized portion to the created table container, and in response to an end of file indication associated with the received portion, ending the requests and finalizing the table.
    • 本公开涉及用于将表从源节点移动到目的地节点的系统,软件和计算机实现的方法。 在一个示例中,该方法包括接收与存储在源节点处的存储器内数据库表相关联的元数据。 响应于接收元数据创建表容器。 目的地节点从源节点顺序地请求表的部分,其中表在源节点被序列化以提供表部分的序列化序列。 顺序请求包括在处理接收到的部分之后发送对表的下一部分的请求,其包括接收序列化表的一部分,对接收到的部分进行反序列化,将反序列化部分添加到创建的表容器中,并响应于结束 与所接收的部分相关联的文件指示,结束请求并完成表格。
    • 18. 发明授权
    • Moving tables across nodes in an in-memory database instance
    • 在内存数据库实例中的节点之间移动表
    • US09558216B2
    • 2017-01-31
    • US14549806
    • 2014-11-21
    • Colin FlorendoIvan Schreter
    • Colin FlorendoIvan Schreter
    • G06F17/30
    • G06F17/303G06F17/30339G06F17/30958
    • The present disclosure involves systems, software, and computer implemented methods for moving a table from a source node to a destination node. In one example, the method includes receiving metadata associated with an in-memory database table stored at a source node. A table container is created responsive to receiving the metadata. The destination node sequentially requests, from the source node, portions of the table, wherein the table is serialized at the source node to provide a serialized sequence of table portions. Sequentially requesting comprises sending a request for a next portion of the table after processing a received portion, which includes receiving a portion of the serialized table, deserializing the received portion, adding the deserialized portion to the created table container, and in response to an end of file indication associated with the received portion, ending the requests and finalizing the table.
    • 本公开涉及用于将表从源节点移动到目的地节点的系统,软件和计算机实现的方法。 在一个示例中,该方法包括接收与存储在源节点处的存储器内数据库表相关联的元数据。 响应于接收元数据创建表容器。 目的地节点从源节点顺序地请求表的部分,其中表在源节点被序列化以提供表部分的序列化序列。 顺序请求包括在处理接收到的部分之后发送对表的下一部分的请求,该接收部分包括接收序列化表的一部分,对接收到的部分进行反序列化,将反序列化部分添加到创建的表容器中,并响应于结束 与所接收的部分相关联的文件指示,结束请求并完成表格。
    • 20. 发明申请
    • LARGE STRING ACCESS AND STORAGE
    • 大量的访问和存储
    • US20150142819A1
    • 2015-05-21
    • US14524998
    • 2014-10-27
    • Colin FlorendoIvan SchreterMihnea Andrei
    • Colin FlorendoIvan SchreterMihnea Andrei
    • G06F17/30
    • G06F17/30312
    • Techniques for handling large string values in a string dictionary within an in-memory database system are presented. The string dictionary can be a paged-column main dictionary. For example, a value block of a dictionary may be loaded into memory, where the dictionary stores values for dictionary compression. The value block may include a first portion of a large string value and one or more logical pointers to one or more large string pages containing a remainder of the large string value. The large string value may be materialized into a contiguous location in memory, and a pointer to the materialized large string value may be created.
    • 介绍了在内存数据库系统中处理字符串字典中大字符串值的技术。 字典字典可以是分页列主字典。 例如,字典的值块可以被加载到存储器中,其中字典存储用于字典压缩的值。 值块可以包括大字符串值的第一部分和包含大字符串值的余数的一个或多个大字符串页的一个或多个逻辑指针。 大字符串值可以被实现到存储器中的连续位置,并且可以创建指向物化的大字符串值的指针。