Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for establishing massive ID mapping relation

A mapping relationship and massive technology, applied in the field of online advertising, can solve problems such as inability to use centrally, waste of machine resources, and restraint, and achieve the effects of realizing benefits, expanding storage capacity, and improving query performance

Active Publication Date: 2015-01-14
JINGZAN ADVERTISING SHANGHAI CO LTD
View PDF5 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Generally, NoSql technology can be used to provide key-value query services. However, as more and more ADX platforms and advertisers are connected, the amount of ID mapping relationships maintained by DSPs is gradually increasing. Conventional memory-based NoSql technology (memcached, redis, etc.) are limited by the memory capacity and have a large expansion rate for key-value pairs. A single machine cannot support the storage and query of up to 1B groups of ID mapping relationships
Multiple memory-based NoSql small clusters waste machine resources, cannot be used centrally, and have problems such as data consistency
Other NoSql technologies based on disk files (LevelDB, SSDB, etc.) cannot satisfy a large number of random query requests

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for establishing massive ID mapping relation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0026] Such as figure 1 As shown, a method for establishing a massive ID mapping relationship of the present invention comprises the following steps:

[0027] (1) Select the corresponding block according to the primary key identification code in the mapping relationship A;

[0028] (2) Determine whether the current block has the mapping relationship, if so, execute step (3), if not, execute step (5);

[0029] (3) Read the mapping relationship B stored before the primary key identification code;

[0030] (4) Determine whether the mapping relationship B includes the mapping relationship A, if so, perform step (5), if not, perform step (7);

[0031] (5) Update the full memory index;

[0032] (6) write the mapping data to disk; and

[0033] (7) The mapping relationship is inserted successfully.

[0034] The step (5) includes merging two sets of mapping relationships A and B. The step (5) includes updating the memory full index for a new set of mapping relationships or a comb...

specific Embodiment approach

[0036] The basic storage unit of the mapping relationship in the present invention

[0037] A set of mapping relations as an independent storage unit, including:

[0038] Correspond the DSP party ID in the above background knowledge to the primary key

[0039] The IDs of the ADX party and the advertiser’s first-party audience correspond to index keys, which are used to uniquely identify a user according to a certain algorithm. But there is no guarantee that there will be no conflicts when crossing platforms or advertisers, so it is also necessary to record the ID source, that is, the type of platform (or advertiser)

[0040] The index key contains at least one, so each set of ID mappings may be organized in the following form

[0041] primary key: {index key source 1: index key 1, index key source 2: index key 2...}

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for establishing a mass ID mapping relation. The method for establishing the mass ID mapping relation comprises the following steps: (1) selecting a corresponding block according to a main key identification code in a mapping relation A; (2) judging whether the current block has the mapping relation, executing the step (3) if the current block has the mapping relation, and executing the step (5) if the current block has no mapping relation; (3) reading a mapping relation B stored in ahead of the main key identification code; (4) judging whether the mapping relation B contains the mapping relation A, executing the step (5) if the mapping relation B contains the mapping relation A, and executing the step (7) if the mapping relation B does not contain the mapping relation A; (5) updating a whole memory index; (6) writing mapping data into a magnetic disk; and (7) inserting the successful mapping relation. By virtue of the method for establishing the mass ID mapping relation, a single computer can support at most 1B groups of mapping relations; the memory capability is expanded by a multistage composite index; the query performance is improved; the mapping relation can be recorded by the magnetic disk in a partitioning area; the mapping relation can be inquired by any ID by virtue of the whole memory index.

Description

technical field [0001] The invention relates to the field of network advertisements, in particular to a method for establishing massive ID mapping relationships. Background technique [0002] As we all know, Internet advertising is the most important profit model in the Internet industry, and traffic monetization has become a very important evaluation standard for Internet commercial products. With the development of Internet crowd-targeting technology, Internet advertising has also begun to get rid of a single, rigid transaction model and shift to a more accurate and efficient transaction model. Real Time Bidding (RTB) plays an important part in this process. [0003] In RTB bidding, the bid request generally contains a visitor ID provided by ADX (Ad Exchange platform). This ID can be understood as a cookie similar to USERID, but it is definitely not an internal ID of the Ad Exchange system. Generally, it will be used The non-reversible encryption algorithm makes a hash a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
CPCG06F16/951G06F16/955G06F16/9574
Inventor 汤奇峰罗青山史剑冬
Owner JINGZAN ADVERTISING SHANGHAI CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com