Systems and methods for indicating the existence of accessible information pertaining to articles of commerce
US-2015379592-A1 · Dec 31, 2015 · US
Methods and apparatus for efficiently processing multiple keyword queries on a distributed network
US8996568B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8996568-B2 |
| Application number | US-83571010-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 13, 2010 |
| Priority date | Jul 14, 2009 |
| Publication date | Mar 31, 2015 |
| Grant date | Mar 31, 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.
Methods and apparatus are described herein for performing AND/OR searching using multiple keywords. A query is received at a first node in a network having multiple keywords. The first node determines a set of documents matching a first of the multiple keywords, and computes an ideal Bloom filter representing those keywords. The first node sends the query and the Bloom filter to a second node, which determines its search results for a second of the multiple keywords in accordance with the Bloom filter.
First claim
Opening claim text (preview).
What is claimed is: 1. A method of searching in an overlay network, comprising: receiving a query at a first node in a distributed network from a querying node, wherein the query includes a first keyword and a second keyword; finding a first set of a first number of documents that contain the first keyword; computing an optimal first Bloom filter length and a corresponding first number of hash functions as a function of the first number of documents in the first set; determi…
Assignees
Inventors
Classifications
Physics · mapped topic
Electricity · mapped topic
- G06F17/30699Primary
Physics · mapped topic
Electricity · mapped topic
Electricity · 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 US8996568B2 cover?
- Methods and apparatus are described herein for performing AND/OR searching using multiple keywords. A query is received at a first node in a network having multiple keywords. The first node determines a set of documents matching a first of the multiple keywords, and computes an ideal Bloom filter representing those keywords. The first node sends the query and the Bloom filter to a second node, …
- Who is the assignee on this patent?
- Swaminathan Ashwin, Jayaram Ranjith Subramanian, Narayanan Vidya, and 1 more
- What technology area does this patent fall under?
- Primary CPC classification G06F17/30699. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Mar 31 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).