Method and apparatus for providing data from a data source to a data consumer, and for rendering data from a data provider to an interface
    4.
    发明申请
    Method and apparatus for providing data from a data source to a data consumer, and for rendering data from a data provider to an interface 有权
    用于从数据源向数据消费者提供数据,以及用于将数据从数据提供者呈现到接口的方法和装置

    公开(公告)号:US20050210057A1

    公开(公告)日:2005-09-22

    申请号:US11124860

    申请日:2005-05-09

    IPC分类号: G06F7/00 G06F17/30

    摘要: An apparatus and methodology are provided for obtaining data from a data source and providing the data to a data consumer, as well as for providing data from a data provider to an interface. The method provides for sending an origin request message to a data provider, receiving an origin response message having a presentation schema and data, and rendering the data to an interface by providing a presentation language representation of the data according to the presentation schema.

    摘要翻译: 提供了一种用于从数据源获取数据并将数据提供给数据消费者以及从数据提供者向接口提供数据的装置和方法。 该方法提供了向数据提供者发送原始请求消息,接收具有呈现模式和数据的原始响应消息,并且通过根据呈现模式提供数据的呈现语言表示,将数据呈现给接口。

    Scalable retrieval of data entries using an array index or a secondary key
    5.
    发明申请
    Scalable retrieval of data entries using an array index or a secondary key 有权
    使用数组索引或辅助密钥可扩展检索数据条目

    公开(公告)号:US20070112795A1

    公开(公告)日:2007-05-17

    申请号:US11280797

    申请日:2005-11-15

    IPC分类号: G06F7/00

    摘要: Example embodiments improve the lookup times and modification costs of indexing on a dynamically sorted list by using a combination of data structures to determine index values for secondary keys and vice versa. More specifically, exemplary embodiments provide a combination of a binary tree (e.g., a balanced binary tree) with a lookup table (e.g., linear dynamic hash table) to provide scalable retrieval of entries by either an array index or a secondary key. For example, given a key, a hash thereof returns a node placement within a balanced binary tree. This positioning can then be used at runtime to determine an index value for a data record, resulting in a near real-time lookup cost. Also note that modifications, such as reordering, insertions, and deletions, become a function of the nodes depth in the binary tree, rather than a linear function of number of records within the data array.

    摘要翻译: 示例性实施例通过使用数据结构的组合来确定辅助键的索引值来改进对动态排序列表的索引的查找时间和修改成本,反之亦然。 更具体地,示例性实施例提供二叉树(例如,平衡二叉树)与查找表(例如,线性动态哈希表)的组合,以通过阵列索引或次要密钥提供对条目的可伸缩检索。 例如,给定一个密钥,其散列返回平衡二叉树内的节点布局。 然后可以在运行时使用该定位来确定数据记录的索引值,从而实现近实时查询成本。 还要注意,修改,如重排序,插入和删除,成为二叉树中节点深度的函数,而不是数据数组中记录数的线性函数。