US 9,811,554 B2
Assisting query and querying
Li Li, Beijing (CN); Chi Liu, Beijing (CN); Ju Wei Shi, Beijing (CN); and Qi Yu, Beijing (CN)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Appl. No. 14/367,902
Filed by INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
PCT Filed Oct. 31, 2012, PCT No. PCT/CN2012/083882
§ 371(c)(1), (2) Date Jun. 21, 2014,
PCT Pub. No. WO2013/097546, PCT Pub. Date Jul. 4, 2013.
Claims priority of application No. 2011 1 0461370 (CN), filed on Dec. 30, 2011.
Prior Publication US 2015/0161207 A1, Jun. 11, 2015
Int. Cl. G06F 17/30 (2006.01)
CPC G06F 17/30424 (2013.01) [G06F 17/3033 (2013.01); G06F 17/30864 (2013.01)] 9 Claims
OG exemplary drawing
 
1. A method, comprising:
constructing a storage device profile contained within each storage device among the plurality of storage devices networked within an Internet of Things environment, based on: a naming query system, an assisting query apparatus, and a querying apparatus, wherein the storage device profile performs one-to-one mapping and one-to-many mapping;
acquiring a record that includes a unique identification and at least one piece of dimension information associated with the unique identification, wherein each piece of dimension information includes a sequence of attributes, wherein each attribute is sequentially ordered in accordance with a hierarchically progressive relation;
calculating a hash value for an attribute pair in each piece of dimension information, wherein the attribute pair comprises attributes of every two neighboring levels;
matching the hash value with the unique identification, wherein the unique identification is stored in at least one storage device;
storing the hash value in an array, wherein the hash value is a distance from a pair of attribute pairs to an attribute located at a highest level in a piece of dimension information in which the distance is same as a weight associated with the hash value;
comparing a hash value not in the array to the hash value in the array, wherein the hash value not in the array is either identical to or different from the hash value in the array;
in response to comparing the hash value not in the array to the hash value in the array, matching the hash value not in the array with the unique identification where the hash value not in the array is identical to the hash value in the array;
in response to matching the hash value not in the array, deriving an intersection of the unique identification matched with the hash value in the array;
identifying information that is redundant by utilizing a linking structure in conjunction with the naming query and the querying apparatus, wherein the linking structure stores in the array the unique identification and the weight associated with the hash value; and
in response to identifying that information is redundant, deleting the redundant information contained in each storage device by deleting the hash value in the array which matches with the unique identification.