Patents by Inventor Qingbo Zhu

Qingbo Zhu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9507848
    Abstract: Generating an inverted index is disclosed. Semi-structured data from a plurality of sources is parsed to extract structure from at least a portion of the semi-structured data. The inverted index is generated using the extracted structure. The inverted index includes a location identifier and a data type identifier for one or more entries of the inverted index.
    Type: Grant
    Filed: September 23, 2010
    Date of Patent: November 29, 2016
    Assignee: VMware, Inc.
    Inventors: Zhenmin Li, Chengdu Huang, Spiros Xanthos, Qingbo Zhu, Yuanyuan Zhou
  • Patent number: 8498987
    Abstract: Indexing data is disclosed. A plurality of subunits of data is determined within received data. For a first subunit, a first mapping between the first subunit and a first dictionary entry is determined. For a second subunit, a second mapping between the second subunit and a second dictionary entry is determined. At least the first and second dictionary entries are aggregated into an aggregation and stored in an index. Searching data is also disclosed. A plurality of subunits of data is determined within a received query. For a first subunit, a first mapping is determined between the first subunit and a first dictionary entry. For a second subunit, a second mapping is determined between the second subunit and a second dictionary entry. The first and second dictionary entries are aggregated and used to search an index.
    Type: Grant
    Filed: September 25, 2009
    Date of Patent: July 30, 2013
    Assignee: VMware, Inc.
    Inventors: Yuanyuan Zhou, Spiros Xanthos, Qingbo Zhu, Xiao Ma, Zhenmin Li
  • Publication number: 20060218176
    Abstract: A data organization system includes an index that offers fast retrieval of records and that protects records from logical modification. The index includes a balanced tree that grows from the root of the tree down to the leaves and requires no re-balancing. Each level in the tree includes a hash table. The hash table in each level in the tree can use a hash function that is different and independent from the hash function used in any other level in the tree. Alternatively, the hash table in each level in the tree can use a universal hash function. Possible locations of a record in the tree are fixed and determined by a hash function of a key of that record.
    Type: Application
    Filed: March 24, 2005
    Publication date: September 28, 2006
    Inventors: Windsor Sun Hsu, Shauchi Ong, Qingbo Zhu
  • Publication number: 20060218201
    Abstract: A record disposition system classifies records into disposition groups based on an expiration date or disposition date of the records. For each disposition group, the system generates an encoding and decoding function. An encoding module uses the encoding function associated with the disposition group of a record to transform a record locator in an index entry associated with the record. To obtain the record from the index entry, a decoding module decodes the transformed record locator using the corresponding decoding function. The decoding function is stored to allow it to be individually disposed. When a disposition group of records are disposed, disposition of the associated decoding function is also carried out. A record locator in an index entry identifies a block in the expiration control block that identifies a corresponding record. In another embodiment, the encoding function includes an encryption algorithm.
    Type: Application
    Filed: March 24, 2005
    Publication date: September 28, 2006
    Inventors: Windsor Hsu, Qingbo Zhu