Method for calculating distributed joins in main memory with minimal communicaton overhead
US8046377B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 20, 2004 |
| Grant date | Oct 25, 2011 |
| Priority date | — |
| Expiry date | Mar 1, 2027 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2456
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of executing a distributed join query for a set of documents includes communication between a first server and a second server. In the first server, a first tuple list is generated from a first list of documents matching a precondition part of the query. A first set of value identifiers of attributes associated with the first list of documents is extracted from the first tuple list. A first set of dictionary keys is generated from the set of value identifiers. Then, the first set of dictionary keys is sent with a join condition attribute to a second server. In the second server, the first set of value identifiers is converted to a second set of value identifiers of attributes associated with the second server based on the set of dictionary keys. Then, a lookup of documents is performed based on the second set of value identifiers.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.