CN109144960B - Method and system for prefetching data in mobile internet according to area range - Google Patents

Method and system for prefetching data in mobile internet according to area range Download PDF

Info

Publication number
CN109144960B
CN109144960B CN201810943818.5A CN201810943818A CN109144960B CN 109144960 B CN109144960 B CN 109144960B CN 201810943818 A CN201810943818 A CN 201810943818A CN 109144960 B CN109144960 B CN 109144960B
Authority
CN
China
Prior art keywords
user application
position coordinate
storage
mobile terminal
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810943818.5A
Other languages
Chinese (zh)
Other versions
CN109144960A (en
Inventor
不公告发明人
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xuanke Technology Shanghai Co ltd
Original Assignee
Xuanke Technology Shanghai Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xuanke Technology Shanghai Co ltd filed Critical Xuanke Technology Shanghai Co ltd
Priority to CN201810943818.5A priority Critical patent/CN109144960B/en
Priority to CN202210163554.8A priority patent/CN114519040A/en
Publication of CN109144960A publication Critical patent/CN109144960A/en
Application granted granted Critical
Publication of CN109144960B publication Critical patent/CN109144960B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/17Details of further file system functions
    • G06F16/172Caching, prefetching or hoarding of files
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/11File system administration, e.g. details of archiving or snapshots
    • G06F16/122File system administration, e.g. details of archiving or snapshots using management policies

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method and a system for prefetching data in a mobile internet according to an area range, wherein the method comprises the following steps: acquiring an operation statistical file associated with a target mobile terminal in a mobile internet; dividing the set of coordinate points into a plurality of subsets, selecting each of the plurality of subsets, which include position coordinate points whose number is greater than a region threshold, as a region subset, and constructing a single region range from the single region subset, thereby generating a plurality of region ranges; sorting the plurality of user applications in a descending order of the operation probability based on the operation probability of each user application in a specific region range to generate a sorted list; setting a storage level for each pre-fetching user application in at least one pre-fetching user application according to the ordered list; and pre-fetching data files associated with each pre-fetching user application from the second memory according to the storage level of the pre-fetching user application.

Description

Method and system for prefetching data in mobile internet according to area range
Technical Field
The present invention relates to the field of internet of things and the internet, and more particularly, to a method and system for prefetching data in a mobile internet according to a region range in the field of mobile internet.
Background
Currently, as the internet of things, especially the mobile internet, develops faster and faster, and the use of mobile terminals is more and more popular, people usually use mobile terminals to install a large number of applications and store a large amount of personal data. Since the amount of data increases more rapidly than the storage space increases, it is increasingly important to efficiently manage data files in a mobile terminal. In some cases, for a user with a high regularity of usage, the user may often use a common application of a plurality of user applications when the mobile terminal is within a specific area. In the prior art, no technology for prefetching data according to the regularity exists.
Disclosure of Invention
According to an aspect of the present invention, there is provided a method for prefetching data in a mobile internet according to a region range, the method comprising:
acquiring an operation statistical file associated with a target mobile terminal in a mobile internet, and analyzing the operation statistical file to acquire position statistical information of the target mobile terminal and operation statistical information of each user application in a plurality of user applications in the target mobile terminal, wherein the position statistical information is a coordinate point set which comprises a plurality of position coordinate points reached by the target mobile terminal in a preset number of natural days;
performing center point clustering on all position coordinate points in the coordinate point set based on mutual distances among the plurality of position coordinate points to divide the coordinate point set into a plurality of subsets each including at least one position coordinate point, selecting each of the plurality of subsets including position coordinate points whose number is greater than a region threshold as a region subset, and constructing a single region range from the single region subset, thereby generating a plurality of region ranges;
monitoring the current position of a target mobile terminal, when the continuous time length of the current position of the target mobile terminal in a specific area range in a plurality of area ranges reaches a stay threshold value, determining the operation probability of each user application in the specific area range according to the operation statistical information of each user application, and performing descending ordering on the operation probabilities of the plurality of user applications based on the operation probability of each user application in the specific area range to generate an ordered list;
determining at least one of the plurality of user applications that can be preloaded from the second memory into the first memory according to the ordered list, and setting a storage level for each of the at least one pre-fetching user application according to the ordered list, wherein the storage level comprises: a decrement storage stage, an increment storage stage, a quantitative storage stage and a compression storage stage;
allocating at least one dynamic memory unit for each pre-fetch user application of the decrement storage stage, allocating at least one dynamic memory unit for each pre-fetch user application of the compression storage stage, allocating one dynamic memory unit for each pre-fetch user application of the increment storage stage and allocating one dynamic memory unit for each pre-fetch user application of the quantitive storage stage;
setting a storage level for a dynamic storage unit allocated to each pre-fetching user application according to the storage level of each pre-fetching user application;
prefetching data from the second memory for a data file associated with each prefetched user application according to the storage level of the prefetched user application, comprising:
copying a plurality of data files associated with each pre-fetch user application of the reduced storage tier from the second memory to the dynamic storage unit of at least one reduced storage tier allocated for each pre-fetch user application of the reduced storage tier, setting a first time period for the dynamic storage unit of each reduced storage tier upon completion of the copying and starting timing, deleting a first predetermined number of data files in the dynamic storage unit of each reduced storage tier each time the first time period expires;
selecting at least one base data file among the plurality of data files associated with each pre-fetching user application of the incremental storage tier, copying the at least one base data file of each pre-fetching user application of the incremental storage tier from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier, setting a second time period and starting timing for the dynamic storage unit of the incremental storage tier upon completion of the copying, wherein a second predetermined number of data files among the plurality of data files associated with each pre-fetching user application of the incremental storage tier are copied from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier each time the second time period expires;
selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier and copying the selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier; and
the method further includes compressing the plurality of data files associated with each pre-fetch user application of the compressed storage tier to generate a plurality of compressed data files, copying the plurality of compressed data files of each pre-fetch user application of the compressed storage tier from the second memory to a dynamic storage unit of at least one compressed storage tier allocated for each pre-fetch user application of the compressed storage tier.
The mobile internet comprises a plurality of mobile terminals, the mobile terminal which initiates a data pre-fetching request is determined as a target mobile terminal, and the number of user applications is more than 4.
The operation statistics file comprises a location data table comprising a plurality of location data items and the content of each location data item is a triple < location coordinate point, start time, end time >.
And combining the position coordinate points in each position data item in a position data table into a coordinate point set comprising a plurality of position coordinate points, and taking the coordinate point set as position statistical information, wherein the position data table is used for recording the running position information of the target mobile terminal in real time.
In the location data table, a predetermined number of location data items are stored for the target mobile terminal, or a predetermined number of location data items are stored for the target mobile terminal within a natural day or a predetermined length of time. Wherein the predetermined number of natural days is 10 natural days, 20 natural days or 30 natural days, and the predetermined time length is 240 hours
Wherein no position coordinate point in the coordinate point set has a straight-line distance greater than 5 meters, 6 meters, 8 meters or 10 meters from any single position coordinate point in the plurality of position coordinate points, or whenever the distance between the current position of the target mobile terminal and the last position coordinate point is equal to 5 meters, 6 meters, 8 meters or 10 meters, determining the current position as the current position coordinate point; or determines the current position of the target mobile terminal as the current position coordinate point every time 5 seconds, 10 seconds, or 20 seconds passes.
Wherein the predetermined number of natural days is 10 natural days, 20 natural days, or 30 natural days.
Wherein each location data item associated with each location coordinate point that the target mobile terminal has reached within the current natural day is saved into the location data table at the end of the current natural day.
The operation statistical file comprises a plurality of operation data tables, one operation data table is distributed to each user application in a plurality of user applications in the target mobile terminal, each operation data table comprises a plurality of operation data items, and the content of each operation data item is quintuple < application name, position coordinate point, starting time, ending time and accumulated time length >.
The running data table allocated to each user application is used as running statistical information of each user application, and the running data table allocated to each user application is used for recording running position information of each user application in real time.
In the running statistics file, a predetermined number of running data items are saved for each user application, or a predetermined number of running data items within a natural day or a predetermined length of time (at least 10 days) are saved for each user application.
The region threshold is 50, 100 or 200.
In each subset, at least one position coordinate point is selected as a center point, and the center point can be a plurality of position coordinate points whose positions coincide.
Wherein constructing the single region range from the single subset of regions comprises:
calculating the straight-line distance between the central point and each of other position coordinate points (except the central point) in the single regional subset to which the central point belongs;
determining the longest straight-line distance among straight-line distances of a center point and each position coordinate point (other than the center point) (among other position coordinate points);
a circle centered at a center point within a single subset of regions and having a radius of the longest straight-line distance is constructed as a single region extent.
After clustering by the center point to divide the coordinate point set into a plurality of subsets, the straight-line distance between the arbitrary position coordinate point in each subset and the center point of the attributed subset is smaller than the straight-line distance to the center point of any other subset except the attributed subset.
Wherein the residence threshold is 1 minute, 5 minutes, 10 minutes, or 15 minutes.
The determining the operation probability of each user application in the specific area range according to the operation statistical information of each user application comprises the following steps:
selecting a statistical date interval for determining an operational probability, the statistical date interval comprising at least 10 natural days;
analyzing each data item in a plurality of data items in the running statistical information of each user application to determine the effective times Ci of running of each user application in a specific area range in a statistical date interval, wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal, Na is a natural number and Na is more than 4;
calculating the total effective times S of all the user applications in the specific area range based on the effective times Ci of each user application in the statistical date range and running in the specific area range:
Figure GDA0003355770970000031
and calculating the operation probability Pi ═ Ci/S of each user application in the specific area range.
Wherein the effective number of times is counted when the running time of the user application in the specific area range exceeds 60 seconds.
The determining the operation probability of each user application in the specific area range according to the operation statistical information of each user application comprises the following steps:
selecting a statistical date interval for determining an operational probability, the statistical date interval comprising at least 10 natural days;
analyzing each data item in a plurality of data items in the running statistical information of each user application to determine the time length ti of each user application running in a specific area range in a statistical date interval, wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal, and Na is a natural number and is more than 4;
based on the time duration ti of each user application operating within the statistical date interval, the total time duration T of all user applications operating within the specific area is calculated:
Figure GDA0003355770970000032
and calculating the operation probability Pi of each user application in the specific area range, namely ti/T.
Before obtaining the operation statistical file associated with the target mobile terminal in the mobile internet, the method further comprises the following steps:
responding to a data prefetching request initiated by a user and used for prefetching data aiming at a data file, associated with a user application, of a target mobile terminal in a mobile internet, and acquiring a dynamic configuration file associated with the data prefetching;
creating a dynamic index area in a first memory of the target mobile terminal, and creating a plurality of dynamic storage units for storing data files in the first memory according to the dynamic configuration file, wherein the storage capacity of each of the plurality of dynamic storage units is determined according to the dynamic configuration file; and
and generating a dynamic index table in the dynamic index area, wherein the dynamic index table comprises a plurality of index entries, and each index entry is used for recording the application identification, the starting address, the ending address, the storage capacity and the storage level of a corresponding dynamic storage unit in a plurality of dynamic storage units.
The first memory is a random access memory, and the second memory is a read-only memory.
The dynamic profile includes a start address and an end address of a storage area in the first memory for providing a plurality of dynamic storage units, and the dynamic profile further includes a storage capacity of each of the plurality of dynamic storage units.
The application identifier is an identifier of a user application to which the dynamic storage unit belongs, the starting address is a starting address of a storage space of the dynamic storage unit, the ending address is an ending address of the storage space of the dynamic storage unit, and the storage capacity is the storage capacity and the storage level of the storage space of the dynamic storage unit.
And updating the corresponding index entry in the dynamic index table according to the storage level set for the dynamic storage unit.
Wherein selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier comprises:
grouping a plurality of data files associated with each pre-fetch user application of the quantitative storage tier according to a storage capacity of a dynamic storage unit of the quantitative storage tier allocated to each pre-fetch user application of the quantitative storage tier to generate a plurality of file groups, wherein each file group includes at least one data file, and setting different priorities for the plurality of file groups of each pre-fetch user application of the quantitative storage tier to constitute priority queues, regarding a file group positioned at a head of a queue in each priority queue as a current file group and copying at least one data file in the current file group from a second memory to a dynamic storage unit of the quantitative storage tier allocated to each pre-fetch user application of the quantitative storage tier and setting a third time period for each dynamic storage unit of the quantitative storage tier, whenever the third time period expires, using a next file group in the priority queues as the current file group in order of decreasing priority, until there is no next set of files;
determining a number of pre-fetch user applications associated with the quantitative storage tier based on the at least one data file selected from the plurality of data files;
wherein the size of each file group is smaller than the storage space of the dynamic storage unit of the corresponding quantitative storage tier.
Wherein selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetch user application of the quantitative storage tier comprises:
grouping a plurality of data files associated with each pre-fetch user application of the quantitative storage tier according to a storage capacity of a dynamic storage unit of the quantitative storage tier allocated for each pre-fetch user application of the quantitative storage tier to generate a plurality of file groups, wherein each file group includes at least one data file, randomly selecting one file group from the plurality of file groups as a current file group and copying at least one data file in the current file group from the second memory to the dynamic storage unit of the quantitative storage tier allocated for each pre-fetch user application of the quantitative storage tier and setting a third time period for each dynamic storage unit of the quantitative storage tier, randomly selecting a next file group from the plurality of file groups as the current file group whenever the third time period expires until there is no next file group;
determining a number of pre-fetch user applications associated with the quantitative storage tier based on the at least one data file selected from the plurality of data files;
wherein the size of each file group is smaller than the storage space of the dynamic storage unit of the corresponding quantitative storage tier.
After copying the selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned to each pre-fetching user application of the quantitative storage tier, setting a third time period and whenever the third time period expires, re-selecting at least one data file from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier assigned to each pre-fetching user application of the quantitative storage tier, copying the re-selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned to each pre-fetching user application of the quantitative storage tier.
Wherein selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetch user application of the quantitative storage tier comprises:
step 1, grouping a plurality of data files associated with each pre-fetching user application of the quantitative storage tier to generate N file groups according to the storage capacity of a dynamic storage unit of the quantitative storage tier allocated to each pre-fetching user application of the quantitative storage tier, wherein N is a natural number greater than 1 and each file group comprises at least one data file;
step 2, setting different sequence numbers for each file group in the N file groups, wherein the sequence numbers are from 1 to N;
step 3, taking the file group with the serial number i equal to 1 as the current file group, wherein N is more than or equal to i and is more than 0;
step 4, setting a third time period for each dynamic storage unit of the quantitative storage level;
step 5, copying at least one data file included in the current file group from the second memory to a dynamic storage unit of the quantitative storage level allocated to each pre-fetching user application of the quantitative storage level;
step 6, when the third time period expires, judging whether i is true or not, and if yes, ending; if not, taking the file group with the serial number i being i +1 as the current file group, and performing step 5;
wherein the size of each file group is smaller than the storage capacity of the dynamic storage unit of the fixed-amount storage tier.
Wherein determining from the ordered list a plurality of pre-fetch user applications of the plurality of user applications that can be pre-loaded from a second memory into a first memory comprises:
when the number of the user applications with the operation probability larger than the pre-fetching threshold value in the ordered list is larger than 0, determining the user applications with the operation probability larger than the pre-fetching threshold value in the ordered list as the pre-fetching user applications which can be pre-loaded into the first memory from the second memory so as to determine at least one pre-fetching user application;
when the number of user applications in the ordered list having an operating probability greater than the pre-fetch threshold is equal to 0, determining all user applications in the ordered list as pre-fetched user applications that can be pre-loaded from the second memory into the first memory to determine at least one pre-fetched user application.
Wherein setting a storage level for each of the at least one pre-fetch user application according to the ordered list comprises:
setting the storage level of the pre-fetching user application with the operation probability larger than the high probability threshold value in the sorted list as a decrement storage level;
setting the storage level of the pre-fetching user application with the running probability less than or equal to the high probability threshold and greater than the medium probability threshold in the sorted list as an incremental storage level;
setting the storage level of the pre-fetching user application with the operation probability smaller than or equal to the middle probability threshold and larger than the low probability threshold in the sorted list as a quantitative storage level;
and setting the storage level of the pre-fetching user application with the operation probability less than or equal to the low probability threshold value in the sorted list as a compression storage level.
Wherein the at least one dynamic storage unit allocated for the pre-fetch user application of each reduced storage tier is capable of holding all data files of the pre-fetch user application of the corresponding reduced storage tier, and the at least one dynamic storage unit allocated for the pre-fetch user application of each compressed storage tier is capable of holding all compressed data files of the pre-fetch user application of the corresponding compressed storage tier.
Wherein the first time period is 30 seconds, the second time period is 60 seconds, and wherein the third time period is 90 seconds.
Wherein the at least one base data file of each pre-fetching user application is at least one data file of the plurality of data files associated with each pre-fetching user application of the incremental storage tier that has a launch order above a priority threshold.
Wherein the first predetermined number is 5 and the second predetermined number is 8.
According to another aspect of the present invention, there is provided a system for prefetching data in a mobile internet according to a region scope, the system comprising:
the analysis device is used for acquiring an operation statistical file associated with a target mobile terminal in the mobile Internet, and analyzing the operation statistical file to acquire position statistical information of the target mobile terminal and operation statistical information of each user application in a plurality of user applications in the target mobile terminal, wherein the position statistical information is a coordinate point set which comprises a plurality of position coordinate points reached by the target mobile terminal within a preset number of natural days;
generating means that performs center point clustering of all position coordinate points in the coordinate point set based on mutual distances between a plurality of position coordinate points to divide the coordinate point set into a plurality of subsets each including at least one position coordinate point, selects each of the plurality of subsets including position coordinate points whose number is greater than a region threshold as a region subset, and constructs a single region range from the single region subset, thereby generating a plurality of region ranges;
the sequencing device is used for monitoring the current position of the target mobile terminal, determining the operation probability of each user application in a specific area range according to the operation statistical information of each user application when the continuous time length of the current position of the target mobile terminal in the specific area range reaches a stop threshold value, and sequencing the operation probabilities of the user applications in a descending order based on the operation probability of each user application in the specific area range to generate a sequencing list;
setting means for determining at least one pre-fetch user application of the plurality of user applications that can be pre-loaded from the second memory into the first memory according to the ordered list, and setting a storage level for each pre-fetch user application of the at least one pre-fetch user application according to the ordered list, wherein the storage level comprises: a decrement storage stage, an increment storage stage, a quantitative storage stage and a compression storage stage; setting a storage level for a dynamic storage unit allocated to each pre-fetching user application according to the storage level of each pre-fetching user application;
the allocation device allocates at least one dynamic storage unit for each pre-fetching user application of the decrement storage level, allocates at least one dynamic storage unit for each pre-fetching user application of the compression storage level, allocates one dynamic storage unit for each pre-fetching user application of the increment storage level and allocates one dynamic storage unit for each pre-fetching user application of the quantitative storage level;
prefetching means for prefetching data from the second memory for the data file associated with each prefetched user application according to the storage level of the prefetched user application, comprising:
copying a plurality of data files associated with each pre-fetch user application of the reduced storage tier from the second memory to the dynamic storage unit of at least one reduced storage tier allocated for each pre-fetch user application of the reduced storage tier, setting a first time period for the dynamic storage unit of each reduced storage tier and starting timing when the copying is completed, deleting a first predetermined number of data files in the dynamic storage unit of each reduced storage tier each time the first time period expires;
selecting at least one base data file among the plurality of data files associated with each pre-fetching user application of the incremental storage tier, copying the at least one base data file of each pre-fetching user application of the incremental storage tier from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier, setting a second time period and starting timing for the dynamic storage unit of the incremental storage tier upon completion of the copying, wherein a second predetermined number of data files among the plurality of data files associated with each pre-fetching user application of the incremental storage tier are copied from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier each time the second time period expires;
selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier and copying the selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier; and
the method further includes compressing the plurality of data files associated with each pre-fetch user application of the compressed storage tier to generate a plurality of compressed data files, copying the plurality of compressed data files of each pre-fetch user application of the compressed storage tier from the second memory to a dynamic storage unit of at least one compressed storage tier allocated for each pre-fetch user application of the compressed storage tier.
The mobile internet comprises a plurality of mobile terminals, the mobile terminal which initiates a data pre-fetching request is determined as a target mobile terminal, and the number of user applications is more than 4.
The operation statistics file comprises a location data table comprising a plurality of location data items and the content of each location data item is a triple < location coordinate point, start time, end time >.
And forming a coordinate point set comprising a plurality of position coordinate points by the position coordinate points in each position data item in a position data table, and taking the coordinate point set as position statistical information, wherein the position data table is used for recording the running position information of the target mobile terminal in real time.
In the location data table, a predetermined number of location data items are stored for the target mobile terminal, or a predetermined number of location data items are stored for the target mobile terminal within a natural day or a predetermined length of time. Wherein the predetermined number of natural days is 10 natural days, 20 natural days or 30 natural days, and the predetermined time length is 240 hours
Wherein no position coordinate point in the coordinate point set has a straight-line distance greater than 5 meters, 6 meters, 8 meters or 10 meters from any single position coordinate point in the plurality of position coordinate points, or whenever the distance between the current position of the target mobile terminal and the last position coordinate point is equal to 5 meters, 6 meters, 8 meters or 10 meters, determining the current position as the current position coordinate point; or determines the current position of the target mobile terminal as the current position coordinate point every time 5 seconds, 10 seconds, or 20 seconds passes.
Wherein the predetermined number of natural days is 10 natural days, 20 natural days, or 30 natural days.
Wherein each location data item associated with each location coordinate point that the target mobile terminal has reached within the current natural day is saved into the location data table at the end of the current natural day.
The operation statistical file comprises a plurality of operation data tables, one operation data table is distributed to each user application in a plurality of user applications in the target mobile terminal, each operation data table comprises a plurality of operation data items, and the content of each operation data item is quintuple < application name, position coordinate point, starting time, ending time and accumulated time length >.
The running data table allocated to each user application is used as running statistical information of each user application, and the running data table allocated to each user application is used for recording running position information of each user application in real time.
In the running statistics file, a predetermined number of running data items are saved for each user application, or a predetermined number of running data items within a natural day or a predetermined length of time (at least 10 days) are saved for each user application.
The region threshold is 50, 100 or 200.
In each subset, at least one position coordinate point is selected as a center point, and the center point can be a plurality of position coordinate points whose positions coincide.
Wherein the generating means constructs the single region range from the single subset of regions comprises:
calculating the straight-line distance between the center point and each position coordinate point in other position coordinate points in the single area subset to which the center point belongs;
determining the longest straight-line distance in the straight-line distances between the center point and each position coordinate point;
a circle centered at a center point within a single subset of regions and having a radius of the longest straight-line distance is constructed as a single region extent.
After the generating means clusters through the center points to divide the set of coordinate points into a plurality of subsets, a straight-line distance between an arbitrary position coordinate point in each subset and the center point of the attributed subset is smaller than a straight-line distance between the arbitrary position coordinate point and the center point of any other subset except the attributed subset.
Wherein the residence threshold is 1 minute, 5 minutes, 10 minutes, or 15 minutes.
The sequencing device determines the operation probability of each user application in the specific area range according to the operation statistical information of each user application, and the method comprises the following steps:
selecting a statistical date interval for determining an operational probability, the statistical date interval comprising at least 10 natural days;
analyzing each data item in a plurality of data items in the running statistical information of each user application to determine the effective times Ci of running of each user application in a specific area range in a statistical date interval, wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal, Na is a natural number and Na is more than 4;
calculating the total effective times S of all the user applications in the specific area range based on the effective times Ci of each user application in the statistical date range and running in the specific area range:
Figure GDA0003355770970000071
and calculating the operation probability Pi & Ci/S of each user application in the specific area range.
Wherein the effective number of times is counted when the running time of the user application in the specific area range exceeds 60 seconds.
The sequencing device determines the operation probability of each user application in the specific area range according to the operation statistical information of each user application, and the operation probability comprises the following steps:
selecting a statistical date interval for determining an operational probability, the statistical date interval comprising at least 10 natural days;
analyzing each data item in a plurality of data items in the running statistical information of each user application to determine the time length ti of each user application running in a specific area range in a statistical date interval, wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal, and Na is a natural number and is more than 4;
based on the time duration ti of each user application running in the statistical date interval within the specific area range, calculating the total time duration T of all user applications running in the specific area range:
Figure GDA0003355770970000081
and calculating the operation probability Pi of each user application in the specific area range, namely ti/T.
The system comprises a mobile internet and an initialization device, wherein the initialization device is used for responding to a data prefetching request initiated by a user and used for prefetching data aiming at a data file of a target mobile terminal in the mobile internet and relevant to user application, and acquiring a dynamic configuration file relevant to data prefetching;
creating a dynamic index area in a first memory of the target mobile terminal, and creating a plurality of dynamic storage units for storing data files in the first memory according to the dynamic configuration file, wherein the storage capacity of each of the plurality of dynamic storage units is determined according to the dynamic configuration file; and
and generating a dynamic index table in the dynamic index area, wherein the dynamic index table comprises a plurality of index entries, and each index entry is used for recording the application identification, the starting address, the ending address, the storage capacity and the storage level of a corresponding dynamic storage unit in a plurality of dynamic storage units.
The first memory is a random access memory, and the second memory is a read-only memory.
The dynamic profile includes a start address and an end address of a storage area in the first memory for providing a plurality of dynamic storage units, and the dynamic profile further includes a storage capacity of each of the plurality of dynamic storage units.
The application identifier is an identifier of a user application to which the dynamic storage unit belongs, the starting address is a starting address of a storage space of the dynamic storage unit, the ending address is an ending address of the storage space of the dynamic storage unit, and the storage capacity is the storage capacity and the storage level of the storage space of the dynamic storage unit.
And updating the corresponding index entry in the dynamic index table according to the storage level set for the dynamic storage unit.
Wherein the pre-fetching means selects at least one data file from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier comprises:
grouping a plurality of data files associated with each pre-fetch user application of the quantitative storage tier according to a storage capacity of a dynamic storage unit of the quantitative storage tier allocated to each pre-fetch user application of the quantitative storage tier to generate a plurality of file groups, wherein each file group includes at least one data file, and setting different priorities for the plurality of file groups of each pre-fetch user application of the quantitative storage tier to constitute priority queues, regarding a file group positioned at a head of a queue in each priority queue as a current file group and copying at least one data file in the current file group from a second memory to a dynamic storage unit of the quantitative storage tier allocated to each pre-fetch user application of the quantitative storage tier and setting a third time period for each dynamic storage unit of the quantitative storage tier, whenever the third time period expires, using a next file group in the priority queues as the current file group in order of decreasing priority, until there is no next set of files;
determining a number of pre-fetch user applications associated with the quantitative storage tier based on the at least one data file selected from the plurality of data files;
wherein the size of each file group is smaller than the storage space of the dynamic storage unit of the corresponding quantitative storage tier.
Wherein the pre-fetching means selects at least one data file from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier comprises:
grouping a plurality of data files associated with each pre-fetch user application of the quantitative storage tier according to a storage capacity of a dynamic storage unit of the quantitative storage tier allocated for each pre-fetch user application of the quantitative storage tier to generate a plurality of file groups, wherein each file group includes at least one data file, randomly selecting one file group from the plurality of file groups as a current file group and copying at least one data file in the current file group from the second memory to the dynamic storage unit of the quantitative storage tier allocated for each pre-fetch user application of the quantitative storage tier and setting a third time period for each dynamic storage unit of the quantitative storage tier, randomly selecting a next file group from the plurality of file groups as the current file group whenever the third time period expires until there is no next file group;
determining a number of pre-fetch user applications associated with the quantitative storage tier based on the at least one data file selected from the plurality of data files;
wherein the size of each file group is smaller than the storage space of the dynamic storage unit of the corresponding quantitative storage tier.
After the pre-fetching means copies the selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned to each pre-fetching user application of the quantitative storage tier, the pre-fetching means sets a third time period and re-selects the at least one data file from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier according to the storage capacity of the dynamic storage unit of the quantitative storage tier assigned to each pre-fetching user application of the quantitative storage tier each time the third time period expires, copying the re-selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned to each pre-fetching user application of the quantitative storage tier.
Wherein the pre-fetching means selects at least one data file from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier comprises:
step 1, grouping a plurality of data files associated with each pre-fetching user application of the quantitative storage tier to generate N file groups according to the storage capacity of a dynamic storage unit of the quantitative storage tier allocated to each pre-fetching user application of the quantitative storage tier, wherein N is a natural number greater than 1 and each file group comprises at least one data file;
step 2, setting different sequence numbers for each file group in the N file groups, wherein the sequence numbers are from 1 to N;
step 3, taking the file group with the serial number i equal to 1 as the current file group, wherein N is more than or equal to i and is more than 0;
step 4, setting a third time period for each dynamic storage unit of the quantitative storage level;
step 5, copying at least one data file included in the current file group from the second memory to a dynamic storage unit of the quantitative storage level allocated to each pre-fetching user application of the quantitative storage level;
step 6, when the third time period expires, judging whether the i is equal to N, if yes, ending; if not, taking the file group with the serial number i being i +1 as the current file group, and performing step 5;
wherein the size of each file group is smaller than the storage capacity of the dynamic storage unit of the fixed-amount storage tier.
Wherein the setting means determining, from the ordered list, a plurality of pre-fetched user applications of the plurality of user applications that can be pre-loaded from the second memory into the first memory comprises:
when the number of the user applications with the operation probability larger than the pre-fetching threshold value in the ordered list is larger than 0, determining the user applications with the operation probability larger than the pre-fetching threshold value in the ordered list as the pre-fetching user applications which can be pre-loaded into the first memory from the second memory so as to determine at least one pre-fetching user application;
when the number of user applications in the ordered list having an operating probability greater than the pre-fetch threshold is equal to 0, determining all user applications in the ordered list as pre-fetched user applications that can be pre-loaded from the second memory into the first memory to determine at least one pre-fetched user application.
Wherein the setting means setting a storage level for each of the at least one pre-fetch user application according to the ordered list comprises:
setting the storage level of the pre-fetching user application with the operation probability larger than the high probability threshold value in the ordered list as a decrement storage level;
setting the storage level of the pre-fetching user application with the running probability less than or equal to the high probability threshold and greater than the medium probability threshold in the sorted list as an incremental storage level;
setting the storage level of the pre-fetching user application with the running probability less than or equal to the middle probability threshold and greater than the low probability threshold in the sorted list as a quantitative storage level;
and setting the storage level of the pre-fetching user application with the operation probability less than or equal to the low probability threshold value in the sorted list as a compression storage level.
Wherein the at least one dynamic storage unit allocated by the allocating means for the pre-fetching user application of each reduced storage tier is able to hold all data files of the pre-fetching user application of the corresponding reduced storage tier, and the at least one dynamic storage unit allocated by the allocating means for the pre-fetching user application of each compressed storage tier is able to hold all compressed data files of the pre-fetching user application of the corresponding compressed storage tier.
Wherein the first time period is 30 seconds, the second time period is 60 seconds, and wherein the third time period is 90 seconds.
Wherein the at least one base data file of each pre-fetching user application is at least one data file of the plurality of data files associated with each pre-fetching user application of the incremental storage tier that has a launch order above a priority threshold.
Wherein the first predetermined number is 5 and the second predetermined number is 8.
Drawings
A more complete understanding of exemplary embodiments of the present invention may be had by reference to the following drawings in which:
fig. 1 is a flowchart of a method for prefetching data in a mobile internet according to a region scope according to an embodiment of the present invention;
FIG. 2 is a logical representation of an ordered list according to an embodiment of the present invention;
FIG. 3 is a logic diagram illustrating a reduced amount store according to an embodiment of the present invention;
FIG. 4 is a logic diagram of incremental storage according to an embodiment of the present invention;
FIG. 5 is a logic diagram of a quantitative store according to an embodiment of the present invention;
FIG. 6 is a logic diagram of compressed storage according to an embodiment of the present invention; and
fig. 7 is a schematic structural diagram of a system for prefetching data in a mobile internet according to a region scope according to an embodiment of the present invention.
Detailed Description
Fig. 1 is a flow chart of a method 100 for prefetching data in a mobile internet according to a region scope according to an embodiment of the present invention. As shown in fig. 1, method 100 begins at step 101.
In step 101, an operation statistical file associated with a target mobile terminal in a mobile internet is obtained, and the operation statistical file is analyzed to obtain position statistical information of the target mobile terminal and operation statistical information of each user application in a plurality of user applications in the target mobile terminal, where the position statistical information is a coordinate point set, and the coordinate point set includes a plurality of position coordinate points that have been reached by the target mobile terminal within a predetermined number of natural days. The mobile internet includes a plurality of mobile terminals, base stations, content servers, and the like. The method and the device determine the mobile terminal which initiates the data prefetching request or the mobile terminal which requests to perform data prefetching as the target mobile terminal. Furthermore, the number of user applications included or installed in each mobile terminal (including the target mobile terminal) is greater than 4, e.g. 5, 10, 20 user applications. Concepts related to user applications include system applications, and system applications are typically system level applications determined by the operating system of the mobile terminal.
The operation statistical file comprises a position data table, and the application sets or creates the position data table for the target mobile terminal. The location data table includes a plurality of data items and the content of each data item is a triplet < location coordinate point, start time, end time > or a quintet < application name, location coordinate point, start time, end time, accumulated time length >. For example, the data item is < caf, 20:00, 8.6.2018, 21:50, 6.8.2018, or < caf, 20:00, 8.6.8.2018, 21:50, 110 minutes.
According to the method and the device, all position coordinate points in each data item of a position data table form a coordinate point set, the coordinate point set is used as operation position information, and the position data table is used for recording the operation position information of the target mobile terminal in real time. That is, in a case where the mobile terminal is operating, the operating system or the control device may count and record location information of the mobile terminal, for example, a location coordinate point, a start time (at the current location coordinate point), an end time (at the current location coordinate point), and the like, in real time. Wherein. The set of coordinate points includes a plurality of location coordinate points that the target mobile terminal has reached during a statistical time interval (a predetermined number of natural days). Therefore, the location data table records location information (location coordinate point, operation location information) within a statistical time interval (a predetermined number of natural days) from a specific time point in the past to a current time point of the mobile terminal. Wherein, in the operation statistical file or the location data table, the application stores a predetermined number (e.g. 100, 200, 300) of data items for the (target) mobile terminal, or stores data items within a predetermined number of natural days (e.g. 10 days, 20 days, 30 days) for each (target) mobile terminal. Wherein the predetermined number of natural days is 10 natural days, 20 natural days, 30 natural days, or any reasonable number of natural days.
Wherein no position coordinate point within the set of coordinate points has a linear distance from any single one of the plurality of position coordinate points that is greater than 5 meters, 6 meters, 8 meters, or 10 meters, i.e., any position coordinate point within the set of coordinate points has position coordinate points that are positionally or temporally proximate, and the linear distance between position coordinate points that are positionally or temporally proximate is less than or equal to 5 meters, 6 meters, 8 meters, 10 meters, or any reasonable distance. Alternatively, when the target mobile terminal moves, whenever the current position of the target mobile terminal is a distance equal to 5 meters, 6 meters, 8 meters, 10 meters, or any reasonable distance from the last position coordinate point (a position coordinate point that is positionally or temporally adjacent, or a position coordinate point that is closest in distance) to the current position coordinate point(s), the (coordinate point(s) of the current position is determined as the current position coordinate point. In this case, the distances between the position coordinate points may be equal. Every time 5 seconds, 10 seconds, 15 seconds, 30 seconds, or any reasonable time elapses, (the coordinate point of) the current position of the target mobile terminal is determined as the current position coordinate point. In this case, when the target mobile terminal does not move at the expiration of 5 seconds, 10 seconds, 15 seconds, 30 seconds, or any reasonable time, the current position coordinate point coincides with the last position coordinate point recorded. In this case, the distance between the position coordinate points may be dense (the mobile terminal moves at a low speed) or loose (the mobile terminal moves at a high speed, for example, by riding a car, a train, or the like).
In the present application, at the end of the current natural day, each data item associated with each position coordinate point that the target mobile terminal has reached within the current natural day is saved into the position data table. For example, at 24 pm on 6/8/2018 (i.e., 0 pm on 6/9/2018), each data item < position coordinate point, start time, end time > associated with each position coordinate point reached by the target mobile terminal within 6/8/2018 is saved into the position data table. That is, when the comparison between the linear distance between the current position coordinate point and each position coordinate point in the coordinate point set and the distance threshold is performed within the current natural day, the position coordinate point within the current natural day is not included in the coordinate point set. For example, when the comparison of the straight-line distance between the current position coordinate point and each position coordinate point in the set of coordinate points with the distance threshold is performed within 6/8 of 2018, the position coordinate points within 6/8 of 2018 are not included in the set of coordinate points. For example, in a case where the predetermined number of natural days is 10 natural days, the coordinate point set includes each of the position coordinate points that the target mobile terminal has reached within 10 natural days, that is, 29 days 5 and 29 days 2018 and 7 days 6 and 7 months 2018.
The operation statistical file comprises a plurality of operation data tables, and the application allocates one operation data table to each user application in a plurality of user applications in the target mobile terminal. Each operation data table includes a plurality of operation data items and the content of each operation data item is quintuple < application name, position coordinate point, start time, end time, accumulated time length >. For example, the operation data items are < royal glory, gawa cafe, 6/8/2018 20:00, 6/8/2018/21: 50, 110 minutes >.
The running data table allocated to each user application is used as the running statistical information of each user application, namely, the running statistical information of each user application is provided in the form of the running data table. And the running data table allocated to each user application is used for recording the running position information of each user application in real time. That is, in the case where the mobile terminal is operated, the operating system or the control device may count and record the operation location information of each user application, for example, an application name, a location coordinate point, a start time, an end time, and the like, in real time. Therefore, the data table records the running information of each user application in a statistical time interval from a specific time point in the past to the current time point. Wherein, in the running statistics file, the application stores a predetermined number (e.g., 100, 200, 300) of running data items for each user application, or stores running data items for each user application within a predetermined length of time or a predetermined number of natural days (e.g., 10 days, 20 days, 30 days). Wherein the predetermined number of natural days is 10 natural days, 20 natural days, 30 natural days, or any reasonable number of natural days.
At step 102, center point clustering is performed on all position coordinate points in the coordinate point set based on mutual distances between the plurality of position coordinate points to divide the coordinate point set into a plurality of subsets and each subset includes at least one position coordinate point, each of the plurality of subsets including position coordinate points whose number is greater than a region threshold is selected as a region subset, and a single region range is constructed from the single region subset, thereby generating a plurality of region ranges.
Further, the present application may also determine at least one center point based on mutual distances between a plurality of position coordinate points, and classify all the position coordinate points in the coordinate point set based on each center point to divide the coordinate point set into a plurality of subsets and each subset includes at least one position coordinate point, select each of the plurality of subsets, in which the number of included position coordinate points is greater than a region threshold, as a region subset, and construct a single region range from the single region subset, thereby generating a plurality of region ranges.
Any known center point clustering or classification method may be used to divide the set of coordinate points into a plurality of subsets. In a simplified version, all location coordinate points in the set of coordinate points may be classified according to building and road: all the position coordinate points in the same building are taken as one subset and each position coordinate point on the road is not taken into consideration, or each position coordinate point on the road is selected as a single subset (i.e., only one position coordinate point is included in each subset). In summary, the present application may divide the set of coordinate points into a plurality of subsets in any manner and each subset includes at least one position coordinate point.
In any way, after the coordinate point set is divided into a plurality of subsets, for example, by center point clustering, (center point) classification, building classification, etc., the straight-line distance between any position coordinate point in each subset and the center point of the attributed subset is smaller than the straight-line distance between any position coordinate point in any subset except the attributed subset and the center point of any other subset. When the straight-line distance between the first position coordinate point in any subset and the central point of any subset is larger than the straight-line distance between the first position coordinate point in any subset and the central point of another subset, the first position coordinate point is divided into the other subset. That is, the straight-line distance between any position coordinate point in each subset and the center point of the subset in which the position coordinate point is located is smaller than the straight-line distance between any position coordinate point in other subsets and the center point of the other arbitrary subsets. For example, when a straight-line distance of a first position coordinate point in the first subset from a center point of the first subset is greater than a straight-line distance from a center point of the second subset, the first position coordinate point is divided into the second subset.
In the present application, the region threshold is 50, 100 or 200. In each subset, at least one position coordinate point is selected as a center point, and the center point can be a plurality of position coordinate points that coincide in position, or the center point can be a plurality of position coordinate points that are located close together. Wherein constructing the single region range from the single subset of regions comprises: calculating the straight-line distance between the center point and each position coordinate point in other position coordinate points in the single area subset to which the center point belongs; determining the longest straight-line distance in the straight-line distances between the center point and each position coordinate point; a circle centered at a center point within a single subset of regions and having a radius of the longest straight-line distance is constructed as a single region extent. For example, wherein constructing the first region range from the first subset of regions comprises: calculating the straight-line distance between the center point of the first area subset and each position coordinate point in any other position coordinate points in the first area subset; determining the longest straight-line distance in the straight-line distances between the center point of the first area subset and each position coordinate point; a circle having a center point within the first subset of regions as a center point and a radius of the longest straight-line distance is constructed as the first region range.
FIG. 2 is a logic diagram of an ordered list 200 according to an embodiment of the invention. As shown in fig. 2, the residence 202 is an area where the user of the target mobile terminal lives, the office 203 is an area where the user of the target mobile terminal works, and the restaurants 204 and 205 are areas where the user of the target mobile terminal takes lunch. In fig. 2, the position coordinate points are represented by circles within the area range, where a solid circle is a position coordinate point selected as the center point of the area range, and an open circle is a position coordinate point not selected as the center point of the area range. Within the residence 202, there are a plurality of position coordinate points, with the position coordinate point at the center being selected as the center point. The plurality of location coordinate points of the residence 202 are used to represent a plurality of locations, e.g., a bedroom, a living room, and the like, reached by the user holding the target mobile terminal at the residence 202 (home). The plurality of location coordinate points of the office 203 are used to represent a plurality of locations, for example, at a work place, in a conference room, which the user has reached by holding the target mobile terminal at the office 203. In the office 203, three position coordinate points located at the center are selected as the center points. The position coordinate points of the restaurants 204 and 205 are used to represent the positions of the user holding the target mobile terminal for meals in the restaurant. In the restaurants 204 and 205, a position coordinate point located at the center is selected as the center point.
Wherein the plurality of location coordinate points 206 between the residence 202 and the office 203 are used to indicate a plurality of location coordinate points that have been reached by the user of the target mobile terminal to work or to work. It should be appreciated that the present application demonstrates the multiple location coordinate points that a user has reached during work or work in a simple path, while in practice, the user may be routed different paths during work or work, and possibly at different locations (e.g., one side or the other side of the road, etc.) during the same path. Similarly, the plurality of location coordinate points between the office 203 and the restaurants 204, 205 are used to indicate a plurality of location coordinate points that the user of the target mobile terminal has reached when going to a meal or returning. As described above, depending on how the position coordinate points are collected, the plurality of position coordinate points of the target mobile terminal may be dense, overlapped, dispersed, and the like. However, no position coordinate point within the set of coordinate points is present that is linearly more than 5, 6, 8 or 10 meters away from any single one of the plurality of position coordinate points, i.e., any position coordinate point within the set of coordinate points has (positionally or temporally) neighboring position coordinate points, and the linear distance between (positionally or practically) neighboring position coordinate points is less than or equal to 5, 6, 8, 10 or any reasonable distance.
In any way, after the coordinate point set is divided into a plurality of subsets, for example, by center point clustering, (center point) classification, building classification, etc., the straight-line distance between any position coordinate point in each subset and the center point of the attributed subset is smaller than the straight-line distance between any position coordinate point in any subset except the attributed subset and the center point of any other subset. And when the straight-line distance between the first position coordinate point in any subset and the central point of any subset is greater than the straight-line distance between the first position coordinate point in any subset and the central point of another subset, dividing the first position coordinate point into the another subset. That is, the straight-line distance between any position coordinate point in each subset and the center point of the subset in which the position coordinate point is located is smaller than the straight-line distance between any position coordinate point in other subsets and the center point of the other arbitrary subsets. For example, when a straight-line distance of a first position coordinate point in the first subset from a center point of the first subset is greater than a straight-line distance from a center point of the second subset, the first position coordinate point is divided into the second subset.
In the present application, the region threshold is 50, 100 or 200. In each subset, at least one location coordinate point is selected as a center point, and the center point can be a plurality of location coordinate points whose locations coincide, or the center point can be a plurality of location coordinate points whose locations are nearby, such as is the case in office 203.
In the case where the center point can be a plurality of location coordinate points located in close proximity, constructing a single area range from a single subset of areas includes: determining a central point of the plurality of central points as a composite central point; calculating the straight-line distance between the composite center point and each position coordinate point in other position coordinate points in the single region subset to which the composite center point belongs; determining the longest straight line distance in the straight line distances between the composite center point and each position coordinate point; a circle centered at the composite center point within the subset of the single region and having a radius of the longest straight-line distance is constructed as the single region extent. For example, wherein constructing the first region range from the first subset of regions comprises: calculating the straight-line distance between the composite center point of the first area subset and each position coordinate point in any other position coordinate points in the first area subset; determining the longest straight-line distance in the straight-line distances between the composite center point of the first area subset and each position coordinate point; and constructing a circle with the composite center point in the first area subset as the center and the radius of the longest straight line distance as a first area range.
In step 103, the current position of the target mobile terminal is monitored, when it is determined that the continuous time length of the current position of the target mobile terminal in a specific area range of the multiple area ranges reaches a stay threshold, the operation probability of each user application in the specific area range is determined according to the operation statistical information of each user application, and the multiple user applications are sorted in a descending order of the operation probability based on the operation probability of each user application in the specific area range to generate a sorted list.
The method and the device utilize a positioning component (such as a GPS component or a Beidou component) to monitor the current position of the target mobile terminal in real time, and determine whether the continuous time length of the current position of the target mobile terminal in a specific area range of a plurality of area ranges reaches a stop threshold value. Wherein the residence threshold is 1 minute, 5 minutes, 10 minutes, or 15 minutes.
When the continuous time length that the current position of the target mobile terminal is in a specific area range of the plurality of area ranges reaches the stay threshold, determining the operation probability of each user application in the specific area range according to the operation statistical information of each user application comprises:
selecting a statistical date interval for determining the probability of operation, the statistical date interval including at least 10 natural days (e.g., 10 natural days, 20 natural days, 30 natural days);
and analyzing each data item in the plurality of data items in the running statistical information of each user application to determine the effective times Ci of running of each user application in a specific area range in the statistical date interval. For example, when the user application has a running time in a specific area range (e.g., the residential site 202) exceeding 60 seconds, it counts as a valid number of times. For example, if the continuous operation time of the pay bank application in a specific region range (for example, the residential area 202) in each of 10 natural days is 50 seconds (operation does not exceed 60 seconds), 120 seconds, 0 seconds (non-operation), 180 seconds, 360 seconds, 520 seconds, 780 seconds, 0 seconds (non-operation), 55 seconds (operation does not exceed 60 seconds), and 600 seconds, the valid number of times of the pay bank application is 0+1+0+1+1+ 0+0+1 to 6 times. Wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal and Na is more than 4;
the total number of validations S that all user applications run within a particular region range is calculated based on the number of validations Ci for each user application within the statistical date interval within the particular region range (e.g., the residence 202):
Figure GDA0003355770970000141
and calculating the operation probability Pi & Ci/S of each user application in the specific area range.
For example, the pay for use is executed 6 times in a specific region range (for example, the residence 202) on 10 natural days, the WeChat use is executed 10 times in a specific region range (for example, the residence 202) on 10 natural days, the Taobao use is executed 3 times in a specific region range (for example, the residence 202) on 10 natural days, the King is awarded 1 time in a specific region range (for example, the residence 202) on 10 natural days, and the Meiqu use is executed 0 times in a specific region range (for example, the residence 202) on 10 natural days, so that S is 20 times. The operation probabilities of the pay for use, WeChat application, Taobao application, Royal and beauty team application for a specific region area (e.g., the residence 202) are 30%, 50%, 15%, 5% and 0%, respectively.
Alternatively, wherein determining the operation probability of each user application within the specific area according to the operation statistical information of each user application comprises:
selecting a statistical date interval for determining the probability of operation, the statistical date interval including at least 10 natural days, (e.g., 10 natural days, 20 natural days, 30 natural days);
each of the plurality of data items within the running statistics of each user application is parsed to determine a length of time ti for which each user application is running within a particular region within the statistics interval. The time of operation of the pay for use application within a specific regional scope (e.g., the residence 202) on each of the 10 natural days is 10 seconds, 60 seconds, 0 seconds, 50 seconds, 30 seconds, 90 seconds, 120 seconds, 0 seconds, 15 seconds, and 60 seconds, and then the time length of the pay for use application is 435 seconds. Wherein i is more than or equal to 1 and less than or equal to Na, the Na is the number of user applications in the target mobile terminal, and the Na is more than 4;
based on the length of time ti that each user application runs within the statistical date interval within a particular region (e.g., the residence 202), the total length of time T that all user applications run within the particular region is calculated:
Figure GDA0003355770970000142
and calculating the operation probability Pi of each user application in the specific area range, namely ti/T.
For example, if the paupo application runs for 435 seconds in a specific region range (e.g., residence 202) on 10 natural days, the WeChat application runs for 875 seconds in a specific region range (e.g., residence 202) on 10 natural days, the Taobao application runs for 500 seconds in a specific region range (e.g., residence 202) on 10 natural days, the King blooms for 190 seconds in a specific region range (e.g., residence 202) on 10 natural days, and the Mei Gong application runs for 0 seconds in a specific region range (e.g., residence 202) on 10 natural days, then T equals 2000 seconds. The operation probabilities of the pay for use, WeChat application, Taobao application, Royal and beauty team application for a specific region area (e.g., the residence 202) are 21.75%, 43.75%, 25%, 9.5% and 0%, respectively.
In the example shown in fig. 2, as shown in table 210, in a specific region range (for example, the residential area 202) within 10 natural days from 6/1/2018 to 6/10/2018, the operation probability of the royal glory is 18%, the operation probability of the trembled short video is 16%, the operation probability of the kukoku video is 15%, the operation probability of the mobile phone panning is 13%, the operation probability of the masu takeout is 10%, the operation probability of the hectic takeout is 9%, the operation probability of the polo vehicle is 7%, the operation probability of the tribasic superimposter is 6%, and the operation probability of the lazy english is 0%.
At step 104, determining at least one of the plurality of user applications that can be preloaded from the second memory into the first memory according to the ordered list, and setting a storage level for each of the at least one pre-fetch user application according to the ordered list, wherein the storage levels include: a decrement storage stage, an increment storage stage, a quantitative storage stage, and a compressed storage stage.
Wherein determining from the ordered list a plurality of pre-fetch user applications of the plurality of user applications that can be pre-loaded from a second memory into a first memory comprises: when the number of user applications in the ordered list having an operating probability greater than the pre-fetch threshold (e.g., 5%, 10%) is greater than 0 (e.g., 10), determining the user applications in the ordered list having an operating probability greater than the pre-fetch threshold as pre-fetch user applications that can be pre-loaded from the second memory into the first memory to determine at least one pre-fetch user application; when the number of user applications in the ordered list having a running probability greater than the pre-fetch threshold (e.g., 5%, 10%) is equal to 0, all user applications (e.g., 15) in the ordered list are determined as pre-fetched user applications that can be pre-loaded from the second memory into the first memory to determine at least one pre-fetched user application.
Wherein setting a storage level for each of the at least one pre-fetch user application according to the ordered list comprises:
setting a storage level of the pre-fetched user applications in the ordered list having an operational probability greater than a high probability threshold (e.g., 15%) to a reduced storage level;
setting a storage level of the pre-fetch user application in the sorted list having a probability of operation less than or equal to a high probability threshold (e.g., 15%) and greater than a medium probability threshold (e.g., 12%) as an incremental storage level;
setting a storage level of the pre-fetched user applications in the sorted list having a probability of operation less than or equal to a medium probability threshold (e.g., 12%) and greater than a low probability threshold (e.g., 8%) as a quantitative storage level;
setting a storage level of the pre-fetched user applications in the sorted list having an operating probability less than or equal to a low probability threshold (e.g., 8%) as a compressed storage level. Wherein the operation probability of pre-fetching user applications is greater than 5%.
As shown in fig. 2, according to the above-described manner, it can be determined that the operation probability of the royal glowing and the operation probability of the tremble short video are 18% and 16%, and therefore the storage level of the royal glowing and the tremble short video is the reduced storage level. The running probability of the Youkou video is 15% and the running probability of the mobile phone panning is 13%, so the storage level of the Youkou video and the mobile phone panning is an incremental storage level. The operation probability of the American college takeout is 10% and the operation probability of the Baidu takeout is 9%, so that the storage level of the American college takeout and the Baidu takeout is a quantitative storage level, the operation probability of the masterpiece flying vehicle is 7% and the operation probability of the masterpiece flying vehicle is 6%, so that the storage level of the masterpiece flying vehicle and the masterpiece flying vehicle is a compression storage level.
Since the number 8 of user applications having an operation probability greater than 5% of the pre-fetch threshold in the sorted list is greater than 0, the user applications having an operation probability greater than the pre-fetch threshold in the sorted list (the operation probability of royal glory is 18%, the operation probability of jittering short video is 16%, the operation probability of kukoku video is 15%, the operation probability of mobile phone panning is 13%, the operation probability of masu takeout is 10%, the operation probability of Baidu takeout is 9%, the operation probability of masterwork galloping is 7%, and the operation probability of tribasic masterless is 6%) are determined as pre-fetch user applications that can be pre-loaded from the second memory into the first memory to determine at least one pre-fetch user application. The operating probability of the lazy english language is 0%, and therefore does not belong to the pre-fetching user application.
At step 105, at least one dynamic memory location is allocated for each pre-fetch user application of the reduced storage tier, at least one dynamic memory location is allocated for each pre-fetch user application of the compressed storage tier, one dynamic memory location is allocated for each pre-fetch user application of the increased storage tier and one dynamic memory location is allocated for each pre-fetch user application of the quantitative storage tier. Wherein the storage capacity of each of the at least one dynamic storage unit allocated for each of the pre-fetched user applications of the reduced storage tier may be the same or different, and the storage capacity of each of the at least one dynamic storage unit allocated for each of the pre-fetched user applications of the compressed storage tier may be the same or different.
The total storage capacity of the at least one dynamic storage unit allocated for the pre-fetching user application of each reduced storage tier is capable of accommodating all data files of the pre-fetching user application of the corresponding reduced storage tier. The total storage capacity of the at least one dynamic storage unit allocated for the pre-fetching user application of each compressed storage tier is capable of accommodating all compressed data files of the pre-fetching user application of the corresponding compressed storage tier. One dynamic memory unit is allocated for each pre-fetching user application of the incremental storage tier that can accommodate all data files of the pre-fetching user application of the corresponding incremental storage tier. One dynamic memory unit is allocated to each pre-fetching user application of a quantitative memory rank to be able to accommodate all data files of the pre-fetching user application of the corresponding quantitative memory rank.
In step 106, a storage level is set for the dynamic storage unit allocated for each pre-fetching user application according to the storage level of each pre-fetching user application. Setting each dynamic memory unit of the at least one dynamic memory unit allocated for each pre-fetching user application of the reduced memory rank as a reduced memory rank, setting each dynamic memory unit of the at least one dynamic memory unit allocated for each pre-fetching user application of the compressed memory rank as a compressed memory rank, setting one dynamic memory unit allocated for each pre-fetching user application of the increased memory rank as an increased memory rank and setting one dynamic memory unit allocated for each pre-fetching user application of the increased memory rank as a quantitative memory rank.
In step 107, data prefetching is performed on the data file associated with each prefetched user application from the second memory according to the storage level of the prefetched user application, including:
preferably, the (all) plurality of data files associated with each pre-fetching user application of a reduced storage tier are copied from the second memory to the dynamic storage unit of at least one reduced storage tier allocated for each pre-fetching user application of a reduced storage tier, and a first time period is set and timed for the dynamic storage unit of each reduced storage tier upon completion of the copying, a first predetermined number of data files being deleted in the dynamic storage unit of each reduced storage tier each time the first time period expires until none of the dynamic storage units of each reduced storage tier has a data file.
FIG. 3 is a logic diagram of an embodiment of a decrement storage 300. The operation probability of the royal glory is 18% and the operation probability of the tremble short video is 16%, so that the storage level of the royal glory and tremble short video is a decrement storage level.
All data files of the royal glowing are copied from the second memory to the dynamic memory units 301, 302 and 303 of at least one reduced memory level allocated for the royal glowing. Each of the dynamic memory units 301, 302, and 303 has a memory capacity of 500M, and an application name and a memory level are labeled in each dynamic memory unit. A first time period (e.g., 30 seconds, 50 seconds, 60 seconds) is set for the dynamic storage units 301, 302, and 303 of each reduced storage rank after the copying is completed, and a first predetermined number (e.g., 3, 5) of data files are deleted in the dynamic storage units 301, 302, and 303 of each reduced storage rank every time the first time period expires (i.e., every time 30 seconds, 50 seconds, 60 seconds elapses).
All data files of the trembling short video are copied from the second memory to the dynamic memory units 311 and 312 of at least one decrement memory level allocated for the trembling short video. Each of the dynamic memory units 311 and 312 has a memory capacity of 60M, and an application name and a memory level are labeled in each dynamic memory unit. And sets a first time period (e.g., 30 seconds, 50 seconds, 60 seconds) for the dynamic storage units 311 and 312 of each reduced storage rank after the copying is completed, and deletes a first predetermined number (e.g., 3, 5) of data files in the dynamic storage unit of each reduced storage rank every time the first time period expires (i.e., every time 30 seconds, 50 seconds, 60 seconds elapses). For example, after the data files of the royal glorious and tremble short videos are all copied to the corresponding dynamic storage units 301, 302, and 303, and 311 and 312, a timer is started, and 3 data files are deleted from each of the dynamic storage units 301, 302, 303, 311, and 312 every time 30 seconds pass. When none of the dynamic storage units 301, 302, and 303, and 311 and 312 have a data file, deletion of the file is stopped.
Preferably, at least one base data file is selected among the (all) plurality of data files associated with each pre-fetching user application of the incremental storage tier, the at least one base data file of each pre-fetching user application of the incremental storage tier is copied from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier, and a second time period is set and timed for the dynamic storage unit of the incremental storage tier upon completion of the copying, wherein a second predetermined number of data files, other than already copied files, of the plurality of data files associated with each pre-fetching user application of the incremental storage tier are copied from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier each time period expires until all data files associated with each pre-fetching user application are copied to the corresponding allocated incremental storage tier Dynamic memory cells of the storage level. Wherein the at least one base data file of each pre-fetching user application is at least one data file of the plurality of data files associated with each pre-fetching user application of the incremental storage tier having a firing order above a priority threshold (e.g., a priority threshold of 3, i.e., the firing order for each of the plurality of data files is set to 1, 2, 3, 4, or 5 levels, with the level of the firing order for 1, 2, 3, 4, or 5 levels increasing in order).
Wherein one dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application is capable of accommodating/storing all data file(s) of the corresponding/attributed pre-fetching user application.
FIG. 4 is a logic diagram of an incremental store 400 according to an embodiment of the present invention. The running probability of the Youkou video is 15% and the running probability of the mobile phone panning is 13%, so that the storage level of the Youkou video and the mobile phone panning is an incremental storage level.
The 10 elementary data files are selected from the (all) plurality of data files associated with the kukov video, and these 10 elementary files are copied from the second memory to the dynamic storage unit 401 of the incremental storage tier allocated for the kukov video. The storage capacity of the dynamic storage units 401 is 200M each, and an application name and a storage level are labeled in each dynamic storage unit. A second time period (e.g., 30 seconds, 50 seconds, 60 seconds) is set for the dynamic storage unit 401 of the incremental storage tier after the copying is completed, and a second predetermined number (e.g., 3, 5, 8) of data files (other than the already copied files) of the plurality of data files associated with the use of the kukov video are copied from the second memory to the dynamic storage unit 401 every time the second time period expires (i.e., every time 30 seconds, 50 seconds, 60 seconds elapses).
The 10 base data files are selected from the (all) plurality of data files associated with the mobile phone pan, and the 10 base files are copied from the second memory to the dynamic storage unit 402 of the incremental storage level allocated for the mobile phone pan. The dynamic memory units 402 each have a memory capacity of 300M, and an application name and a memory level are labeled in each dynamic memory unit. A second time period (e.g., 30 seconds, 50 seconds, 60 seconds) is set for the dynamic storage unit 402 of the incremental storage stage after the copying is completed, and a second predetermined number (e.g., 3, 5, 8) of data files (other than the already copied files) of the plurality of data files associated with the mobile phone panning is copied from the second memory to the dynamic storage unit 402 every time the second time period expires (i.e., every time 30 seconds, 50 seconds, 60 seconds elapses).
For example, after all 10 basic data files of the youku video and the mobile phone panning are copied to the corresponding dynamic storage units 401 and 402, timing is started, and every time 60 seconds pass, 8 data files (initially 100 data files) of 90 data files associated with the youku video are copied from the second memory to the dynamic storage unit 401; and copying 8 data files (initially 160 data files) of the 150 data files associated with the panning of the mobile phone from the second memory to the dynamic storage unit 401 every time 60 seconds elapse. When all 100 data files of the Youkou video are copied into the Olympic dynamic storage unit 401, the copying operation is not performed, and when all 160 data files of the mobile phone Taobao are copied into the Olympic dynamic storage unit 402, the copying operation is not performed
Preferably, at least one data file is selected from the (all) plurality of data files associated with each pre-fetching user application of the quantitative storage tier (the total storage capacity required for the selected at least one data file being smaller than the storage capacity of the dynamic storage units of the quantitative storage tier) in dependence on the storage capacity of the dynamic storage units of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier, and the selected at least one data file is copied from the second memory to the dynamic storage units of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier.
FIG. 5 is a logic diagram of a quantitative storage 500 according to an embodiment of the present invention. Wherein the operation probability of the American group take-out is 10% and the operation probability of the Baidu take-out is 9%, so that the storage level of the American group take-out and the Baidu take-out is a quantitative storage level. At least one data file is selected from (all) the plurality of data files associated with the massa takeaway (the selected at least one data file requiring a storage capacity of less than 20M) according to the storage capacity 20M of the dynamic storage unit of the quantitative storage tier assigned for the massa takeaway, and the selected at least one data file is copied from the second storage to the dynamic storage unit 501. At least one data file is selected from (all) the plurality of data files associated with the massa takeaway (the selected at least one data file requiring less than 10M of storage capacity) based on the storage capacity 10M of the dynamic storage unit of the quantitative storage tier assigned for the hundred degrees takeaway, and the selected at least one data file is copied from the second storage to the dynamic storage unit 511.
Alternatively, wherein selecting at least one data file from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier comprises:
the plurality of data files associated with each pre-fetching user application of the quantitative storage tier are grouped according to a storage capacity of a dynamic storage unit (501 or 511) of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier (American or Baidu takeout) to generate a plurality of file groups, wherein each file group includes at least one data file. Wherein the total storage capacity required for the at least one data file of each file group is smaller than the storage capacity of the dynamic storage unit of the corresponding quantitative storage tier. That is, the total storage capacity of all data files in each file group for the U.S. take-out is less than 20M, and the total storage capacity of all data files in each group for the hundred degree take-out is less than 10M. Different priorities are set for each of the plurality of file groups of the pre-fetching user application of the quantitative storage tier to form a priority queue. For example, the cohesive takeout includes 5 file groups, and the priorities of the 5 file groups are 1, 2, 3, 4, and 5 (where the smaller the number, the higher the priority). The group of files at the head of the queue (the group of files with priority 1) in each priority queue is taken as the current group of files and at least one data file in the current group of files is copied from the second memory to a dynamic storage unit (e.g., dynamic storage unit 501) of the quantitative storage level allocated for each pre-fetching user application of the quantitative storage level. A third time period (e.g., 30 seconds, 60 seconds, or 90 seconds) is set for each dynamic memory cell (501 or 511) of the quantitative memory rank after replication is complete. Every time the third time period expires (i.e., every time 30 seconds, 60 seconds pass), the next file group in the priority queue (e.g., file group of priority 2) is used as the current file group in order of decreasing priority until there is no next file group. That is, the file groups of priorities 1, 2, 3, 4, and 5 are copied to the dynamic storage unit 501 or 511. It can be seen that when the time is long enough (sufficiently longer than the plurality of third time period periods), for example, the third time period is 90 seconds, and the 450 th second is reached (i.e., when the 5 third time periods are reached), all of the 5 file groups are used as the current file group. In this case, the content in the dynamic storage unit (501 or 511) is not being updated, i.e., at least one data file of the file group having the priority of 5 is retained in the dynamic storage unit 501.
At least one data file in the current set of files (possibly a set of files with a priority of 1, 2, 3, 4 or 5) is taken as the at least one data file selected from the plurality of data files associated with each pre-fetching user application of a quantitative storage tier. Wherein the size of each file group (i.e., the size of all data files in the file group) is smaller than the storage space of the dynamic storage unit of the corresponding quantitative storage tier.
Alternatively, wherein selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetch user application of the quantitative storage tier comprises:
the plurality of data files associated with each pre-fetching user application of the quantitative storage tier are grouped according to the storage capacity of the dynamic storage unit (501 or 511) of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier (American takeaway or Baidu takeaway) to generate a plurality of file groups, wherein each file group includes at least one data file wherein the total storage capacity required for the at least one data file of each file group is less than the storage capacity of the dynamic storage unit of the corresponding quantitative storage tier. That is, the total storage capacity of all data files in each file group for the U.S. take-out is less than 20M, and the total storage capacity of all data files in each group for the hundred degree take-out is less than 10M. For example, the beauty group takeout includes 5 file groups, and the 5 file groups have sequence numbers of 1, 2, 3, 4, and 5. Randomly selecting one file group (file group with the sequence number of 5) from the plurality of file groups as a current file group, copying at least one data file in the current file group from the second memory to a dynamic storage unit (for example, the dynamic storage unit 501) of a quantitative storage class allocated for each pre-fetching user application of the quantitative storage class, and setting a third time period (for example, 30 seconds, 60 seconds or 90 seconds) for each dynamic storage unit (501 or 511) of the quantitative storage class after the copying is completed. Every time the third time period expires (i.e., every time 30 seconds, 60 seconds elapses), a next file group (e.g., file group of sequence number 2) is randomly selected from the plurality of file groups as the current file group until there is no next file group. The file groups with sequence numbers 1, 2, 3, 4 and 5 are copied to the dynamic storage unit 501 or 511. It can be seen that when the time is long enough (sufficiently longer than the plurality of third time period periods), for example, the third time period is 90 seconds, and the 450 th second is reached (i.e., when 5 third time periods are reached), all of the 5 file groups are used as the current file group. In this case, the content in the dynamic storage unit (501 or 511) is not updated, i.e. at least one data file of the last file group (e.g. file group 1) selected randomly is kept in the dynamic storage unit 501.
At least one data file in the current set of files (possibly a set of files with sequence number 1, 2, 3, 4 or 5) is taken as the at least one data file selected from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier. Wherein the size of each file group (i.e. the size of all data files in the file group) is smaller than the storage space of the dynamic storage unit of the corresponding quantitative storage tier.
Alternatively, after copying the selected at least one data file from the second memory to the dynamic storage unit (501 or 511) of the quantitative storage tier assigned for each pre-fetched user application (mezzo takeaway or hectometre takeaway) of the quantitative storage tier, setting a third time period (e.g., 30 seconds, 60 seconds, or 90 seconds) and starting timing, whenever the third time period (e.g., 30 seconds, 60 seconds, or 90 seconds) expires, re-selecting at least one data file randomly/sequentially from the plurality of data files associated with each pre-fetched user application of the quantitative storage tier based on the storage capacity (20M or 10M) of the dynamic storage unit (501 or 511) of the quantitative storage tier assigned for each pre-fetched user application (mezzo takeaway or hectometre takeaway) of the quantitative storage tier, copying the re-selected at least one data file from the second memory to each pre-fetched user application (mezzo takeaway or hectometer) of the quantitative storage tier Dynamic memory cells (20M or 10M) of the assigned fixed-amount storage rank. Wherein the data file of the at least one data file reselected by the random selection may be the same as the previously randomly selected data file. The data file of the at least one data file reselected by the sequential selection may not be identical to any data file previously selected in the sequential selection.
Alternatively, wherein selecting at least one data file from the plurality of data files associated with each pre-fetching user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier comprises:
step 1, grouping a plurality of data files associated with each pre-fetching user application of the quantitative storage tier according to a storage capacity (20M or 10M) of a dynamic storage unit (501 or 511) of the quantitative storage tier allocated for each pre-fetching user application of the quantitative storage tier (american takeout or hundredth takeout) to generate N (e.g., N ═ 5) file groups, where N is a natural number greater than 1 and each file group includes at least one data file;
step 2, setting different sequence numbers for each of the N file groups, wherein the sequence numbers are from 1 to N (for example, 1, 2, 3, 4 and 5);
step 3, taking the file group with the serial number i equal to 1 as the current file group, wherein N is more than or equal to i and is more than 0;
step 4, setting a third time period (for example, 30 seconds, 60 seconds or 90 seconds) for each dynamic memory unit (501 or 511) of the quantitative memory stage;
step 5, copying at least one data file included in the current file group from the second memory to a dynamic storage unit of the quantitative storage level allocated to each pre-fetching user application of the quantitative storage level, and starting timing;
step 6, when the third time period expires, determining whether i-N (i.e. whether i-5 holds true) holds true, and if yes, ending; if not, taking the file group with the serial number i being i +1 as the current file group, and performing step 5;
wherein the size of each file group is smaller than the storage capacity (20M or 10M) of the dynamic storage unit (501 or 511) of the quantitative storage tier. That is, the total storage capacity of all data files in each file group for the U.S. take-out is less than 20M, and the total storage capacity of all data files in each group for the hundred degree take-out is less than 10M. For example, the beauty group takeout includes 5 file groups, and the 5 file groups have sequence numbers of 1, 2, 3, 4, and 5.
In step 6, if true, the process ends, meaning that: the file groups with sequence numbers 1, 2, 3, 4 and 5 are copied to the dynamic storage unit 501 or 511, and then the copying is stopped. It can be seen that when the time is long enough (sufficiently longer than the plurality of third time period periods), for example, the third time period is 90 seconds, and the 450 th second is reached (i.e., when 5 third time periods are reached), all of the 5 file groups are used as the current file group. In this case, the content in the dynamic storage unit (501 or 511) is not updated, i.e. at least one data file of the last file group (e.g. file group 5) selected randomly is kept in the dynamic storage unit 501.
Preferably, the (all) plurality of data files associated with each pre-fetching user application of the compressed storage tier are compressed to generate a plurality of compressed data files, the plurality of compressed data files of each pre-fetching user application of the compressed storage tier are copied from the second memory to the dynamic storage unit of the at least one compressed storage tier allocated for each pre-fetching user application of the compressed storage tier.
FIG. 6 is a logic diagram of a compressed store 600 according to an embodiment of the present invention. The running probability of the super-quality aerodyne is 7 percent and the running probability of the super-quality aerodyne of three kingdoms is 6 percent, so the storage level of the royal glory and tremble short video is a compressed storage level. The (all) plurality of data files associated with each pre-fetch user application of the compressed storage tier (either mastership or tribune) are compressed to generate a plurality of compressed data files, the plurality of compressed data files of each pre-fetch user application of the compressed storage tier (mastership or tribune) are copied from the second memory to the dynamic storage units 601, 602, and 603, and 611 and 612 of the at least one compressed storage tier allocated for each pre-fetch user application of the compressed storage tier.
For example, the (all) plurality of data files associated with the mastership aircraft are compressed to generate a plurality of compressed data files, which are copied from the second memory to the dynamic storage units 601, 602, and 603. For example, the (all) plurality of data files associated with the tribune pair are compressed to generate a plurality of compressed data files, and the tribune plurality of compressed data files are copied from the second memory to the dynamic storage units 611 and 612.
Preferably, before obtaining the operation statistic file associated with the target mobile terminal in the mobile internet, the method further includes:
the method comprises the steps of responding to a data prefetching request initiated by a user and used for prefetching data aiming at a data file, associated with a user application, of a target mobile terminal in the mobile Internet, and obtaining a dynamic configuration file associated with the data prefetching. The mobile internet includes a plurality of mobile terminals, base stations, content servers, and the like. The method and the device determine the mobile terminal which initiates the data prefetching request or the mobile terminal which requests to perform data prefetching as the target mobile terminal. Furthermore, the number of user applications included or installed in each mobile terminal (including the target mobile terminal) is greater than 4, e.g. 5, 10, 20 user applications. Concepts related to user applications include system applications, and system applications are typically system level applications determined by the operating system of the mobile terminal.
The dynamic profile includes a start address and an end address of a storage area in the first memory for providing a plurality of dynamic storage units. The memory area in which the plurality of dynamic memory cells are provided may be a memory area contiguous in address or a memory area non-contiguous in address in the first memory. The dynamic profile further includes a storage capacity of each of the plurality of dynamic storage units. In general, the storage capacity of each dynamic storage unit may be set according to the size and number of a plurality of data files applied per user within a mobile terminal (target mobile terminal) so that the storage capacity of each dynamic storage unit can accommodate a corresponding at least one data file.
Creating a dynamic index area in a first memory of the target mobile terminal, and creating a plurality of dynamic storage units for storing data files in the first memory according to the dynamic configuration file, wherein the storage capacity of each of the plurality of dynamic storage units is determined according to the dynamic configuration file. Therefore, the method creates a plurality of dynamic storage units for storing the data files in the first storage according to the storage capacity of each dynamic storage unit.
And generating a dynamic index table in the dynamic index area, wherein the dynamic index table comprises a plurality of index entries, and each index entry is used for recording the application identification, the starting address, the ending address, the storage capacity and the storage level of a corresponding dynamic storage unit in a plurality of dynamic storage units. The application identifier is an identifier of a user application to which the dynamic storage unit belongs, the starting address is a starting address of a storage space of the dynamic storage unit, the ending address is an ending address of the storage space of the dynamic storage unit, and the storage capacity is the storage capacity of the storage space of the dynamic storage unit and the storage level is the storage level of the storage space of the dynamic storage unit. For example, the index entry of the dynamic storage unit includes: payment treasure application, 7000H00, 8FFFH, 8Kb, decrement storage level. When any index entry in the dynamic index table relates to updated data, the corresponding index entry in the dynamic index table is updated with the updated data.
Wherein the first memory is a random access memory and the second memory is a read only memory. And updating the corresponding index entry in the dynamic index table according to the storage level set for the dynamic storage unit. Wherein the first time period is 30 seconds, the second time period is 60 seconds, and wherein the third time period is 90 seconds. Wherein the first predetermined number is 5 and the second predetermined number is 8.
It should be understood that, in the present application, when copying one or more data files from the second memory or other locations to the dynamic storage unit of any storage rank, the original data files in the dynamic storage unit of any storage rank are deleted and the new one or more data files are copied to the dynamic storage unit of any storage rank.
Further, when data prefetching ends, or according to a user's operation, the dynamic index area or all the dynamic memory cells are deleted/reset/cleared.
Fig. 7 is a block diagram illustrating a system 700 for prefetching data in a mobile internet according to a region range according to an embodiment of the present invention. As shown in fig. 7, the system 700 includes: analyzing means 701, generating means 702, sorting means 703, setting means 704, assigning means 705, prefetching means 706 and initializing means 707.
The parsing device 701 is configured to obtain an operation statistics file associated with a target mobile terminal in the mobile internet, and parse the operation statistics file to obtain location statistics information of the target mobile terminal and operation statistics information of each user application in a plurality of user applications in the target mobile terminal, where the location statistics information is a set of coordinate points, and the set of coordinate points includes a plurality of location coordinate points that have been reached by the target mobile terminal within a predetermined number of natural days. The mobile internet includes a plurality of mobile terminals, base stations, content servers, and the like. The method and the device determine the mobile terminal which initiates the data prefetching request or the mobile terminal which requests to perform data prefetching as the target mobile terminal. Furthermore, the number of user applications included or installed in each mobile terminal (including the target mobile terminal) is greater than 4, e.g. 5, 10, 20 user applications. Concepts related to user applications include system applications, and system applications are typically system level applications determined by the operating system of the mobile terminal.
The operation statistical file comprises a position data table, and the application sets or creates the position data table for the target mobile terminal. The location data table includes a plurality of data items and the content of each data item is a triplet < location coordinate point, start time, end time > or a quintet < application name, location coordinate point, start time, end time, accumulated time length >. For example, the data item is < caf, 20:00, 8.6.2018, 21:50, 6.8.2018, or < caf, 20:00, 8.6.8.2018, 21:50, 110 minutes.
According to the method and the device, all position coordinate points in each data item of a position data table form a coordinate point set, the coordinate point set is used as operation position information, and the position data table is used for recording the operation position information of the target mobile terminal in real time. That is, in a case where the mobile terminal is operating, the operating system or the control device may count and record location information of the mobile terminal, for example, a location coordinate point, a start time (at the current location coordinate point), an end time (at the current location coordinate point), and the like, in real time. Wherein. The set of coordinate points includes a plurality of location coordinate points that the target mobile terminal has reached during a statistical time interval (a predetermined number of natural days). Therefore, the location data table records location information (location coordinate point, operation location information) within a statistical time interval (a predetermined number of natural days) from a specific time point in the past to a current time point of the mobile terminal. Wherein, in the operation statistical file or the location data table, the application stores a predetermined number (e.g. 100, 200, 300) of data items for the (target) mobile terminal, or stores data items within a predetermined number of natural days (e.g. 10 days, 20 days, 30 days) for each (target) mobile terminal. Wherein the predetermined number of natural days is 10 natural days, 20 natural days, 30 natural days, or any reasonable number of natural days.
Wherein there is no position coordinate point in the set of coordinate points that is linearly more than 5, 6, 8, or 10 meters away from any single position coordinate point in the plurality of position coordinate points, i.e., any position coordinate point in the set of coordinate points has position coordinate points that are locally or temporally proximate, and the linear distance between position coordinate points that are locally or temporally proximate is less than or equal to 5, 6, 8, 10, or any reasonable distance. Alternatively, when the target mobile terminal moves, whenever the current position of the target mobile terminal is a distance equal to 5 meters, 6 meters, 8 meters, 10 meters, or any reasonable distance from the last position coordinate point (a position coordinate point that is positionally or temporally adjacent, or a position coordinate point that is closest in distance) to the current position coordinate point(s), the (coordinate point(s) of the current position is determined as the current position coordinate point. In this case, the distances between the position coordinate points may be equal. Every time 5 seconds, 10 seconds, 15 seconds, 30 seconds, or any reasonable time elapses, (the coordinate point of) the current position of the target mobile terminal is determined as the current position coordinate point. In this case, when the target mobile terminal does not move at the expiration of 5 seconds, 10 seconds, 15 seconds, 30 seconds, or any reasonable time, the current position coordinate point coincides with the last position coordinate point recorded. In this case, the distance between the position coordinate points may be dense (the mobile terminal moves at a low speed) or loose (the mobile terminal moves at a high speed, for example, by riding a car, a train, or the like).
In the present application, at the end of the current natural day, each data item associated with each position coordinate point that the target mobile terminal has reached within the current natural day is saved into the position data table. For example, at 24 pm on 6/8/2018 (i.e., 0 pm on 6/9/2018), each data item < position coordinate point, start time, end time > associated with each position coordinate point reached by the target mobile terminal within 6/8/2018 is saved into the position data table. That is, when the comparison between the linear distance between the current position coordinate point and each position coordinate point in the coordinate point set and the distance threshold is performed within the current natural day, the position coordinate point within the current natural day is not included in the coordinate point set. For example, when the comparison of the straight-line distance between the current position coordinate point and each position coordinate point in the set of coordinate points with the distance threshold is performed within 6/8 of 2018, the position coordinate points within 6/8 of 2018 are not included in the set of coordinate points. For example, in a case where the predetermined number of natural days is 10 natural days, the coordinate point set includes each of the position coordinate points that the target mobile terminal has reached within 10 natural days, that is, 29 days 5 and 29 days 2018 and 7 days 6 and 7 months 2018.
The operation statistical file comprises a plurality of operation data tables, and the application allocates one operation data table for each user application in a plurality of user applications in the target mobile terminal. Each operation data table includes a plurality of operation data items and the content of each operation data item is quintuple < application name, position coordinate point, start time, end time, accumulated time length >. For example, the operation data items are < royal glory, gawa cafe, 6/8/2018 20:00, 6/8/2018/21: 50, 110 minutes >.
The running data table allocated to each user application is used as the running statistical information of each user application, namely, the running statistical information of each user application is provided in the form of the running data table. And the running data table allocated to each user application is used for recording the running position information of each user application in real time. That is, in the case where the mobile terminal is operated, the operating system or the control device may count and record the operation location information of each user application, for example, an application name, a location coordinate point, a start time, an end time, and the like, in real time. Therefore, the data table records the running information of each user application in a statistical time interval from a specific time point in the past to the current time point. Wherein, in the running statistics file, the application stores a predetermined number (e.g., 100, 200, 300) of running data items for each user application, or stores running data items for each user application within a predetermined length of time or a predetermined number of natural days (e.g., 10 days, 20 days, 30 days). Wherein the predetermined number of natural days is 10 natural days, 20 natural days, 30 natural days, or any reasonable number of natural days.
Generating means 702 that performs center point clustering on all position coordinate points in the coordinate point set based on mutual distances between the plurality of position coordinate points to divide the coordinate point set into a plurality of subsets and each subset includes at least one position coordinate point, selects each of the plurality of subsets including position coordinate points whose number is greater than a region threshold as a region subset, and constructs a single region range from the single region subset, thereby generating a plurality of region ranges.
Further, the present application may also determine at least one center point based on mutual distances between a plurality of position coordinate points, and classify all the position coordinate points in the coordinate point set based on each center point to divide the coordinate point set into a plurality of subsets and each subset includes at least one position coordinate point, select each of the plurality of subsets, in which the number of included position coordinate points is greater than a region threshold, as a region subset, and construct a single region range from the single region subset, thereby generating a plurality of region ranges.
Any known center point clustering or classification method may be used to divide the set of coordinate points into a plurality of subsets. In a simplified version, all location coordinate points in the set of coordinate points may be classified according to building and road: all the position coordinate points in the same building are taken as one subset and each position coordinate point on the road is not taken into consideration, or each position coordinate point on the road is selected as a single subset (i.e., only one position coordinate point is included in each subset). In summary, the present application may divide the set of coordinate points into a plurality of subsets in any manner and each subset includes at least one position coordinate point.
In any way, after the coordinate point set is divided into a plurality of subsets, for example, by center point clustering, (center point) classification, building classification, etc., the straight-line distance between any position coordinate point in each subset and the center point of the attributed subset is smaller than the straight-line distance between any position coordinate point in any subset except the attributed subset and the center point of any other subset. And when the straight-line distance between the first position coordinate point in any subset and the central point of any subset is greater than the straight-line distance between the first position coordinate point in any subset and the central point of another subset, dividing the first position coordinate point into the another subset. That is, the straight-line distance between any position coordinate point in each subset and the center point of the subset in which the position coordinate point is located is smaller than the straight-line distance between any position coordinate point in other subsets and the center point of the other arbitrary subsets. For example, when a straight-line distance of a first position coordinate point in the first subset from a center point of the first subset is greater than a straight-line distance from a center point of the second subset, the first position coordinate point is divided into the second subset.
In the present application, the region threshold is 50, 100 or 200. In each subset, at least one position coordinate point is selected as a center point, and the center point can be a plurality of position coordinate points that coincide in position, or the center point can be a plurality of position coordinate points that are located close together. Wherein constructing the single region range from the single subset of regions comprises: calculating the straight-line distance between the center point and each position coordinate point in other position coordinate points in the single area subset to which the center point belongs; determining the longest straight-line distance in the straight-line distances between the center point and each position coordinate point; a circle centered at a center point within a single subset of regions and having a radius of the longest straight-line distance is constructed as a single region extent. For example, wherein constructing the first region range from the first subset of regions comprises: calculating the straight-line distance between the center point of the first area subset and each position coordinate point in any other position coordinate points in the first area subset; determining the longest straight-line distance in the straight-line distances between the center point of the first area subset and each position coordinate point; a circle having a center point within the first subset of regions as a center point and a radius of the longest straight-line distance is constructed as the first region range.
FIG. 2 is a logic diagram of an ordered list 200 according to an embodiment of the invention. As shown in fig. 2, the residential site 202 is an area where the user of the target mobile terminal lives, the office site 203 is an area where the user of the target mobile terminal works, and the restaurants 204 and 205 are area where the user of the target mobile terminal takes lunch. In fig. 2, the position coordinate points are represented by circles within the area range, where a solid circle is a position coordinate point selected as the center point of the area range, and an open circle is a position coordinate point not selected as the center point of the area range. Within the residence 202, there are a plurality of position coordinate points, with the position coordinate point at the center being selected as the center point. The plurality of location coordinate points of the residence 202 are used to represent a plurality of locations, for example, a bedroom, a living room, and the like, reached by the user holding the target mobile terminal in the residence 202 (home). The plurality of location coordinate points of the office 203 are used to represent a plurality of locations, for example, at a work place, in a conference room, which the user has reached by holding the target mobile terminal at the office 203. In the office 203, three position coordinate points located at the center are selected as the center points. The location coordinate points of the restaurants 204 and 205 are used to represent the locations of the user holding the target mobile terminal for meals in the restaurants. In the restaurants 204 and 205, a position coordinate point located at the center is selected as the center point.
Wherein the plurality of location coordinate points 206 between the residence 202 and the office 203 are used to indicate a plurality of location coordinate points that have been reached by the user of the target mobile terminal to work or to work. It should be appreciated that the present application demonstrates the multiple location coordinate points that a user has reached during work or work in a simple path, while in practice, the user may be routed different paths during work or work, and possibly at different locations (e.g., one side or the other side of the road, etc.) during the same path. Similarly, the plurality of location coordinate points between the office 203 and the restaurants 204, 205 are used to indicate a plurality of location coordinate points that the user of the destination mobile terminal has reached when going to a meal or returning. As described above, depending on the manner of collecting the location coordinate points, the plurality of location coordinate points of the target mobile terminal may be relatively dense, overlapped, relatively dispersed, and the like. However, no position coordinate point within the set of coordinate points is present that is linearly more than 5, 6, 8 or 10 meters away from any single one of the plurality of position coordinate points, i.e., any position coordinate point within the set of coordinate points has (positionally or temporally) neighboring position coordinate points, and the linear distance between (positionally or practically) neighboring position coordinate points is less than or equal to 5, 6, 8, 10 or any reasonable distance.
In any way, after the coordinate point set is divided into a plurality of subsets, for example, by center point clustering, (center point) classification, building classification, etc., the straight-line distance between any position coordinate point in each subset and the center point of the attributed subset is smaller than the straight-line distance between any position coordinate point in any subset except the attributed subset and the center point of any other subset. And when the straight-line distance between the first position coordinate point in any subset and the central point of any subset is greater than the straight-line distance between the first position coordinate point in any subset and the central point of another subset, dividing the first position coordinate point into the another subset. That is, the straight-line distance between any position coordinate point in each subset and the center point of the subset in which the position coordinate point is located is smaller than the straight-line distance between any position coordinate point in other subsets and the center point of the other arbitrary subsets. For example, when a straight-line distance of a first position coordinate point in the first subset from a center point of the first subset is greater than a straight-line distance from a center point of the second subset, the first position coordinate point is divided into the second subset.
In the present application, the region threshold is 50, 100 or 200. In each subset, at least one location coordinate point is selected as a center point, and the center point can be a plurality of location coordinate points whose locations coincide, or the center point can be a plurality of location coordinate points whose locations are nearby, such as is the case in office 203.
In the case where the center point can be a plurality of location coordinate points located in close proximity, constructing a single area range from a single subset of areas includes: determining a central point of the plurality of central points as a composite central point; calculating the straight-line distance between the composite center point and each position coordinate point in other position coordinate points in the single region subset to which the composite center point belongs; determining the longest straight line distance in the straight line distances between the composite center point and each position coordinate point; a circle centered at the composite center point within the subset of the single region and having a radius of the longest straight-line distance is constructed as the single region extent. For example, wherein constructing the first region range from the first subset of regions comprises: calculating the straight-line distance between the composite center point of the first area subset and each position coordinate point in any other position coordinate points in the first area subset; determining the longest straight-line distance in the straight-line distances between the composite center point of the first area subset and each position coordinate point; and constructing a circle with the composite center point in the first area subset as the center and the radius of the longest straight line distance as a first area range.
The sorting device 703 monitors the current location of the target mobile terminal, determines, according to the operation statistical information of each user application, an operation probability of each user application in a specific area range when it is determined that the continuous time length of the current location of the target mobile terminal in the specific area range reaches a stay threshold, and performs a descending sorting of the operation probabilities of the plurality of user applications based on the operation probability of each user application in the specific area range to generate a sorted list.
The method and the device utilize a positioning component (such as a GPS component or a Beidou component) to monitor the current position of the target mobile terminal in real time, and determine whether the continuous time length of the current position of the target mobile terminal in a specific area range of a plurality of area ranges reaches a stop threshold value. Wherein the residence threshold is 1 minute, 5 minutes, 10 minutes, or 15 minutes.
When the continuous time length that the current position of the target mobile terminal is in a specific area range of the multiple area ranges reaches the stay threshold, determining the operation probability of each user application in the specific area range according to the operation statistical information of each user application comprises:
selecting a statistical date interval for determining the probability of operation, the statistical date interval including at least 10 natural days (e.g., 10 natural days, 20 natural days, 30 natural days);
and analyzing each data item in the plurality of data items in the running statistical information of each user application to determine the effective times Ci of running of each user application in a specific area range in the statistical date interval. For example, a user application counts as a valid number of times when it runs for more than 60 seconds in a certain area range (e.g., the residence 202). For example, if the continuous operation time of the pay bank application in a specific region range (for example, the residential area 202) in each of 10 natural days is 50 seconds (operation does not exceed 60 seconds), 120 seconds, 0 seconds (non-operation), 180 seconds, 360 seconds, 520 seconds, 780 seconds, 0 seconds (non-operation), 55 seconds (operation does not exceed 60 seconds), and 600 seconds, the valid number of times of the pay bank application is 0+1+0+1+1+ 0+0+1 to 6 times. Wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal and Na is more than 4;
the total number of validations S that all user applications run within a particular region range is calculated based on the number of validations Ci for each user application within the statistical date interval within the particular region range (e.g., the residence 202):
Figure GDA0003355770970000241
and calculating the operation probability Pi ═ Ci/S of each user application in the specific area range.
For example, the pay for use is run 6 times at a specific region range (e.g., residence 202) for 10 natural days, the WeChat use is run 10 times at a specific region range (e.g., residence 202) for 10 natural days, the Taobao use is run 3 times at a specific region range (e.g., residence 202) for 10 natural days, the King is shone 1 time at a specific region range (e.g., residence 202) for 10 natural days, and the Mei group use is run 0 times at a specific region range (e.g., residence 202) for 10 natural days, then S is 20 times. The operation probabilities of the pay for use, WeChat application, Taobao application, Royal and beauty team application for a specific region area (e.g., the residence 202) are 30%, 50%, 15%, 5% and 0%, respectively.
Alternatively, wherein determining the operation probability of each user application within the specific area according to the operation statistical information of each user application comprises:
selecting a statistical date interval for determining the probability of operation, the statistical date interval including at least 10 natural days, (e.g., 10 natural days, 20 natural days, 30 natural days);
each of the plurality of data items within the running statistics of each user application is parsed to determine a length of time ti for which each user application is running within a particular region within the statistics interval. The time of operation of the pay-for-treasure application within a certain regional scope (e.g., the residence 202) within each of the 10 natural days is 10 seconds, 60 seconds, 0 seconds, 50 seconds, 30 seconds, 90 seconds, 120 seconds, 0 seconds, 15 seconds, and 60 seconds, and then the length of time of the pay-for-treasure application is 435 seconds. Wherein i is more than or equal to 1 and less than or equal to Na, the Na is the number of user applications in the target mobile terminal, and the Na is more than 4;
based on the length of time ti that each user application runs within the statistical date interval within a particular region (e.g., the residence 202), the total length of time T that all user applications run within the particular region is calculated:
Figure GDA0003355770970000251
and calculating the operation probability Pi of each user application in the specific area range, namely ti/T.
For example, if the pay for Bao application runs 435 seconds for a specific region range on 10 natural days (e.g., the residence 202), the WeChat application runs 875 seconds for a specific region range on 10 natural days (e.g., the residence 202), the Taobao application runs 500 seconds for a specific region range on 10 natural days (e.g., the residence 202), the King blooms 190 seconds for a specific region range on 10 natural days (e.g., the residence 202), and the Mei group application runs 0 seconds for a specific region range on 10 natural days (e.g., the residence 202), then T is 2000 seconds. The operation probabilities of the pay for use, WeChat application, Taobao application, Royal and beauty team application for a specific region area (e.g., the residence 202) are 21.75%, 43.75%, 25%, 9.5% and 0%, respectively.
In the example shown in fig. 2, as shown in table 210, in a specific region range (for example, the residential area 202) within 10 natural days from 6/1/2018 to 6/10/2018, the operation probability of the royal glory is 18%, the operation probability of the trembled short video is 16%, the operation probability of the kukoku video is 15%, the operation probability of the mobile phone panning is 13%, the operation probability of the masu takeout is 10%, the operation probability of the hectic takeout is 9%, the operation probability of the polo vehicle is 7%, the operation probability of the tribasic superimposter is 6%, and the operation probability of the lazy english is 0%.
Setting means 704 is configured to determine at least one pre-fetch user application of the plurality of user applications that can be pre-loaded from the second memory into the first memory according to the ordered list, and set a storage level for each pre-fetch user application of the at least one pre-fetch user application according to the ordered list, wherein the storage level comprises: a decrement storage stage, an increment storage stage, a quantitative storage stage and a compression storage stage; and setting the storage level of the dynamic storage unit allocated to each pre-fetching user application according to the storage level of each pre-fetching user application.
Wherein determining from the ordered list a plurality of pre-fetch user applications of the plurality of user applications that can be pre-loaded from a second memory into a first memory comprises: when the number of user applications in the ordered list having an operating probability greater than the pre-fetch threshold (e.g., 5%, 10%) is greater than 0 (e.g., 10), determining the user applications in the ordered list having an operating probability greater than the pre-fetch threshold as pre-fetch user applications that can be pre-loaded from the second memory into the first memory to determine at least one pre-fetch user application; when the number of user applications in the ordered list having a running probability greater than the pre-fetch threshold (e.g., 5%, 10%) is equal to 0, all user applications (e.g., 15) in the ordered list are determined as pre-fetched user applications that can be pre-loaded from the second memory into the first memory to determine at least one pre-fetched user application.
Wherein setting a storage level for each of the at least one pre-fetch user application according to the ordered list comprises:
setting a storage level of the pre-fetched user applications in the ordered list having an operational probability greater than a high probability threshold (e.g., 15%) to a reduced storage level;
setting a storage level of the pre-fetch user application in the sorted list having a probability of operation less than or equal to a high probability threshold (e.g., 15%) and greater than a medium probability threshold (e.g., 12%) as an incremental storage level;
setting a storage level of the pre-fetched user applications in the sorted list having a probability of operation less than or equal to a medium probability threshold (e.g., 12%) and greater than a low probability threshold (e.g., 8%) as a quantitative storage level;
setting a storage level of the pre-fetched user applications in the sorted list having an operating probability less than or equal to a low probability threshold (e.g., 8%) as a compressed storage level. Wherein the pre-fetching of user applications has a running probability of more than 5%.
The allocation means 705 is adapted to allocate at least one dynamic memory location for each pre-fetch user application of the reduced memory rank, at least one dynamic memory location for each pre-fetch user application of the compressed memory rank, one dynamic memory location for each pre-fetch user application of the increased memory rank and one dynamic memory location for each pre-fetch user application of the quantitative memory rank. Wherein the storage capacity of each of the at least one dynamic storage unit allocated for each of the pre-fetched user applications of the reduced storage tier may be the same or different, and the storage capacity of each of the at least one dynamic storage unit allocated for each of the pre-fetched user applications of the compressed storage tier may be the same or different.
The total storage capacity of the at least one dynamic storage unit allocated for the pre-fetching user application of each reduced storage tier is capable of accommodating all data files of the pre-fetching user application of the corresponding reduced storage tier. The total storage capacity of the at least one dynamic storage unit allocated for the pre-fetching user application of each compressed storage tier is capable of accommodating all compressed data files of the pre-fetching user application of the corresponding compressed storage tier. One dynamic memory unit is allocated for each pre-fetching user application of the incremental storage tier that can accommodate all data files of the pre-fetching user application of the corresponding incremental storage tier. One dynamic memory unit is allocated to each pre-fetching user application of a quantitative memory rank to be able to accommodate all data files of the pre-fetching user application of the corresponding quantitative memory rank.
The prefetching means 706 is configured to prefetch data from the second memory for the data file associated with each prefetching user application according to the storage level of the prefetching user application, and includes:
copying a plurality of data files associated with each pre-fetch user application of the reduced storage tier from the second memory to the dynamic storage unit of at least one reduced storage tier allocated for each pre-fetch user application of the reduced storage tier, setting a first time period for the dynamic storage unit of each reduced storage tier upon completion of the copying and starting timing, deleting a first predetermined number of data files in the dynamic storage unit of each reduced storage tier each time the first time period expires;
selecting at least one base data file among the plurality of data files associated with each pre-fetching user application of the incremental storage tier, copying the at least one base data file of each pre-fetching user application of the incremental storage tier from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier, setting a second time period and starting timing for the dynamic storage unit of the incremental storage tier upon completion of the copying, wherein a second predetermined number of data files among the plurality of data files associated with each pre-fetching user application of the incremental storage tier are copied from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier each time the second time period expires;
selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier and copying the selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier; and
the method further includes compressing the plurality of data files associated with each pre-fetch user application of the compressed storage tier to generate a plurality of compressed data files, copying the plurality of compressed data files of each pre-fetch user application of the compressed storage tier from the second memory to a dynamic storage unit of at least one compressed storage tier allocated for each pre-fetch user application of the compressed storage tier.
The initialization device 707 is configured to, in response to a data prefetching request initiated by a user and used for performing data prefetching on a data file associated with a user application of a target mobile terminal in a mobile internet, obtain a dynamic configuration file associated with the data prefetching;
creating a dynamic index area in a first memory of the target mobile terminal, and creating a plurality of dynamic storage units for storing data files in the first memory according to the dynamic configuration file, wherein the storage capacity of each of the plurality of dynamic storage units is determined according to the dynamic configuration file; and
and generating a dynamic index table in the dynamic index area, wherein the dynamic index table comprises a plurality of index entries, and each index entry is used for recording the application identification, the starting address, the ending address, the storage capacity and the storage level of a corresponding dynamic storage unit in a plurality of dynamic storage units.

Claims (10)

1. A method for prefetching data within a mobile internet based on a region scope, the method comprising:
acquiring an operation statistical file associated with a target mobile terminal in a mobile internet, and analyzing the operation statistical file to acquire position statistical information of the target mobile terminal and operation statistical information of each user application in a plurality of user applications in the target mobile terminal, wherein the position statistical information is a coordinate point set which comprises a plurality of position coordinate points reached by the target mobile terminal in a preset number of natural days;
performing center point clustering on all position coordinate points in the coordinate point set based on mutual distances among the plurality of position coordinate points to divide the coordinate point set into a plurality of subsets each including at least one position coordinate point, selecting each of the plurality of subsets including position coordinate points whose number is greater than a region threshold as a region subset, and constructing a single region range from the single region subset, thereby generating a plurality of region ranges;
monitoring the current position of a target mobile terminal, when the continuous time length of the current position of the target mobile terminal in a specific area range in a plurality of area ranges reaches a stay threshold value, determining the operation probability of each user application in the specific area range according to the operation statistical information of each user application, and performing descending ordering on the operation probabilities of the plurality of user applications based on the operation probability of each user application in the specific area range to generate an ordered list;
determining at least one of the plurality of user applications that can be preloaded from the second memory into the first memory according to the ordered list, and setting a storage level for each of the at least one pre-fetching user application according to the ordered list, wherein the storage level comprises: a decrement storage stage, an increment storage stage, a quantitative storage stage and a compression storage stage;
allocating at least one dynamic memory unit for each pre-fetch user application of the decrement storage stage, allocating at least one dynamic memory unit for each pre-fetch user application of the compression storage stage, allocating one dynamic memory unit for each pre-fetch user application of the increment storage stage and allocating one dynamic memory unit for each pre-fetch user application of the quantitive storage stage;
setting a storage level for a dynamic storage unit allocated to each pre-fetching user application according to the storage level of each pre-fetching user application;
prefetching data from the second memory for a data file associated with each prefetched user application according to the storage level of the prefetched user application, comprising:
copying all data files associated with each pre-fetching user application of the reduced storage tier from the second memory to the dynamic storage unit of at least one reduced storage tier allocated for each pre-fetching user application of the reduced storage tier, setting a first time period for the dynamic storage unit of each reduced storage tier upon completion of the copying and starting timing, deleting a first predetermined number of data files in the dynamic storage unit of each reduced storage tier each time the first time period expires;
selecting at least one base data file among the plurality of data files associated with each pre-fetching user application of the incremental storage tier, copying the at least one base data file of each pre-fetching user application of the incremental storage tier from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier, setting a second time period and starting timing for the dynamic storage unit of the incremental storage tier upon completion of the copying, wherein a second predetermined number of data files among the plurality of data files associated with each pre-fetching user application of the incremental storage tier are copied from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier each time the second time period expires;
selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier and copying the selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier; and
the method further includes compressing the plurality of data files associated with each pre-fetch user application of the compressed storage tier to generate a plurality of compressed data files, copying the plurality of compressed data files of each pre-fetch user application of the compressed storage tier from the second memory to a dynamic storage unit of at least one compressed storage tier allocated for each pre-fetch user application of the compressed storage tier.
2. The method of claim 1, comprising a plurality of mobile terminals within the mobile internet and determining a mobile terminal initiating a data pre-fetch request as a target mobile terminal, wherein the number of user applications is greater than 4; the operation statistical file comprises a position data table, wherein the position data table comprises a plurality of position data items, and the content of each position data item is a triple < position coordinate point, starting time and ending time >; forming a coordinate point set comprising a plurality of position coordinate points by using position coordinate points in each position data item in a position data table, and taking the coordinate point set as position statistical information, wherein the position data table is used for recording the running position information of the target mobile terminal in real time; in the position data table, storing a preset number of position data items for the target mobile terminal, or storing a preset number of position data items in a natural day or a preset time length for the target mobile terminal; wherein the predetermined number of natural days is 10 natural days, 20 natural days, or 30 natural days, wherein the predetermined time length is 240 hours; wherein no position coordinate point in the coordinate point set has a straight-line distance greater than 5 meters, 6 meters, 8 meters or 10 meters from any single position coordinate point in the plurality of position coordinate points, or whenever the distance between the current position of the target mobile terminal and the last position coordinate point is equal to 5 meters, 6 meters, 8 meters or 10 meters, determining the current position as the current position coordinate point; or determining the current position of the target mobile terminal as a current position coordinate point every time 5 seconds, 10 seconds or 20 seconds passes; wherein each location data item associated with each location coordinate point that the target mobile terminal has reached within the current natural day is saved into the location data table at the end of the current natural day.
3. The method according to any one of claims 1-2, wherein the operation statistics file comprises a plurality of operation data tables, and one operation data table is allocated to each of a plurality of user applications in the target mobile terminal, each operation data table comprises a plurality of operation data items, and the content of each operation data item is quintuple < application name, position coordinate point, start time, end time, accumulated time length >; the operation data table distributed for each user application is used as the operation statistical information of each user application, and the operation data table distributed for each user application is used for recording the operation position information of each user application in real time; in the operation statistical file, a preset number of operation data items are saved for each user application, or a preset number of operation data items in a natural day or a preset time length are saved for each user application.
4. The method of claim 3, the region threshold is 50, 100, or 200; in each subset, at least one position coordinate point is selected as a center point, and the center point can be a plurality of position coordinate points whose positions coincide; wherein constructing the single region range from the single subset of regions comprises:
calculating the straight-line distance between the center point and each position coordinate point in other position coordinate points in the single area subset to which the center point belongs;
determining the longest straight-line distance in the straight-line distances between the center point and each position coordinate point;
constructing a circle which takes a central point in the single area subset as a circle center and takes the radius of the longest straight line distance as a single area range;
after clustering by the center point to divide the coordinate point set into a plurality of subsets, the straight-line distance between the arbitrary position coordinate point in each subset and the center point of the attributed subset is smaller than the straight-line distance to the center point of any other subset except the attributed subset.
5. The method of claim 4, wherein the dwell threshold is 1 minute, 5 minutes, 10 minutes, or 15 minutes;
the step of determining the operation probability of each user application in the specific area range according to the operation statistical information of each user application comprises the following steps:
selecting a statistical date interval for determining an operational probability, the statistical date interval comprising at least 10 natural days;
analyzing each data item in a plurality of data items in the running statistical information of each user application to determine the effective times Ci of running of each user application in a specific area range in a statistical date interval, wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal, Na is a natural number and Na is more than 4;
calculating the total effective times S of all the user applications in the specific area range based on the effective times Ci of each user application in the statistical date range and running in the specific area range:
Figure FDA0003355770960000031
calculating the operation probability Pi (Ci/S) of each user application in a specific area range;
wherein the effective number of times is counted when the running time of the user application in the specific area range exceeds 60 seconds.
6. A system for prefetching data within a mobile internet based on a region scope, the system comprising:
the analysis device is used for acquiring an operation statistical file associated with a target mobile terminal in the mobile Internet, and analyzing the operation statistical file to acquire position statistical information of the target mobile terminal and operation statistical information of each user application in a plurality of user applications in the target mobile terminal, wherein the position statistical information is a coordinate point set which comprises a plurality of position coordinate points reached by the target mobile terminal within a preset number of natural days;
generating means that performs center point clustering of all position coordinate points in the coordinate point set based on mutual distances between the plurality of position coordinate points to divide the coordinate point set into a plurality of subsets and each subset includes at least one position coordinate point, selects each of the plurality of subsets including position coordinate points whose number is greater than a region threshold as a region subset, and constructs a single region range from the single region subset, thereby generating a plurality of region ranges;
the sequencing device is used for monitoring the current position of the target mobile terminal, determining the operation probability of each user application in a specific area range according to the operation statistical information of each user application when the continuous time length of the current position of the target mobile terminal in the specific area range reaches a stop threshold value, and sequencing the operation probabilities of the plurality of user applications in a descending order to generate a sequencing list based on the operation probability of each user application in the specific area range;
setting means for determining at least one pre-fetch user application of the plurality of user applications that can be pre-loaded from the second memory into the first memory according to the ordered list, and setting a storage level for each pre-fetch user application of the at least one pre-fetch user application according to the ordered list, wherein the storage level comprises: a decrement storage stage, an increment storage stage, a quantitative storage stage and a compression storage stage; setting a storage level for a dynamic storage unit allocated to each pre-fetching user application according to the storage level of each pre-fetching user application;
the allocation device allocates at least one dynamic storage unit for each pre-fetching user application of the decrement storage level, allocates at least one dynamic storage unit for each pre-fetching user application of the compression storage level, allocates one dynamic storage unit for each pre-fetching user application of the increment storage level and allocates one dynamic storage unit for each pre-fetching user application of the quantitative storage level;
prefetching means for prefetching data from the second memory for the data file associated with each prefetched user application according to the storage level of the prefetched user application, comprising:
copying all data files associated with each pre-fetching user application of the reduced storage tier from the second memory to the dynamic storage unit of at least one reduced storage tier allocated for each pre-fetching user application of the reduced storage tier, setting a first time period for the dynamic storage unit of each reduced storage tier upon completion of the copying and starting timing, deleting a first predetermined number of data files in the dynamic storage unit of each reduced storage tier each time the first time period expires;
selecting at least one base data file among the plurality of data files associated with each pre-fetching user application of the incremental storage tier, copying the at least one base data file of each pre-fetching user application of the incremental storage tier from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier, setting a second time period and starting timing for the dynamic storage unit of the incremental storage tier upon completion of the copying, wherein a second predetermined number of data files among the plurality of data files associated with each pre-fetching user application of the incremental storage tier are copied from the second memory to the dynamic storage unit of the incremental storage tier allocated for each pre-fetching user application of the incremental storage tier each time the second time period expires;
selecting at least one data file from the plurality of data files associated with each pre-fetch user application of the quantitative storage tier based on the storage capacity of the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier and copying the selected at least one data file from the second memory to the dynamic storage unit of the quantitative storage tier assigned for each pre-fetch user application of the quantitative storage tier; and
the method further includes compressing the plurality of data files associated with each pre-fetch user application of the compressed storage tier to generate a plurality of compressed data files, copying the plurality of compressed data files of each pre-fetch user application of the compressed storage tier from the second memory to a dynamic storage unit of at least one compressed storage tier allocated for each pre-fetch user application of the compressed storage tier.
7. The system of claim 6, comprising a plurality of mobile terminals within the mobile internet and determining a mobile terminal initiating a data prefetch request as a target mobile terminal, wherein the number of user applications is greater than 4; the operation statistical file comprises a position data table, wherein the position data table comprises a plurality of position data items, and the content of each position data item is a triple < position coordinate point, starting time and ending time >; forming a coordinate point set comprising a plurality of position coordinate points by using position coordinate points in each position data item in a position data table, and taking the coordinate point set as position statistical information, wherein the position data table is used for recording the running position information of the target mobile terminal in real time; in the position data table, storing a preset number of position data items for the target mobile terminal, or storing a preset number of position data items in a natural day or a preset time length for the target mobile terminal; wherein the predetermined number of natural days is 10 natural days, 20 natural days, or 30 natural days, wherein the predetermined time length is 240 hours; wherein no position coordinate point in the coordinate point set has a straight-line distance greater than 5 meters, 6 meters, 8 meters or 10 meters from any single position coordinate point in the plurality of position coordinate points, or whenever the distance between the current position of the target mobile terminal and the last position coordinate point is equal to 5 meters, 6 meters, 8 meters or 10 meters, determining the current position as the current position coordinate point; or determining the current position of the target mobile terminal as a current position coordinate point every time 5 seconds, 10 seconds or 20 seconds passes; wherein each location data item associated with each location coordinate point that the target mobile terminal has reached within the current natural day is saved into the location data table at the end of the current natural day.
8. The system according to any one of claims 6 to 7, wherein the operation statistic file comprises a plurality of operation data tables, and one operation data table is allocated to each user application in the plurality of user applications in the target mobile terminal, each operation data table comprises a plurality of operation data items, and the content of each operation data item is quintuple < application name, position coordinate point, start time, end time, accumulated time length >; the operation data table distributed for each user application is used as the operation statistical information of each user application, and the operation data table distributed for each user application is used for recording the operation position information of each user application in real time; in the operation statistical file, a preset number of operation data items are saved for each user application, or a preset number of operation data items in a natural day or a preset time length are saved for each user application.
9. The system of claim 8, the region threshold is 50, 100, or 200; in each subset, at least one position coordinate point is selected as a center point, and the center point can be a plurality of position coordinate points whose positions coincide; wherein the generating means constructs the single region range from the single subset of regions comprises:
calculating the straight-line distance between the center point and each position coordinate point in other position coordinate points in the single area subset to which the center point belongs;
determining the longest straight-line distance in the straight-line distances between the center point and each position coordinate point;
constructing a circle which takes a central point in the single area subset as a circle center and takes the radius of the longest straight line distance as a single area range;
after the generating means clusters through the center points to divide the set of coordinate points into a plurality of subsets, a straight-line distance between an arbitrary position coordinate point in each subset and the center point of the attributed subset is smaller than a straight-line distance between the arbitrary position coordinate point and the center point of any other subset except the attributed subset.
10. The system of claim 9, wherein the dwell threshold is 1 minute, 5 minutes, 10 minutes, or 15 minutes; the sequencing device determines the operation probability of each user application in the specific area range according to the operation statistical information of each user application, and the method comprises the following steps:
selecting a statistical date interval for determining an operational probability, the statistical date interval comprising at least 10 natural days;
analyzing each data item in a plurality of data items in the running statistical information of each user application to determine the effective times Ci of running of each user application in a specific area range in a statistical date interval, wherein i is more than or equal to 1 and less than or equal to Na, Na is the number of user applications in the target mobile terminal, Na is a natural number and Na is more than 4;
calculating the total effective times S of all the user applications in the specific area range based on the effective times Ci of each user application in the statistical date range and running in the specific area range:
Figure FDA0003355770960000051
calculating the operation probability Pi (Ci/S) of each user application in a specific area range; wherein the effective number of times is counted when the running time of the user application in the specific area range exceeds 60 seconds.
CN201810943818.5A 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range Active CN109144960B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201810943818.5A CN109144960B (en) 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range
CN202210163554.8A CN114519040A (en) 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810943818.5A CN109144960B (en) 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range

Related Child Applications (1)

Application Number Title Priority Date Filing Date
CN202210163554.8A Division CN114519040A (en) 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range

Publications (2)

Publication Number Publication Date
CN109144960A CN109144960A (en) 2019-01-04
CN109144960B true CN109144960B (en) 2022-05-06

Family

ID=64789996

Family Applications (2)

Application Number Title Priority Date Filing Date
CN201810943818.5A Active CN109144960B (en) 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range
CN202210163554.8A Pending CN114519040A (en) 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN202210163554.8A Pending CN114519040A (en) 2018-08-18 2018-08-18 Method and system for prefetching data in mobile internet according to area range

Country Status (1)

Country Link
CN (2) CN109144960B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114817174B (en) * 2022-04-02 2023-08-15 中新社(北京)国际传播集团有限公司 Method and system for prefetching data in mobile internet according to regional scope

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103197940A (en) * 2012-01-09 2013-07-10 三星电子株式会社 Apparatus and method for partitioning memory area for application preloading in a wireless terminal
CN103870126A (en) * 2014-03-27 2014-06-18 上海斐讯数据通信技术有限公司 Method and mobile terminal for intelligently recommending application program
US9042912B1 (en) * 2014-02-18 2015-05-26 Google Inc. Two-pass copresence
CN104951340A (en) * 2015-06-12 2015-09-30 联想(北京)有限公司 Information processing method and device
CN104978324A (en) * 2014-04-03 2015-10-14 腾讯科技(深圳)有限公司 Data processing method and device
CN105282299A (en) * 2014-06-11 2016-01-27 中兴通讯股份有限公司 Application starting device and method
CN105843367A (en) * 2016-03-24 2016-08-10 维沃移动通信有限公司 Application processing method and electronic device
CN105988805A (en) * 2015-02-12 2016-10-05 广东欧珀移动通信有限公司 Management method for application programs and mobile terminal
CN106331318A (en) * 2016-08-15 2017-01-11 宇龙计算机通信科技(深圳)有限公司 Automatic application opening method and device

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103197940A (en) * 2012-01-09 2013-07-10 三星电子株式会社 Apparatus and method for partitioning memory area for application preloading in a wireless terminal
US9042912B1 (en) * 2014-02-18 2015-05-26 Google Inc. Two-pass copresence
CN103870126A (en) * 2014-03-27 2014-06-18 上海斐讯数据通信技术有限公司 Method and mobile terminal for intelligently recommending application program
CN104978324A (en) * 2014-04-03 2015-10-14 腾讯科技(深圳)有限公司 Data processing method and device
CN105282299A (en) * 2014-06-11 2016-01-27 中兴通讯股份有限公司 Application starting device and method
CN105988805A (en) * 2015-02-12 2016-10-05 广东欧珀移动通信有限公司 Management method for application programs and mobile terminal
CN104951340A (en) * 2015-06-12 2015-09-30 联想(北京)有限公司 Information processing method and device
CN105843367A (en) * 2016-03-24 2016-08-10 维沃移动通信有限公司 Application processing method and electronic device
CN106331318A (en) * 2016-08-15 2017-01-11 宇龙计算机通信科技(深圳)有限公司 Automatic application opening method and device

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
An SPN Based Integrated Model for Web Prefetching and caching;Lei Shi等;《J.Comput.Sci.&Technol》;20060731;第21卷(第4期);第[482]-[489]页 *
一种智能终端数据共享中的预取缓存技术;杨培勇等;《网络新媒体技术》;20120731;第1卷(第4期);第[31]-[36]页 *

Also Published As

Publication number Publication date
CN114519040A (en) 2022-05-20
CN109144960A (en) 2019-01-04

Similar Documents

Publication Publication Date Title
US9582587B2 (en) Real-time content searching in social network
US10561946B2 (en) File prefetching for gaming applications accessed by electronic devices
US9197710B1 (en) Temporal based data string intern pools
CN109033360A (en) A kind of data query method, apparatus, server and storage medium
CN111443867B (en) Data storage method, device, equipment and storage medium
CN110858210B (en) Data query method and device
CN112262379A (en) Storing data items and identifying stored data items
CN112148690A (en) File caching method, file access request processing method and device
CN109144960B (en) Method and system for prefetching data in mobile internet according to area range
CN109240574B (en) Method and system for prefetching files in mobile internet based on operation heat
CN110795026A (en) Hot spot data identification method, device, equipment and storage medium
CN107122136B (en) Capacity obtaining method and device
CN109240987B (en) Method and system for prefetching data based on time for mobile internet
CN109151196B (en) Method and system for prefetching data in mobile internet based on current position
CN109033445B (en) Method and system for prefetching files in mobile internet according to running application
CN110909072B (en) Data table establishment method, device and equipment
CN109271352B (en) Method and system for prefetching files in mobile internet according to state information
CN109271345B (en) Method and system for prefetching data based on navigation information in mobile internet
KR20120132182A (en) Information searching system for social network Service
CN109189737B (en) Method and system for prefetching files in mobile internet according to time segments
KR101744017B1 (en) Method and apparatus for indexing data for real time search
CN113835613B (en) File reading method and device, electronic equipment and storage medium
JP6972612B2 (en) Storage equipment, management equipment, information processing systems, control methods and programs
CN113407513B (en) Feature library scheduling method and device and feature library searching method and device
CN104951869A (en) Workflow-based public opinion monitoring method and workflow-based public opinion monitoring device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20220418

Address after: Room 2015, building 18, Lane 879, Zhongjiang Road, Putuo District, Shanghai 200333

Applicant after: Xuanke Technology (Shanghai) Co.,Ltd.

Address before: 110034 gate 2, 14th floor, unit 1, building 6, No.10 Xianglushan Road, Shenyang City, Liaoning Province

Applicant before: Wang Mei

GR01 Patent grant
GR01 Patent grant