Method for calculating distributed joins in main memory with minimal communicaton overhead
AssigneeSap SE
InventorsOliver M. Steinau, Jane Hartmann
Life of this patent
Estimating the term…
Loading patent…
AssigneeSap SE
InventorsOliver M. Steinau, Jane Hartmann
Estimating the term…
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.
A method comprising:
A system for executing a distributed equi-join query for a set of documents, wherein the query includes a precondition part and a join condition part, the system comprising one or more processors configured to provide:
A first server configured to perform operations comprising one or more processors configured for:
Dependencies are inferred from the claim text.