Invention Grant
US08856138B1 Faster substring searching using hybrid range query data structures
有权
使用混合范围查询数据结构更快的子串搜索
- Patent Title: Faster substring searching using hybrid range query data structures
- Patent Title (中): 使用混合范围查询数据结构更快的子串搜索
-
Application No.: US13570761Application Date: 2012-08-09
-
Publication No.: US08856138B1Publication Date: 2014-10-07
- Inventor: Alexander Neubeck
- Applicant: Alexander Neubeck
- Applicant Address: US CA Mountain View
- Assignee: Google Inc.
- Current Assignee: Google Inc.
- Current Assignee Address: US CA Mountain View
- Agency: Brake Hughes Bellermann LLP
- Main IPC: G06F7/00
- IPC: G06F7/00 ; G06F17/30

Abstract:
A system is disclosed for faster processing of range queries. The system includes at least one processor and a memory storing a hybrid range query data structure in the form of a binary tree. The structure includes a root node, non-leaf nodes, and leaf nodes. The root node is a bitmap that includes one bit for each value in a first set of values. The non-leaf nodes are also bitmaps. The leaf nodes eliminate a number of lower levels of the tree and include two or more second values that map to values in the first set of values. The system may include instructions that cause the system to receive a range of first values, use the range of first values to traverse the data structure to identify second values that map to the first values, and return the identified second values in sorted order.
Public/Granted literature
- US3121049A Method for colloidally dispersing collagen Public/Granted day:1964-02-11
Information query