公开(公告)号：US09208114B2

公开(公告)日：2015-12-08

申请号：US13615836

申请日：2012-09-14

申请人： Munenori Maeda ,  Jun Kato ,  Tatsuo Kumano ,  Masahisa Tamura ,  Ken Ilzawa ,  Yasuo Noguchi ,  Toshihiro Ozawa

发明人： Munenori Maeda ,  Jun Kato ,  Tatsuo Kumano ,  Masahisa Tamura ,  Ken Ilzawa ,  Yasuo Noguchi ,  Toshihiro Ozawa

IPC分类号： G06F13/28

CPC分类号： G06F13/28

摘要： A storage device being one of a plurality of storage devices storing data includes a memory and a processor coupled to the memory. The processor executes determining, when having received a new request and a new priority information during a preparation for an execution of another update processing, whether a new priority indicated by the new priority information is higher than a priority of the update processing in the preparation. The process including canceling the update processing in the preparation when having determines at the determining that the new priority is higher than the priority of the update processing in the preparation. The process includes forwarding the new request and the new priority information to another storage device when having determined at the determining that the new priority is higher than the priority of the update processing in the preparation.

摘要翻译： 作为存储数据的多个存储装置之一的存储装置包括存储器和耦合到存储器的处理器。 处理器执行在准备执行另一更新处理期间已经接收到新请求和新的优先级信息时确定新的优先级信息指示的新的优先级是否高于准备中的更新处理的优先级。 所述处理包括在确定新的优先级高于准备中的更新处理的优先级时确定准备中的更新处理。 当确定新的优先级高于准备中的更新处理的优先级时，该过程包括将新请求和新的优先级信息转发到另一存储设备。

公开(公告)号：US20130138999A1

公开(公告)日：2013-05-30

申请号：US13604682

申请日：2012-09-06

申请人： Masahisa TAMURA ,  Yasuo Noguchi ,  Toshihiro Ozawa ,  Munenori Maeda ,  Tatsuo Kumano ,  Ken Iizawa ,  Jun Kato

发明人： Masahisa TAMURA ,  Yasuo Noguchi ,  Toshihiro Ozawa ,  Munenori Maeda ,  Tatsuo Kumano ,  Ken Iizawa ,  Jun Kato

IPC分类号： G06F11/16

CPC分类号： G06F11/2071 ,  G06F11/2058 ,  G06F11/2082

摘要： An internode put requesting unit detects a time-out with respect to a put request issued to the next node in the order of a multiplexing chain and notifies a put/get executing unit of the time-out. The put/get executing unit sends an error to the previous node in the order of the multiplexing chain or a client and instructs a put-failed-data synchronizing unit to synchronize data failed to be put, and the put-failed-data synchronizing unit performs a synchronization process. A primary makes other put requests wait until completion of the synchronization process. Furthermore, when having received the error, the client issues a get request to the tail end of the multiplexing chain.

摘要翻译： 节点放置请求单元按照多路复用链的顺序检测对发出给下一个节点的放置请求的超时，并将放弃/获取执行单元通知超时。 投放/获取执行单元按照多路复用链或客户端的顺序向前一个节点发送错误，并且指示放置失败数据同步单元将未被置位的数据和丢失失败的数据同步单元 执行同步过程。 主要让其他放置请求等待，直到完成同步过程。 此外，当接收到错误时，客户机向多路复用链的尾端发出获取请求。

公开(公告)号：US20130138893A1

公开(公告)日：2013-05-30

申请号：US13615836

申请日：2012-09-14

申请人： Munenori MAEDA ,  Jun Kato ,  Tatsuo Kumano ,  Masahisa Tamura ,  Ken Ilzawa ,  Yasuo Noguchi ,  Toshihiro Ozawa

发明人： Munenori MAEDA ,  Jun Kato ,  Tatsuo Kumano ,  Masahisa Tamura ,  Ken Ilzawa ,  Yasuo Noguchi ,  Toshihiro Ozawa

IPC分类号： G06F13/28

CPC分类号： G06F13/28

