Invention Application
WO2011008889A2 METHODS AND APPARATUS FOR EFFICIENTLY PROCESSING MULTIPLE KEYWORD QUERIES ON A DISTRIBUTED NETWORK
审中-公开
用于有效处理分布式网络上的多个关键字查询的方法和设备
- Patent Title: METHODS AND APPARATUS FOR EFFICIENTLY PROCESSING MULTIPLE KEYWORD QUERIES ON A DISTRIBUTED NETWORK
- Patent Title (中): 用于有效处理分布式网络上的多个关键字查询的方法和设备
-
Application No.: PCT/US2010/042021Application Date: 2010-07-14
-
Publication No.: WO2011008889A2Publication Date: 2011-01-20
- Inventor: SWAMINATHAN, Ashwin , JAYARAM, Ranjith, S. , NARAYANAN, Vidya
- Applicant: QUALCOMM INCORPORATED , SWAMINATHAN, Ashwin , JAYARAM, Ranjith, S. , NARAYANAN, Vidya
- Applicant Address: Attn: International IP Administration 5775 Morehouse Drive San Diego, California 92121 US
- Assignee: QUALCOMM INCORPORATED,SWAMINATHAN, Ashwin,JAYARAM, Ranjith, S.,NARAYANAN, Vidya
- Current Assignee: QUALCOMM INCORPORATED,SWAMINATHAN, Ashwin,JAYARAM, Ranjith, S.,NARAYANAN, Vidya
- Current Assignee Address: Attn: International IP Administration 5775 Morehouse Drive San Diego, California 92121 US
- Agency: EKWUEME, Kristine, U.
- Priority: US61/225,505 20090714; US12/835,710 20100713
Abstract:
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.
Information query
