Title:
COMPUTER-IMPLEMENTED KINETIC SHARDING METHOD
Document Type and Number:
Japanese Patent JP2016062609
Kind Code:
A
Abstract:
PROBLEM TO BE SOLVED: To provide a computer-implemented kinetic sharding method.SOLUTION: The method of the invention comprises: a step for providing a request (13) to a predetermined shard store (20) when handling the request (13) of data (11) which is designated by at least one key (12); a step in which, the predetermined shard store (20) inspects whether or not, the at least one key (12) exists in a local partial range (40) of a shard (30) stored in the predetermined shard store (20) by local partial range assembly (42) of the predetermined shard store itself; and a step for, returning a message (60) including the local partial range assembly (42) of the predetermined shard store (20) when the at least one key (12) does not exist in the local partial range (40) of the shard (30) stored in the predetermined shard store (20).SELECTED DRAWING: Figure 2
More Like This:
Inventors:
CARL RENE D'HALLUIN
FREDERIK DE SCHRIJVER
JOCHEN MAES
ROMAIN RAYMOND AGNES SLOOTMAEKERS
NICOLAS TRANGEZ
JAN DOMS
FREDERIK DE SCHRIJVER
JOCHEN MAES
ROMAIN RAYMOND AGNES SLOOTMAEKERS
NICOLAS TRANGEZ
JAN DOMS
Application Number:
JP2015178972A
Publication Date:
April 25, 2016
Filing Date:
September 10, 2015
Export Citation:
Assignee:
AMPLIDATA NV
International Classes:
G06F12/00
Domestic Patent References:
| JP2013030165A | 2013-02-07 |
Other References:
近藤直樹ほか: "複数分散インデックス手法の実装・比較のための共通フレームワークの実現", 第４回データ工学と情報マネジメントに関するフォーラム論文集 （第１０回日本データベース学会年次大会）, JPN6017002185, 13 July 2012 (2012-07-13), JP
Attorney, Agent or Firm:
Haruka International Patent Office