CN105488125A - Page access method and apparatus - Google Patents
Page access method and apparatus Download PDFInfo
- Publication number
- CN105488125A CN105488125A CN201510822435.9A CN201510822435A CN105488125A CN 105488125 A CN105488125 A CN 105488125A CN 201510822435 A CN201510822435 A CN 201510822435A CN 105488125 A CN105488125 A CN 105488125A
- Authority
- CN
- China
- Prior art keywords
- user
- hash
- registered user
- cryptographic hash
- hash table
- 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.)
- Pending
Links
Classifications
-
- 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
-
- 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/951—Indexing; Web crawling techniques
Abstract
The invention discloses a page access method and apparatus. An embodiment of the method comprises: receiving a browsing request of a page, wherein the browsing request comprises a user identifier; based on a hash table indicating a correspondence relationship between the user identifier and registration indication information, judging whether a user corresponding to the user identifier is a registered user or not, wherein the registration indication information is used for indicating whether the user is the registered user or not; and if it is judged that the user is the registered user, creating a processing thread for processing a calling request of an application corresponding to a link in the page, received from the registered user. Whether the user is the registered user or not is queried through the hash table loaded in a memory, so that the system overhead in a query process is reduced and the storage space is saved.
Description
Technical field
The application relates to computer realm, is specifically related to internet arena, particularly relates to page access method and apparatus.
Background technology
Along with the fast development of internet, the application that website provides is also more and more abundanter.User only need register in website, and the mode namely by such as clicking the application link on the page is called application.For alleviating the system load during concurrent invocation to application, usually needing to be pre-created processing threads to process the call request to application, correspondingly, needing to distinguish registered user and nonregistered user in advance.At present, the mode usually adopted is: inquiry represents that user is the field of registered user or nonregistered user in a database, when inquiring user for registered user, then creates processing threads.
But, when adopting aforesaid way to judge whether user is registered user, on the one hand, all needing to carry out a database manipulation for inquiring about each time, because the expense of database query operations self is comparatively large, and then increasing the system overhead in query script.On the other hand, because with needing to arrange correspondingly field per family, needs represent that this user is registered user or nonregistered user for each in a database, storage space is taken larger.
Summary of the invention
This application provides page access method and apparatus, for solving the technical matters that above-mentioned background technology part exists.
First aspect, this application provides page access method, the method comprises: receive the browse request to the page, browse request comprises user ID; Based on the Hash table of corresponding relation of indicating user mark with registration indication information, judge whether user corresponding to user ID is registered user, wherein, register indication information and be used to indicate user whether as registered user; If judge that user is as registered user, create processing threads, with to receive from registered user, the call request of the application of the link correspondence on the page is processed.
Second aspect, this application provides page access device, and this device comprises: receiving element, and be configured for the browse request received the page, browse request comprises user ID; Judging unit, is configured for based on the Hash table of corresponding relation of indicating user mark with registration indication information, judges whether user corresponding to user ID is registered user, wherein, registers indication information and is used to indicate user whether as registered user; If be configured for, creating unit, judges that user is as registered user, create processing threads, with to receive from registered user, the call request of the application of the link correspondence on the page is processed.
The page access method and apparatus that the application provides, by receiving the browse request to the page; Based on the Hash table of corresponding relation of indicating user mark with registration indication information, judge whether user corresponding to user ID is registered user; If judge that user is as registered user, create processing threads, with to receive from registered user, the call request of the application of the link correspondence on the page is processed.Whether be registered user, decrease the system overhead in query script, and save storage space if achieving by the Hash table inquiring user be carried in internal memory.
Accompanying drawing explanation
By reading the detailed description done non-limiting example done with reference to the following drawings, the other features, objects and advantages of the application will become more obvious:
Fig. 1 is the exemplary system architecture figure that the application can be applied to wherein;
Fig. 2 shows the process flow diagram of an embodiment of the page access method according to the application;
Fig. 3 shows the process flow diagram of another embodiment of the page access method according to the application;
Fig. 4 shows schematic diagram registration indication information being added bitmap;
Fig. 5 shows the structural representation of an embodiment of the page access device according to the application;
Fig. 6 is the structural representation of the computer system be suitable for for the terminal device or server realizing the embodiment of the present application.
Embodiment
Below in conjunction with drawings and Examples, the application is described in further detail.Be understandable that, specific embodiment described herein is only for explaining related invention, but not the restriction to this invention.It also should be noted that, for convenience of description, in accompanying drawing, illustrate only the part relevant to Invention.
It should be noted that, when not conflicting, the embodiment in the application and the feature in embodiment can combine mutually.Below with reference to the accompanying drawings and describe the application in detail in conjunction with the embodiments.
Fig. 1 shows the exemplary system architecture 100 can applying the page access method of the application or the embodiment of page access device.
As shown in Figure 1, system architecture 100 can comprise terminal device 101,102,103, network 104 and server 105.Network 104 is in order at terminal device 101, the medium providing transmission link between 102,103 and server 105.Network 104 can comprise various connection type, such as wired, wireless transmission link or fiber optic cables etc.
User can use terminal device 101,102,103 mutual by network 104 and server 105, to receive or to send message etc.Terminal device 101,102,103 can be provided with various communication applications, such as, the application of browser class, search class application, mailbox client, social platform software etc.
Terminal device 101,102,103 can be have display screen and the various electronic equipments of network enabled communication, include but not limited to smart mobile phone, panel computer, E-book reader, MP3 player (MovingPictureExpertsGroupAudioLayerIII, dynamic image expert compression standard audio frequency aspect 3), MP4 (MovingPictureExpertsGroupAudioLayerIV, dynamic image expert compression standard audio frequency aspect 4) player, pocket computer on knee and desk-top computer etc.
Server 105 can be to provide the server of various service, such as, the browser class on terminal device 101,102,103 is applied to the server provided support.Server can process the request of access received, and result (such as webpage) is fed back to terminal device.
Should be appreciated that, the number of the terminal device in Fig. 1, network and server is only schematic.According to realizing needs, the terminal device of arbitrary number, network and server can be had.
Please refer to Fig. 2, it illustrates the flow process 200 of an embodiment of the page access method according to the application.It should be noted that, the page access method that the embodiment of the present application provides generally is performed by the server 105 in Fig. 1, and correspondingly, page access device is generally positioned in server 105.The method comprises the following steps:
Step 201, receives the browse request to the page.
In the present embodiment, the electronic equipment (server such as shown in Fig. 1) that page access method is run thereon can receive the browse request to the page by wired connection mode or radio connection from the terminal that user utilizes it to carry out page browsing.Wherein, browse request comprises user ID.This user ID can for the mark for identifying the identity to the user that the page conducts interviews generated in advance.Such as, one can be write in advance for representing the mark of user identity in the buffer memory of the browser of user, thus when generating the browse request to the page, this mark can send together with browse request, thus make when receiving the browse request to the page, this user ID can be received simultaneously.In the present embodiment, user ID can also be the attribute information of user's registered in advance in website, the identification card number of such as user, and user is in the login account of website.
Step 202, based on the Hash table of corresponding relation of indicating user mark with registration indication information, judges whether user corresponding to user ID is registered user.
In the present embodiment, indication information indicating user is registered whether as registered user.Before explanation determines whether user is the mode of registered user, first illustrate and determine that whether user is the object of registered user: user, when browsing pages, can be called the application that website provides by the mode such as clicking the application link on the page.For the financial service class page, the link of the application of loan class, the application of financing consulting class in this page, can be comprised.Can call the application of financial service class by clicking this link.Usually, need, after website carries out being registered as registered user, just to call the application that website provides.When the visit capacity of website is magnanimity rank, the concurrent invocation request of the magnanimity to application can be received simultaneously, can be pre-created for the treatment of the processing threads of registered user to the call request of the application of the link correspondence on the page, to avoid because creating processing threads again after receiving request and the problem that sharply increases of the system load caused.Correspondingly, in above process, due to in the user of page browsing, comprise a large amount of nonregistered users, therefore, need the registered user determined in the user of browsing pages, in other words, need to filter nonregistered user.Thus can registered user be determined, create processing threads for registered user.
Go on to say below in the present embodiment and determine that whether user is the mode of registered user: in the present embodiment, the Hash table of indicating user mark and the corresponding relation of registration indication information can be set up in advance, can using the key assignments of user ID as Hash table.In the present embodiment, hash function can be chosen in advance, then, utilize the hash function selected to carry out cryptographic hash calculating to key assignments and user ID, obtain cryptographic hash, registration indication information is stored on position corresponding with this cryptographic hash in Hash table.In the present embodiment, after the Hash table of corresponding relation setting up indicating user mark and registration indication information, this Hash table can be utilized, judge whether user corresponding to user ID is registered user, namely utilizes hash function to calculate user ID, obtains cryptographic hash, then, obtain the registration indication information on position corresponding with this cryptographic hash in Hash table, according to registration indication information, judge whether user corresponding to user ID is registered user.
The following describes in the present embodiment utilize Hash table determine user be whether in registered user and prior art by difference that whether database query user is the mode of registered user:
On the one hand, when whether being registered user by database query user, because database data is not carried in internal memory, all need to carry out a database manipulation for inquiring about each time, because the expense of database query operations self is comparatively large, and then increase the system overhead in query script.In addition, need to arrange in a database by data base querying the field whether indicating user is registered user, take storage space large.And in the present embodiment, utilize the Hash table be carried in internal memory to judge whether user is registered user.During owing to adopting Hash table inquiry numerical value corresponding to key assignments, time complexity is O (1).Therefore, in this example, rely on Hash table to determine whether user is registered user, time complexity is also O (1).Thus whether lifting inquiring user is the speed of registered user and saves storage space, determines the registered user in the user of browsing pages rapidly and accurately, namely filters nonregistered user.
On the other hand, when whether being registered user by database query user, due in the system architecture is described, Database Systems and main business (such as the treatment of to the processing threads linking the call request of corresponding application on the page) integrate, therefore, delay is caused can to affect the operation of main business due to data base querying.Such as, whether above-mentioned processing threads is being be suspended in the process of registered user by database query user, thus increases system overhead further.And in the present embodiment, owing to being carried in Hash table in internal memory independent of main business, thus decrease inquiring user be whether registered user operation with to being coupled between main business, and then the operational efficiency of elevator system.
Step 203, if judge that user is as registered user, creates processing threads.
In the present embodiment, when judging the user of browsing pages for registered user, then processing threads can be created.Processing threads for receive from registered user, the call request of the application of the link correspondence on the page is processed.
Please refer to Fig. 3, it illustrates the flow process 300 of another embodiment of the page access method according to the application.It should be noted that, the page access method that the embodiment of the present application provides generally is performed by the server 105 in Fig. 1, and the method comprises the following steps:
Step 301, receives the browse request to the page.
In the present embodiment, browse request comprises user ID.This user ID can for the mark for identifying the identity to the user that the page conducts interviews generated in advance.Such as, one can be write for representing the mark of user identity in the buffer memory of the browser of user, thus when generating the browse request to the page, this mark can send together with browse request, thus make when receiving the browse request to the page, this user ID can be received simultaneously.In the present embodiment, user ID can also be the attribute information of user's registered in advance in website, the identification card number of such as user, and user is in the login account of website.
Step 302, comprises based on storage space the Hash table that multiple size is the storage unit of a bit, judges whether user corresponding to user ID is registered user.
In the present embodiment, the storage space of Hash table can comprise multiple storage unit, and the size of each storage unit is a bit, this Hash table can be referred to as bitmap.In this example, bitmap can adopt array to realize.Such as, be pre-created an array, arranging the memory headroom that each array element takies is a bit (bit), thus generates bitmap.
In the present embodiment, register indication information as binary number, such as, can to adopt 1 expression registered user, represent nonregistered user with 0.In the present embodiment, can for a user ID, cryptographic hash can be carried out by multiple hash function to this user ID and calculate multiple cryptographic hash, the position that then multiple cryptographic hash is corresponding in Hash table be arranged the registration indication information of this user ID.Correspondingly, owing to adopting multiple hash function, cryptographic hash calculating is carried out to user ID, the registration indication information making user ID corresponding can be stored in multiple storage unit in bitmap and multiple bit, therefore, the size of this bitmap can be that the number of the quantity of user and hash function is long-pending.In the present embodiment, the quantity of the user of browsing pages can be pre-determined, and choose the hash function of predetermined number, then, using the long-pending size as the storage space of bitmap of the quantity of user and predetermined number.
In the present embodiment, before whether the user that inquiring user mark is corresponding is registered user, first initialization can be carried out to bitmap.Due to when creating bitmap, such as, when bitmap array realizes, the numerical value initial value in each storage unit in bitmap is 0, therefore, and can for that is the registration indication information of registered user 1 to be added in position corresponding in bitmap to the initialization of bitmap.
In the present embodiment, can in the following ways the registration indication information of registered user be added in bitmap: the registered user's mark obtaining registered user; Utilize each hash function in hash function to carry out cryptographic hash calculating to registered user's mark respectively, obtain registered user and identify corresponding multiple cryptographic hash; Numerical value in each self-corresponding storage unit of each cryptographic hash in multiple cryptographic hash of bitmap is set to 1.
Please refer to Fig. 4, it illustrates schematic diagram registration indication information being added bitmap.
In the diagram, show that registered user identifies 401, bitmap 402.Bitmap 402 can utilize array to realize, and each array element can be set to when carrying out initialization to array occupy a bit.Hash function 1, hash function 2, the hash function 3 couples of registered users mark selected in advance can be adopted respectively to carry out cryptographic hash calculating, obtain cryptographic hash 0,3,5, then, that is registration indication information registered user being identified 401 1 is stored on the 0th, 3,5 bit of bitmap 402 respectively.
In this example, can judge whether user is registered user in the following ways: utilize each hash function in hash function to carry out cryptographic hash calculating to user ID respectively, obtain multiple cryptographic hash that user ID is corresponding; When numerical value in multiple cryptographic hash of Hash table in each self-corresponding storage unit of each cryptographic hash is 1, determine that user corresponding to user ID is registered user.
In the present embodiment, owing to carrying out cryptographic hash calculating according to multiple hash function to user ID, obtain multiple cryptographic hash, then, registration indication information is stored in Hash table in each self-corresponding storage unit of multiple cryptographic hash, thus avoids hash-collision problem.Hash-collision problem is: when only utilizing a hash function to carry out cryptographic hash calculating to user ID, may occur that two user ID correspond to the situation of a cryptographic hash.Such as, when in two users, a user is registered user, when another user is nonregistered user, the position that there will be the cryptographic hash that the user ID of nonregistered user is corresponding in bitmap is previously stored with registration indication information corresponding to registered user that is 1, thus has caused misjudgment.And in the present embodiment, only in bitmap multiple cryptographic hash that user ID is corresponding position on all numerical value when being 1, just determine that user corresponding to user ID is registered user.
In the present embodiment, each hash function in multiple hash function can be utilized to carry out cryptographic hash calculating to user ID successively, obtain cryptographic hash.Then, search the numerical value on position corresponding to cryptographic hash in bitmap, if 0, then can determine that user is nonregistered user.If 1, next hash function then can be utilized to continue to carry out cryptographic hash calculating to user ID, when the numerical value on positions that the cryptographic hash that obtains is corresponding after cryptographic hash calculates all in bitmap is 1, then can determine that user corresponding to this user ID is registered user.
Step 303, if judge that user is as registered user, creates processing threads.
In the present embodiment, when judging the user of browsing pages for registered user, then processing threads can be created.Processing threads for receive from registered user, the call request of the application of the link correspondence on the page is processed.
As can be seen from Figure 3, the embodiment corresponding with Fig. 2 unlike, the flow process 300 of the page access method in the present embodiment highlights and comprises based on storage space the Hash table that multiple size is the storage unit of a bit, judges that whether user corresponding to user ID be the step 302 of registered user.Whether, by step 302, according to the bit of in the storage space of Hash table, the scheme that the present embodiment describes can judge whether user is registered user, promote inquiring user further and be the speed of registered user and save storage space.
With further reference to Fig. 5, as the realization to method shown in above-mentioned each figure, this application provides an a kind of embodiment of page access device, this device embodiment is corresponding with the embodiment of the method shown in Fig. 2, and this device specifically can be applied in various electronic equipment.
As shown in Figure 5, the page access device 500 of the present embodiment comprises: receiving element 501, judging unit 502, creating unit 503.Wherein, receiving element 501 is configured for the browse request received the page, and browse request comprises user ID; Judging unit 502 is configured for based on the Hash table of corresponding relation of indicating user mark with registration indication information, judges whether user corresponding to user ID is registered user, wherein, registers indication information and is used to indicate user whether as registered user; If creating unit 503 is configured for judge that user is as registered user, create processing threads, with to receive from registered user, the call request of the application of the link correspondence on the page is processed.
In the present embodiment, receiving element 501 receiving package can contain the browse request of the page of user ID.This user ID can be pre-written in the buffer memory of the browser sending page browsing request, for identifying the identity to the user that the page conducts interviews.
In the present embodiment, judging unit 502 can get user ID from the browse request of the page received, and carries out cryptographic hash calculating, obtain cryptographic hash to user ID.In the indicating user mark set up in advance with the Hash table of the corresponding relation of registration indication information, can inquire on position corresponding to this cryptographic hash and register indication information.Then, according to this registration indication information, can judge whether user is registered user.
In the present embodiment, creating unit 503 can when judging the user of browsing pages for registered user, and create processing threads, this processing threads may be used for processing the call request of this registered user to the application of the link correspondence on the page.
In some optional implementations of the present embodiment, the storage space of Hash table comprises multiple storage unit, register indication information as binary number, wherein, the size of each storage unit is a bit, in the storage unit that the cryptographic hash that registration indication information obtains after being stored in and carrying out cryptographic hash calculating to user ID in Hash table is corresponding.
In some optional implementations of the present embodiment, device 500 also comprises: processing unit (not shown), be configured for the Hash table at the corresponding relation based on indicating user mark and registration indication information, before judging whether user corresponding to user ID is registered user, determine the quantity of the user of browsing pages in preset time period and choose the hash function of predetermined number; Determining unit (not shown), is configured for quantity and the long-pending size being defined as the storage space of Hash table of predetermined number; Hash table creating unit (not shown), is configured for the Hash table that the size creating storage space is the size of determined storage space.
In some optional implementations of the present embodiment, device 500 also comprises: mark acquiring unit (not shown), be configured for after the size creating storage space is the Hash table of the size of determined storage space, obtain registered user's mark of registered user; Computing unit (not shown), is configured for and utilizes each hash function in hash function to carry out cryptographic hash calculating to registered user's mark respectively, obtain registered user and identify corresponding multiple cryptographic hash; Setting unit (not shown), the numerical value be configured in the multiple cryptographic hash by Hash table in each self-corresponding storage unit of each cryptographic hash is set to 1.
In some optional implementations of the present embodiment, judging unit 502 comprises: cryptographic hash computation subunit (not shown), be configured for and utilize each hash function in hash function to carry out cryptographic hash calculating to user ID respectively, obtain multiple cryptographic hash that user ID is corresponding; Registered user determines subelement (not shown), when the numerical value be configured in each self-corresponding storage unit of each cryptographic hash in multiple cryptographic hash of Hash table is 1, determines that user corresponding to user ID is registered user.
It will be understood by those skilled in the art that above-mentioned page access device 500 also comprises some other known features, such as processor, storeies etc., in order to unnecessarily fuzzy embodiment of the present disclosure, these known structures are not shown in Figure 5.
Fig. 6 shows the structural representation of the computer system be suitable for for the terminal device or server realizing the embodiment of the present application.
As shown in Figure 6, computer system 600 comprises CPU (central processing unit) (CPU) 601, and it or can be loaded into the program random access storage device (RAM) 603 from storage area 608 and perform various suitable action and process according to the program be stored in ROM (read-only memory) (ROM) 602.In RAM603, also store system 600 and operate required various program and data.CPU601, ROM602 and RAM603 are connected with each other by bus 604.I/O (I/O) interface 605 is also connected to bus 604.
I/O interface 605 is connected to: the importation 606 comprising keyboard, mouse etc. with lower component; Comprise the output 607 of such as cathode-ray tube (CRT) (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.; Comprise the storage area 608 of hard disk etc.; And comprise the communications portion 609 of network interface unit of such as LAN card, modulator-demodular unit etc.Communications portion 609 is via the network executive communication process of such as the Internet.Driver 610 is also connected to I/O interface 605 as required.Detachable media 611, such as disk, CD, magneto-optic disk, semiconductor memory etc., be arranged on driver 610 as required, so that the computer program read from it is mounted into storage area 608 as required.
Especially, according to embodiment of the present disclosure, the process that reference flow sheet describes above may be implemented as computer software programs.Such as, embodiment of the present disclosure comprises a kind of computer program, and it comprises the computer program visibly comprised on a machine-readable medium, and described computer program comprises the program code for the method shown in flowchart.In such embodiments, this computer program can be downloaded and installed from network by communications portion 609, and/or is mounted from detachable media 611.
Process flow diagram in accompanying drawing and block diagram, illustrate according to the architectural framework in the cards of the system of the various embodiment of the application, method and computer program product, function and operation.In this, each square frame in process flow diagram or block diagram can represent a part for module, program segment or a code, and a part for described module, program segment or code comprises one or more executable instruction for realizing the logic function specified.Also it should be noted that at some as in the realization of replacing, the function marked in square frame also can be different from occurring in sequence of marking in accompanying drawing.Such as, in fact the square frame that two adjoining lands represent can perform substantially concurrently, and they also can perform by contrary order sometimes, and this determines according to involved function.Also it should be noted that, the combination of the square frame in each square frame in block diagram and/or process flow diagram and block diagram and/or process flow diagram, can realize by the special hardware based system of the function put rules into practice or operation, or can realize with the combination of specialized hardware and computer instruction.
As another aspect, present invention also provides a kind of non-volatile computer storage medium, this non-volatile computer storage medium can be the non-volatile computer storage medium comprised in device described in above-described embodiment; Also can be individualism, be unkitted the non-volatile computer storage medium allocated in terminal.Above-mentioned non-volatile computer storage medium stores one or more program, and when one or more program described is performed by an equipment, make described equipment: receive the browse request to the page, described browse request comprises user ID; Based on the Hash table of corresponding relation of indicating user mark with registration indication information, judge whether user corresponding to described user ID is registered user, wherein, described indication information of registering is used to indicate user whether as registered user; If judge that described user is as registered user, create processing threads, with to receive from described registered user, the call request of the application of the link correspondence on the described page is processed.
More than describe and be only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art are to be understood that, invention scope involved in the application, be not limited to the technical scheme of the particular combination of above-mentioned technical characteristic, also should be encompassed in when not departing from described inventive concept, other technical scheme of being carried out combination in any by above-mentioned technical characteristic or its equivalent feature and being formed simultaneously.The technical characteristic that such as, disclosed in above-mentioned feature and the application (but being not limited to) has similar functions is replaced mutually and the technical scheme formed.
Claims (10)
1. a page access method, is characterized in that, described method comprises:
Receive the browse request to the page, described browse request comprises user ID;
Based on the Hash table of corresponding relation of indicating user mark with registration indication information, judge whether user corresponding to described user ID is registered user, wherein, described indication information of registering is used to indicate user whether as registered user;
If judge that described user is as registered user, create processing threads, with to receive from described registered user, the call request of the application of the link correspondence on the described page is processed.
2. method according to claim 1, it is characterized in that, the storage space of described Hash table comprises multiple storage unit, described indication information of registering is as binary number, wherein, the size of each storage unit is a bit, in the storage unit that the cryptographic hash that described registration indication information obtains after being stored in and carrying out cryptographic hash calculating to described user ID in described Hash table is corresponding.
3. method according to claim 2, is characterized in that, based on the Hash table of corresponding relation of indicating user mark with registration indication information, before judging whether user corresponding to described user ID is registered user, described method also comprises:
Determine the quantity of the user browsing the described page in preset time period and choose the hash function of predetermined number;
By described quantity and the long-pending size being defined as the storage space of described Hash table of described predetermined number;
The size creating storage space is the Hash table of the size of determined storage space.
4. method according to claim 3, is characterized in that, after the size creating storage space is the Hash table of the size of determined storage space, described method also comprises:
Obtain registered user's mark of registered user;
Utilize each hash function in described hash function to carry out cryptographic hash calculating to described registered user's mark respectively, obtain described registered user and identify corresponding multiple cryptographic hash;
Numerical value in each self-corresponding storage unit of each cryptographic hash in described multiple cryptographic hash of described Hash table is set to 1.
5. method according to claim 4, is characterized in that, based on the Hash table of corresponding relation of indicating user mark with registration indication information, judges whether user corresponding to described user ID is that registered user comprises:
Utilize each hash function in described hash function to carry out cryptographic hash calculating to described user ID respectively, obtain multiple cryptographic hash that described user ID is corresponding;
When numerical value in described multiple cryptographic hash of described Hash table in each self-corresponding storage unit of each cryptographic hash is 1, determine that user corresponding to described user ID is registered user.
6. a page access device, is characterized in that, described device comprises:
Receiving element, be configured for the browse request received the page, described browse request comprises user ID;
Judging unit, is configured for based on the Hash table of corresponding relation of indicating user mark with registration indication information, judges whether user corresponding to described user ID is registered user, and wherein, described indication information of registering is used to indicate user whether as registered user;
If be configured for, creating unit, judges that described user is as registered user, create processing threads, with to receive from described registered user, the call request of the application of the link correspondence on the described page is processed.
7. device according to claim 6, it is characterized in that, the storage space of described Hash table comprises multiple storage unit, described indication information of registering is as binary number, wherein, the size of each storage unit is a bit, in the storage unit that the cryptographic hash that described registration indication information obtains after being stored in and carrying out cryptographic hash calculating to described user ID in described Hash table is corresponding.
8. device according to claim 7, is characterized in that, described device also comprises:
Processing unit, be configured for the Hash table at the corresponding relation based on indicating user mark and registration indication information, before judging whether user corresponding to described user ID is registered user, determine the quantity of the user browsing the described page in preset time period and choose the hash function of predetermined number;
Determining unit, is configured for described quantity and the long-pending size being defined as the storage space of described Hash table of described predetermined number;
Hash table creating unit, is configured for the Hash table that the size creating storage space is the size of determined storage space.
9. device according to claim 8, is characterized in that, described device also comprises:
Mark acquiring unit, is configured for after the size creating storage space is the Hash table of the size of determined storage space, obtains registered user's mark of registered user;
Computing unit, is configured for and utilizes each hash function in described hash function to carry out cryptographic hash calculating to described registered user's mark respectively, obtain described registered user and identify corresponding multiple cryptographic hash;
Setting unit, the numerical value be configured in the described multiple cryptographic hash by described Hash table in each self-corresponding storage unit of each cryptographic hash is set to 1.
10. device according to claim 9, is characterized in that, described judging unit comprises:
Cryptographic hash computation subunit, is configured for and utilizes each hash function in described hash function to carry out cryptographic hash calculating to described user ID respectively, obtain multiple cryptographic hash that described user ID is corresponding;
Registered user determines subelement, when the numerical value be configured in each self-corresponding storage unit of each cryptographic hash in described multiple cryptographic hash of described Hash table is 1, determines that user corresponding to described user ID is registered user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510822435.9A CN105488125A (en) | 2015-11-24 | 2015-11-24 | Page access method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510822435.9A CN105488125A (en) | 2015-11-24 | 2015-11-24 | Page access method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105488125A true CN105488125A (en) | 2016-04-13 |
Family
ID=55675100
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510822435.9A Pending CN105488125A (en) | 2015-11-24 | 2015-11-24 | Page access method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105488125A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391277A (en) * | 2017-07-17 | 2017-11-24 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN107508892A (en) * | 2017-08-29 | 2017-12-22 | 努比亚技术有限公司 | A kind of page access method, server and computer-readable recording medium |
| CN108269168A (en) * | 2017-12-29 | 2018-07-10 | 明博教育科技股份有限公司 | User's registration identification method and system are applied in a kind of platform docking more |
| CN108681587A (en) * | 2018-05-14 | 2018-10-19 | 五八有限公司 | Bitmap generation methods, device, equipment and storage medium |
| CN109471786A (en) * | 2018-11-16 | 2019-03-15 | 苏州好玩友网络科技有限公司 | A kind of collecting method, device, equipment and storage medium |
| CN110399557A (en) * | 2019-07-24 | 2019-11-01 | 秒针信息技术有限公司 | A kind of recognition methods of visitor information, identification device and readable storage medium storing program for executing |
| CN111552715A (en) * | 2020-05-06 | 2020-08-18 | 北京易数科技有限公司 | User query method and device |
| CN112181242A (en) * | 2019-07-02 | 2021-01-05 | 北京百度网讯科技有限公司 | Page display method and device |
| CN114584314A (en) * | 2022-02-28 | 2022-06-03 | 天翼安全科技有限公司 | Registration method, device, equipment and medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1540544A (en) * | 2003-04-22 | 2004-10-27 | 联想(北京)有限公司 | Method for tracking and controlling users' online states and information |
| JP2007060581A (en) * | 2005-08-26 | 2007-03-08 | Nomura Research Institute Ltd | Information management system and method |
| CN101060402A (en) * | 2006-04-21 | 2007-10-24 | 盛趣信息技术（上海）有限公司 | Hash-map-based multipoint buffer memory device |
| CN102480354A (en) * | 2010-11-30 | 2012-05-30 | 北大方正集团有限公司 | Unified authentication service system and method for unified authentication |
| KR20120071193A (en) * | 2010-12-22 | 2012-07-02 | 주식회사 케이티 | Hash tree based id federation system and technique for the user authentication |
| CN103051600A (en) * | 2011-08-23 | 2013-04-17 | 国际商业机器公司 | File access control method and system |
| CN103297402A (en) * | 2012-03-01 | 2013-09-11 | 腾讯科技（深圳）有限公司 | Method and system for controlling account registration |
| CN103353887A (en) * | 2013-06-28 | 2013-10-16 | 贵阳朗玛信息技术股份有限公司 | Method and device for searching user data |
-
2015
- 2015-11-24 CN CN201510822435.9A patent/CN105488125A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1540544A (en) * | 2003-04-22 | 2004-10-27 | 联想(北京)有限公司 | Method for tracking and controlling users' online states and information |
| JP2007060581A (en) * | 2005-08-26 | 2007-03-08 | Nomura Research Institute Ltd | Information management system and method |
| CN101060402A (en) * | 2006-04-21 | 2007-10-24 | 盛趣信息技术（上海）有限公司 | Hash-map-based multipoint buffer memory device |
| CN102480354A (en) * | 2010-11-30 | 2012-05-30 | 北大方正集团有限公司 | Unified authentication service system and method for unified authentication |
| KR20120071193A (en) * | 2010-12-22 | 2012-07-02 | 주식회사 케이티 | Hash tree based id federation system and technique for the user authentication |
| CN103051600A (en) * | 2011-08-23 | 2013-04-17 | 国际商业机器公司 | File access control method and system |
| CN103297402A (en) * | 2012-03-01 | 2013-09-11 | 腾讯科技（深圳）有限公司 | Method and system for controlling account registration |
| CN103353887A (en) * | 2013-06-28 | 2013-10-16 | 贵阳朗玛信息技术股份有限公司 | Method and device for searching user data |
Non-Patent Citations (2)
| Title |
|---|
| 叶军伟: ""哈希表冲突处理方法浅析"", 《科技视界》 * |
| 张婷等: ""基于多核PC的事务内存重复探测Hash冲突检测算法"", 《现代计算机》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391277B (en) * | 2017-07-17 | 2021-06-29 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN107391277A (en) * | 2017-07-17 | 2017-11-24 | 北京京东尚科信息技术有限公司 | Information processing method and device |
| CN107508892A (en) * | 2017-08-29 | 2017-12-22 | 努比亚技术有限公司 | A kind of page access method, server and computer-readable recording medium |
| CN108269168A (en) * | 2017-12-29 | 2018-07-10 | 明博教育科技股份有限公司 | User's registration identification method and system are applied in a kind of platform docking more |
| CN108269168B (en) * | 2017-12-29 | 2023-07-04 | 明博教育科技股份有限公司 | Platform docking multi-application user registration identification method and system |
| CN108681587A (en) * | 2018-05-14 | 2018-10-19 | 五八有限公司 | Bitmap generation methods, device, equipment and storage medium |
| CN108681587B (en) * | 2018-05-14 | 2023-01-13 | 五八有限公司 | bitmap generation method, device, equipment and storage medium |
| CN109471786B (en) * | 2018-11-16 | 2019-08-30 | 苏州好玩友网络科技有限公司 | A kind of collecting method, device, equipment and storage medium |
| CN109471786A (en) * | 2018-11-16 | 2019-03-15 | 苏州好玩友网络科技有限公司 | A kind of collecting method, device, equipment and storage medium |
| CN112181242A (en) * | 2019-07-02 | 2021-01-05 | 北京百度网讯科技有限公司 | Page display method and device |
| CN112181242B (en) * | 2019-07-02 | 2021-11-02 | 北京百度网讯科技有限公司 | Page display method and device |
| CN110399557A (en) * | 2019-07-24 | 2019-11-01 | 秒针信息技术有限公司 | A kind of recognition methods of visitor information, identification device and readable storage medium storing program for executing |
| CN111552715A (en) * | 2020-05-06 | 2020-08-18 | 北京易数科技有限公司 | User query method and device |
| CN111552715B (en) * | 2020-05-06 | 2023-11-17 | 北京易数科技有限公司 | User query method and device |
| CN114584314A (en) * | 2022-02-28 | 2022-06-03 | 天翼安全科技有限公司 | Registration method, device, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105488125A (en) | Page access method and apparatus | |
| CN105550345A (en) | File operation method and apparatus | |
| CN107070858B (en) | Service processing method and device | |
| CA3139243A1 (en) | Information collection method, device, computer equipment and storage medium | |
| CN105528408A (en) | Page display method and apparatus | |
| CN109522751B (en) | Access right control method and device, electronic equipment and computer readable medium | |
| CN105205174A (en) | File processing method and device for distributed system | |
| US20190089549A1 (en) | Information processing system and charge calculation apparatus | |
| CN105631035A (en) | Data storage method and device | |
| CN102135895B (en) | System upgrading method and system | |
| CN110941614A (en) | Form generation method and device, electronic equipment and computer readable storage medium | |
| CN111857674B (en) | Business product generation method and device, electronic equipment and readable storage medium | |
| US20220309546A1 (en) | Ad Simulator Browser Extension | |
| CN110058992B (en) | Text template effect feedback method and device and electronic equipment | |
| CN112818270A (en) | Data cross-domain transfer method and device and computer equipment | |
| US9754319B2 (en) | Source document framework for accounting systems | |
| CN105739717A (en) | Information input method and device | |
| US20100057733A1 (en) | Method, computer program product, and apparatus for enabling access to enterprise information | |
| CN114330240A (en) | PDF document analysis method and device, computer equipment and storage medium | |
| CN111506340B (en) | Business rule information processing method, device and system | |
| WO2021043034A1 (en) | Service query method, and related device | |
| US20200050787A1 (en) | Methods and systems for facilitating migration to centralized compliance content for integration with a plurality of digital applications | |
| CN111240785A (en) | Page generation method and device | |
| US20160162959A1 (en) | Performance Optimization Utilizing Pre-Analysis of Condition Records | |
| CN117493443A (en) | Data processing method and device, electronic equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160413 |
|
| RJ01 | Rejection of invention patent application after publication |