会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • Scalable retrieval of data entries using an array index or a secondary key
    • 使用数组索引或辅助密钥可扩展检索数据条目
    • US20070112795A1
    • 2007-05-17
    • US11280797
    • 2005-11-15
    • Daniel TravisonJohn Messec
    • Daniel TravisonJohn Messec
    • G06F7/00
    • G06F17/30327G06F17/3033Y10S707/99932
    • 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.
    • 示例性实施例通过使用数据结构的组合来确定辅助键的索引值来改进对动态排序列表的索引的查找时间和修改成本,反之亦然。 更具体地,示例性实施例提供二叉树(例如,平衡二叉树)与查找表(例如,线性动态哈希表)的组合,以通过阵列索引或次要密钥提供对条目的可伸缩检索。 例如,给定一个密钥,其散列返回平衡二叉树内的节点布局。 然后可以在运行时使用该定位来确定数据记录的索引值,从而实现近实时查询成本。 还要注意,修改,如重排序,插入和删除,成为二叉树中节点深度的函数,而不是数据数组中记录数的线性函数。