Storage recommendation method for computer information
By obtaining user usage data and executing data comparison strategies, and combining spatial analysis strategies to recommend and adjust storage space, the problem of inability to judge user identity and classifying storage space in the existing technology is solved, and the effect of clarifying data in the storage space and improving equipment performance is achieved.
Patent Information
- Application Number
- CN202411938469.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-26
- Publication Date
- 2025-04-22
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The existing storage recommendation methods for computer information cannot determine whether the current user is the user himself based on the user's usage, and cannot classify the file type or file name in the storage space, resulting in messy data in the storage space, making it difficult for users to find the required files, and it is prone to duplication or loss of files, which in turn increases the number of redundant files in the storage space, reduces the capacity of use, and reduces the performance of the equipment.
By obtaining the target storage information and the user's current usage data and historical usage data, a data comparison strategy is executed to judge the user's identity, a spatial analysis strategy is executed to classify the storage space, and a habit or temporary recommendation strategy is executed according to the user's usage situation, and corresponding storage space recommendations and adjustments are made.
Make the data in the storage space clear, reduce the situation where users cannot find the files they need in time, reduce the duplication or loss of files, reduce redundant files in storage space, increase the usable capacity, and improve device performance.
Smart Images

Figure CN119861874A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of information storage, and in particular to a storage recommendation method for computer information. Background Art
[0002] In the era of information explosion, data has become a valuable asset for enterprises and even individuals. Reasonable selection of data storage methods is related to data security, access speed and cost-effectiveness. Common data storage methods include local storage, network attached storage (NAS), storage area network (SAN), cloud storage and distributed storage. To choose a data storage method that suits you, you need to consider factors such as data volume, access speed, security, cost and business needs. In practical applications, different storage methods can complement each other to form an efficient and reliable data storage solution. With the development of technology, more new storage methods will emerge in the future, providing more possibilities for data protection and management;
[0003] Existing storage recommendation methods for computer information cannot determine whether the current user is the user himself based on the user's usage, cannot classify the storage space according to the file type or file name in the storage space, and cannot make corresponding storage space recommendations and adjustments based on the different situations of the user's own use and that of others. This makes the data in the storage space messy, making it difficult for users to find the files they need in time, which makes it easy for files to be duplicated or lost, and further increases the number of redundant files in the storage space, reduces the available capacity, and reduces the performance of the device. Its practicality has certain limitations. Summary of the invention
[0004] The present invention provides a storage recommendation method for computer information, which is used to promote solving the problems mentioned in the background technology.
[0005] The present invention provides the following technical solution: a storage recommendation method for computer information, comprising:
[0006] Get target storage information;
[0007] Obtain all storage spaces of the target device to form a storage space set;
[0008] Obtain the available capacity of each storage space and set it as storage capacity;
[0009] Each storage capacity is matched to each element in the storage space set one by one to form a storage set;
[0010] Identify each element in the storage set as a target space element in turn;
[0011] Execute spatial analysis strategies on target spatial elements;
[0012] Extract the storage content of each element in the storage set and define it as the spatial content;
[0013] The content of each space corresponds to each element in the storage set one by one to form a storage data set;
[0014] Get the user's current usage data and historical usage data;
[0015] Based on the current usage data and historical usage data, comparative data is formed through data comparison strategy;
[0016] The comparative data includes the use by oneself and others;
[0017] If the comparison data is used by the user himself, the habit recommendation strategy is executed to form habit recommendation data;
[0018] Recommend data and store data sets based on habits, and adjust strategies through habits to form adjusted data;
[0019] If the comparison data is used by others, a temporary recommendation strategy is implemented to form temporary recommendation data;
[0020] According to the temporary recommendation data and the stored data set, the adjustment data is formed through the temporary adjustment strategy;
[0021] According to the adjustment data, the target storage information is stored in the corresponding final selected storage space.
[0022] As an optional solution of the storage recommendation method for computer information of the present invention, the spatial analysis strategy is specifically:
[0023] Get all files in the target space element to form a space file set;
[0024] Get the file type of each element in the spatial file collection and set it as the analysis type;
[0025] If all analysis types in the spatial file collection are of the same type, then that analysis type is identified as the stored content;
[0026] If there are different types of analysis types in the spatial file set, the file name of each element in the spatial file set is obtained and defined as the analysis name;
[0027] Get the text format of each analysis name and set it as the analysis format;
[0028] If all analysis formats in the spatial file set are in the same text format, then the analysis format is identified as the stored content;
[0029] If there are analysis formats of different text formats in the spatial file collection, the target spatial element is identified as a temporary storage space.
[0030] As an optional solution of the storage recommendation method for computer information of the present invention, the obtaining of the current usage data and historical usage data of the user includes obtaining the current usage data, specifically:
[0031] Get the initial key;
[0032] Obtain the target user's operation mode for the initial key, and set it as the current operation mode;
[0033] Get the terminate button;
[0034] The process from the target user pressing the initial key to the end pressing the final key is defined as a storage process;
[0035] Get the number of keys in the stored process and set it as the current process number;
[0036] Get all the keys in the storage process to form the current key set;
[0037] Get the click time of each element in the current button set and set it as the current click time;
[0038] Match each current click time with each element in the current key set one by one to form a current key time set;
[0039] Sequentially extract each two adjacent elements in the current key time set, and define them as the front key element and the back key element respectively according to the order of their corresponding current click times;
[0040] Calculate the key press time difference, key press time difference = next key press element - previous key press element;
[0041] Each key time difference is matched one-to-one with each previous key element in the current key time set to form the current key time difference set.
[0042] As an optional solution of the storage recommendation method for computer information of the present invention, the method of obtaining the current usage data and historical usage data of the user also includes obtaining the historical usage data, specifically:
[0043] Get the historical users of the target device and define them as the device users;
[0044] Get the initial key;
[0045] Obtain the operation mode of the device user on the initial key and set it as the historical operation mode;
[0046] Get the terminate button;
[0047] The process from the device user pressing the initial key to the end of pressing the final key is defined as the storage process;
[0048] Get the number of keys in the stored process and set it as the number of historical processes;
[0049] Get all the keys in the storage process to form a historical key set;
[0050] Get the click time of each element in the history button set and set it as the history click time;
[0051] Each historical click time is matched with each element in the historical key set one by one to form a historical key time set;
[0052] Sequentially extract each two adjacent elements in the historical key time set, and define them as the front key element and the back key element respectively according to the order of their corresponding current click times;
[0053] Calculate the key press time difference, key press time difference = next key press element - previous key press element;
[0054] Each key time difference is matched one-to-one with each previous key element in the current key time set to form a historical key time difference set.
[0055] As an optional solution of the storage recommendation method for computer information of the present invention, the data comparison strategy is specifically as follows:
[0056] Get historical operation mode and current operation mode;
[0057] Get the number of historical processes and the number of current processes;
[0058] Get the historical key set and the current key set;
[0059] Get the historical key time difference set and the current key time difference set;
[0060] Extract each element in the historical key time difference set in turn and identify it as the first element;
[0061] Extract each element in the current key time difference set in turn and identify it as the second element;
[0062] If the second element ≤ the first element × (1 + 15%) and the second element ≥ the first element × (1 - 15%), then the time is determined to be similar;
[0063] If the second element > the first element × (1 + 15%) or the second element < the first element × (1 - 15%), then the time is determined to be far apart;
[0064] Get the number of elements with similar time in the current key time difference set, and set it as the similar number;
[0065] Get the number of elements in the current key time difference set and define it as the number of clicks;
[0066] If the historical operation mode = the current operation mode, it is determined that the first comparison requirement is met;
[0067] If the historical operation mode ≠ the current operation mode, it is determined that the first comparison requirement is not met;
[0068] If the number of historical processes = the number of current processes, it is determined that the second comparison requirement is met;
[0069] If the number of historical processes ≠ the number of current processes, it is determined that the second comparison requirement is not met;
[0070] If the historical key set = the current key set, it is determined that the third comparison requirement is met;
[0071] If the historical key set ≠ the current key set, it is determined that the third comparison requirement is not met;
[0072] If the number of similarities is ≥ (number of clicks - 1) × 70%, it is determined to meet the fourth comparison requirement;
[0073] If the number of similarities is less than (number of clicks - 1) × 70%, it is determined that the fourth comparison requirement is not met;
[0074] Obtain the number of comparison requirements that the target users meet, which is defined as the comparison number;
[0075] If the number of comparisons is ≥3, the comparison data is determined to be used by the individual;
[0076] If the comparison number is less than 3, it is determined that the comparison data is used by others.
[0077] As an optional solution of the storage recommendation method for computer information of the present invention, the custom recommendation strategy is specifically:
[0078] Get target storage information;
[0079] Extract the file name of the target storage information and set it as the target name;
[0080] Extract the text format of the target name and set it as the target format;
[0081] Get the stored data set;
[0082] Extract the storage space corresponding to the target format in the storage data set and define it as the text space;
[0083] Get the number of text spaces and set it as the first space number;
[0084] If the number of first spaces is ≥ 1, all text spaces are obtained to form a first space set;
[0085] Obtain the historical usage time of each element in the first spatial set, and set it as the first historical time;
[0086] Get the current time;
[0087] Calculate the first time difference, the first time difference = current time - first historical time;
[0088] Extract the first historical time corresponding to the first time difference with the smallest value and set it as the first most recent time;
[0089] Extract the element corresponding to the first most recent time in the first space set and identify it as the first selection space;
[0090] If the first space quantity is less than 1, the file type of the target storage information is extracted and determined as the target type;
[0091] Extract the storage space corresponding to the target type in the storage data set and define it as the type space;
[0092] Get the number of type spaces and set it as the second space number;
[0093] If the number of second spaces is ≥1, all types of spaces are obtained to form a second space set;
[0094] Obtain the historical usage time of each element in the second space set, and set it as the second historical time;
[0095] Get the current time;
[0096] Calculate the second time difference, the second time difference = current time - second historical time;
[0097] Extract the second historical time corresponding to the second time difference with the smallest value and set it as the second most recent time;
[0098] Extract the element corresponding to the second most recent time in the second space set and identify it as the second selected space;
[0099] If the second space quantity is less than 1, the temporary recommendation strategy is executed.
[0100] As an optional solution of the storage recommendation method for computer information of the present invention, the habit adjustment strategy is specifically:
[0101] Get the first selection space or the second selection space;
[0102] Extracting the storage capacity of the first selected space or the second selected space and setting it as the analysis capacity;
[0103] Get target storage information;
[0104] The file size of the target storage information is extracted and defined as the file capacity;
[0105] If the file capacity is less than the analysis capacity, the preferred storage space will be identified as the final storage space;
[0106] If the file capacity is greater than or equal to the analysis capacity, the first space set or the second space set is obtained;
[0107] Obtain the storage capacity of each element in the first spatial set or the second spatial set as the secondary capacity;
[0108] The element corresponding to the secondary capacity with the largest value in the first space set or the second space set is extracted and identified as the final selected storage space.
[0109] As an optional solution of the storage recommendation method for computer information of the present invention, the temporary recommendation strategy is specifically:
[0110] Get all temporary storage spaces to form a temporary space set;
[0111] Get the number of elements in the temporary space collection and set it as the temporary number;
[0112] If the temporary quantity is less than 1, the initial interface is obtained;
[0113] Extract the storage space where the initial interface is located and identify it as the final selected storage space;
[0114] If the temporary quantity = 1, the storage capacity of the temporary storage space is obtained and is set as the first temporary capacity;
[0115] Get target storage information;
[0116] The file size of the target storage information is extracted and defined as the file capacity;
[0117] If the first temporary capacity is greater than the file capacity, the temporary storage space is identified as the final storage space;
[0118] If the first temporary capacity is less than or equal to the file capacity, the storage space where the initial interface is located is extracted and identified as the final storage space;
[0119] If the temporary quantity is greater than 1, the historical usage time of each element in the temporary space set is obtained and is defined as the temporary historical time;
[0120] Get the current time;
[0121] Calculate temporary time difference, temporary time difference = current time - temporary historical time;
[0122] Extract the temporary historical time corresponding to the temporary time difference with the smallest value and set it as the temporary latest time;
[0123] The element corresponding to the temporary most recent time in the temporary space set is extracted and identified as the temporary selection space.
[0124] As an optional solution of the storage recommendation method for computer information of the present invention, the temporary adjustment strategy is specifically:
[0125] Get temporary selection space;
[0126] Extract the storage capacity of the temporary selection space and set it as the temporary analysis capacity;
[0127] Get target storage information;
[0128] The file size of the target storage information is extracted and defined as the file capacity;
[0129] If the file capacity is less than the temporary analysis capacity, the temporary selected space will be identified as the final selected storage space;
[0130] If the file capacity is greater than or equal to the temporary analysis capacity, obtain the temporary space collection;
[0131] Get the storage capacity of each element in the temporary space and set it as the temporary secondary capacity;
[0132] The element corresponding to the temporary secondary capacity with the largest value in the temporary space set is extracted and identified as the final storage space.
[0133] The present invention has the following beneficial effects:
[0134] 1. The storage recommendation method for computer information obtains the file saving operation status of the user to which the device belongs and the file saving operation status of the current user to determine whether the current user is the user himself, so as to make corresponding storage space recommendations and adjustments, so as to make the data in the storage space clear, reduce the situation where the user cannot find the files he needs in time, reduce the situation where the files are duplicated or lost, reduce the redundant files in the storage space, increase the available capacity, and improve the performance of the device.
[0135] 2. The storage recommendation method for computer information obtains the file type or file name in each storage space, classifies the storage space, and determines the user's own functional division of the storage space, so as to make storage recommendations to the user, make the data in the storage space clear, reduce the situation where the user cannot find the files he needs in time, reduce the situation where files are duplicated or lost, reduce redundant files in the storage space, increase the available capacity, improve the device performance, and improve the user experience.
[0136] 3. The storage recommendation method for computer information makes corresponding storage space recommendations based on the different situations of use by the user and others, and gives priority to storage spaces with the same file type or the same file civilization format and the closest usage time. If the preferred storage space does not meet the storage requirements or storage conditions, corresponding adjustments are made to select the storage space with the largest storage space and that meets the requirements for storage, so that the data in the storage space is clear, reducing the situation where users cannot find the files they need in time, reducing the situation of file duplication or loss, reducing redundant files in the storage space, increasing the available capacity, and improving device performance. BRIEF DESCRIPTION OF THE DRAWINGS
[0137] Figure 1 The present invention is a flowchart of a recommended method for storing computer information. DETAILED DESCRIPTION
[0138] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0139] Embodiment 1, a storage recommendation method for computer information, see Figure 1 ,include:
[0140] Get target storage information;
[0141] Obtain all storage spaces of the target device to form a storage space set;
[0142] Obtain the available capacity of each storage space and set it as storage capacity;
[0143] Each storage capacity is matched to each element in the storage space set one by one to form a storage set;
[0144] Identify each element in the storage set as a target space element in turn;
[0145] Execute spatial analysis strategies on target spatial elements;
[0146] Extract the storage content of each element in the storage set and define it as the spatial content;
[0147] The content of each space corresponds to each element in the storage set one by one to form a storage data set;
[0148] Get the user's current usage data and historical usage data;
[0149] Based on the current usage data and historical usage data, comparative data is formed through data comparison strategy;
[0150] The comparative data includes the use by oneself and others;
[0151] If the comparison data is used by the user himself, the habit recommendation strategy is executed to form habit recommendation data;
[0152] Recommend data and store data sets based on habits, and adjust strategies through habits to form adjusted data;
[0153] If the comparison data is used by others, a temporary recommendation strategy is implemented to form temporary recommendation data;
[0154] According to the temporary recommendation data and the stored data set, the adjustment data is formed through the temporary adjustment strategy;
[0155] According to the adjustment data, the target storage information is stored in the corresponding final selected storage space.
[0156] Through the above method, it is determined whether the current user is the user himself according to the user's usage, the storage space is classified according to the file type or file name in the storage space, and corresponding storage space recommendations and adjustments are made according to the different situations of use by the user himself and others, so that the data in the storage space is clear, the situation where the user cannot find the files he needs in time is reduced, the situation of file duplication or loss is reduced, the redundant files in the storage space are reduced, the available capacity is increased, and the device performance is improved.
[0157] Embodiment 2: This embodiment is an improvement made on the basis of embodiment 1. The storage recommendation method for computer information, the spatial analysis strategy, is specifically:
[0158] Get all files in the target space element to form a space file set;
[0159] Get the file type of each element in the spatial file collection and set it as the analysis type;
[0160] If all analysis types in the space file set are of the same type, the analysis type is identified as the storage content, that is, the storage space contains files of the analysis type, indicating that the storage space stores files based on the file type. For example, if the file types in the storage space are all .jpg, the analysis type is .jpg, and the storage space stores files based on the file type of .jpg.
[0161] If there are different types of analysis types in the spatial file set, the file name of each element in the spatial file set is obtained and defined as the analysis name;
[0162] Get the text format of each analysis name and set it as the analysis format;
[0163] If all analysis formats in the spatial file set are in the same text format, the analysis format is identified as the storage content, that is, the storage space contains files in the analysis format, indicating that the storage space stores files based on the file name of the same text format. For example, if the file names in the storage space are respectively the worksheet of January XX, the worksheet of February XX, and the worksheet of March XX, and the analysis format is the worksheet of A month in A year, then the storage space stores files based on the file name of the worksheet of A month in A year;
[0164] If there are analysis formats of different text formats in the spatial file collection, the target spatial element is identified as a temporary storage space, indicating that the storage space is not a storage space that users often use and search for, and is used as a temporary storage space.
[0165] Embodiment 3: This embodiment is an improvement made on the basis of Embodiment 2. In this embodiment, the obtaining of the current usage data and historical usage data of the user includes obtaining the current usage data, specifically:
[0166] Obtain an initial key, where the initial key is a save key for saving a file;
[0167] Obtain the target user's operation mode for the initial key, and set it as the current operation mode;
[0168] Get a termination button, where the termination button is a confirmation button for confirming to save the file;
[0169] The process from the target user pressing the initial key to the end pressing the final key is defined as a storage process;
[0170] Obtain the number of keys in the stored process and set it as the number of the current process, where the number of keys includes the initial key and the termination key;
[0171] Get all the keys in the storage process to form the current key set;
[0172] Get the click time of each element in the current button set and set it as the current click time;
[0173] Match each current click time with each element in the current key set one by one to form a current key time set;
[0174] Sequentially extract each two adjacent elements in the current key time set, and define them as the front key element and the back key element respectively according to the order of their corresponding current click times;
[0175] Calculate the key press time difference, key press time difference = next key press element - previous key press element;
[0176] Each key time difference is matched one-to-one with each previous key element in the current key time set to form the current key time difference set.
[0177] This embodiment also provides that the obtaining of the current usage data and historical usage data of the user further includes obtaining the historical usage data, specifically:
[0178] Get the historical users of the target device and define them as the device users;
[0179] Obtain an initial key, where the initial key is a save key for saving a file;
[0180] Obtain the operation mode of the device user on the initial key and set it as the historical operation mode;
[0181] Get a termination button, where the termination button is a confirmation button for confirming to save the file;
[0182] The process from the device user pressing the initial key to the end of pressing the final key is defined as the storage process;
[0183] Obtain the number of keys in the stored process and define it as the number of historical processes, where the number of keys includes the initial key and the termination key;
[0184] Get all the keys in the storage process to form a historical key set;
[0185] Get the click time of each element in the history button set and set it as the history click time;
[0186] Each historical click time is matched with each element in the historical key set one by one to form a historical key time set;
[0187] Sequentially extract each two adjacent elements in the historical key time set, and define them as the front key element and the back key element respectively according to the order of their corresponding current click times;
[0188] Calculate the key press time difference, key press time difference = next key press element - previous key press element;
[0189] Each key time difference is matched one-to-one with each previous key element in the current key time set to form a historical key time difference set.
[0190] This embodiment also provides that the data comparison strategy is specifically:
[0191] Get historical operation mode and current operation mode;
[0192] Get the number of historical processes and the number of current processes;
[0193] Get the historical key set and the current key set;
[0194] Get the historical key time difference set and the current key time difference set;
[0195] Extract each element in the historical key time difference set in turn and identify it as the first element;
[0196] Extract each element in the current key time difference set in turn and identify it as the second element;
[0197] If the second element ≤ the first element × (1 + 15%) and the second element ≥ the first element × (1 - 15%), then the time is determined to be similar;
[0198] If the second element > the first element × (1 + 15%) or the second element < the first element × (1 - 15%), then the time is determined to be far apart;
[0199] Get the number of elements with similar time in the current key time difference set, and set it as the similar number;
[0200] Get the number of elements in the current key time difference set and define it as the number of clicks;
[0201] If the historical operation mode = the current operation mode, it is determined that the first comparison requirement is met;
[0202] If the historical operation mode ≠ the current operation mode, it is determined that the first comparison requirement is not met;
[0203] If the number of historical processes = the number of current processes, it is determined that the second comparison requirement is met;
[0204] If the number of historical processes ≠ the number of current processes, it is determined that the second comparison requirement is not met;
[0205] If the historical key set = the current key set, it is determined that the third comparison requirement is met;
[0206] If the historical key set ≠ the current key set, it is determined that the third comparison requirement is not met;
[0207] If the number of similarities is ≥ (number of clicks - 1) × 70%, it is determined to meet the fourth comparison requirement;
[0208] If the number of similarities is less than (number of clicks - 1) × 70%, it is determined that the fourth comparison requirement is not met;
[0209] Obtain the number of comparison requirements that the target users meet, which is defined as the comparison number;
[0210] If the number of comparisons is ≥3, the comparison data is determined to be used by the individual;
[0211] If the comparison number is less than 3, it is determined that the comparison data is used by others.
[0212] Embodiment 4: This embodiment is an improvement made on the basis of Embodiment 3. In this embodiment, the habit recommendation strategy is specifically as follows:
[0213] Get target storage information;
[0214] Extract the file name of the target storage information and set it as the target name;
[0215] Extract the text format of the target name and set it as the target format;
[0216] Get the stored data set;
[0217] Extract the storage space corresponding to the target format in the storage data set and define it as the text space;
[0218] Get the number of text spaces and set it as the first space number;
[0219] If the number of first spaces is ≥ 1, all text spaces are obtained to form a first space set;
[0220] Obtain the historical usage time of each element in the first spatial set, and set it as the first historical time;
[0221] Get the current time;
[0222] Calculate the first time difference, the first time difference = current time - first historical time;
[0223] Extract the first historical time corresponding to the first time difference with the smallest value and set it as the first most recent time;
[0224] Extract the element corresponding to the first most recent time in the first space set and identify it as the first selection space;
[0225] If the first space quantity is less than 1, the file type of the target storage information is extracted and determined as the target type;
[0226] Extract the storage space corresponding to the target type in the storage data set and define it as the type space;
[0227] Get the number of type spaces and set it as the second space number;
[0228] If the number of second spaces is ≥1, all types of spaces are obtained to form a second space set;
[0229] Obtain the historical usage time of each element in the second space set, and set it as the second historical time;
[0230] Get the current time;
[0231] Calculate the second time difference, the second time difference = current time - second historical time;
[0232] Extract the second historical time corresponding to the second time difference with the smallest value and set it as the second most recent time;
[0233] Extract the element corresponding to the second most recent time in the second space set and identify it as the second selected space;
[0234] If the second space quantity is less than 1, the temporary recommendation strategy is executed.
[0235] This embodiment also provides that the habit adjustment strategy is specifically:
[0236] Get the first selection space or the second selection space;
[0237] Extracting the storage capacity of the first selected space or the second selected space and setting it as the analysis capacity;
[0238] Get target storage information;
[0239] The file size of the target storage information is extracted and defined as the file capacity;
[0240] If the file capacity is less than the analysis capacity, the preferred storage space will be identified as the final storage space;
[0241] If the file capacity is greater than or equal to the analysis capacity, the first space set or the second space set is obtained;
[0242] Obtain the storage capacity of each element in the first spatial set or the second spatial set as the secondary capacity;
[0243] The element corresponding to the secondary capacity with the largest value in the first space set or the second space set is extracted and identified as the final selected storage space.
[0244] Embodiment 5: This embodiment is an improvement made on the basis of Embodiment 4. In this embodiment, the temporary recommendation strategy is specifically as follows:
[0245] Get all temporary storage spaces to form a temporary space set;
[0246] Get the number of elements in the temporary space collection and set it as the temporary number;
[0247] If the temporary number is less than 1, the initial interface is obtained, and the initial interface is the desktop;
[0248] Extract the storage space where the initial interface is located and identify it as the final selected storage space;
[0249] If the temporary quantity = 1, the storage capacity of the temporary storage space is obtained and is set as the first temporary capacity;
[0250] Get target storage information;
[0251] The file size of the target storage information is extracted and defined as the file capacity;
[0252] If the first temporary capacity is greater than the file capacity, the temporary storage space is identified as the final storage space;
[0253] If the first temporary capacity is less than or equal to the file capacity, the storage space where the initial interface is located is extracted and identified as the final storage space;
[0254] If the temporary quantity is greater than 1, the historical usage time of each element in the temporary space set is obtained and is defined as the temporary historical time;
[0255] Get the current time;
[0256] Calculate temporary time difference, temporary time difference = current time - temporary historical time;
[0257] Extract the temporary historical time corresponding to the temporary time difference with the smallest value and set it as the temporary latest time;
[0258] The element corresponding to the temporary most recent time in the temporary space set is extracted and identified as the temporary selection space.
[0259] This embodiment also provides that the temporary adjustment strategy is specifically:
[0260] Get temporary selection space;
[0261] Extract the storage capacity of the temporary selection space and set it as the temporary analysis capacity;
[0262] Get target storage information;
[0263] The file size of the target storage information is extracted and defined as the file capacity;
[0264] If the file capacity is less than the temporary analysis capacity, the temporary selected space will be identified as the final selected storage space;
[0265] If the file capacity is greater than or equal to the temporary analysis capacity, obtain the temporary space collection;
[0266] Get the storage capacity of each element in the temporary space and set it as the temporary secondary capacity;
[0267] The element corresponding to the temporary secondary capacity with the largest value in the temporary space set is extracted and identified as the final storage space.
[0268] In this embodiment, it is determined whether the current user is the user himself based on the user's usage situation, and the storage space is classified according to the file type or file name in the storage space. According to the different situations of use by the user himself and others, corresponding storage space recommendations and adjustments are made to make the data in the storage space clear, reduce the situation where the user cannot find the files he needs in time, reduce the situation of file duplication or loss, reduce redundant files in the storage space, increase the available capacity, and improve the performance of the device.
Claims
1. A storage recommendation method for computer information, characterized in that: include: Get target storage information; Obtain all storage spaces of the target device to form a storage space set; Obtain the available capacity of each storage space and define it as storage capacity; Each storage capacity is matched to each element in the storage space set one by one to form a storage set; Identify each element in the storage set as a target space element in turn; Execute spatial analysis strategies on target spatial elements; Extract the storage content of each element in the storage set and define it as the spatial content; The content of each space corresponds to each element in the storage set one by one to form a storage data set; Get the user's current usage data and historical usage data; Based on the current usage data and historical usage data, comparative data is formed through data comparison strategy; The comparative data includes the use by oneself and others; If the comparison data is used by the user himself, the habit recommendation strategy is executed to form habit recommendation data; Recommend data and store data sets based on habits, and adjust strategies through habits to form adjusted data; If the comparison data is used by others, a temporary recommendation strategy is implemented to form temporary recommendation data; According to the temporary recommendation data and the stored data set, the adjustment data is formed through the temporary adjustment strategy; According to the adjustment data, the target storage information is stored in the corresponding final selected storage space.
2. The storage recommendation method for computer information according to claim 1, characterized in that: The spatial analysis strategy is specifically: Obtain all files in the target space element to form a space file set; Get the file type of each element in the spatial file collection and set it as the analysis type; If all analysis types in the spatial file collection are of the same type, then that analysis type is identified as the stored content; If there are different types of analysis types in the spatial file set, the file name of each element in the spatial file set is obtained and defined as the analysis name; Get the text format of each analysis name and set it as the analysis format; If all analysis formats in the spatial file set are in the same text format, then the analysis format is identified as the stored content; If there are analysis formats of different text formats in the spatial file collection, the target spatial element is identified as a temporary storage space.
3. The storage recommendation method for computer information according to claim 1, characterized in that: The obtaining of the user's current usage data and historical usage data includes obtaining the current usage data, specifically: Get the initial key; Obtain the target user's operation mode for the initial key, and set it as the current operation mode; Get the terminate button; The process from the target user pressing the initial key to the end pressing the final key is defined as a storage process; Get the number of keys in the stored process and set it as the current process number; Get all the keys in the storage process to form the current key set; Get the click time of each element in the current button set and set it as the current click time; Match each current click time with each element in the current key set one by one to form a current key time set; Sequentially extract each two adjacent elements in the current key time set, and define them as the front key element and the back key element respectively according to the order of their corresponding current click times; Calculate the key press time difference, key press time difference = next key press element - previous key press element; Each key time difference is matched one-to-one with each previous key element in the current key time set to form the current key time difference set.
4. The storage recommendation method for computer information according to claim 3, characterized in that: The acquisition of the user's current usage data and historical usage data also includes acquiring historical usage data, specifically: Get the historical users of the target device and define them as the device users; Get the initial key; Obtain the operation mode of the device user on the initial key and set it as the historical operation mode; Get the terminate button; The process from the device user pressing the initial key to the end of pressing the final key is defined as a storage process; Get the number of keys in the stored process and set it as the number of historical processes; Get all the keys in the storage process to form a historical key set; Get the click time of each element in the history button set and set it as the history click time; Each historical click time is matched with each element in the historical key set one by one to form a historical key time set; Sequentially extract each two adjacent elements in the historical key time set, and define them as the front key element and the back key element respectively according to the order of their corresponding current click times; Calculate the key press time difference, key press time difference = next key press element - previous key press element; Each key time difference is matched one-to-one with each previous key element in the current key time set to form a historical key time difference set.
5. The storage recommendation method for computer information according to claim 1, characterized in that: The data comparison strategy is specifically as follows: Get historical operation mode and current operation mode; Get the number of historical processes and the number of current processes; Get the historical key set and the current key set; Get the historical key time difference set and the current key time difference set; Extract each element in the historical key time difference set in turn and identify it as the first element; Extract each element in the current key time difference set in turn and identify it as the second element; If the second element ≤ the first element × (1 + 15%) and the second element ≥ the first element × (1 - 15%), then the time is determined to be similar; If the second element > the first element × (1 + 15%) or the second element < the first element × (1 - 15%), then the time is determined to be far apart; Get the number of elements with similar time in the current key time difference set, and set it as the similar number; Get the number of elements in the current key time difference set and define it as the number of clicks; If the historical operation mode = the current operation mode, it is determined that the first comparison requirement is met; If the historical operation mode ≠ the current operation mode, it is determined that the first comparison requirement is not met; If the number of historical processes = the number of current processes, it is determined that the second comparison requirement is met; If the number of historical processes ≠ the number of current processes, it is determined that the second comparison requirement is not met; If the historical key set = the current key set, it is determined that the third comparison requirement is met; If the historical key set ≠ the current key set, it is determined that the third comparison requirement is not met; If the number of similarities is ≥ (number of clicks - 1) × 70%, it is determined to meet the fourth comparison requirement; If the number of similarities is less than (number of clicks - 1) × 70%, it is determined that the fourth comparison requirement is not met; Obtain the number of comparison requirements that the target users meet, which is defined as the comparison number; If the number of comparisons is ≥3, the comparison data is determined to be used by the individual; If the comparison number is less than 3, it is determined that the comparison data is used by others.
6. The storage recommendation method for computer information according to claim 1, characterized in that: The habit recommendation strategy is specifically: Get target storage information; Extract the file name of the target storage information and set it as the target name; Extract the text format of the target name and set it as the target format; Get the stored data set; Extract the storage space corresponding to the target format in the storage data set and define it as the text space; Get the number of text spaces and set it as the first space number; If the number of first spaces is ≥ 1, all text spaces are obtained to form a first space set; Obtain the historical usage time of each element in the first spatial set, and set it as the first historical time; Get the current time; Calculate the first time difference, the first time difference = current time - first historical time; Extract the first historical time corresponding to the first time difference with the smallest value and set it as the first most recent time; Extract the element corresponding to the first most recent time in the first space set and identify it as the first selection space; If the first space quantity is less than 1, the file type of the target storage information is extracted and determined as the target type; Extract the storage space corresponding to the target type in the storage data set and define it as the type space; Get the number of type spaces and set it as the second space number; If the number of second spaces is ≥1, all types of spaces are obtained to form a second space set; Obtain the historical usage time of each element in the second space set, and set it as the second historical time; Get the current time; Calculate the second time difference, the second time difference = current time - second historical time; Extract the second historical time corresponding to the second time difference with the smallest value and set it as the second most recent time; Extract the element corresponding to the second most recent time in the second space set and identify it as the second selected space; If the second space quantity is less than 1, the temporary recommendation strategy is executed.
7. The storage recommendation method for computer information according to claim 6, characterized in that: The habit adjustment strategy is specifically as follows: Get the first selection space or the second selection space; Extracting the storage capacity of the first selected space or the second selected space and setting it as the analysis capacity; Get target storage information; The file size of the target storage information is extracted and defined as the file capacity; If the file capacity is less than the analysis capacity, the preferred storage space will be identified as the final storage space; If the file capacity is greater than or equal to the analysis capacity, the first space set or the second space set is obtained; Obtain the storage capacity of each element in the first spatial set or the second spatial set as the secondary capacity; The element corresponding to the secondary capacity with the largest value in the first space set or the second space set is extracted and identified as the final selected storage space.
8. The storage recommendation method for computer information according to claim 1, characterized in that: The temporary recommendation strategy is specifically: Get all temporary storage spaces to form a temporary space set; Get the number of elements in the temporary space collection and set it as the temporary number; If the temporary quantity is less than 1, the initial interface is obtained; Extract the storage space where the initial interface is located and identify it as the final selected storage space; If the temporary quantity = 1, the storage capacity of the temporary storage space is obtained and is set as the first temporary capacity; Get target storage information; The file size of the target storage information is extracted and defined as the file capacity; If the first temporary capacity is greater than the file capacity, the temporary storage space is identified as the final storage space; If the first temporary capacity is less than or equal to the file capacity, the storage space where the initial interface is located is extracted and identified as the final storage space; If the temporary quantity is greater than 1, the historical usage time of each element in the temporary space set is obtained and is defined as the temporary historical time; Get the current time; Calculate temporary time difference, temporary time difference = current time - temporary historical time; Extract the temporary historical time corresponding to the temporary time difference with the smallest value and set it as the temporary latest time; The element corresponding to the temporary most recent time in the temporary space set is extracted and identified as the temporary selection space.
9. The storage recommendation method for computer information according to claim 8, characterized in that: The temporary adjustment strategy is specifically as follows: Get temporary selection space; Extract the storage capacity of the temporary selection space and set it as the temporary analysis capacity; Get target storage information; The file size of the target storage information is extracted and defined as the file capacity; If the file capacity is less than the temporary analysis capacity, the temporary selected space will be identified as the final selected storage space; If the file capacity is greater than or equal to the temporary analysis capacity, obtain the temporary space collection; Get the storage capacity of each element in the temporary space and set it as the temporary secondary capacity; The element corresponding to the temporary secondary capacity with the largest value in the temporary space set is extracted and identified as the final storage space.