-
公开(公告)号:US20180307609A1
公开(公告)日:2018-10-25
申请号:US15496761
申请日:2017-04-25
发明人: Jian Qiang , Harry Tiotantra , Kai Chen , WenXiang Xie , Andrew Michael Kowles
IPC分类号: G06F12/0868 , G06F17/30
CPC分类号: G06F12/0868 , G06F17/30961 , G06F2212/1024 , G06F2212/281
摘要: Apparatus and method for managing metadata in a data storage device. In some embodiments, a metadata object has entries that describe data sets stored in a non-volatile write cache. During an archival (persistence) operation, the metadata object is divided into portions, and the portions are copied in turn to a non-volatile memory at a rate that maintains a measured latency within a predetermined threshold. A journal is formed of time-ordered entries that describe changes to the metadata object after the copying of the associated portions to the non-volatile memory. The journal is subsequently stored to the non-volatile memory, and may be subsequently combined with the previously stored portions to recreate the metadata object in a local memory. The measured performance latency may be related to a specified customer command completion time (CCT) for host commands.
-
公开(公告)号:US20180285477A1
公开(公告)日:2018-10-04
申请号:US14822553
申请日:2015-08-10
申请人: Google Inc.
CPC分类号: G06F17/30958 , G06F7/00 , G06F8/457 , G06F9/46 , G06F9/5005 , G06F11/1448 , G06F11/1451 , G06F11/1464 , G06F11/1469 , G06F11/2082 , G06F15/17312 , G06F17/30 , G06F17/30339 , G06F17/30575 , G06F17/30961 , G06F2201/84 , G06F2221/0793 , G06N99/00 , G06N99/005 , G06T11/206 , G06T2210/32 , H04L5/0032 , H04L29/08135 , H04L67/10
摘要: Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.
-
公开(公告)号:US09984051B2
公开(公告)日:2018-05-29
申请号:US15053846
申请日:2016-02-25
申请人: CA, Inc.
CPC分类号: G06F17/2247 , G06F17/22 , G06F17/2725 , G06F17/30896 , G06F17/30905 , G06F17/30961
摘要: Elements within HTML based applications may be logically related; however, HTML does not have built-in support for indicating these relationships, such as parent-child relationships. Instead, relationships among HTML elements are not utilized or are incorrectly inferred based on nesting of HTML elements within an HTML document. As a result, when creating a DOM for an HTML document, the hierarchy of elements in the DOM tree is based on coded locations of elements within the HTML document rather than logical relationships among elements. To allow for indication of logical relationships, a hierarchical identifier attribute may be used in conjunction with the HTML id attribute. For example, two elements may include a hierarchical identifier of “person” with base identifiers of “name” and “address”.
-
公开(公告)号:US09977805B1
公开(公告)日:2018-05-22
申请号:US15838110
申请日:2017-12-11
申请人: SAS Institute Inc.
CPC分类号: G06F17/30327 , G06F7/02 , G06F7/08 , G06F7/20 , G06F9/5027 , G06F9/5072 , G06F17/30289 , G06F17/30321 , G06F17/3033 , G06F17/30345 , G06F17/30371 , G06F17/30424 , G06F17/30575 , G06F17/30725 , G06F17/30949 , G06F17/30961
摘要: An apparatus including a processor to index data records within a data cell, wherein for each data record, the processor retrieves data values from first and second data fields; determines whether the first and second data fields store unique data values; in response to the first data field storing a unique data value, adds an identifier of the data record to a first unique values index, in response to the second data field storing a unique data value, adds the identifier to a second unique values index, wherein identifiers of data records within the unique values indexes are ordered based on corresponding unique data values; and generates an indication of ranges of data values of the first and second data fields to enable a determination of whether a data value specified in search criteria is present within at least the data cell.
-
公开(公告)号:US09959346B2
公开(公告)日:2018-05-01
申请号:US14399690
申请日:2012-09-24
申请人: Qatar Foundation
IPC分类号: G06F17/30
CPC分类号: G06F17/30858 , G06F17/30094 , G06F17/30324 , G06F17/30327 , G06F17/30333 , G06F17/30781 , G06F17/30961 , G06F17/30994
摘要: A method to design, implement and create distributed indexes for storing and comparing fingerprints of videos is presented. The method effectively utilizes cloud computing platforms that offer varying amounts of computing resources. The method enables the distributed index to scale to large numbers of data points and the distributed index is robust to failures within the computing resources maintaining the index. The method minimizes the memory required to maintain the distributed index and reduces the I/O operations needed to process operations performed on the index. The method improves the efficiency of the index to process queries.
-
公开(公告)号:US09959338B2
公开(公告)日:2018-05-01
申请号:US15256934
申请日:2016-09-06
发明人: John M. Boyer
CPC分类号: G06F17/30613 , G06F17/2247 , G06F17/2705 , G06F17/30011 , G06F17/30067 , G06F17/30321 , G06F17/30327 , G06F17/30377 , G06F17/30625 , G06F17/30864 , G06F17/30961
摘要: An illustrative embodiment includes processing parse tree data. A parse tree data structure that is representative of a document object model (DOM) tree data structure is received. Concomitant to receiving the parse tree data structure, an assignment of index values for the DOM nodes consisting of distinct index values for each existing DOM node is received by the processor. Requests to manipulate the parse tree data structure that include node inserts and document order comparisons are also performed.
-
7.
公开(公告)号:US09933917B2
公开(公告)日:2018-04-03
申请号:US14458980
申请日:2014-08-13
发明人: Ryan P. Debraal
IPC分类号: G06F3/048 , G06F3/0482 , G06F3/0484 , G06F3/0481 , G06F17/30
CPC分类号: G06F3/0482 , G06F3/0481 , G06F3/04842 , G06F17/30961
摘要: A system may include an interface, a memory, and one or more processors. The system receives data in a hierarchical nature from a memory and displays data associated with a parent. The system receives an instruction to display data associated with a child and receives the data associated with the child from the memory. The system replaces the data associated with the parent with the data associated with the child. The system also displays the data associated with a child.
-
公开(公告)号:US09928270B2
公开(公告)日:2018-03-27
申请号:US14750301
申请日:2015-06-25
CPC分类号: G06F17/30377 , G06F11/3409 , G06F11/3414 , G06F17/30477 , G06F17/30489 , G06F17/30876 , G06F17/30949 , G06F17/30961 , G06F17/40 , G06F2201/80 , G06F2201/87 , G06F2201/88
摘要: Sequences of hierarchical records are aggregated and summarized. A capture log that includes a plurality of operations of a workload is received. A first data structure that models transaction types as sequences of nodes is created. The nodes identify operations in the workload. A present operation and a transaction identifier are read from the capture log. The transaction identifier is dissociated from a first node that identifies a prior operation. The transaction identifier is associated with a second node that identifies the present operation. In a second data structure that associates nodes with transaction identifiers, the first node is dissociated from the transaction identifier and the second node is associated with the transaction identifier. A summary of the workload is generated based, at least in part, on the first and second data structures. The summary includes signatures of transaction types and counts of instances of the transaction types.
-
公开(公告)号:US09904793B2
公开(公告)日:2018-02-27
申请号:US14665064
申请日:2015-03-23
申请人: Intel Corporation
发明人: Richard Chow , Edward Wang , Vinay Phegade
CPC分类号: G06F21/6218 , G06F17/30312 , G06F17/30584 , G06F17/30961 , G06F21/57 , G06F21/6227 , G06F21/6263 , G06F2221/2123 , H04L63/0428 , H04L63/102
摘要: Systems, methods, and apparatus to provide private information retrieval. A disclosed example system includes a first trusted processing unit to store a first portion of data such that entities other than the first trusted processing unit are unable to access the first portion of the data in the first trusted processing unit; a second trusted processing unit to store a second portion of the data such that entities other than the second trusted processing unit are unable to access the second portion of the data in the second trusted processing unit; and a third trusted processing unit to: determine that a data element specified in a request is stored in the first trusted processing unit; request the data element from the first trusted processing unit; send a dummy request to the second trusted processing unit; and send the data element to a requester.
-
公开(公告)号:US09903729B2
公开(公告)日:2018-02-27
申请号:US15119667
申请日:2015-02-17
发明人: Hiroyuki Tashiro , Tomohiko Masutani , Yukiko Hiroo , Motohiro Nakamura , Tomoki Kodan , Atsushi Ikeno , Yoshitaka Kato , Sadahiro Koshiba , Kazuteru Maekawa , Koichi Ushida
CPC分类号: G01C21/3446 , G01C21/32 , G06F17/30961
摘要: A route search apparatus comprises a road information storage part configured to store road information including link information comprised of single link information and composite link information; and a route searcher configured to search a recommended route between two different points using the link information. The single link information includes information regarding an approach link that is a link approaching to a node at one end of a target link, an exit link that is a link exiting from a node at the other end of the target link, and a cost of the target link for entering from the approach link and exiting to the exit link. The composite link information includes information regarding an approach link that is a link approaching to a node at one end of a target link array, an exit link that is a link exiting from a node at the other end of the target link array, and a cost of the target link array for entering from the approach link and exiting to the exit link.
-
-
-
-
-
-
-
-
-