摘要： A storage device being one of a plurality of storage devices storing data includes a memory and a processor coupled to the memory. The processor executes determining, when having received a new request and a new priority information during a preparation for an execution of another update processing, whether a new priority indicated by the new priority information is higher than a priority of the update processing in the preparation. The process including canceling the update processing in the preparation when having determines at the determining that the new priority is higher than the priority of the update processing in the preparation. The process includes forwarding the new request and the new priority information to another storage device when having determined at the determining that the new priority is higher than the priority of the update processing in the preparation.

摘要翻译： 作为存储数据的多个存储装置之一的存储装置包括存储器和耦合到存储器的处理器。 处理器执行在准备执行另一更新处理期间已经接收到新请求和新的优先级信息时确定新的优先级信息指示的新的优先级是否高于准备中的更新处理的优先级。 所述处理包括在确定新的优先级高于准备中的更新处理的优先级时确定准备中的更新处理。 当确定新的优先级高于准备中的更新处理的优先级时，该过程包括将新请求和新的优先级信息转发到另一存储设备。

公开(公告)号：US08423562B2

公开(公告)日：2013-04-16

申请号：US13461176

申请日：2012-05-01

申请人： Takashi Watanabe ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

发明人： Takashi Watanabe ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

IPC分类号： G06F7/00

CPC分类号： G06F17/30946

摘要： A non-transitory, computer readable storage medium storing a program for a computer being capable of accessing a group of nodes having divided-data structures obtained by dividing a data structure having a transposed hierarchical bloom filter of a hierarchical bloom filter and sets of data blocks by a predetermined bit width, wherein the hierarchical bloom filter has h-stage bloom filter arrays each having a bit width of “s”, the hth-stage bloom filter array having bits indicating false positives or negatives and the pth-stage bloom filter array having n=d[h-(p-1)] bloom filters (where 1≦p≦h) each having a bit width of m=s/d[h-(p-1)] (where d indicates a division number for the hth-stage bloom filter array), the transposed hierarchical bloom filter is obtained in the bloom filters in the bloom filter array, and the set of data blocks corresponds to the first-stage bloom filter array of the hierarchical bloom filter.

摘要翻译： 存储用于计算机的程序的非暂时的计算机可读存储介质，其能够访问具有分割数据结构的一组节点，所述分割数据结构通过划分具有分层布隆过滤器的转置的分层布隆过滤器的数据结构和数据块集合 其中分层布隆过滤器具有每个具有位宽s的h级布隆过滤器阵列，第h级布隆过滤器阵列具有指示误报或否定的位，并且具有n位的第p级布隆过滤器阵列 = d [h-（p-1）]绽放滤波器（其中1＆nlE; p＆nlE; h）具有位宽m = s / d [h-（p-1）]（其中d表示 第一阶段的布隆过滤器阵列），在布隆过滤器阵列的布隆过滤器中获得转置的分层布隆过滤器，并且数据块集合对应于分层布隆过滤器的第一阶段布隆过滤器阵列。

公开(公告)号：US20110225182A1

公开(公告)日：2011-09-15

申请号：US13028409

申请日：2011-02-16

申请人： Yoshihiro TSUCHIYA ,  Yasuo Noguchi ,  Takashi Watanabe

发明人： Yoshihiro TSUCHIYA ,  Yasuo Noguchi ,  Takashi Watanabe

IPC分类号： G06F17/30

CPC分类号： G06F17/3033

摘要： A data management device includes a memory including a multistage Bloom Filter, a first stage being divided into filter parts of which the number is same as that of data blocks, and a pth stage being divided into filter parts of which a size is a combination of filter parts of a (p−1)th stage; a registration unit registering an entry of data in a filter part of the first stage corresponding to a data block where the data is stored, and the entry of the data to a filter part of the pth stage corresponding to the filter part of the first stage where the entry of the data is registered; and a search unit determining which filter part of the first stage an entry of data being searched is registered in by narrowing down filter parts from the Bloom Filter of which a stage number is large.

