Dynamic service resource control
US-9223623-B2 · Dec 29, 2015 · US
Ranking supervised hashing
US9026539B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9026539-B2 |
| Application number | US-201213644747-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 4, 2012 |
| Priority date | Sep 28, 2012 |
| Publication date | May 5, 2015 |
| Grant date | May 5, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
Aspects of the present invention provide a tool for hash-based indexing. In an embodiment, a ranked dataset having a plurality of data items is obtained. Every data item in the ranked dataset has a ranking with respect to every other data item in the ranked dataset. A ranking triplet matrix is created based on the ranked dataset. The ranking triplet matrix has a set of ranking triplets, each of which indicates the relative ranking for a pair of the data items in the ranked dataset. This ranking triplet can be merged with a hash table obtained using a standard hash function and the data items can be indexed based on the results.
First claim
Opening claim text (preview).
What is claimed is: 1. A system for hash-based indexing, comprising at least one computer device that performs a method, comprising: obtaining a ranked dataset having a plurality of data items, every data item in the ranked dataset having a ranking with respect to every other data item in the ranked dataset; creating a ranking triplet matrix having a set of ranking triplets, each ranking triplet indicating a relative ranking for a pair of data items in the ranked dataset; comp…
Assignees
Inventors
Classifications
- G06F17/30Primary
Physics · mapped topic
- G06F16/3347Primary
Physics · mapped topic
- G06F16/9014Primary
Physics · mapped topic
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9026539B2 cover?
- Aspects of the present invention provide a tool for hash-based indexing. In an embodiment, a ranked dataset having a plurality of data items is obtained. Every data item in the ranked dataset has a ranking with respect to every other data item in the ranked dataset. A ranking triplet matrix is created based on the ranked dataset. The ranking triplet matrix has a set of ranking triplets, each of…
- Who is the assignee on this patent?
- IBM
- What technology area does this patent fall under?
- Primary CPC classification G06F17/30. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue May 05 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).