WO2013106595A2 - Gestion de données en rapport avec une visite de magasin - Google Patents

Gestion de données en rapport avec une visite de magasin Download PDF

Info

Publication number
WO2013106595A2
WO2013106595A2 PCT/US2013/021063 US2013021063W WO2013106595A2 WO 2013106595 A2 WO2013106595 A2 WO 2013106595A2 US 2013021063 W US2013021063 W US 2013021063W WO 2013106595 A2 WO2013106595 A2 WO 2013106595A2
Authority
WO
WIPO (PCT)
Prior art keywords
store
user
data
new
visiting data
Prior art date
Application number
PCT/US2013/021063
Other languages
English (en)
Other versions
WO2013106595A3 (fr
Inventor
Panfeng YUAN
Cong MA
Xuliang SHI
Zhu ZHENJIE
Maosen Zhang
Original Assignee
Alibaba Group Holding Limited
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 Alibaba Group Holding Limited filed Critical Alibaba Group Holding Limited
Priority to JP2014552308A priority Critical patent/JP2015508543A/ja
Priority to EP13701318.1A priority patent/EP2802979A4/fr
Publication of WO2013106595A2 publication Critical patent/WO2013106595A2/fr
Publication of WO2013106595A3 publication Critical patent/WO2013106595A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2465—Query processing support for facilitating data mining operations in structured databases
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201—Market modelling; Market analysis; Collecting market data

Definitions

  • the present disclosure relates to the field of computer data processing technology and, more specifically, to a method and a system for processing store visiting data.
  • Online shopping has become a new shopping trend. More and more persons open online shops at online shopping websites and more and more user shop at the online stores. For example, users from different locations may visit an online store daily.
  • a shopping website may provide statistical data relating to the online store, such as a sale volume of a product, a user visiting volume, a number of users that frequently visit the online store, etc.
  • a seller that opens the online store may timely analyze and adjust types and volume of products and change service based on the data. For example, if a user repeatedly visits the online store during a period of time, the user is a repeated user of the online store. Thus, it may be determined that the user is interested in products of the online store.
  • the seller may analyze data of repeated users to adjust products types and services.
  • the conventional method for calculating repeated users is as follows.
  • a time period, such as 6 days, to classify a repeated user is determined.
  • Historical visiting data of all users who visit the online store during the time period such as user identifications (IDs) and online store ID, is obtained.
  • IDs user identifications
  • online store ID online store ID
  • a user ID and a visited online store ID in the new visiting data are obtained and compared with the user IDs and the online store IDs in the historical visiting data. If both the user ID and the online shop ID are matched, the user is determined as a repeated user of the online store. Otherwise, the user is not determined as a repeated user of the online store.
  • each new user visiting data needs to be compared with the historical visiting data.
  • data may be disordered at a data source for each matching.
  • the comparison or matching may consume a lot of time and workload, thereby occupying excessive system resources and increasing system burdens.
  • the conventional method may affect the accuracy of matching, thereby causing inaccurate determination results.
  • the present disclosure provides a method and a system for processing store visiting data.
  • the present techniques may improve the accuracy of data processing and reduce requirement of system sources.
  • the present disclosure provides a method for processing store visiting data.
  • New visiting data is obtained.
  • a user ID, a store ID, and a visiting time are analyzed from the new visiting data.
  • the static historical visiting data is stored or saved by using a static data structure.
  • the dynamic historical visiting data is stored or saved by using a dynamic data structure.
  • the determination of whether the user ID and the store ID match one of the user IDs and store IDs in the static historical visiting data may include the following operations.
  • the store ID in the new visiting data is matched with the store IDs in the static historical visiting data. If there is a match, the user ID in the new visiting data is matched with the user IDs in the static historical visiting data. Otherwise, it is determined that there is no match.
  • the determination whether the user ID and the store ID match one of user IDs and store IDs in the dynamic historical visiting data may include the following operations.
  • the store ID in the new visiting data is matched with the store IDs in the dynamic historical visiting data. If there is a match, the user ID in the new visiting data is matched with the user IDs in the dynamic historical visiting data. Otherwise, it is determined that there is no match.
  • the static historical data may include one or more static data structures such as ordered arrays that store information of stores and one or more ordered arrays that store user information of an individual store.
  • the determination of whether the user ID and the store ID match one of user the IDs and store IDs in the static historical visiting data may include the following operations.
  • the store ID in the new visiting data is matched with data in the ordered arrays that store information of stores. If there is a match, the user ID in the new visiting data is matched with data in the ordered arrays that store user information of the matched store. Otherwise, it is determined that there is no match.
  • the dynamic historical data may include one or more dynamic data structures such as red-black trees that store information of stores and one or more red-black trees that store user information of an individual store.
  • the determination of whether the user ID and the store ID match one of the user IDs and store IDs in the dynamic historical visiting data may include the following operations.
  • the store ID in the new visiting data is matched with data in the red-black trees that store information of stores. If there is a match, the user ID in the new visiting data is matched with data in the red-black trees that store user information of the matched store. Otherwise, it is determined that there is no match. For example, after it is determined that the user corresponding to the new visiting data is the repeated user of the store, the following operations may be performed. If the user corresponding to the new visiting user is the repeated user of the store, a visiting time corresponding to the new visiting data is used to replace a previous time that the user visits the store. Otherwise, the new visiting record is added into the dynamic historical visiting data.
  • the new visiting record may include store information corresponding to the store ID, user information corresponding to the user ID, and the visiting time.
  • the present techniques may further include the following operations.
  • a merger processing is conducted to the dynamic historical visiting data and the static historical visiting data. For instance, some or all of the dynamic historical visiting data are stored by using the static data structure to be converted into static historical visiting data and merged with the previous static historical visiting data.
  • the merger processing may be conducted at a preset time point and/or when a storage volume of the dynamic historical vising data reaches a threshold volume.
  • the static historical data may include one or more ordered arrays that store information of stores and one or more ordered arrays that store user information of the single store.
  • the dynamic historical data may include one or more red-black trees that store information of stores and one or more red-black trees that store user information of the single store.
  • the merger processing may include the following operations.
  • a store is selected from the ordered arrays and the red-black trees that store the store information.
  • a size of the ordered array that stores user information of the store is enlarged. For instance, such size is enlarged to a sum of previous cookies in the order array and cookies in the red-black tree that stores the user information of the store.
  • the cookies may store information of users that have visited the store.
  • Some or all of the cookies in the red-black tree that stores the user information of the corresponding store is written into the enlarged portion of the ordered array that stores the user information of the corresponding store in order.
  • the previous cookies and the newly written cookies in the ordered array that stores the user information of the corresponding store are ranked according to a hash value of the cookies to form a new ordered array.
  • the present disclosure also provides a system for processing store visiting data.
  • the system may include an analysis module, a static data determination module, and a dynamic data determination module.
  • the analysis module obtains new visiting data and analyzes a user ID, a store ID, and a visiting time from the new visiting data.
  • the static data determination module determines whether the user ID and the store ID match one of the user IDs and store IDs in static historical visiting data. If there is a match, it is determined that a user corresponding to the new visiting data is a repeated user of the store.
  • the static historical visiting data is stored by using a static data structure.
  • the dynamic data determination module determines whether the user ID and the store
  • the dynamic historical visiting data is stored by using a dynamic data structure.
  • the static data determination module may include an ordered array matching unit that matches the user ID and the store ID with one of the user IDs and store
  • the dynamic data determination module may include a red-black matching unit that matches the user ID and the store ID with one of the user IDs and store
  • the system may also include a processing module. After it is determined that the user corresponding to the new visiting data is the repeated user of the store, the processing module uses a visiting time corresponding to the new visiting data to replace a previous time that the user visits the store. Otherwise, the new visiting record is added into the dynamic historical visiting data.
  • the new visiting record includes store information corresponding to the store ID, user information corresponding to the user ID, and the visiting time.
  • the system may also include a merger module.
  • the merger module uses the static data structure to store some or all of the dynamic historical visiting data to convert them into static historical visiting data and merge them with the previous static historical visiting data.
  • the method and system for processing store vising data divide the historical visiting data into different data structures for storage.
  • the earlier historical visiting data is stored by using the static data structure while the more updated historical visiting data is stored by using the dynamic data structure.
  • the static data structure data is relatively stable data to implement quick searching and reduce requirement of system resources.
  • the dynamic historical visiting data stores real-time changing data to implement quick data storage and updates. The combination of both may increase the efficiency to process the visiting data, reduce the requirement of system resources, improve the precision of the data processing, and ensure the accuracy of the data processing.
  • the historical visiting data may be merged to process at a preset time point or when the storage volume of the dynamic data structure reaches a threshold.
  • the dynamic historical visiting data may be changed to be stored by using static data structures.
  • the data source is optimized and the occupation of storage space by the dynamic data structures is reduced.
  • the historical visiting data is updated in real time, thereby improving the efficiency of processing store visiting data and reducing the consumption of system resources.
  • the static historical visiting data may be stored by the ordered arrays and the dynamic historical visiting data may be stored by the red-black tree.
  • the store information is divided into the ordered arrays and the red-black trees while the user information corresponding to an individual store is also divided into the ordered arrays and the red-black trees.
  • searching is performed, a step-by-step determination may be implemented. The store is matched first and the user is then matched, thereby improving the search efficiency and implementing the quick processing of data.
  • FIG. 1 illustrates a diagram of an example system for processing store visiting data in accordance with the present disclosure.
  • FIG. 2 illustrates flowchart of an example method for processing store visiting data in accordance with a first example embodiment of the present disclosure.
  • FIG. 3 illustrates flowchart of an example method for processing store visiting data in accordance with a second example embodiment of the present disclosure.
  • FIG. 4 illustrates a diagram of an example system for processing store visiting data in accordance with the first example embodiment of the present disclosure.
  • FIG. 1 illustrates a diagram of an example system for processing store visiting data in accordance with the present disclosure.
  • a system 102 for processing store visiting data may be located at a web server 104 or a separate server.
  • the web server 104 records visiting data 110.
  • the system 102 for processing store visiting data obtains the visiting data 110 through real-time information interaction and information such as a user ID, a store ID, and a visiting time from the visiting data 110, and conducts a matching search in historical visiting data.
  • the following is a detailed description of the method and system for processing store visiting data in accordance with the present disclosure.
  • FIG. 2 illustrates flowchart of an example method for processing store visiting data in accordance with a first example embodiment of the present disclosure.
  • new visiting data is obtained.
  • a user ID, a store ID, and a visiting time are analyzed from the new visiting data.
  • the web server When a user visits a shopping website through a client terminal of a web browser, the web server records a visiting request from the client terminal and records and stores the visiting data, such as a cookie ID of the user, a store ID, a requested uniform recourse locator (URL), a visiting time, a version of the client terminal, etc.
  • the system for processing store visiting data may read the visiting data from the web server.
  • the system for processing store visiting data may monitor the visiting status of the web server in real time.
  • the system for processing store visiting data reads the new visiting data and analyzes the user ID, the store ID, and the visiting time from the new visiting data.
  • webpage codes are generally embedded in a log collection script such as in a form of JavaScript.
  • the web server conducts session tracking to identify the user such that a cookie is generated for the user and sent to the client terminal of web browser.
  • the web browser will save a key/value of the cookie, which is generally encrypted, into a text file under a local folder of a computer of the user.
  • the cookie is sent to the web server.
  • the log collection script collects relevant log data when the client terminal visits the website according to a preset format, such as the cookie ID of the user, a nickname of the user, the visited store ID, the visiting time, a visited webpage, etc.
  • a preset format such as the cookie ID of the user, a nickname of the user, the visited store ID, the visiting time, a visited webpage, etc.
  • Such collected log data is sent to the webpage server through a HTTP request.
  • the system for processing store visiting data reads the visiting data from the web server, and analyzes the visiting data according to a data storage format to obtain the user ID, the store ID, and the visiting time.
  • the user ID and the store ID are unique identifications to identify the user and the store, and may be represented by specific items based on needs. For instance, the user cookie ID may be regarded as the user identification and the store ID may be regarded as the store identification.
  • the user ID and the store ID match one of the user IDs and one of the store IDs in static historical visiting data. If there is a match, it is determined that the user corresponding to the new visiting data is a repeated user of the store. Otherwise, next operations are performed.
  • the static historical visiting data is stored by using a static data structure.
  • the historical visiting data may be preloaded into system memory and loaded according to a preset rule. For example, if a condition for determining the repeated user is to compare data during a recent 7 days, only data of the recent 7 days is loaded.
  • initialized operations may be conducted to the historical visiting data. For instance, historical visiting data not within the preset time period may be deleted to ensure accuracy of determination result.
  • the historical visiting data may have two components. One component is stored by the static data structure, i.e., the static historical visiting data. The other component is stored by the dynamic data structure, i.e., the dynamic historical visiting data. For example, if 7 days are used as a time period, data within the previous 7 days including a current day is historical visiting data.
  • the historical visiting data in the previous 6 days may be stored by using the static data structure.
  • the historical visiting data of the current day i.e., the visiting data prior to the new visiting data of the current day
  • the historical visiting data in the previous 5 days may be stored by using the static data structure.
  • the historical visiting data of the current day and an immediately preceding day may be stored by using the static data structure.
  • Different examples may use different time combinations.
  • the present disclosure does not impose restrictions herein.
  • the data stored in the static data structure, such as the order array has relatively high indexing efficiency and saves storage space.
  • the data stored in the dynamic data structure such as the red-black tree, is easy to quick store and fast search. Thus, to implement fast determination and consume little storage space while ensuring fast store and search of new data, a majority of data and earlier data may be stored by using the static data structure when possible. A minority of data and updated data may be stored by using the dynamic data structure.
  • the user ID and the store ID analyzed from the new visiting data may be matched to the user IDs and the store IDs in each record of the static historical visiting data one pair by one pair.
  • the store ID analyzed from the new visiting data is firstly matched with the store IDs in the static historical visiting data. If there is a match, the user ID in the new visiting data is then matched with the user IDs corresponding to the store ID in the static historical visiting data. If there is no match, there is no need to match the user ID analyzed from the new visiting data with the static historical visiting data. Operations at 206 may be directly performed.
  • the user ID analyzed from the new visiting data may be matched first and then the store IDs corresponding to the user ID in the historical visiting data is searched to find whether there is a matched store ID that is the same as the store ID analyzed from the new visiting data.
  • the store ID may be matched first and the user ID is then matched. This method separates the match of store ID with the match of user ID. As only one of two is matched and then the other is matched, there is no need to conduct one-by- one comparison. Thus, the match scope, the time of search queries, and the workload for searching are reduced, and the search efficiency is improved.
  • the user ID and the store ID match one of user the IDs and one of the store IDs in the dynamic historical visiting data. If there is a match, the user ID in the new visiting data is determined as the repeater user of the store.
  • the dynamic historical visiting data is stored by using the dynamic data structure.
  • the matching is continued in the dynamic historical visiting data.
  • the matching may be the same as the matching in the static historical visiting data. That is, the matching may be conducted one by one. Alternatively, one of the store ID and the user ID is selected for matching first and the other one is then matched.
  • the present disclosure does not impose restriction herein.
  • data record may be conducted according to the determination result.
  • the data record may include the following operations.
  • a current visiting time analyzed from the new visiting data is used to replace a previous time that the user visits the store. If the user analyzed from the new visiting data is not the repeated user, a current visiting record is added into the dynamic historical visiting data.
  • the current visiting record includes store information corresponding to the store ID, user information corresponding to the user ID, and the current visiting time.
  • FIG. 3 illustrates a flowchart of an example method for adding a data record in real time in accordance with a second example embodiment of the present disclosure.
  • store information corresponding to the store is added into the dynamic historical visiting data and operations at 308 are then performed.
  • user information corresponding to the user ID is added into user information corresponding to the store in the dynamic historical visiting data and the user is set as a new user of the store.
  • the corresponding visiting time in the historical visiting data is replaced by the visiting time corresponding to the new visiting data and the user is set as the repeated user of the store.
  • the visiting time in the static historical visiting data is amended. If the new visiting data is matched in the dynamic historical visiting data, the visiting time in the dynamic historical visiting data is amended.
  • the operations may directly jump to 310.
  • the storage rules of the historical visiting data if the store ID does not exist in the static historical visiting data, it can be understood that the store corresponding to the store ID has no user visiting record during the time period corresponding to the static historical visiting data and thus no corresponding user ID exists.
  • the dynamic historical visiting data may be changed to be stored by the static data structure according to the preset rules, real-time data change may occur during the determination process.
  • the store ID may be searched in the dynamic historical visiting data. In the later determination, however, the dynamic historical visiting data is switched to the static historical visiting data.
  • 3 may be used in some examples. That is, if the store ID analyzed from the new visiting data does not exist in the static historical visiting data and exists in the dynamic historical visiting data, it is firstly determined in the static historical visiting data whether the user ID analyzed from the new visiting data exists in the user records of the store corresponding to the store ID analyzed from the new visiting data.
  • the example methods for processing store visiting data may further include a merger processing to the dynamic historical visiting data and the static historical visiting data.
  • the merger processing may be conducted at a preset time point and/or when a storage volume of the dynamic historical vising data reaches a threshold volume.
  • the dynamic historical visiting data of the store is converted by using the static data structure for storage to obtain the newly converted static historical visiting data.
  • the newly converted static historical visiting data is merged with the previous static historical visiting data to form new static historical visiting data of the store.
  • the detailed converting process may be determined by the data structures of the static historical visiting data and the dynamic historical visiting data.
  • 7 days may be set as a time period. That is, only the historical visiting data within the 7 days is considered.
  • the preset rules may be as follows.
  • the historical visiting data of the first 6 days is stored by using the static data structure and the historical visiting data of the 7 th day is stored by using the dynamic data structure.
  • the 7 th day ends and the 8 th day starts, such as using 00:00:00 at the 8 th day as the time point according to the preset rules, the historical visiting data between the 2 nd day and the 7 th day should be stored by using the static data structure.
  • the dynamic historical visiting data at the 7 th day is stored by using the static data structure and is then merged with the static historical visiting data between the 2 nd day and the 6 th day.
  • the historical visiting data at the 1 st day relative to the 8 th day is beyond the preset 7 day period and the historical visiting data at the 1 st day may be omitted, such as released or deleted.
  • a threshold of dynamic historical visiting data may be preset.
  • the preset rule is that the visiting data at the 7 th day is stored by using the dynamic data structure.
  • some or all of the generated dynamic historical visiting data at the 7 th day may be merged with the static historical visiting data of the prior 6 days. That is, the dynamic historical visiting data is stored by using the static data structure to ensure the following visiting data may be stored by using the dynamic data structure.
  • all historical visiting data of the shopping website is divided into the static historical visiting data (for the prior 6 days) and the dynamic historical visiting data (for the current day) and is stored by using the ordered array and red-black tree data structure.
  • All store information is divided into an ordered array called units and a red-black tree called new units.
  • the user information of each store is grouped into an ordered array called cookies or a red-black tree called new cookies. That is, the ordered array units stores the store information visited in the prior 6 days and the red-black tree new units stores the store information visited in the current day.
  • the ordered array cookies corresponding to each store stores the user information of the users that visited the store in the prior 6 days.
  • the red- black tree new units store the user information of the user that visited the store at the current day.
  • the store information may include the store represented by the shop id, a list of cookies, and a newly added list of cookies that is waiting for merger, a last merger time, etc.
  • the user information may include a hash value of the user cookie, a visiting time, a status mark for a repeated user (such as whether the user is a new user of the current day and a number of visiting days), etc.
  • the process to determine whether a user that sends a new visiting request is a repeated user of the store may be as follows.
  • a user ID such as the hash value of the cookie
  • a current visiting time such as the current visiting time
  • a store ID such as the shop id
  • the store ID is matched with data in the red-black tree new units. If there is a match, the fourth step is performed. Otherwise, a third step is performed.
  • store information corresponding to the store ID is added as a new item into the red-black tree new units and a fourth step is then performed.
  • the user ID is matched with data in the ordered array cookies. If there is a match, a seventh step is performed. Otherwise, a fifth step is performed.
  • the user ID is matched with data in the red-black tree new cookies. If there is a match, the seventh step is performed. Otherwise, a sixth step is performed.
  • user information corresponding to the user ID is added as a new item into the red-black tree new cookies corresponding to the store, and the user is added as a new user of the store.
  • a visiting time in the user information is changed to the current visiting time and the user is added as a repeated user of the store.
  • the matching in the ordered array may use dichotomy for processing and the matching in the red-black tree may use traversal of tree for processing.
  • the dynamic historical visiting data and the static historical visiting data may be merged.
  • stores are selected one by one from the order array units and the red- black tree new units that save store information and the data structure represented by shop node of the current store is obtained.
  • a size of the ordered array cookies is enlarged (i.e., shop node -> cookies is expanded) to include a sum of already included number of cookies and newly added cookies.
  • the previous and current ordered groups of cookies in the shop_node->cookies are ranked based on respective harsh values of the cookies and then merged to form a new ordered array.
  • the red-black tree storage units that are added into shop_node->cookies are released from the shop_node->new_cookies.
  • the shop_node->length is set as equal to previous shop_node->length + shop node- >new cookies length.
  • the shop_node->new_cookies_length is initially set as 0.
  • the threshold of dynamic data storage volume may be preset.
  • the data therein is merged into the ordered array units or the ordered array cookies respectively. The detailed merging process is described above.
  • the visiting data of each store is divided into the ordered array and the red-black tree.
  • the visiting data of all stores in the shopping website is also divided into the ordered array and the red-black tree structure.
  • the matching may be implemented in multiple steps such that the store is firstly matched and the user is then matched to improve searching efficiency and to implement quick processing of data.
  • the data are merged at the time point or the storage volume reaches the threshold such that the dynamical historical visiting data is changed to be stored in the static data structure to implement real-time updating of the historical visiting data and to ensure that the new visiting data may be stored by the dynamic data structure.
  • FIG. 4 illustrates a diagram of an example system for processing store visiting data in accordance with the first example embodiment of the present disclosure.
  • the system may include software, hardware, or a combination thereof.
  • the system 400 in FIG. 4 may include one or more processor(s) 402 and memory 404.
  • the memory 404 is an example of computer storage media.
  • Computer storage media includes volatile and non-volatile, removable and nonremovable media implemented in any method or technology for storage of information such as computer-executable instructions, data structures, program modules, or other data.
  • Examples of computer storage media includes, but is not limited to, phase change memory (PRAM), static random-access memory (SRAM), dynamic random-access memory (DRAM), other types of random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information for access by a computing device.
  • computer storage media does not include transitory media such as modulated data signals and carrier waves.
  • the memory 404 may store therein program units or modules and program data.
  • the memory 404 may store therein an analysis module 406, a static data determination module 408, and a dynamic data determination module 410.
  • the analysis module 406 obtains new visiting data and analyzes a user ID, a store ID, and a visiting time from the new visiting data.
  • the static data determination module 408 determines whether the user ID and the store ID match one of the user IDs and store IDs in static historical visiting data. If there is a match, it is determined that a user corresponding to the new visiting data is a repeated user of the store. Otherwise, further operations are performed.
  • the static historical visiting data is stored by using a static data structure.
  • the static data structure may include one or more ordered arrays.
  • the static data determination module 408 may include an ordered array matching unit that matches the store ID and the user ID analyzed by the analysis module 406 with store IDs and user IDs in the one or more order arrays. The matching in the ordered array may use a dichotomy method.
  • the dynamic data determination module 410 determines whether the user ID and the store ID match one of the user IDs and store IDs in dynamic historical visiting data. If there is a match, it is determined that a user corresponding to the new visiting data is a repeated user of the store.
  • the dynamic historical visiting data is stored by using a dynamic data structure.
  • the dynamic data structure may include one or more red-black trees.
  • the dynamic data determination module 410 may include a red-black matching unit that matches the store ID and the user ID analyzed by the analysis module 406 with store IDs and user IDs in the one or more red-black trees. The matching in the red-black tree may use traversal of tree to process.
  • the system may also include a processing module. After it is determined that the user corresponding to the new visiting data is the repeated user of the store, the processing module uses the visiting time corresponding to the new visiting data to replace a previous time that the user visits the store. Otherwise, the new visiting record is added into the dynamic historical visiting data.
  • the new visiting record includes store information corresponding to the store ID, user information corresponding to the user ID, and the visiting time.
  • the system may also include a merger module.
  • the merger module merges some or all of the static historical visiting data and the dynamic historical visiting data.
  • the merger module may use the static data structure to store some or all of the dynamic historical visiting data to convert them into static historical visiting data and merge them with the previous static historical visiting data.
  • the merger module may also include a trigger unit that triggers the merge module to conduct merger processing.
  • the trigger unit may set one or more triggering conditions in advance, such as the time point, the threshold of storage volume, etc. When it is detected that the triggering condition meets, such as the preset time point arrives or the threshold of storage volume reaches, the merger module is triggered to conduct the merger processing.
  • the present techniques may be described in a context of computer-executable instructions performed by computers, such as program modules.
  • the program modules include instances, programs, objects, components, and data structures that implement specific tasks or realized specific abstract data types.
  • the present techniques may also be implemented in a distribution computing environment.
  • remote devices connected by communication networks are used to implement tasks.
  • the program modules may be stored on local and remote computer storage media including storage devices.
  • the above system is described in different modules according to the functionalities.
  • the present techniques may implement the functionalities of multiple modules in one or more hardware, software, or in combination of both
  • the various exemplary embodiments are progressively described in the present disclosure. Same or similar portions of the example embodiments can be mutually referenced. Each example embodiment has a different focus than other example embodiments.
  • the example system embodiment has been described in a relatively simple manner because of its fundamental correspondence with the example methods. Details thereof can be referred to related portions of the exemplary methods. From the descriptions of the example embodiments, one of ordinary skill in the art may understand that the present techniques may be implemented through software and necessary general platforms. The present techniques may be embodied in the form of software products.
  • the present disclosure can be in a form of one or more computer programs containing the computer-executable or processor-executable instructions that can be implemented in the computer storage medium (including but not limited to disks, CD-ROM, optical disks, etc.). These computer program instructions can also be loaded in a computer or other programmable data processors, so that the computer or other programmable data processors can perform the methods described in the example embodiments.
  • each flow and/or block and the combination of the flow and/or block of the flowchart and/or block diagram can be implemented by computer program instructions.
  • These computer program instructions can be provided to the general computers, specific computers, embedded processor or other programmable data processors to generate a machine, so that a device of implementing one or more flows of the flow chart and/or one or more blocks of the block diagram can be generated through the instructions operated by a computer or other programmable data processors.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Physics & Mathematics (AREA)
  • Game Theory and Decision Science (AREA)
  • Databases & Information Systems (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Data Mining & Analysis (AREA)
  • General Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Fuzzy Systems (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Software Systems (AREA)
  • Computational Linguistics (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

La présente invention se rapporte à un procédé et à un système adaptés pour gérer des données en rapport avec une visite de magasin. De nouvelles données en rapport avec une visite de magasin sont obtenues. Un ID d'utilisateur, un ID de magasin et une heure de visite du magasin sont analysés à partir des nouvelles données en rapport avec une visite de magasin. Il est déterminé si l'ID d'utilisateur et l'ID de magasin correspondent ou non à l'un des ID d'utilisateur et des ID de magasin qui sont contenus dans un historique statique de données en rapport avec une visite de magasin. Si une correspondance peut être trouvée, il est déterminé qu'un utilisateur correspondant aux nouvelles données en rapport avec une visite de magasin est un utilisateur qui visite régulièrement le magasin. Autrement, il est déterminé si l'ID d'utilisateur et l'ID de magasin correspondent ou non à l'un des ID d'utilisateur et des ID de magasin qui sont contenus dans un historique dynamique de données en rapport avec une visite de magasin. Si une correspondance peut être trouvée, il est également déterminé qu'un utilisateur correspondant aux nouvelles données en rapport avec une visite de magasin est un utilisateur qui visite régulièrement le magasin.
PCT/US2013/021063 2012-01-13 2013-01-10 Gestion de données en rapport avec une visite de magasin WO2013106595A2 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2014552308A JP2015508543A (ja) 2012-01-13 2013-01-10 店舗訪問データを処理すること
EP13701318.1A EP2802979A4 (fr) 2012-01-13 2013-01-10 Gestion de données en rapport avec une visite de magasin

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210065476.4A CN103207882B (zh) 2012-01-13 2012-01-13 店铺访问数据处理方法及系统
CN201210065476.4 2012-01-13

Publications (2)

Publication Number Publication Date
WO2013106595A2 true WO2013106595A2 (fr) 2013-07-18
WO2013106595A3 WO2013106595A3 (fr) 2014-01-16

Family

ID=47604222

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2013/021063 WO2013106595A2 (fr) 2012-01-13 2013-01-10 Gestion de données en rapport avec une visite de magasin

Country Status (6)

Country Link
US (1) US20130185429A1 (fr)
EP (1) EP2802979A4 (fr)
JP (1) JP2015508543A (fr)
CN (1) CN103207882B (fr)
TW (1) TW201329890A (fr)
WO (1) WO2013106595A2 (fr)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160350807A1 (en) * 2014-01-17 2016-12-01 Sk Planet Co., Ltd. Off-line store advertising service system and method therefor, and apparatus applied thereto
CN104504077B (zh) * 2014-12-22 2018-04-03 北京国双科技有限公司 网页访问数据的统计方法和装置
US10592913B2 (en) * 2015-12-14 2020-03-17 Google Llc Store visit data creation and management
US10872353B2 (en) 2015-12-14 2020-12-22 Google Llc Providing content to store visitors without requiring proactive information sharing
CN106897281B (zh) 2015-12-17 2020-08-14 阿里巴巴集团控股有限公司 一种日志分片方法和装置
CN105701694A (zh) * 2015-12-31 2016-06-22 广州东海网络科技有限公司 创建电子商店的方法及创建电子商店的系统
CN111782941B (zh) * 2016-05-11 2023-12-12 创新先进技术有限公司 信息推荐方法、装置及服务器
CN108153777B (zh) * 2016-12-05 2022-02-22 北京国双科技有限公司 数据访问信息的获取方法及装置
CN108427687A (zh) * 2017-02-15 2018-08-21 北京国双科技有限公司 一种用户数处理方法及装置
CN107562930B (zh) * 2017-09-15 2020-06-19 广州快信信息科技有限公司 操作行为数据的处理方法及装置
JP6616860B2 (ja) * 2018-04-06 2019-12-04 ソフトバンク株式会社 情報生成装置、プログラム及び情報生成方法
CN111367897B (zh) * 2019-06-03 2023-09-08 杭州海康威视系统技术有限公司 一种数据处理方法、装置、设备及存储介质
CN112149391B (zh) * 2020-09-28 2023-06-09 平安证券股份有限公司 信息处理方法、信息处理装置、终端设备及存储介质

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04253266A (ja) * 1991-01-29 1992-09-09 Tokyo Electric Co Ltd 取引処理装置
WO2002039215A2 (fr) * 2000-11-09 2002-05-16 Visitalk.Com, Inc. Systeme et procede d'acces aux donnees dynamiques repartis
JP3724721B2 (ja) * 2001-06-22 2005-12-07 レモンクーポン株式会社 販売促進方法、販売促進システム及びコンピュータプログラム
US7136883B2 (en) * 2001-09-08 2006-11-14 Siemens Medial Solutions Health Services Corporation System for managing object storage and retrieval in partitioned storage media
US20030126560A1 (en) * 2001-12-28 2003-07-03 Koninklijke Philips Electronics N.V. Adaptive bookmarking of often-visited web sites
JP2004118621A (ja) * 2002-09-27 2004-04-15 Hitachi Information Systems Ltd 顧客管理システム
JP4439879B2 (ja) * 2003-11-13 2010-03-24 日本電信電話株式会社 データ処理装置および履歴検証方法
CA2499305A1 (fr) * 2005-03-04 2006-09-04 668158 B.C. Ltd. Methode et appareil pour fournir de l'information et de la publicite destinee a une region geographique
US7606897B2 (en) * 2007-04-05 2009-10-20 Yahoo! Inc. Accelerated and reproducible domain visitor targeting
US7953727B2 (en) * 2008-04-04 2011-05-31 International Business Machines Corporation Handling requests for data stored in database tables
US8347204B2 (en) * 2008-05-05 2013-01-01 Norm Rosner Method and system for data analysis
GR1006698B (el) * 2008-12-22 2010-02-05 Μεθοδολογια και συστημα για συλλογη, επεξεργασια και διανομη δεδομενων οδικης κινησης για βελτιωμενη δρομολογηση σε συστηματα δορυφορικης πλοηγησης οχηματων
US8504792B2 (en) * 2009-12-22 2013-08-06 Apple Inc. Methods and apparatuses to allocate file storage via tree representations of a bitmap
US20110225288A1 (en) * 2010-03-12 2011-09-15 Webtrends Inc. Method and system for efficient storage and retrieval of analytics data
CN103001993A (zh) * 2011-09-19 2013-03-27 中兴通讯股份有限公司 服务器、网络数据提供方法及装置
CN104468672A (zh) * 2013-09-17 2015-03-25 北京千橡网景科技发展有限公司 用于对匿名用户进行推荐的方法和设备

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
None
See also references of EP2802979A4

Also Published As

Publication number Publication date
TW201329890A (zh) 2013-07-16
CN103207882B (zh) 2016-12-07
EP2802979A4 (fr) 2016-05-18
EP2802979A2 (fr) 2014-11-19
US20130185429A1 (en) 2013-07-18
WO2013106595A3 (fr) 2014-01-16
JP2015508543A (ja) 2015-03-19
CN103207882A (zh) 2013-07-17

Similar Documents

Publication Publication Date Title
US20130185429A1 (en) Processing Store Visiting Data
US10546006B2 (en) Method and system for hybrid information query
US10839038B2 (en) Generating configuration information for obtaining web resources
KR101463974B1 (ko) 마케팅을 위한 빅데이터 분석 시스템 및 방법
US9448999B2 (en) Method and device to detect similar documents
US10289700B2 (en) Method for dynamically matching images with content items based on keywords in response to search queries
US9600470B2 (en) Method and system relating to re-labelling multi-document clusters
CN110362544B (zh) 日志处理系统、日志处理方法、终端及存储介质
CN106021583B (zh) 页面流量数据的统计方法及其系统
CN106951557B (zh) 日志关联方法、装置和应用其的计算机系统
US20170300564A1 (en) Clustering for social media data
CN103617266A (zh) 个性化扩展搜索方法及装置、系统
US10275472B2 (en) Method for categorizing images to be associated with content items based on keywords of search queries
US10235387B2 (en) Method for selecting images for matching with content based on metadata of images and content in real-time in response to search queries
US8639559B2 (en) Brand analysis using interactions with search result items
WO2015074477A1 (fr) Procédé et appareil d'analyse de chemin
CN103729479A (zh) 基于分布式文件存储的网站页面内容统计的方法和系统
CN111368227A (zh) 一种url处理方法以及装置
Gaurav et al. An outline on big data and big data analytics
Sethi An optimized crawling technique for maintaining fresh repositories
Antunes et al. Semantic-based publish/subscribe for M2M
CN104750752A (zh) 一种上网偏好用户群体的确定方法和设备
CN110020101B (zh) 实时搜索场景的还原方法、装置和系统
Maheswari et al. Algorithm for Tracing Visitors' On-Line Behaviors for Effective Web Usage Mining
CN112395510A (zh) 基于活跃度确定目标用户的方法和装置

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref document number: 2014552308

Country of ref document: JP

Kind code of ref document: A

REEP Request for entry into the european phase

Ref document number: 2013701318

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2013701318

Country of ref document: EP

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13701318

Country of ref document: EP

Kind code of ref document: A2