会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明申请
    • ON-DISK OPERATIONS ON FRAGMENTS TO SUPPORT HUGE DATA SIZES
    • 片上的盘上操作支持巨大的数据尺寸
    • US20140281212A1
    • 2014-09-18
    • US13797664
    • 2013-03-12
    • Ivan SchreterDirk ThomsenColin FlorendoBlaine French
    • Ivan SchreterDirk ThomsenColin FlorendoBlaine French
    • G06F3/06
    • G06F3/0674G06F3/0611G06F3/0635G06F12/0888G06F17/30312
    • Data records of a data set can be stored in a plurality of main part fragments retained in on-disk storage. A size of the data set can be compared to an available size of main system memory. All of the plurality of main part fragments can be fully loaded into the main system memory when the available size of the main system memory is larger than the size of the data set. Alternatively, one or more of the of main part fragments can be paged into the main system memory on demand in response to a data access request when the available size of the main system memory is smaller than the size of the data set and the data access request can be satisfied by providing access to a subset of the main part fragments, or access can be provided directly to the on-disk main part fragments when the data access request involves random access for projection in the data set and the available size of the main system memory is smaller than the size of the data set.
    • 数据集的数据记录可以存储在保存在盘上存储器中的多个主要部分片段中。 可以将数据集的大小与主系统存储器的可用大小进行比较。 当主系统存储器的可用尺寸大于数据集的大小时,所有多个主要部分片段可以完全加载到主系统存储器中。 或者,当主系统存储器的可用尺寸小于数据集的大小和数据访问的大小时,响应于数据访问请求,主要部分片段中的一个或多个可以根据需要被分页到主系统存储器中 可以通过提供对主要部分片段的子集的访问来满足请求,或者当数据访问请求涉及数据集中的投影的随机访问以及数据集的可用大小时,可以直接向磁盘上的主要部分片段提供访问 主系统内存小于数据集的大小。
    • 62. 发明申请
    • Partitioning Data Within A Distributed Data Storage System Using Virtual File Links
    • 使用虚拟文件链接分布式数据存储系统中的数据分区
    • US20130117528A1
    • 2013-05-09
    • US13324826
    • 2011-12-13
    • Dirk ThomsenIvan Schreter
    • Dirk ThomsenIvan Schreter
    • G06F12/00
    • G06F17/30233
    • A record within a destination virtual file is generated on a destination node of a distributed data storage system. The record comprises (i) a link directed to a partition of a source virtual file stored on a source node and (ii) partition criteria characterizing the partition. The source virtual file is mapped to a chain of linked pages stored in a page buffer of the distributed data storage system and the partitioning criteria is used by at least one of the source node and the destination node to identify data associated with the partition. A request is later received at the destination node to access data defined by the destination virtual file. Data is provided, in response to the request, from the partition of the source virtual file stored on the source node using the link and the partitioning criteria. Related apparatus, systems, techniques and articles are also described.
    • 在分布式数据存储系统的目标节点上生成目标虚拟文件中的记录。 记录包括(i)指向存储在源节点上的源虚拟文件的分区的链接和(ii)表征分区的分区标准。 源虚拟文件被映射到存储在分布式数据存储系统的页面缓冲器中的链接页链,并且分割标准由源节点和目的地节点中的至少一个使用以识别与分区相关联的数据。 稍后在目的节点接收请求以访问由目的虚拟文件定义的数据。 根据请求,使用链接和分区标准从存储在源节点上的源虚拟文件的分区提供数据。 还描述了相关设备,系统,技术和物品。
    • 66. 发明申请
    • FAST ROW TO PAGE LOOKUP OF DATA TABLE USING CAPACITY INDEX
    • 快速浏览使用能力指数的数据表查询
    • US20160147904A1
    • 2016-05-26
    • US14553878
    • 2014-11-25
    • David WeinIvan Schreter
    • David WeinIvan Schreter
    • G06F17/30
    • G06F17/30952G06F12/0817G06F17/30312G06F17/30321G06F17/30327G06F17/30424G06F17/30595
    • The subject matter disclosed herein provides methods for determining the page on which a desired row position value is located. A table having a plurality of rows can be accessed. The rows can be distributed across one or more pages in an in-memory database. Each row can be associated with a unique row position value. Each page can be associated with a capacity that is representative of an amount of data stored on the page. A capacity index having a plurality of entries can be created to record changes in capacity between pages. Neighboring entries in the capacity index can have a different capacity. Each entry in the capacity index can correspond to a page. A page directory can be created based on the capacity index. The page directory can indicate all possible row position values associated with each page. Related apparatus, systems, techniques, and articles are also described.
    • 本文公开的主题提供了用于确定期望行位置值所位于的页面的方法。 可以访问具有多行的表。 这些行可以分布在内存数据库中的一个或多个页面上。 每行可以与唯一的行位置值相关联。 每个页面可以与表示页面上存储的数据量的容量相关联。 可以创建具有多个条目的容量索引以记录页面之间的容量变化。 容量指标中的相邻条目可以具有不同的容量。 容量索引中的每个条目可以对应一个页面。 可以基于容量索引创建页面目录。 页面目录可以指示与每个页面相关联的所有可能的行位置值。 还描述了相关装置,系统,技术和制品。
    • 68. 发明申请
    • Transient and Persistent Representation of a Unified Table Metadata Graph
    • 统一表元数据图的瞬态和持续表示
    • US20160147445A1
    • 2016-05-26
    • US14553215
    • 2014-11-25
    • Ivan SchreterDavid WeinThorsten Glebe
    • Ivan SchreterDavid WeinThorsten Glebe
    • G06F3/06G06F17/30
    • G06F17/30339G06F17/30584
    • Loading of table metadata into memory of an in-memory database is initiated. The table metadata is persisted across pages in a page chain. Thereafter, a plurality of metadata objects are materialized into memory that each include an object handle pinning an underlying persisted page in the page chain. The objects are populated with data from the underlying persisted pages. Subsequently, for one to many object relationships, a vector of object handles is generated that comprises a plurality of transient handles that each point to a different instance of a respective transient object. Alternatively, for one to one object relationships or many to one object relationships, an object handle to point to a respective linked object is generated. Related apparatus, systems, techniques and articles are also described.
    • 启动将表元数据加载到内存数据库的内存中。 表元数据在页链中的页面上持久化。 此后,将多个元数据对象实现到存储器中,每个元数据对象包括在页链中固定底层持久页面的对象句柄。 这些对象用来自底层持久化页面的数据填充。 随后,对于一对多对象关系,生成对象句柄的向量,其包括多个瞬态句柄,每个临时句柄指向相应的瞬时对象的不同实例。 或者,对于一对一对象关系或多对一关系,生成指向相应链接对象的对象句柄。 还描述了相关设备,系统,技术和物品。