CN105607987A - Access number statistic method and device - Google Patents
Access number statistic method and device Download PDFInfo
- Publication number
- CN105607987A CN105607987A CN201510956587.8A CN201510956587A CN105607987A CN 105607987 A CN105607987 A CN 105607987A CN 201510956587 A CN201510956587 A CN 201510956587A CN 105607987 A CN105607987 A CN 105607987A
- Authority
- CN
- China
- Prior art keywords
- visit capacity
- access
- memory
- current total
- access number
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3452—Performance evaluation by statistical analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Biology (AREA)
- Quality & Reliability (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Data Mining & Analysis (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention relates to an access number statistic method and device. The method comprises the following steps: obtaining a memory space and dividing the memory space into areas in M columns and N lines according to a preset memory size, wherein M corresponds to the number of processes, each column corresponds to one process and N corresponds to the recordable access number of each process; receiving a concurrent access request according to the M processes and recording the concurrent access number in the memory space; carrying out statistic on the current total access number according to the used memory value in the memory space; and recording the current total access number in a database. Through the technical scheme, the concurrent access request is received through a plurality of processes and the concurrent access number is recorded, so that the access number statistic speed can be ensured while a large number of concurrent accesses are received, and the access number statistic correctness is ensured at the same time.
Description
Technical field
The present invention relates to data statistics technical field, relate in particular to a kind of visit capacity statistical method and device.
Background technology
Website often need to be added up user's visit capacity, but in the time of a large amount of Concurrency Access, this meterThe speed of number may not catch up with the speed that visit capacity rises. Prior art is that a number constantly adds 1, oneAdding of number one number,, speed is very slow.
Summary of the invention
The embodiment of the present invention provides a kind of visit capacity statistical method and device, comprises following technical scheme:
According to the first aspect of the embodiment of the present invention, a kind of visit capacity statistical method is provided, comprising:
Obtain memory headroom, and described memory headroom is divided into capable of M row * N according to default memory sizeRegion, wherein, the quantity of the corresponding process of M, the corresponding process of every row, the corresponding each process of N can be rememberedThe access number of record;
Receive Concurrency Access request by M process, and in described memory headroom, record Concurrency Access amount;
Add up current total visit capacity according to the memory value that used of described memory headroom;
Described current total visit capacity is recorded in database.
In one embodiment, describedly record Concurrency Access amount by M process, and at described internal memory skyBetween in record Concurrency Access amount, comprising:
Receive Concurrency Access request by M process, when each process receives a request of access simultaneouslyTime, by the mark in a region in recordable access number corresponding process described in described memory headroomWill position is set to 1 by 0.
In one embodiment, the described memory value that used according to described memory headroom is added up current total visitThe amount of asking, comprising:
Add up in described memory headroom the number in the region that flag bit is 1;
Described number is defined as to described current total visit capacity.
In one embodiment, described method also comprises:
Monitor the processing progress of each process;
When All Ranges in recordable access number corresponding to the arbitrary process in M process of monitoringFlag bit is at 1 o'clock, and the current total visit capacity in described database is added to N, and by described arbitrary processIn corresponding recordable access number, the mark of All Ranges is set to 0.
According to the second aspect of the embodiment of the present invention, a kind of visit capacity statistic device is provided, comprising:
Divide module, for obtaining memory headroom, and described memory headroom is drawn according to default memory sizeBe divided into capable region of M row * N, wherein, the quantity of the corresponding process of M, the corresponding process of every row, N coupleAnswer the recordable access number of each process;
The first logging modle, for receiving Concurrency Access request by M process, and at described internal memory skyBetween in record Concurrency Access amount;
Statistical module, adds up current total visit capacity for the memory value that used according to described memory headroom;
The second logging modle, for being recorded to database by described current total visit capacity.
In one embodiment, described the first logging modle is used for:
Receive Concurrency Access request by M process, when each process receives a request of access simultaneouslyTime, by the mark in a region in recordable access number corresponding process described in described memory headroomWill position is set to 1 by 0.
In one embodiment, described statistical module comprises:
Statistics submodule, for adding up described memory headroom, the number in the region that flag bit is 1;
Determine submodule, for described number being defined as to described current total visit capacity.
In one embodiment, described device also comprises:
Monitoring module, for monitoring the processing progress of each process;
Processing module, monitors M the recordable access number that the arbitrary process of process is corresponding for working asThe flag bit of middle All Ranges is at 1 o'clock, and the current total visit capacity in described database is added to N, and by instituteThe mark of stating All Ranges in the corresponding recordable access number of arbitrary process is set to 0.
The technical scheme that embodiments of the invention provide can comprise following beneficial effect:
Technique scheme, receives concurrent request of access by multiple threads, and records Concurrency Access amount,Like this, in the time receiving a large amount of Concurrency Access, can ensure the speed of visit capacity statistics, ensure to visit simultaneouslyThe amount of asking statistical accuracy.
Should be understood that, it is only exemplary and explanatory that above general description and details are hereinafter described, can not limit the present invention.
Brief description of the drawings
Accompanying drawing is herein merged in description and forms the part of this description, shows and meets thisBright embodiment, and be used from and explain principle of the present invention with description one.
Fig. 1 is according to the flow chart of a kind of visit capacity statistical method shown in an exemplary embodiment.
Fig. 2 is according to the flow chart of the another kind of visit capacity statistical method shown in an exemplary embodiment.
Fig. 3 is according to step S103 in the another kind of visit capacity statistical method shown in an exemplary embodimentFlow chart.
Fig. 4 is according to the flow chart of another the visit capacity statistical method shown in an exemplary embodiment.
Fig. 5 is according to the block diagram of a kind of visit capacity statistic device shown in an exemplary embodiment.
Fig. 6 is according to the frame of statistical module in a kind of visit capacity statistic device shown in an exemplary embodimentFigure.
Fig. 7 is according to the block diagram of the another kind of visit capacity statistic device shown in an exemplary embodiment.
Detailed description of the invention
Here will at length describe exemplary embodiment, its sample table shows in the accompanying drawings. Retouching belowState while relating to accompanying drawing, unless separately there is expression, the same numbers in different accompanying drawings represents same or analogous wantingElement. Embodiment described in following exemplary embodiment does not represent own consistent with the present inventionEmbodiment. On the contrary, they be only with as that described in detail in appended claims, more of the present inventionThe example of the consistent apparatus and method in aspect.
The embodiment of the present invention provides a kind of visit capacity statistical method, and as shown in Figure 1, the method comprises stepRapid S101-S104:
In step S101, obtain memory headroom, and memory headroom is divided into according to default memory sizeCapable region of M row * N, wherein, the quantity of the corresponding process of M, the corresponding process of every row, N is corresponding everyThe recordable access number of individual process;
In step S102, receive Concurrency Access request by M process, and in memory headroom recordConcurrency Access amount;
In step S103, add up current total visit capacity according to the memory value that used of memory headroom;
In step S104, current total visit capacity is recorded in database.
In this embodiment, receive concurrent request of access by multiple threads, and record Concurrency Access amount,Like this, in the time receiving a large amount of Concurrency Access, can ensure the speed of visit capacity statistics, ensure to visit simultaneouslyThe amount of asking statistical accuracy.
For example, open up the memory headroom of a 16*n, distribute 16 processes to count simultaneously. A process pairYing Yilie. In the time that counting completes, or in the time that Concurrency Access amount obviously declines, large according to memory headroomSubtotal figure goes out visit capacity, and this visit capacity is recorded in database. A general server is maximum supports 100000 Concurrency Access amount, also just distributes the internal memory of 1M just much of that.
As shown in Figure 2, in one embodiment, above-mentioned steps S102 comprises step S201:
In step S201, receive Concurrency Access request by M process, when each process receives simultaneouslyDuring to a request of access, by Yi Ge district in recordable access number corresponding process in memory headroomThe flag bit in territory is set to 1 by 0.
In this embodiment, can represent the also not record access request of this region with flag bit 0, when certain entersWhen journey receives Concurrency Access request, the flag bit in a region of this process is set to 1 by 0, thus tableShow and increased a visit capacity.
As shown in Figure 3, in one embodiment, above-mentioned steps S103 comprises step S301-S302:
In step S301, in statistics memory headroom, the number in the region that flag bit is 1;
In step S302, number is defined as to current total visit capacity.
In this embodiment, can determine by the number in the region that in statistics memory headroom, flag bit is 1Current total visit capacity, thereby convenient statistics visit capacity.
As shown in Figure 4, in one embodiment, said method also comprises step S401-S402:
In step S401, monitor the processing progress of each process;
In step S402, when monitoring recordable access number corresponding to arbitrary process in M processIn amount, the flag bit of All Ranges is at 1 o'clock, the current total visit capacity in database is added to N, and will appointIn the corresponding recordable access number of one process, the mark of All Ranges is set to 0.
In this embodiment, can also monitor the processing progress of each process, when certain process corresponding canIn the access number of record, the flag bit of All Ranges is 1, illustrates that N region write all over, now,Current total visit capacity in database can be added to N, and by corresponding arbitrary process recordable access numberThe mark of middle All Ranges is set to 0, thereby facilitates this process again to count.
For example, open up the memory headroom of a 16*1000, distribute 16 processes to count simultaneously. A processCorresponding row, every row have 1000. Add at 1 o'clock, just having a process is 1 by a position at every turn.
Meanwhile, also have the memory headroom of a 16*1, a correspondence one is listed as. When a process is by its correspondence1000 write at full 1 o'clock, be 1 by the position in corresponding 16*1. The 17th process check is to having oneIndividual 1 o'clock, in database, visit capacity is added to 1000, simultaneously by relevant position zero clearing in two memory headrooms,Facilitate process again to count.
Following is disclosure device embodiment, can be for carrying out disclosure embodiment of the method.
Fig. 5 is according to the block diagram of a kind of visit capacity statistic device shown in an exemplary embodiment. As Fig. 5Shown in, this visit capacity statistic device comprises:
Divide module 51, for obtaining memory headroom, and by described memory headroom according to default memory sizeBe divided into capable region of M row * N, wherein, the quantity of the corresponding process of M, the corresponding process of every row, NThe recordable access number of corresponding each process;
The first logging modle 52, for receiving Concurrency Access request by M process, and at described internal memoryIn space, record Concurrency Access amount;
Statistical module 53, adds up current total visit capacity for the memory value that used according to described memory headroom;
The second logging modle 54, for being recorded to database by described current total visit capacity.
In this embodiment, receive concurrent request of access by multiple threads, and record Concurrency Access amount,Like this, in the time receiving a large amount of Concurrency Access, can ensure the speed of visit capacity statistics, ensure to visit simultaneouslyThe amount of asking statistical accuracy.
For example, open up the memory headroom of a 16*n, distribute 16 processes to count simultaneously. A process pairYing Yilie. In the time that counting completes, or in the time that Concurrency Access amount obviously declines, large according to memory headroomSubtotal figure goes out visit capacity, and this visit capacity is recorded in database. A general server is maximum supports 100000 Concurrency Access amount, also just distributes the internal memory of 1M just much of that.
In one embodiment, described the first logging modle 52 for:
Receive Concurrency Access request by M process, when each process receives a request of access simultaneouslyTime, by the mark in a region in recordable access number corresponding process described in described memory headroomWill position is set to 1 by 0.
In this embodiment, can represent the also not record access request of this region with flag bit 0, when certain entersWhen journey receives Concurrency Access request, the flag bit in a region of this process is set to 1 by 0, thus tableShow and increased a visit capacity.
As shown in Figure 6, in one embodiment, described statistical module 53 comprises:
Statistics submodule 61, for adding up described memory headroom, the number in the region that flag bit is 1;
Determine submodule 62, for described number being defined as to described current total visit capacity.
In this embodiment, can determine by the number in the region that in statistics memory headroom, flag bit is 1Current total visit capacity, thereby convenient statistics visit capacity.
As shown in Figure 7, in one embodiment, said apparatus also comprises:
Monitoring module 71, for monitoring the processing progress of each process;
Processing module 72, monitors M the recordable access number that the arbitrary process of process is corresponding for working asIn amount, the flag bit of All Ranges is at 1 o'clock, and the current total visit capacity in described database is added to N, and willIn the corresponding recordable access number of described arbitrary process, the mark of All Ranges is set to 0.
In this embodiment, can also monitor the processing progress of each process, when certain process corresponding canIn the access number of record, the flag bit of All Ranges is 1, illustrates that N region write all over, now,Current total visit capacity in database can be added to N, and by corresponding arbitrary process recordable access numberThe mark of middle All Ranges is set to 0, thereby facilitates this process again to count.
For example, open up the memory headroom of a 16*1000, distribute 16 processes to count simultaneously. A processCorresponding row, every row have 1000. Add at 1 o'clock, just having a process is 1 by a position at every turn.
Meanwhile, also have the memory headroom of a 16*1, a correspondence one is listed as. When a process is by its correspondence1000 write at full 1 o'clock, be 1 by the position in corresponding 16*1. The 17th process check is to having oneIndividual 1 o'clock, in database, visit capacity is added to 1000, simultaneously by relevant position zero clearing in two memory headrooms,Facilitate process again to count.
About the device in above-described embodiment, wherein the concrete mode of modules executable operations is havingIn the embodiment of pass the method, have been described in detail, will not elaborate explanation herein.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system orComputer program. Therefore, the present invention can adopt complete hardware implementation example, completely implement software example,Or in conjunction with the form of the embodiment of software and hardware aspect. And the present invention can adopt one or moreThe computer-usable storage medium that wherein includes computer usable program code (includes but not limited to diskMemory and optical memory etc.) form of the upper computer program of implementing.
The present invention is that reference is according to the method for the embodiment of the present invention, equipment (system) and computer programThe flow chart of product and/or block diagram are described. Should understand can be by computer program instructions realization flowEach flow process in figure and/or block diagram and/or the stream in square frame and flow chart and/or block diagramThe combination of journey and/or square frame. Can provide these computer program instructions to all-purpose computer, dedicated computingThe processor of machine, Embedded Processor or other programmable data processing device, to produce a machine, makesThe instruction that must carry out by the processor of computer or other programmable data processing device produces for realizingThe merit of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frameThe device of energy.
These computer program instructions also can be stored in energy vectoring computer or other programmable data processing are establishedIn the standby computer-readable memory with ad hoc fashion work, make to be stored in this computer-readable memoryIn instruction produce and comprise the manufacture of command device, this command device realize in flow process of flow chart orThe function of specifying in square frame of multiple flow processs and/or block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device,Make to carry out sequence of operations step on computer or other programmable devices computer implemented to produceProcess, thereby the instruction of carrying out on computer or other programmable devices is provided for realizing at flow chartThe step of the function of specifying in square frame of a flow process or multiple flow process and/or block diagram or multiple square frame。
Obviously, those skilled in the art can carry out various changes and modification and not depart from this present inventionThe spirit and scope of invention. Like this, if belonging to right of the present invention, these amendments of the present invention and modification wantAsk and the scope of equivalent technologies within, the present invention be also intended to comprise these change and modification interior.
Claims (8)
1. a visit capacity statistical method, is characterized in that, comprising:
Obtain memory headroom, and described memory headroom is divided into capable of M row * N according to default memory sizeRegion, wherein, the quantity of the corresponding process of M, the corresponding process of every row, the corresponding each process of N can be rememberedThe access number of record;
Receive Concurrency Access request by M process, and in described memory headroom, record Concurrency Access amount;
Add up current total visit capacity according to the memory value that used of described memory headroom;
Described current total visit capacity is recorded in database.
2. method according to claim 1, is characterized in that, describedly records also by M processSend out visit capacity, and in described memory headroom, record Concurrency Access amount, comprising:
Receive Concurrency Access request by M process, when each process receives a request of access simultaneouslyTime, by the mark in a region in recordable access number corresponding process described in described memory headroomWill position is set to 1 by 0.
3. method according to claim 2, is characterized in that, described according to described memory headroomUsed the current total visit capacity of memory value statistics, being comprised:
Add up in described memory headroom the number in the region that flag bit is 1;
Described number is defined as to described current total visit capacity.
4. method according to claim 2, is characterized in that, described method also comprises:
Monitor the processing progress of each process;
When the mark of All Ranges in recordable access number corresponding to the arbitrary process in M process of monitoringWill position is at 1 o'clock, and the current total visit capacity in described database is added to N, and by described arbitrary process correspondenceIn recordable access number, the mark of All Ranges is set to 0.
5. a visit capacity statistic device, is characterized in that, comprising:
Divide module, for obtaining memory headroom, and described memory headroom is drawn according to default memory sizeBe divided into capable region of M row * N, wherein, the quantity of the corresponding process of M, the corresponding process of every row, N coupleAnswer the recordable access number of each process;
The first logging modle, for receiving Concurrency Access request by M process, and at described internal memory skyBetween in record Concurrency Access amount;
Statistical module, adds up current total visit capacity for the memory value that used according to described memory headroom;
The second logging modle, for being recorded to database by described current total visit capacity.
6. device according to claim 5, is characterized in that, described the first logging modle is used for:
Receive Concurrency Access request by M process, when each process receives a request of access simultaneouslyTime, by the mark in a region in recordable access number corresponding process described in described memory headroomWill position is set to 1 by 0.
7. device according to claim 6, is characterized in that, described statistical module comprises:
Statistics submodule, for adding up described memory headroom, the number in the region that flag bit is 1;
Determine submodule, for described number being defined as to described current total visit capacity.
8. device according to claim 6, is characterized in that, described device also comprises:
Monitoring module, for monitoring the processing progress of each process;
Processing module, monitors M the recordable access number that the arbitrary process of process is corresponding for working asThe flag bit of middle All Ranges is at 1 o'clock, and the current total visit capacity in described database is added to N, and by instituteThe mark of stating All Ranges in the corresponding recordable access number of arbitrary process is set to 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510956587.8A CN105607987B (en) | 2015-12-17 | 2015-12-17 | A kind of visit capacity statistical method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510956587.8A CN105607987B (en) | 2015-12-17 | 2015-12-17 | A kind of visit capacity statistical method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105607987A true CN105607987A (en) | 2016-05-25 |
| CN105607987B CN105607987B (en) | 2018-07-20 |
Family
ID=55987939
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510956587.8A Expired - Fee Related CN105607987B (en) | 2015-12-17 | 2015-12-17 | A kind of visit capacity statistical method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105607987B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106354812A (en) * | 2016-08-30 | 2017-01-25 | 江苏名通信息科技有限公司 | Game page view data acquiring method |
| CN106484819A (en) * | 2016-09-26 | 2017-03-08 | 天脉聚源（北京）科技有限公司 | A kind of method and device of counting user amount |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145937A (en) * | 2006-09-15 | 2008-03-19 | 腾讯科技（深圳）有限公司 | Method for displaying access traffic data and its transmission device |
| US20080313019A1 (en) * | 2007-06-14 | 2008-12-18 | Jeffers Martin C | System and method for extracting contact information from website traffic statistics |
| CN101631036A (en) * | 2008-07-14 | 2010-01-20 | 中兴通讯股份有限公司 | Method and device for counting website hits |
| CN102377583A (en) * | 2010-08-09 | 2012-03-14 | 百度在线网络技术（北京）有限公司 | Method and system for counting website traffic |
-
2015
- 2015-12-17 CN CN201510956587.8A patent/CN105607987B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101145937A (en) * | 2006-09-15 | 2008-03-19 | 腾讯科技（深圳）有限公司 | Method for displaying access traffic data and its transmission device |
| US20080313019A1 (en) * | 2007-06-14 | 2008-12-18 | Jeffers Martin C | System and method for extracting contact information from website traffic statistics |
| CN101631036A (en) * | 2008-07-14 | 2010-01-20 | 中兴通讯股份有限公司 | Method and device for counting website hits |
| CN102377583A (en) * | 2010-08-09 | 2012-03-14 | 百度在线网络技术（北京）有限公司 | Method and system for counting website traffic |
Non-Patent Citations (2)
| Title |
|---|
| ZHANGWENGE111: "深入理解并行编程V1.0-并发编程网", 《豆丁网：HTTP://WWW.DOCIN.COM/P-790720074.HTML》 * |
| 张勇 等: "一种新型统计计数器结构及其性能研究", 《计算机工程与应用》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106354812A (en) * | 2016-08-30 | 2017-01-25 | 江苏名通信息科技有限公司 | Game page view data acquiring method |
| CN106484819A (en) * | 2016-09-26 | 2017-03-08 | 天脉聚源（北京）科技有限公司 | A kind of method and device of counting user amount |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105607987B (en) | 2018-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4859595B2 (en) | Storage system, data relocation method thereof, and data relocation program | |
| US9588906B2 (en) | Removing cached data | |
| US11275721B2 (en) | Adaptive table placement in NUMA architectures | |
| CN103970870A (en) | Database query method and server | |
| CN106570025B (en) | Data filtering method and device | |
| WO2019085709A1 (en) | Pooling method and system applied to convolutional neural network | |
| CN105843819B (en) | Data export method and device | |
| US10895919B2 (en) | Gesture control method and apparatus for display screen | |
| CN106201673B (en) | A kind of seismic data processing technique and device | |
| CN104657435A (en) | Storage management method for application data and network management system | |
| CN102937993B (en) | A kind of method for access key and device | |
| US10417192B2 (en) | File classification in a distributed file system | |
| US20150277405A1 (en) | Production plan display method, production plan support method, production plan display apparatus, production plan support apparatus, and recording medium | |
| CN104951462A (en) | Method and system for managing data base | |
| CN105607987A (en) | Access number statistic method and device | |
| CN110888922A (en) | Method and device for creating target table during data synchronization | |
| CN110347497B (en) | Method and device for dividing multiple storage devices into device groups | |
| US20240220334A1 (en) | Data processing method in distributed system, and related system | |
| WO2015088557A1 (en) | Data stream processing based on a boundary parameter | |
| CN106648567B (en) | Data acquisition method and device | |
| TWI534704B (en) | Processing method for time series and system thereof | |
| CN104598463B (en) | For the method and apparatus in switch data library | |
| CN112214978A (en) | Data processing method and related equipment | |
| US11080299B2 (en) | Methods and apparatus to partition a database | |
| CN106294700A (en) | The storage of a kind of daily record and read method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A method and device of access statistics Effective date of registration: 20210104 Granted publication date: 20180720 Pledgee: Inner Mongolia Huipu Energy Co.,Ltd. Pledgor: WUXI TVMINING MEDIA SCIENCE & TECHNOLOGY Co.,Ltd. Registration number: Y2020990001517 |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180720 |