摘要翻译： 一种数据管理装置，包括：存储器，包括多级布隆过滤器，第一级被分成数字与数据块的数量相同的过滤器部分，第四级被分成过滤器部件，其尺寸是 （p-1）阶段的过滤器部件; 注册单元，在与存储数据的数据块对应的第一级的过滤器部分中登记数据条目，并将数据输入到与第一级的过滤器部分对应的第p级的过滤器部分 注册数据的输入; 并且搜索单元通过从布隆过滤器缩小其阶段号大的过滤器部分来确定第一阶段的哪个过滤部分登记正在搜索的数据的条目。

公开(公告)号：US08560558B2

公开(公告)日：2013-10-15

申请号：US13064674

申请日：2011-04-07

申请人： Takashi Watanabe ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

发明人： Takashi Watanabe ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/3033

摘要： A computer-readable, non-transitory medium stores therein a search program that causes a computer having access to a data block set that includes data groups respectively registered in data blocks, and a Bloom filter row of n Bloom filters that each have m bits indicating negativity in a given number of the data blocks, to execute a process that includes receiving a transposition request for the Bloom filter row; transposing the Bloom filter row into a transposed Bloom filter row of m transposed Bloom filters respectively of n bits gathered from the Bloom filters according to arrangement position in the Bloom filters; and storing the transposed Bloom filter row to a storage device, if a transposition request has been received at the receiving.

摘要翻译： 计算机可读的非暂时性介质存储搜索程序，其使计算机能够访问包括分别登记在数据块中的数据组的数据块组以及每个具有m位的布隆过滤器的Bloom过滤器 在给定数量的数据块中的负值，执行包括接收布隆过滤器行的转置请求的处理; 根据布鲁姆滤波器中的布置位置，将布隆滤波器行分别转移到布卢姆滤波器收集的n个位的m个转置布隆滤波器的布洛姆滤波器行中; 并且如果在接收处已经接收到转置请求，则将转置的布隆过滤器行存储到存储设备。

公开(公告)号：US20120317130A1

公开(公告)日：2012-12-13

申请号：US13458666

申请日：2012-04-27

申请人： Takashi WATANABE ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

发明人： Takashi WATANABE ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

IPC分类号： G06F17/30

CPC分类号： G06F17/30197 ,  G06F17/30985 ,  G06F17/30988

摘要： Nodes respectively store a multilayer transposed Bloom filter. A client selects a node N1 from among the group of nodes and transmits a search request to the node N1. Upon receiving a reply from the node N1, the client determines whether the received search result indicates “positive”. If the search result is not positive, the client selects in order of node number, a node N2 and transmits a search request to the node N2. Upon receiving a reply from the node N2, the client determines whether the received search result indicates “positive”. Upon determining that the search result is positive, the client outputs the search result and ends the search notification process.

摘要翻译： 节点分别存储多层转置布鲁姆滤波器。 客户端从节点组中选择节点N1，并向节点N1发送搜索请求。 在从节点N1接收到回复之后，客户端确定接收到的搜索结果是否为正。 如果搜索结果不是正的，则客户端按节点编号的顺序选择节点N2，并向节点N2发送搜索请求。 在从节点N2接收到回复之后，客户端确定接收的搜索结果是否为肯定。 当确定搜索结果为肯定时，客户端输出搜索结果并结束搜索通知处理。

公开(公告)号：US20120310960A1

公开(公告)日：2012-12-06

申请号：US13461176

申请日：2012-05-01

申请人： Takashi WATANABE ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

发明人： Takashi WATANABE ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

IPC分类号： G06F17/30

CPC分类号： G06F17/30946

摘要： A non-transitory, computer readable storage medium storing a program for a computer being capable of accessing a group of nodes having divided-data structures obtained by dividing a data structure having a transposed hierarchical bloom filter of a hierarchical bloom filter and sets of data blocks by a predetermined bit width, wherein the hierarchical bloom filter has h-stage bloom filter arrays each having a bit width of “s”, the hth-stage bloom filter array having bits indicating false positives or negatives and the pth-stage bloom filter array having n=d[h-(p-1)] bloom filters (where 1≦p≦h) each having a bit width of m=s/d[h-(p-1)] (where d indicates a division number for the hth-stage bloom filter array), the transposed hierarchical bloom filter is obtained in the bloom filters in the bloom filter array, and the set of data blocks corresponds to the first-stage bloom filter array of the hierarchical bloom filter.

