Invitation code promotion level query system based on B tree and forest

Abstract

The invention discloses an invitation code promotion level query system based on a B tree and a forest. The method comprises the following specific steps: 1, constructing all natural users as root nodes of a tree B in a forest, 2, constructing child nodes of the tree B and completing tree construction, 3, storing the B tree and a forest data model, 4, monitoring changes of database users by a monitoring thread and dynamically updating the tree and the forest, 5, carrying out related query according to the constructed B tree and forest model, and 6, performing persistence of the tree B and theforest data model. Through the query system, the farm game users are ranked, so that the problem of low efficiency in a massive data environment in hierarchical query is effectively solved, meanwhile,a model based on a B tree and a forest is provided, and tree nodes are self-defined, so that the system not only meets the requirement of improving the efficiency of common hierarchical query, but also can realize more conditional queries.

Description

technical field [0001] The invention relates to the technical field related to game user ranking, in particular to a B-tree and forest-based invitation code promotion level query system. Background technique [0002] In recent years, with the continuous development of smart phones and mobile Internet, the Internet industry has various promotion models, and the invitation code promotion model based on the reward mechanism is currently widely used. Each natural user shares the invitation code, and successfully invites a user to register to get rewards. The more people you invite, the more rewards, but the follow-up is that the timeliness of reward calculation is not high enough. The current hierarchical query system is based on the relational database to store user invitation records for query, but it cannot accurately and efficiently query intergenerational invitations. For example, A invites B, and B invites C. In this case, both B and C Belonging to the users invited by A,...

AI Technical Summary

Problems solved by technology

However, the underlying data structure used by the above two methods is a binary sorting tree. This data structure has certain advantages in query because of its sorting characteristics, but it is not suitable for the hierarchical query of invitation code promotion. The reasons are: first, Invitation code promotion Since there is a strong relationship between the inviter and the invitee, specific fields cannot be used for sorting

Secondly, the binary tree has at most two child nodes, but the number of users that the inviter can invite is not online. If a binary tree is used, it cannot show this feature of invitation code promotion

Images