发明名称 EFFICIENT STORAGE AND RETRIEVAL FOR WEARABLE-DEVICE DATA
摘要 Technology described herein provides methods whereby a two-level indexing/hashing structure is used to efficiently coordinate storage of sensor measurements between local digital memory (e.g., at a mobile device) and remote digital memory (e.g., at a cloud storage system). The first level of the two-level indexing/hashing structure may be include an array of first-level nodes that are sorted according to priority values. The priority values may be determined based on user data-querying activity. The second level of the two-level indexing/hashing structure may include second-level hash tables wherein buckets are associated with memory blocks of a predefined size. Sensor measurements that were taken during a specific time period may be stored near each other in memory and may be downloaded for local storage if user activity suggests that the user frequently has interest in data from that time period.
申请公布号 US2017090814(A1) 申请公布日期 2017.03.30
申请号 US201514866711 申请日期 2015.09.25
申请人 INTEL CORPORATION 发明人 Yeung Fai;Zhou Fu;Khosravy Nicholas
分类号 G06F3/06;G06F17/30 主分类号 G06F3/06
代理机构 代理人
主权项 1. A user equipment (UE) comprising local digital memory and one or more processors configured to: identify a level-1 (L1) list of level-1 (L1) nodes, wherein each respective L1 node comprises a respective element priority counter that is an instance variable indicating a frequency with which a respective hash table associated with the respective L1 node is accessed, wherein each hash table comprises level-2 (L2) nodes corresponding to buckets, wherein each L2 node comprises a respective usage counter that is an instance variable reflecting a frequency with which data measurements made by one or more sensors and stored for the respective bucket are accessed, and wherein the L1 nodes are sorted in the L1 list according to element priority counter values; identify a pivot index for the L1 list; perform, for each respective L1 node having an index in the L1 list ranging from the pivot index to a first terminal index, the following: identify a high-priority L2 node in a hash table associated with the respective L1 node; anddetermine whether data measurements of a respective bucket corresponding to the high-priority L2 node are stored in the local digital memory at the UE.
地址 Santa Clara CA US
您可能感兴趣的专利