RUNTIME CODE VISUALIZATION
    1.
    发明申请
    RUNTIME CODE VISUALIZATION 审中-公开
    运行代码可视化

    公开(公告)号:US20150199262A1

    公开(公告)日:2015-07-16

    申请号:US14157016

    申请日:2014-01-16

    IPC分类号: G06F11/36

    CPC分类号: G06F11/3664

    摘要: Disclosed herein are system, method, and computer program product embodiments for visualizing code execution of a multi-threaded server. An embodiment operates by receiving a log of contents of a plurality of thread stacks over a time period of code execution and receiving a rule for populating a graphical interface with thread stack contents. It also includes populating the graphical interface with a representation of the thread stack contents over time.

    摘要翻译: 这里公开了用于可视化多线程服务器的代码执行的系统,方法和计算机程序产品实施例。 实施例通过在代码执行的时间段内接收多个线程栈的内容的日志来操作,并且接收用于填充具有线程栈内容的图形界面的规则。 它还包括使图形界面填充线程堆栈内容随时间的表示。

    VERSIONED BLOOM FILTER
    4.
    发明申请

    公开(公告)号:US20160147806A1

    公开(公告)日:2016-05-26

    申请号:US14552905

    申请日:2014-11-25

    IPC分类号: G06F17/30

    摘要: Disclosed herein are system, method, and computer program product embodiments for bloom filter versioning. A request to add a new value to a first bitmap is received, wherein the first bitmap includes a bit sequence corresponding to a most recently added value. It is determined that the first bitmap has exceeded a threshold. A second bitmap is generated, the second bitmap including more bits than the first bitmap. The first bitmap is deleted based upon a determination that a number of readers accessing the first bitmap is zero.

    摘要翻译: 这里公开了用于布隆过滤器版本控制的系统,方法和计算机程序产品实施例。 接收向第一位图添加新值的请求,其中第一位图包括与最近添加的值对应的比特序列。 确定第一位图已经超过阈值。 生成第二位图,第二位图包括比第一位图更多的位。 基于确定访问第一位图的读取器的数量为零的第一位图被删除。

    INVERTED INDEXING
    5.
    发明申请
    INVERTED INDEXING 有权
    反转指数

    公开(公告)号:US20160147808A1

    公开(公告)日:2016-05-26

    申请号:US14552897

    申请日:2014-11-25

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30011 G06F17/30622

    摘要: Disclosed herein are system, method, and computer program product embodiments for inverted indexing. An embodiment operates by receiving a request to add a new document identifier (doc ID) to an inverted index. A memory block corresponding to where the doe ID is to be added is determined or located, and the available space remaining in the memory block is determined. If the memory block has available space, the doc ID is added to the memory block.

    摘要翻译: 本文公开了用于反向索引的系统,方法和计算机程序产品实施例。 实施例通过接收向反向索引添加新的文档标识符(doc ID)的请求来操作。 确定或定位对应于要添加多径ID的位置的存储块,并且确定存储块中剩余的可用空间。 如果内存块具有可用空间,则将文档ID添加到内存块。

    Inverted indexing
    6.
    发明授权

    公开(公告)号:US09971770B2

    公开(公告)日:2018-05-15

    申请号:US14552897

    申请日:2014-11-25

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30011 G06F17/30622

    摘要: Disclosed herein are system, method, and computer program product embodiments for inverted indexing. An embodiment operates by receiving a request to add a new document identifier (doc ID) to an inverted index. A memory block corresponding to where the doc ID is to be added is determined or located, and the available space remaining in the memory block is determined. If the memory block has available space, the doc ID is added to the memory block.

    N-bit Compressed Versioned Column Data Array for In-Memory Columnar Stores
    7.
    发明申请
    N-bit Compressed Versioned Column Data Array for In-Memory Columnar Stores 审中-公开
    用于内存列存储的N位压缩版本列数据数组

    公开(公告)号:US20160147447A1

    公开(公告)日:2016-05-26

    申请号:US14553435

    申请日:2014-11-25

    IPC分类号: G06F3/06 G06F17/30

    摘要: As part of a columnar in-memory database, value identifiers are inserted into a backing array in-memory until such time that it is determined that such backing array does not have sufficient capacity. A new backing array is then generated that includes the value identifiers in the old backing array and which has sufficient capacity. The old backing array can be flushed from memory when there are no active operations using such backing array. Such an arrangement allows for readers and non-structural writers to operate concurrently. Related apparatus, systems, techniques and articles are also described.

    摘要翻译: 作为列内存数据库的一部分,将值标识符插入到内存中的后台阵列中,直到确定此类后台阵列的容量不足为止。 然后生成新的后备阵列,其中包括旧的后备阵列中的值标识符,并且具有足够的容量。 当没有使用这种后备阵列的活动操作时,旧的后备阵列可以从内存刷新。 这种安排允许读者和非结构性作家同时进行操作。 还描述了相关设备,系统,技术和物品。