公开(公告)号：US10204039B2

公开(公告)日：2019-02-12

申请号：US15004162

申请日：2016-01-22

Applicant: Intel Corporation

Inventor： James A. Boyd ,  Dale J. Juenemann ,  Francis R. Corrado

IPC: G06F12/02 ,  G06F12/0868 ,  G06F12/0804 ,  G06F12/12

Abstract: A host based caching technique may be used to determine caching policies for a hybrid hard disk drive. Because the host based caching may make use of knowledge about what data is being cached, improved performance may be achieved in some cases.

公开(公告)号：US20160217069A1

公开(公告)日：2016-07-28

申请号：US15004162

申请日：2016-01-22

Applicant: Intel Corporation

Inventor： James A. Boyd ,  Dale J. Juenemann ,  Francis R. Corrado

IPC: G06F12/02 ,  G06F12/12 ,  G06F12/08

CPC classification number: G06F12/0246 ,  G06F12/0804 ,  G06F12/0868 ,  G06F12/12 ,  G06F2212/205 ,  G06F2212/217 ,  G06F2212/222 ,  G06F2212/60

Abstract: A host based caching technique may be used to determine caching policies for a hybrid hard disk drive. Because the host based caching may make use of knowledge about what data is being cached, improved performance may be achieved in some cases.

公开(公告)号：US20190034427A1

公开(公告)日：2019-01-31

申请号：US15856686

申请日：2017-12-28

Applicant: Intel Corporation

Inventor： Sanjeev N. Trika ,  Dongchul Park ,  Peng Li ,  Francis R. Corrado ,  Robert A. Dickinson

IPC: G06F17/30

Abstract: Disclosed is a data management system configured to provide a key-value data structure architecture for use with a storage device. The key-value data structure includes a logic tree having a tree-based index and a hash table having a hash-based index. For a ‘scan’ (or range query) operation, the data management system scans the tree-based index to determine which keys exist between two search keys in the tree-based index. For a ‘get’ (e.g., a value request) operation, the data management system applies a hash function to a provided key to determine an index in the hash table by which to retrieve a value that corresponds with the provided key. Other operations (e.g., ‘put’, ‘update’, ‘delete’) may include updating both the tree-based index and the hash-based index. The logic tree stores keys and stores a zero byte-sized value with each of the keys, to limit the size of the logic tree.