摘要翻译： 存储用于计算机的程序的非暂时的计算机可读存储介质，其能够访问具有分割数据结构的一组节点，所述分割数据结构通过划分具有分层布隆过滤器的转置的分层布隆过滤器的数据结构和数据块集合 其中分层布隆过滤器具有每个具有位宽s的h级布隆过滤器阵列，第h级布隆过滤器阵列具有指示误报或否定的位，并且具有n位的第p级布隆过滤器阵列 = d [h-（p-1）]绽放滤波器（其中1＆nlE; p＆nlE; h）具有位宽m = s / d [h-（p-1）]（其中d表示 第一阶段的布隆过滤器阵列），在布隆过滤器阵列的布隆过滤器中获得转置的分层布隆过滤器，并且数据块集合对应于分层布隆过滤器的第一阶段布隆过滤器阵列。

公开(公告)号：US08255406B2

公开(公告)日：2012-08-28

申请号：US13028409

申请日：2011-02-16

申请人： Yoshihiro Tsuchiya ,  Yasuo Noguchi ,  Takashi Watanabe

发明人： Yoshihiro Tsuchiya ,  Yasuo Noguchi ,  Takashi Watanabe

IPC分类号： G06F17/30

CPC分类号： G06F17/3033

摘要： A data management device includes a memory including a multistage Bloom Filter, a first stage being divided into filter parts of which the number is same as that of data blocks, and a pth stage being divided into filter parts of which a size is a combination of filter parts of a (p−1)th stage; a registration unit registering an entry of data in a filter part of the first stage corresponding to a data block where the data is stored, and the entry of the data to a filter part of the pth stage corresponding to the filter part of the first stage where the entry of the data is registered; and a search unit determining which filter part of the first stage an entry of data being searched is registered in by narrowing down filter parts from the Bloom Filter of which a stage number is large.

摘要翻译： 一种数据管理装置，包括：存储器，包括多级布隆过滤器，第一级被分成数字与数据块的数量相同的过滤器部分，第四级被分成过滤器部件，其尺寸是 （p-1）阶段的过滤器部件; 注册单元，在与存储数据的数据块对应的第一级的过滤器部分中登记数据条目，并将数据输入到与第一级的过滤器部分对应的第p级的过滤器部分 注册数据的输入; 并且搜索单元通过从布隆过滤器缩小其阶段号大的过滤器部分来确定第一阶段的哪个过滤部分登记正在搜索的数据的条目。

公开(公告)号：US08819036B2

公开(公告)日：2014-08-26

申请号：US13458666

申请日：2012-04-27

申请人： Takashi Watanabe ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

发明人： Takashi Watanabe ,  Yoshihiro Tsuchiya ,  Yasuo Noguchi

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30197 ,  G06F17/30985 ,  G06F17/30988

摘要： Nodes respectively store a multilayer transposed Bloom filter. A client selects a node N1 from among the group of nodes and transmits a search request to the node N1. Upon receiving a reply from the node N1, the client determines whether the received search result indicates “positive”. If the search result is not positive, the client selects in order of node number, a node N2 and transmits a search request to the node N2. Upon receiving a reply from the node N2, the client determines whether the received search result indicates “positive”. Upon determining that the search result is positive, the client outputs the search result and ends the search notification process.

摘要翻译： 节点分别存储多层转置布鲁姆滤波器。 客户端从节点组中选择节点N1，并向节点N1发送搜索请求。 当从节点N1接收到回复时，客户机确定接收到的搜索结果是否表示“肯定”。 如果搜索结果不是正的，则客户端按节点编号的顺序选择节点N2，并向节点N2发送搜索请求。 在从节点N2接收到回复之后，客户端确定接收到的搜索结果是否表示“肯定”。 当确定搜索结果为肯定时，客户端输出搜索结果并结束搜索通知处理。