Social activity organization-faced time aggregation query method

Abstract

A social activity organization-faced time aggregation query method comprises the following steps: (1) establishing an index structure SB*-Tree; (2) particularly operating the SB*-Tree; and (3) carrying out querying, which specifically comprises acquisition of a participation time interval, acquirement of a candidate scheme and selection of an optimal scheme. In order to more effectively solve a problem of difficulty in determination of party time, the method provided by the present invention expands the structure of a current SB-Tree on the basis of the current SB-Tree, proposes a new index structure and a query technology and can effectively solve the three problems. The method finally implements a function that optimal holding time can be provided for a party activity according to intention time committed by participants, so that the most number of people can be guaranteed to participant in the activities. Calculation on the number of people adopts a count aggregate function.

Description

technical field [0001] The invention belongs to the field of Temporal Database, and mainly solves the problem of "difficulty organizing gatherings" existing in current life, and proposes a novel, efficient index structure and related query methods that can satisfy temporal aggregation queries. By using this index structure and method, the optimal activity organization time can be obtained according to the time arrangement of all the people participating in the activity, that is, the most people can participate in this time. technical background [0002] With the advent of the "Internet +" era, people's requirements for network platforms are not limited to creating and sharing information. More, people began to gradually center their lives around the Internet, and use some network application platforms to complete daily relatively tedious or even complicated tasks, such as mobile phone taxis, electronic payments, online shopping, etc. Under the background of "Internet +", th...

AI Technical Summary

Problems solved by technology

[0006] The present invention overcomes the shortcomings of the prior art that it is difficult to determine the party time and cannot effectively solve the problem scene of the activity organization, and provides a time aggregation query method for social activity organization

[0007] In order to more effectively solve the problem of "difficult to determine the meeting time", based on the existing SB-Tree, its structure is extended, and a new index structure and query technology is proposed, which can effectively solve the above three problems question

Images