CN108460102A - Social network data querying method, device, computer equipment and storage medium - Google Patents
Social network data querying method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN108460102A CN108460102A CN201810111975.XA CN201810111975A CN108460102A CN 108460102 A CN108460102 A CN 108460102A CN 201810111975 A CN201810111975 A CN 201810111975A CN 108460102 A CN108460102 A CN 108460102A
- Authority
- CN
- China
- Prior art keywords
- node
- subtree
- leaf
- target
- period
- 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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
-
- 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application involves a kind of social network data querying method, device, computer equipment and storage mediums.The method includes：Inquiry instruction is received, and parses inquiry instruction, obtains the period to be checked；Then according to the period to be checked, target subtree is searched from dendrogram, dendrogram is stored with user history information data, dendrogram includes root node and subtree collection, root node is for indexing different time points, each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；The node in target subtree is traversed, when the node in target subtree is leaf node, the user history information data that leaf node stores in target subtree is obtained, can effectively improve inquiry velocity in this way.
Description
Technical field
This application involves field of computer technology, more particularly to a kind of social network data querying method, device, calculating
Machine equipment and storage medium.
Background technology
With the development of Internet technology, social networks also continues to develop and universal, user except through social networks into
Outside row social activity, by positioning function, location information can also be left and patronize the information such as the information of businessman.
With the continuous popularization of social networking application, a large amount of social data is accumulated, and can therefrom analysis mining be gone out
The Behavior law of user is according to the hobby of user and Behavior law for more precisely effectively being publicized to target user
It, which is provided, preferably recommends and services etc. have important value.And the side that traditional social data to magnanimity is inquired
Method, needs to be traversed for all records in social network database, and inquiry velocity is slow.
Invention content
Based on this, it is necessary in view of the above technical problems, provide a kind of social network data that can improve inquiry velocity
Querying method, device, computer equipment and storage medium.
A kind of social network data querying method, the method includes：
Inquiry instruction is received, and parses the inquiry instruction, obtains the period to be checked；
From being stored in the dendrogram of user history information data, according to the period to be checked, target subtree, institute are searched
It includes root node and subtree collection to state dendrogram, and for indexing different time points, each time point is respectively directed to pair the root node
It includes the subtree of each period to answer the subtree of period, the subtree collection；
The node in target subtree is traversed, when the node in the target subtree is leaf node, obtains the target
The user history information data that leaf node stores in subtree.
In one embodiment, the user history information data includes spatial positional information, time segment information and place
It is described according to the period to be checked in the frequency of set spatial position, after lookup obtains target subtree, including：
When the node in the target subtree is non-leaf nodes, obtains non-leaf nodes in the target subtree and correspond to
Minimum enclosed rectangle, time segment information and the frequency in set spatial position；
When the corresponding spatial position of the minimum enclosed rectangle is corresponding with set spatial position overlapping, the non-leaf nodes
Time segment information and preset time period be overlapped and the corresponding frequency in the set spatial position of the non-leaf nodes
When more than or equal to predeterminated frequency, the child node of the non-leaf nodes is obtained；
When the child node of the non-leaf nodes is leaf node, the user's history letter of the leaf node storage is obtained
Cease data.
In one embodiment, when the node when in the target subtree is non-leaf nodes, the target is obtained
After the corresponding minimum enclosed rectangle of non-leaf nodes in subtree, time segment information and frequency in set spatial position,
Including：
When the corresponding spatial position of the minimum enclosed rectangle is corresponding with set spatial position overlapping, the non-leaf nodes
Time segment information and preset time period be overlapped and the corresponding frequency in the set spatial position of the non-leaf nodes
When less than predeterminated frequency, the child node of the non-leaf nodes is filtered out.
In one embodiment, the user history information data includes spatial positional information, temporal information and is in
The frequency of set spatial position obtains when the node when in the target subtree is leaf node in the target subtree
The user history information data of leaf node storage, including：
It obtains the corresponding spatial positional information of leaf node in the target subtree, temporal information and is in pre-set space
The frequency of position；
When the node in the target subtree is leaf node, the corresponding spatial positional information of the leaf node belongs to pre-
If spatial position, the corresponding temporal information of the leaf node belong to the time in preset time period and the leaf node pair
When the frequency in the set spatial position answered is greater than or equal to predeterminated frequency, leaf node in the target subtree is obtained
The user history information data of storage.
In one embodiment, the user history information data includes spatial positional information, temporal information and key
Word information when the node when in the target subtree is leaf node, obtains leaf node in the target subtree and stores
User history information data, including：
Obtain the corresponding spatial positional information of leaf node, temporal information and key word information in the target subtree；
When the node in the target subtree is leaf node, the corresponding spatial positional information of the leaf node belongs to pre-
If spatial position, the corresponding temporal information of the leaf node belong to the time in preset time period and the leaf node pair
When the key word information answered belongs to predetermined keyword, the user history information number that leaf node stores in the target subtree is obtained
According to.
In one embodiment, the user history information data includes spatial positional information, time segment information and pass
Keyword information, it is described according to the period to be checked, after lookup obtains target subtree, including：
When the node in the target subtree is non-leaf nodes, obtains non-leaf nodes in the target subtree and correspond to
Minimum enclosed rectangle, time segment information and key word information；
When the corresponding spatial position of the minimum enclosed rectangle is corresponding with set spatial position overlapping, the non-leaf nodes
Time segment information and preset time period be overlapped and the corresponding key word information of the non-leaf nodes is Chong Die with predetermined keyword
When, obtain the child node of the non-leaf nodes；
When the child node of the non-leaf nodes is leaf node, the user's history letter of the leaf node storage is obtained
Cease data.
In one embodiment, the user history information data includes spatial positional information and time segment information, institute
It states according to the period to be checked, after lookup obtains target subtree, including：
When the node in the target subtree is non-leaf nodes, obtains non-leaf nodes in the target subtree and correspond to
Minimum enclosed rectangle and time segment information；
Not be overlapped with set spatial position when the corresponding spatial position of the minimum enclosed rectangle and described non-leaf nodes
When corresponding time segment information and not be overlapped preset time period, the child node of the non-leaf nodes is filtered out.
A kind of social network data inquiry unit, described device include：
Command analysis module for receiving inquiry instruction, and parses the inquiry instruction, obtains the period to be checked；
Target sub-tree search module, for from being stored in the dendrogram of user history information data, according to be checked
Period searches target subtree, and the dendrogram includes root node and subtree collection, and the root node is for indexing different time
Point, each time point are respectively directed to the subtree of corresponding period, and the subtree collection includes the subtree of each period；
Target user's acquisition module, for traversing the node in target subtree, when the node in the target subtree is leaf
When child node, the user history information data that leaf node stores in the target subtree is obtained.
A kind of computer equipment, including memory and processor, the memory are stored with computer program, the processing
Device realizes following steps when executing the computer program：
Inquiry instruction is received, and parses the inquiry instruction, obtains the period to be checked；
From being stored in the dendrogram of user history information data, according to the period to be checked, target subtree, institute are searched
It includes root node and subtree collection to state dendrogram, and for indexing different time points, each time point is respectively directed to pair the root node
It includes the subtree of each period to answer the subtree of period, the subtree collection；
The node in target subtree is traversed, when the node in the target subtree is leaf node, obtains the target
The user history information data that leaf node stores in subtree.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor
Following steps are realized when row：
Inquiry instruction is received, and parses the inquiry instruction, obtains the period to be checked；
From being stored in the dendrogram of user history information data, according to the period to be checked, target subtree, institute are searched
It includes root node and subtree collection to state dendrogram, and for indexing different time points, each time point is respectively directed to pair the root node
It includes the subtree of each period to answer the subtree of period, the subtree collection；
The node in target subtree is traversed, when the node in the target subtree is leaf node, obtains the target
The user history information data that leaf node stores in subtree.
Above-mentioned social network data querying method, device, computer equipment and storage medium, receive inquiry instruction first,
And inquiry instruction is parsed, obtain the period to be checked；Dendrogram is stored with user history information data, and dendrogram includes root section
Point and subtree collection, root node are respectively directed to the subtree of corresponding period, subtree set for indexing different time points, each time point
Conjunction includes the subtree of each period, and then according to the period to be checked, target subtree is searched from dendrogram；Traverse target
Node in tree obtains the user that leaf node stores in target subtree and goes through when the node in target subtree is leaf node
History information data, can effectively improve inquiry velocity in this way.
Description of the drawings
Fig. 1 is the applied environment figure of social network data querying method in one embodiment；
Fig. 2 is the flow diagram of social network data querying method in one embodiment；
Fig. 3 is the node schematic diagram set in one embodiment；
Fig. 4 is the flow diagram of target user's obtaining step in one embodiment；
Fig. 5 is the flow diagram of target user's obtaining step in another embodiment；
Fig. 6 is the schematic diagram of trace index structure in one embodiment；
Fig. 7 is the schematic diagram that index structure is positioned in one embodiment；
Fig. 8 is the flow diagram of user group spatial-temporal query method in one embodiment；
Fig. 9 is the flow diagram of user group time-space behavior mode querying method in one embodiment；
Figure 10 is the flow diagram of lookup method in one embodiment；
Figure 11 is the structural schematic diagram of social network data inquiry unit in one embodiment；
Figure 12 is the internal structure chart of one embodiment Computer equipment.
Specific implementation mode
It is with reference to the accompanying drawings and embodiments, right in order to make the object, technical solution and advantage of the application be more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not
For limiting the application.
Social network data querying method provided by the present application, can be applied in application environment as shown in Figure 1.Its
In, terminal 102 is communicated with server 104 by network by network.Terminal receives inquiry instruction, and parses inquiry and refer to
It enables, obtains the period to be checked.Then terminal searches target subtree then according to the period to be checked from dendrogram,
Dendrogram is stored with user history information data, and dendrogram includes root node and subtree collection, and root node is for when indexing different
Between point, each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period.When in target subtree
Node be leaf node when, obtain target subtree in leaf node store user history information data.Wherein, terminal 102
It can be, but not limited to be various personal computers, laptop, smart mobile phone, tablet computer and portable wearable device,
Server 104 can be realized with the server cluster of the either multiple server compositions of independent server.
In one embodiment, it as shown in Fig. 2, providing a kind of social network data querying method, applies in this way
It illustrates, includes the following steps for terminal in Fig. 1：
Step 202, inquiry instruction is received, and parses inquiry instruction, obtains the period to be checked.
Inquiry instruction refers to that external equipment needs the instruction inputted when query-related information, inquiry instruction can be space-time and
Key word information can specifically be expressed as (C, [ts, te], Wq), wherein C is the spatial dimension of input, [ts, te] it is input
Time range, WqFor the keyword set of input.Inquiry instruction can also be that space-time, keyword and behavior user behavior mode are believed
Breath, can specifically be expressed as (C, [ts, te], tg, k, Wq], wherein C is the spatial dimension of input, [ts, te] it is the time inputted
Range, tgFor customized time span, integer k tgThe number that user occurs in time span, WqFor the keyword set of input
It closes.
Step 204, from being stored in the dendrogram of user history information data, according to the period to be checked, mesh is searched
Subtree is marked, dendrogram includes root node and subtree collection, and for indexing different time points, each time point is respectively directed to pair root node
It includes the subtree of each period to answer the subtree of period, subtree collection.
Dendrogram is a kind of data structure, it is by n (n>=1) a limited node forms a collection with hierarchical relationship
It closes.Dendrogram is alternatively referred to as set, because it looks like a projecting tree, that is to say, that it be root upward, and leaf is directed downwardly.
Dendrogram has the characteristics that：Each node has zero or more child node；There is no the node of father node to be known as root node；It is each
A non-root node has and only there are one father nodes；Other than root node, each child node can be divided into multiple disjoint subtrees.
Root node corresponds to the index entry at a time point for indexing different time points, each root node, and each root node is pressed
Extend according to time sequencing.Specifically, root node may include t1、t2、t3... wait the index entry of continuous time points.Index entry refers to
The class for being indexed object claims, and each index node saves the metadata of a file system object in file system, but not
Including data content or filename.Metadata refers to describing the data of data, mainly describes the attribute information of data, is used for
It supports such as to indicate storage location, historical data, resource lookup, file record function.Metadata is a kind of electronic type catalogue, can
To achieve the purpose that scheduling, and then reach the purpose for assisting data retrieval.Subtree be tree one of node and its
The tree that following all nodes are constituted.Assuming that T is rooted tree, a is a vertex in T, by all descendants of a and a
Subgraph derived from (offspring) is known as the subtree of directed tree T.For example, as shown in figure 3, the tree T has 16 nodes, wherein A is root section
Point, remaining node are divided into 6 mutually disjoint subsets, are indicated respectively with T1, T2, T3, T4, T5 and T6.T1={ B }, T2=
{ C }, T3={ D, H }, T4={ E, I, J, P, Q }, T5={ F, K, L, M }, T6={ G, N }, T1, T2, T3, T4, T5 and T6 are T
Subtree, itself be also one tree, tree T1, T2, T3, T4, T5 and T6 root node be respectively B, C, D, E, F and G.Each time
The index entry of point is directed toward the subtree of corresponding period, such as time point ti, it is directed toward [ti, ti+1) time interval subtree.
It is searched according to the period to be checked in subtree collection, obtains target subtree.For example, root node includes
t1、t2、t3... the index entry for waiting continuous time points, the subtree collection got include [t1, t2)、[t2, t3)、[t3, t4) ... wait whens
Between section subtree, when the period to be checked be [t1, t3), according to the period to be checked, the target subtree searched is
[t1, t2) and [t2, t3) time interval subtree.
Step 206, the node in target subtree is traversed, when the node in target subtree is leaf node, obtains target
The user history information data that leaf node stores in subtree.
Leaf node is the node of lowermost end in tree, and leaf node does not have child node.For example, node B, C, H in Fig. 3,
I, P, Q, K, L, M, N are leaf node.
In one embodiment, as shown in figure 4, user history information data include spatial positional information, temporal information with
And the frequency in set spatial position obtains leaf section in target subtree when the node in target subtree is leaf node
The user history information data of point storage, including：
Step 402, the corresponding spatial positional information of leaf node in target subtree, temporal information are obtained and in default
The frequency of spatial position；
Step 404, when the node in target subtree is leaf node, the corresponding spatial positional information of leaf node belongs to pre-
If time that spatial position, the corresponding temporal information of leaf node belong in preset time period and leaf node is corresponding is in
When the frequency of set spatial position is greater than or equal to predeterminated frequency, the user's history letter that leaf node stores in target subtree is obtained
Cease data.
Specifically, leaf node can be expressed as<Uid, x, y, Wp>Data item form, wherein uid is user identifier,
(x, y) is coordinates of the user uid in moment t, and WpThere are two types of possibilities：If in the presence of, (x, y) is the coordinate of anchor point,
The keyword of covering is Wp；If WpFor null (sky), then (x, y) does not correspond to relevant anchor point, only indicates the seat of user location
Mark.Whether the data item of each leaf node meets following conditions in test-target subtree：(1) moment t is in preset time period
[ts, te] in, (2) coordinate (x, y) is in pre-set space range C；(3) frequency of user into this space-time unique is greater than or equal to
Predeterminated frequency k/tg, wherein tgFor customized time span, integer k tgThe number that the user occurs in time span.If
The data item of leaf node meets above-mentioned condition, then returns to the user history information data stored in the leaf node.
In one embodiment, as shown in figure 5, user history information data include spatial positional information, temporal information with
And key word information obtains the user that leaf node stores in target subtree when the node in target subtree is leaf node
History information data, including：
Step 502, the corresponding spatial positional information of leaf node in target subtree, temporal information and keyword letter are obtained
Breath；
Step 504, when the node in target subtree is leaf node, the corresponding spatial positional information of leaf node belongs to pre-
If spatial position, the corresponding temporal information of leaf node belong to the time in preset time period and the corresponding key of leaf node
When word information belongs to predetermined keyword, the user history information data that leaf node stores in target subtree is obtained.
Specifically, leaf node can be expressed as the form of (x, y, t, w), wherein (x, y) is the coordinate of spatial object, t
For the time of positioning, w is the keyword of spatial object.Whether each leaf node meets following conditions in test-target subtree：
(1) coordinate (x, y) is located at pre-set space range C；(2) time in the corresponding data record of the leaf node is located at preset time
Section [ts, te] in；(3) include predetermined keyword Wq.If the data item of leaf node meets above-mentioned condition, the leaf is returned
The user history information data stored in node.
In above-mentioned social network data querying method, inquiry instruction is received first, and parse inquiry instruction, obtain to be checked
Period；Dendrogram is stored with user history information data, includes the root node for indexing different time points and each time
The subtree collection that point is directed toward searches target subtree then according to the period to be checked from dendrogram；It traverses in target subtree
Node, when the node in target subtree be leaf node when, obtain target subtree in leaf node store user's history letter
Data are ceased, can effectively improve inquiry velocity in this way.
In one embodiment, user history information data includes spatial positional information, time segment information and is in pre-
If the frequency of spatial position, according to the period to be checked, after lookup obtains target subtree, including：When in target subtree
Node be non-leaf nodes when, obtain target subtree in the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and
Frequency in set spatial position；When the corresponding spatial position of minimum enclosed rectangle is Chong Die with set spatial position, non-leaf
The corresponding time segment information of the node frequency in set spatial position corresponding with preset time period overlapping and leaf node is big
When predeterminated frequency, the child node of non-leaf nodes is obtained；When the child node of non-leaf nodes is leaf node, obtain
The user history information data for taking the leaf node to store.Specifically, n omicronn-leaf child node can be expressed as<MBR, tns, tne, KW,
U>Data item form, wherein MBR indicate subtree minimum external matrix, [tns, tne] indicate the period existing for this MBR,
KW indicates the subtree keyword that includes, and U is the set of the statistical information of user in subtree, and the form of element specifically can be with table in U
It is shown as<Uid, MBRu, tus, tue, num>, wherein uid is the mark of user, MBRuIt is in period [tus, tue] interior user uid
Corresponding MBR, num are numbers of the user uid in this node corresponding record.As shown in fig. 6, illustrating a leaf node in figure
With the specifying information of non-leaf nodes.There is user u in leaf node1And u2Historical rudiment information, the information in leaf node
It is shown as：u1In period [t1, t3] MBR be MBRu1, and trace record number is 2；u2In period [t2, t2] MBR be
MBRu2, it is 1 that trace, which records number,.
In one embodiment, when the node in target subtree is non-leaf nodes, non-leaf in target subtree is obtained
After the corresponding minimum enclosed rectangle of node, time segment information and frequency in set spatial position, including：When outside minimum
Connect the corresponding spatial position of rectangle time segment information corresponding with set spatial position overlapping, non-leaf nodes and preset time period
Overlapping and the corresponding frequency in set spatial position of non-leaf nodes less than predeterminated frequency when, filter out non-leaf nodes
Child node.Specifically, a Hash table, the checking information for storing user can be initialized.N omicronn-leaf in target subtree
The corresponding spatial position of minimum enclosed rectangle of the child node period corresponding with set spatial position overlapping, non-leaf nodes believes
It, will when the breath frequency in set spatial position corresponding with preset time period overlapping and non-leaf nodes is less than predeterminated frequency
Cryptographic Hash in its corresponding Hash table is assigned a value of false, and corresponding subtree is not required to be examined, that is, filters out n omicronn-leaf in the subtree
The child node of child node, in this way can be into once accelerating inquiry velocity.
In one embodiment, user history information data includes spatial positional information, time segment information and keyword
Information, according to the period to be checked, after lookup obtains target subtree, including：When the node in target subtree is non-leaf
When node, the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and key word information in target subtree are obtained；When
The corresponding spatial position of minimum enclosed rectangle and set spatial position are overlapped, the corresponding time segment information of non-leaf nodes with it is default
When period overlapping and the corresponding key word information of non-leaf nodes Chong Die with predetermined keyword, the son of non-leaf nodes is obtained
Node；When the child node of non-leaf nodes is leaf node, the user history information data of leaf node storage is obtained.Specifically
Ground, non-leaf nodes are represented by<MBR, KW>Form, wherein MBR be child node minimum enclosed rectangle, KW is child node
Including keyword.Fig. 7 is to position the schematic diagram being indexed to user based on history information.
In one embodiment, user history information data includes spatial positional information and time segment information, according to waiting for
The period of inquiry, after lookup obtains target subtree, including：When the node in target subtree is non-leaf nodes, obtain
The corresponding minimum enclosed rectangle of non-leaf nodes and time segment information in target subtree；When the corresponding space of minimum enclosed rectangle
Position is not overlapped with set spatial position and when the corresponding time segment information of non-leaf nodes and not be overlapped preset time period, filter
Except the child node of non-leaf nodes.Filter out the child node of the non-leaf nodes, the corresponding subtree of child node of the non-leaf nodes
Be not required to it is to be examined, in this way can be into once accelerating inquiry velocity.
In one embodiment, the continuous development with social networks under development of Mobile Internet technology promotion and universal, use
Family, by positioning function, can also leave location information and patronize the information of businessman other than traditional network social intercourse activity.
With the continuous popularization of social networking application, a large amount of social data with time-space attribute is accumulated, and therefrom analysis mining goes out use
The time-space behavior rule of family group has important value.Many users can position in the place such as sight spot, businessman that oneself is liked
It registers and sends social information, be shared with other users in social networks, utilize these data, so that it may to pass through efficient rope
Draw, retrieved for given time, space, keyword and frequency of registering, obtains target user group, and further analyze,
Sum up the time-space behavior rule of target user group.This can utilize the Behavior law excavated more accurate for businessman
Effectively target user is publicized；For the social networking application of client, it can also be advised according to the hobby of user and behavior
Rule provides for it and preferably recommends and service.
Specifically, it can be inquired by following two modes, (1) user group space-time locating query：It is fixed at one
(wherein o is the center of circle, and r is radius), a time interval [t in spatial dimension C=(o, r)s, te], a keyword set Wq
In, corresponding user group set is inquired, needs to meet the following conditions in each user group：In time interval [ts, te] in, each
User is located in the place in C ranges, and the place covering keyword set W positionedq.(2) user group time-space behavior side
Formula is inquired：(wherein o is the center of circle, and r is radius), a time interval [t in a given spatial dimension C=(o, r)s, te], one
A time span (or time granularity) tg, an integer k and a keyword set Wq, find user group set, each user
It needs to meet the following conditions in group：In time interval [ts, te] in, each time span tgUser enters at least k in spatial dimension C
It is secondary, and the place covering keyword set W of user group positioningq。
Positioning index is for being indexed the history information that user positions.The index class has carried out individually the time
Processing, the spatial information inscribed when each are stored in R trees, that is, save the distribution situation of different time points spatial object.
Position index structure schematic diagram as shown in fig. 7, root node be the index entry comprising different time points, prolong sequentially in time
It stretches, each index entry, such as ti, it is directed toward [ti, ti+1) time interval subtree, and its be directed toward subtree be R
Tree, i.e., this R tree stores [ti, ti+1) the period interior data positioned.Unlike HR trees, the non-leaf nodes of R trees
Bloom filter is all combined, filtering keys word is used for.The leaf node form of positioning index is (x, y, t, w), wherein (x,
Y) it is the coordinate of the spatial object of positioning, t is the time of positioning, and w is the keyword of spatial object.It, can for non-leaf nodes
It is expressed as<MBR, KW>, wherein MBR is the minimum enclosed rectangle of child node, and KW includes the keyword of child node.
For user group space-time locating query, querying condition is (C, [ts, te], Wq), wherein C=(o, r), it is intended to find
In specified space-time unique with the relevant user group set of keyword.User group space-time locating query method is as shown in figure 8, specific
Including：
The first step：The root node of positioning index is imported in memory with getRoot () function；
Second step：It finds and meets [ts, te] time interval condition R tree trees, be denoted as SN；
Third walks：For the node in each SN, obtained in period [t using function search ()s, te] in located
Keyword WqLeaf node user set, be denoted as Uset：
For the node in each SN, if non-leaf nodes, the data item in node is checked whether to meet following item
Part：(1) MBR ranges have overlapping with given spatial dimension C；(2) time range where has overlapping with given time range；(3)
The result that Bloom filter is examined includes given keyword set Wq.If these three conditions all meet, search is reused
() function is iterated lookup to its corresponding child node.
Node in each SN is checked whether to meet the following conditions if leaf node to the data item in node：
(1) coordinate (x, y) is fallen in given spatial dimension C；(2) timestamp in the data record is in given time section [ts, te]
In；(3) keyword includes given keyword Wq.If meeting three above condition, qualified leaf node information is returned.
4th step：For Uset, the user in set is built into connection figure, obtains final user group set Ulist.
Trace indexes the mark information for indexing user group.The form of its leafy node is<Uid, x, y, Wp>, wherein
Uid is the mark of user, and (x, y) is coordinates of the user uid in moment t, and WpThere are two types of possibilities：If in the presence of (x, y) is
The coordinate of anchor point, including keyword be Wp；If WpFor null, then (x, y) does not correspond to relevant anchor point, only indicates user
The coordinate of position.The form of n omicronn-leaf child node is<MBR, tns, tne, KW, U>, wherein MBR indicates the external square of minimum of subtree
Shape, [tns, tne] indicate that period existing for this MBR, KW indicate that the keyword that subtree includes, U are the statistics letters of user in subtree
The set of breath, the form of element is in U<Uid, MBRu, tus, tue, num>, wherein uid is user identifier, MBRuIt is in the time
Section [tus, tue] the corresponding MBR of interior user uid, num is numbers of the user uid in this node corresponding record.Fig. 6 indexes for trace
The schematic diagram of structure merely illustrates the specifying information of a leaf node and non-leaf nodes in figure, has user in leaf node
u1And u2Historical rudiment information.Presentation of information in leaf node is：User u1In period [t1, t3] MBR be
MBRu1, and trace record number is 2；User u2In period [t2, t2] MBR be MBRu2, it is 1 that trace, which records number,.
User group time-space behavior mode is inquired, querying condition is (C, [ts, te], tg, k, Wq), target is to return
In a certain section of space-time unique, the frequency of occurrences is higher than k/tg(per tgPeriod k times) user's (behavior limitation), and close
Keyword group WqIt is coated in the group of these users formation.User group time-space behavior mode querying method is as shown in figure 9, specific packet
It includes：
The first step：The root node of positioning index is imported in memory with getRoot () function；
Second step：It finds and meets period [ts, te] condition R tree trees, be denoted as SN；
Third walks：For the node in each SN, obtained in period [t using function search ()s, te] in located
The leaf node user set of given keyword, referred to as Uset：
4th step：User in gathering Uset builds connection figure；
5th step：It finds including giving keyword WqConnection figure, and therefrom obtain final user group set Ulist.
Wherein, process such as Figure 10 institutes of search () function during third walks in user group time-space behavior mode querying method
Show, including：
The first step：Initialize a Hash table, the checking information for storing user；
Second step：For the index entry in non-leaf nodes, judge whether to meet following two conditions：The MBR of index entry
There are overlapping, time interval and the given time range [t of index entry with given spatial dimension Cs, te] there is overlapping：
If meeting above-mentioned two condition, further examined, if avgc ＜ k, corresponding cryptographic Hash is assigned a value of
False, corresponding subtree need not be retrieved again, each time period ts of avgcgMiddle user uiThe average time of appearance, i.e., by the time
Section [tus, tue] temporally length tgIt is segmented, segmentation calculates average record count avgc=u.num/ ((u.tue-
tus)/tg)；If avgc >=k, continue to retrieve its subtree with search () function.It is corresponding if being unsatisfactory for above-mentioned two condition
Subtree need not be retrieved again.
Third walks：Leaf node is traversed always, examines whether the data item in each leaf node meets following conditions：
(1) in given time period [ts, te] in, (2) are in given spatial dimension C；(3) frequency of user into this space-time unique is higher than
k/tg.If data item meets above-mentioned condition, the user is returned；If data item is unsatisfactory for above-mentioned condition, the user is excluded.
4th step：Obtain leaf node user's set Uset.
It should be understood that although each step in the flow chart of Fig. 2,4-5,8-10 is shown successively according to the instruction of arrow
Show, but these steps are not the inevitable sequence indicated according to arrow to be executed successively.Unless expressly state otherwise herein, this
There is no stringent sequences to limit for the execution of a little steps, these steps can execute in other order.Moreover, Fig. 2,4-5,8-
At least part step in 10 may include that either these sub-steps of multiple stages or stage be not necessarily for multiple sub-steps
It is to execute completion in synchronization, but can execute at different times, the execution sequence in these sub-steps or stage
It is not necessarily and carries out successively, but can be with other steps either at least part wheel in the sub-step of other steps or stage
Stream alternately executes.
In one embodiment, as shown in figure 11, a kind of social network data inquiry unit is provided, including：Instruction solution
Module 1102, target sub-tree search module 1104 and target user's acquisition module 1106 are analysed, wherein：
Command analysis module 1102 for receiving inquiry instruction, and parses inquiry instruction, obtains the period to be checked；
Target sub-tree search module 1104, for from being stored in the dendrogram of user history information data, according to be checked
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；
Target user's acquisition module 1106, for traversing the node in target subtree, when the node in target subtree is leaf
When child node, the user history information data that leaf node stores in target subtree is obtained.
In one embodiment, after target sub-tree search module, including：Target subtree data obtaining module, for working as
When node in target subtree is non-leaf nodes, obtain the corresponding minimum enclosed rectangle of non-leaf nodes in target subtree, when
Between segment information and the frequency in set spatial position；Target subtree signal judgement module, for working as minimum enclosed rectangle pair
The spatial position answered and set spatial position are overlapped, the corresponding time segment information of non-leaf nodes is Chong Die with preset time period and
When the corresponding frequency in set spatial position of non-leaf nodes is greater than or equal to predeterminated frequency, the son of non-leaf nodes is obtained
Node；Target subtree user returns to module, for when the child node of the non-leaf nodes is leaf node, obtaining the leaf
The user history information data of node storage.
In one embodiment, after target subtree data obtaining module, including：Target subtree Information Filtration module is used
In when the corresponding time segment information of the overlapping of the corresponding spatial position of minimum enclosed rectangle and set spatial position, non-leaf nodes with
When preset time period is overlapped and the corresponding frequency in the set spatial position of non-leaf nodes is less than predeterminated frequency, filter
Except the child node of non-leaf nodes.
In one embodiment, target user's acquisition module includes：Leaf node information acquiring unit, for obtaining target
The corresponding spatial positional information of leaf node, temporal information and the frequency in set spatial position in subtree；Leaf node
Information judging unit, for being that leaf node, the corresponding spatial positional information of leaf node belong to when the node in target subtree
The corresponding temporal information of set spatial position, leaf node belongs to the time in preset time period and the corresponding place of leaf node
When the frequency of set spatial position is greater than or equal to predeterminated frequency, the user's history that leaf node stores in target subtree is obtained
Information data.
In one embodiment, target user's acquisition module includes：Target subtree information acquisition unit, for obtaining target
The corresponding spatial positional information of leaf node, temporal information and key word information in subtree；Target subtree information judging unit,
When the node in target subtree is leaf node, the corresponding spatial positional information of leaf node belongs to set spatial position, leaf
The time and the corresponding key word information of leaf node that the corresponding temporal information of node belongs in preset time period belong to default pass
When keyword, the user history information data that leaf node stores in target subtree is obtained.
In one embodiment, after target sub-tree search module, including：Non-leaf nodes data obtaining module, is used for
When the node in target subtree be non-leaf nodes when, obtain target subtree in the corresponding minimum enclosed rectangle of non-leaf nodes,
Time segment information and key word information；Non-leaf nodes signal judgement module, for working as the corresponding space of minimum enclosed rectangle
Position and set spatial position are overlapped, the corresponding time segment information of non-leaf nodes is Chong Die with preset time period and non-leaf section
When the corresponding key word information of point is Chong Die with predetermined keyword, the child node of non-leaf nodes is obtained；Non-leaf nodes user sieves
Modeling block, for when the child node of non-leaf nodes is leaf node, obtaining the user history information number of leaf node storage
According to.
In one embodiment, after target sub-tree search module, including：Subtree data obtaining module, for working as target
When node in subtree is non-leaf nodes, the corresponding minimum enclosed rectangle of non-leaf nodes and time in target subtree are obtained
Segment information；Subtree signal judgement module, for work as the corresponding spatial position of minimum enclosed rectangle it is not be overlapped with set spatial position,
And when the corresponding time segment information of non-leaf nodes and not be overlapped preset time period, filter out the child node of non-leaf nodes.
Specific restriction about social network data inquiry unit may refer to inquire above for social network data
The restriction of method, details are not described herein.Modules in above-mentioned social network data inquiry unit can be fully or partially through
Software, hardware and combinations thereof are realized.Above-mentioned each module can be embedded in or in the form of hardware independently of the place in computer equipment
It manages in device, can also in a software form be stored in the memory in computer equipment, in order to which processor calls execution or more
The corresponding operation of modules.
In one embodiment, a kind of computer equipment is provided, which can be server, internal junction
Composition is shown in Fig.12.The computer equipment include the processor connected by system bus, memory, network interface and
Database.Wherein, the processor of the computer equipment is for providing calculating and control ability.The memory packet of the computer equipment
Include non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with operating system, computer program and data
Library.The built-in storage provides environment for the operation of operating system and computer program in non-volatile memory medium.The calculating
History information of the database of machine equipment for storing user's space-time history information data in social networks, user's positioning
And the mark information data of user.The network interface of the computer equipment is used for logical by network connection with external terminal
Letter.To realize a kind of social network data querying method when the computer program is executed by processor.
It will be understood by those skilled in the art that structure shown in Figure 12, only with the relevant part of application scheme
The block diagram of structure, does not constitute the restriction for the computer equipment being applied thereon to application scheme, and specific computer is set
Standby may include either combining certain components than more or fewer components as shown in the figure or being arranged with different components.
In one embodiment, a kind of computer equipment, including memory and processor are provided, is stored in memory
Computer program, the processor realize following steps when executing computer program：Inquiry instruction is received, and parses the inquiry and refers to
It enables, obtains the period to be checked；From being stored in the dendrogram of user history information data, according to the period to be checked,
Target subtree is searched, dendrogram includes root node and subtree collection, and root node is for indexing different time points, each time point difference
It is directed toward the subtree of corresponding period, subtree collection includes the subtree of each period；The node in target subtree is traversed, when target
When node in tree is leaf node, the user history information data that leaf node stores in target subtree is obtained.
In one embodiment, following steps are also realized when processor executes computer program：Inquiry instruction is received, and is solved
The inquiry instruction is analysed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to be checked
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；Section in target subtree
When point is non-leaf nodes, the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and place in target subtree are obtained
In the frequency of set spatial position；When the corresponding spatial position of minimum enclosed rectangle is Chong Die with set spatial position, non-leaf section
The corresponding time segment information of the point frequency in set spatial position corresponding with preset time period overlapping and non-leaf nodes is big
When predeterminated frequency, the child node of non-leaf nodes is obtained；When the child node of non-leaf nodes is leaf node, obtain
The user history information data for taking the leaf node to store；When the node in target subtree is leaf node, target is obtained
The user history information data that leaf node stores in tree.
In one embodiment, following steps are also realized when processor executes computer program：Inquiry instruction is received, and is solved
The inquiry instruction is analysed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to be checked
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；Section in target subtree
When point is non-leaf nodes, the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and place in target subtree are obtained
In the frequency of set spatial position；When the corresponding spatial position of minimum enclosed rectangle is Chong Die with set spatial position, non-leaf section
The corresponding time segment information of the point frequency in the set spatial position corresponding with preset time period overlapping and non-leaf nodes
When rate is less than predeterminated frequency, the child node of non-leaf nodes is filtered out；When the corresponding spatial position of minimum enclosed rectangle and default sky
Between position overlapping, the corresponding time segment information of non-leaf nodes and preset time period overlapping and non-leaf nodes is corresponding is in
When the frequency of set spatial position is greater than or equal to predeterminated frequency, the child node of non-leaf nodes is obtained；When non-leaf nodes
When child node is leaf node, the user history information data of leaf node storage is obtained；When the node in target subtree is
When leaf node, the user history information data that leaf node stores in target subtree is obtained.
In one embodiment, following steps are also realized when processor executes computer program：Inquiry instruction is received, and is solved
The inquiry instruction is analysed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to be checked
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；Obtain the target subtree middle period
The corresponding spatial positional information of child node, temporal information and the frequency in set spatial position；Section in target subtree
Point is leaf node, the corresponding spatial positional information of leaf node belongs to the corresponding time letter of set spatial position, leaf node
It ceases the time belonged in preset time period and the corresponding frequency in the set spatial position of leaf node is greater than or equal to
When predeterminated frequency, the user history information data of leaf node storage is obtained.
In one embodiment, following steps are also realized when processor executes computer program：Inquiry instruction is received, and is solved
The inquiry instruction is analysed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to be checked
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；Obtain the target subtree middle period
The corresponding spatial positional information of child node, temporal information and key word information；When the node in target subtree be leaf node,
The corresponding spatial positional information of leaf node belongs to the corresponding temporal information of set spatial position, leaf node and belongs to preset time
When time and the corresponding key word information of leaf node in section belong to predetermined keyword, the use of leaf node storage is obtained
Family history information data.
In one embodiment, following steps are also realized when processor executes computer program：Inquiry instruction is received, and is solved
The inquiry instruction is analysed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to be checked
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；Section in target subtree
When point is non-leaf nodes, the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and pass in target subtree are obtained
Keyword information；When the corresponding spatial position of the minimum enclosed rectangle time corresponding with set spatial position overlapping, non-leaf nodes
When segment information key word information corresponding with preset time period overlapping and non-leaf nodes is Chong Die with predetermined keyword, obtain non-
The child node of leaf node；When the child node of non-leaf nodes is leaf node, the user for obtaining leaf node storage goes through
History information data；When the node in target subtree is leaf node, the user history information number of leaf node storage is obtained
According to.
In one embodiment, following steps are also realized when processor executes computer program：Inquiry instruction is received, and is solved
The inquiry instruction is analysed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to be checked
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；Section in target subtree
When point is non-leaf nodes, the corresponding minimum enclosed rectangle of non-leaf nodes and time segment information in target subtree are obtained；When
The corresponding spatial position of minimum enclosed rectangle be not overlapped with set spatial position and the corresponding time segment information of non-leaf nodes with
When preset time period is not overlapped, the child node of non-leaf nodes is filtered out；When the node in target subtree is leaf node, obtain
The user history information data of leaf node storage.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
Machine program realizes following steps when being executed by processor：Inquiry instruction is received, and parses the inquiry instruction, is obtained to be checked
Period；From being stored in the dendrogram of user history information data, according to the period to be checked, target subtree, tree are searched
Shape figure includes root node and subtree collection, and root node is respectively directed to the corresponding period for indexing different time points, each time point
Subtree, subtree collection includes the subtree of each period；The node in target subtree is traversed, when the node in target subtree is leaf
When child node, the user history information data that leaf node stores in target subtree is obtained.
In one embodiment, following steps are also realized when computer program is executed by processor：Inquiry instruction is received, and
The inquiry instruction is parsed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to waiting for
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is for indexing different time
Point, each time point are respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；When in target subtree
Node be non-leaf nodes when, obtain target subtree in the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and
Frequency in set spatial position；When the corresponding spatial position of minimum enclosed rectangle is Chong Die with set spatial position, non-leaf
The corresponding time segment information of the node frequency in set spatial position corresponding with preset time period overlapping and non-leaf nodes
When more than or equal to predeterminated frequency, the child node of non-leaf nodes is obtained；When the child node of non-leaf nodes is leaf node,
Obtain the user history information data of leaf node storage；When the node in target subtree is leaf node, target is obtained
The user history information data that leaf node stores in subtree.
In one embodiment, following steps are also realized when computer program is executed by processor：Inquiry instruction is received, and
The inquiry instruction is parsed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to waiting for
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is for indexing different time
Point, each time point are respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；When in target subtree
Node be non-leaf nodes when, obtain target subtree in the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and
Frequency in set spatial position；When the corresponding spatial position of minimum enclosed rectangle is Chong Die with set spatial position, non-leaf
The corresponding time segment information of node and preset time period are overlapped and non-leaf nodes is corresponding in the set spatial position
When frequency is less than predeterminated frequency, the child node of non-leaf nodes is filtered out；When the corresponding spatial position of minimum enclosed rectangle and preset
Spatial position overlapping, the corresponding time segment information of non-leaf nodes place corresponding with preset time period overlapping and non-leaf nodes
When the frequency of set spatial position is greater than or equal to predeterminated frequency, the child node of non-leaf nodes is obtained；Work as non-leaf nodes
Child node be leaf node when, obtain the leaf node storage user history information data；Node in target subtree
For leaf node when, obtain target subtree in leaf node store user history information data.
In one embodiment, following steps are also realized when computer program is executed by processor：Inquiry instruction is received, and
The inquiry instruction is parsed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to waiting for
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is for indexing different time
Point, each time point are respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；It obtains in target subtree
The corresponding spatial positional information of leaf node, temporal information and the frequency in set spatial position；When in target subtree
Node is leaf node, the corresponding spatial positional information of leaf node belongs to set spatial position, the leaf node corresponding time
Time and the leaf node corresponding frequency in the set spatial position that information belongs in preset time period are more than or wait
When predeterminated frequency, the user history information data of leaf node storage is obtained.
In one embodiment, following steps are also realized when computer program is executed by processor：Inquiry instruction is received, and
The inquiry instruction is parsed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to waiting for
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is for indexing different time
Point, each time point are respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；It obtains in target subtree
The corresponding spatial positional information of leaf node, temporal information and key word information；When the node in target subtree is leaf section
The corresponding spatial positional information of point, leaf node belongs to the corresponding temporal information of set spatial position, leaf node and belongs to default
When time and leaf node corresponding key word information in period belongs to predetermined keyword, leaf node storage is obtained
User history information data.
In one embodiment, following steps are also realized when computer program is executed by processor：Inquiry instruction is received, and
The inquiry instruction is parsed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to waiting for
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is for indexing different time
Point, each time point are respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；When in target subtree
Node be non-leaf nodes when, obtain target subtree in the corresponding minimum enclosed rectangle of non-leaf nodes, time segment information and
Key word information；When the corresponding spatial position of minimum enclosed rectangle is corresponding with set spatial position overlapping, non-leaf nodes
Between segment information and preset time period be overlapped and when the corresponding key word information of non-leaf nodes is Chong Die with predetermined keyword, acquisition
The child node of non-leaf nodes；When the child node of non-leaf nodes is leaf node, the user of leaf node storage is obtained
History information data；When the node in target subtree is leaf node, the user history information of leaf node storage is obtained
Data.
In one embodiment, following steps are also realized when computer program is executed by processor：Inquiry instruction is received, and
The inquiry instruction is parsed, the period to be checked is obtained；From being stored in the dendrogram of user history information data, according to waiting for
The period of inquiry searches target subtree, and dendrogram includes root node and subtree collection, and root node is for indexing different time
Point, each time point are respectively directed to the subtree of corresponding period, and subtree collection includes the subtree of each period；When in target subtree
When node is non-leaf nodes, the corresponding minimum enclosed rectangle of non-leaf nodes and time segment information in target subtree are obtained；
When the corresponding spatial position of minimum enclosed rectangle is not overlapped and the corresponding time segment information of non-leaf nodes with set spatial position
With preset time period it is not be overlapped when, filter out the child node of non-leaf nodes；When the node in target subtree is leaf node, obtain
The user history information data for taking the leaf node to store.
One of ordinary skill in the art will appreciate that realizing all or part of flow in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the flow of the embodiment of above-mentioned each method.Wherein,
Any reference to memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above example can be combined arbitrarily, to keep description succinct, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield is all considered to be the range of this specification record.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, under the premise of not departing from the application design, various modifications and improvements can be made, these belong to the protection of the application
Range.Therefore, the protection domain of the application patent should be determined by the appended claims.
Claims (10)
1. a kind of social network data querying method, the method includes：
Inquiry instruction is received, and parses the inquiry instruction, obtains the period to be checked；
From being stored in the dendrogram of user history information data, according to the period to be checked, target subtree, institute are searched
It includes root node and subtree collection to state dendrogram, and for indexing different time points, each time point is respectively directed to pair the root node
It includes the subtree of each period to answer the subtree of period, the subtree collection；
The node in target subtree is traversed, when the node in the target subtree is leaf node, obtains the target subtree
The user history information data of middle leaf node storage.
2. according to the method described in claim 1, it is characterized in that, the user history information data includes space bit confidence
Breath, time segment information and the frequency in set spatial position, described according to the period to be checked, lookup obtains target
After tree, including：
When the node in the target subtree is non-leaf nodes, it is corresponding most to obtain non-leaf nodes in the target subtree
Small boundary rectangle, time segment information and the frequency in set spatial position；
When the corresponding spatial position of the minimum enclosed rectangle is corresponding with set spatial position overlapping, the non-leaf nodes
Between segment information and preset time period be overlapped and the corresponding frequency in the set spatial position of the non-leaf nodes is more than
Or when equal to predeterminated frequency, obtain the child node of the non-leaf nodes；
When the child node of the non-leaf nodes is leaf node, the user history information number of the leaf node storage is obtained
According to.
3. according to the method described in claim 2, it is characterized in that, the node when in the target subtree is non-leaf section
When point, the corresponding minimum enclosed rectangle of non-leaf nodes in the target subtree, time segment information are obtained and in default sky
Between position frequency after, including：
When the corresponding spatial position of the minimum enclosed rectangle is corresponding with set spatial position overlapping, the non-leaf nodes
Between segment information and preset time period be overlapped and the corresponding frequency in the set spatial position of the non-leaf nodes is less than
When predeterminated frequency, the child node of the non-leaf nodes is filtered out.
4. according to the method described in claim 1, it is characterized in that, the user history information data includes space bit confidence
Breath, temporal information and the frequency in set spatial position, when the node when in the target subtree is leaf node,
The user history information data that leaf node stores in the target subtree is obtained, including：
It obtains the corresponding spatial positional information of leaf node in the target subtree, temporal information and is in set spatial position
Frequency；
When the node in the target subtree is leaf node, the corresponding spatial positional information of the leaf node belongs to default sky
Between position, the corresponding temporal information of the leaf node belongs to the time in preset time period and the leaf node is corresponding
When frequency in the set spatial position is greater than or equal to predeterminated frequency, obtains leaf node in the target subtree and store
User history information data.
5. according to the method described in claim 1, it is characterized in that, the user history information data includes space bit confidence
Breath, temporal information and key word information obtain the target when node when in the target subtree is leaf node
The user history information data that leaf node stores in subtree, including：
Obtain the corresponding spatial positional information of leaf node, temporal information and key word information in the target subtree；
When the node in the target subtree is leaf node, the corresponding spatial positional information of the leaf node belongs to default sky
Between position, the corresponding temporal information of the leaf node belongs to the time in preset time period and the leaf node is corresponding
When key word information belongs to predetermined keyword, the user history information data that leaf node stores in the target subtree is obtained.
6. according to the method described in claim 1, it is characterized in that, the user history information data includes space bit confidence
Breath, time segment information and key word information, it is described according to the period to be checked, after lookup obtains target subtree, including：
When the node in the target subtree is non-leaf nodes, it is corresponding most to obtain non-leaf nodes in the target subtree
Small boundary rectangle, time segment information and key word information；
When the corresponding spatial position of the minimum enclosed rectangle is corresponding with set spatial position overlapping, the non-leaf nodes
Between segment information and preset time period be overlapped and when the corresponding key word information of the non-leaf nodes is Chong Die with predetermined keyword,
Obtain the child node of the non-leaf nodes；
When the child node of the non-leaf nodes is leaf node, the user history information number of the leaf node storage is obtained
According to.
7. according to the method described in claim 1-6 any one, which is characterized in that the user history information data includes sky
Between location information and time segment information, it is described according to the period to be checked, after lookup obtains target subtree, including：
When the node in the target subtree is non-leaf nodes, it is corresponding most to obtain non-leaf nodes in the target subtree
Small boundary rectangle and time segment information；
When the corresponding spatial position of the minimum enclosed rectangle is not overlapped and the non-leaf nodes is corresponding with set spatial position
Time segment information and when not be overlapped preset time period, filter out the child node of the non-leaf nodes.
8. a kind of social network data inquiry unit, which is characterized in that described device includes：
Command analysis module for receiving inquiry instruction, and parses the inquiry instruction, obtains the period to be checked；
Target sub-tree search module, for from being stored in the dendrogram of user history information data, according to the time to be checked
Section searches target subtree, and the dendrogram includes root node and subtree collection, and the root node is used to index different time points,
Each time point is respectively directed to the subtree of corresponding period, and the subtree collection includes the subtree of each period；
Target user's acquisition module, for traversing the node in target subtree, when the node in the target subtree is leaf section
When point, the user history information data that leaf node stores in the target subtree is obtained.
9. a kind of computer equipment, including memory and processor, the memory are stored with computer program, feature exists
In when the processor executes the computer program the step of any one of realization claim 1 to 7 the method.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of claim 1 to 7 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810111975.XA CN108460102A (en) | 2018-02-05 | 2018-02-05 | Social network data querying method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810111975.XA CN108460102A (en) | 2018-02-05 | 2018-02-05 | Social network data querying method, device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108460102A true CN108460102A (en) | 2018-08-28 |
Family
ID=63239575
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810111975.XA Pending CN108460102A (en) | 2018-02-05 | 2018-02-05 | Social network data querying method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108460102A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110084714A (en) * | 2019-04-25 | 2019-08-02 | 太原理工大学 | Social network influence power maximization approach, device and equipment based on directed tree |
| CN110347925A (en) * | 2019-07-12 | 2019-10-18 | 腾讯科技（深圳）有限公司 | Information processing method and computer readable storage medium |
| CN110532437A (en) * | 2019-07-18 | 2019-12-03 | 平安科技（深圳）有限公司 | Electronic certificate reminding method, device, computer equipment and storage medium |
| CN111858613A (en) * | 2020-07-31 | 2020-10-30 | 湖北亿咖通科技有限公司 | Service data retrieval method |
| CN112989228A (en) * | 2021-04-25 | 2021-06-18 | 湖南视觉伟业智能科技有限公司 | Distributed space-time query method and system |
| CN113254451A (en) * | 2021-06-01 | 2021-08-13 | 北京城市网邻信息技术有限公司 | Data index construction method and device, electronic equipment and storage medium |
| CN113961573A (en) * | 2021-12-23 | 2022-01-21 | 北京力控元通科技有限公司 | Time sequence database query method and query system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105389370A (en) * | 2015-11-13 | 2016-03-09 | 浙江工业大学 | Social activity organization-faced time aggregation query method |
| CN106844790A (en) * | 2017-03-22 | 2017-06-13 | 中国人民解放军国防科学技术大学 | A kind of quick Temporal query method for user's group analysis in social networks |
-
2018
- 2018-02-05 CN CN201810111975.XA patent/CN108460102A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105389370A (en) * | 2015-11-13 | 2016-03-09 | 浙江工业大学 | Social activity organization-faced time aggregation query method |
| CN106844790A (en) * | 2017-03-22 | 2017-06-13 | 中国人民解放军国防科学技术大学 | A kind of quick Temporal query method for user's group analysis in social networks |
Non-Patent Citations (2)
| Title |
|---|
| XIAOYING CHEN等: "Historical Geo-Social Query Processing", 《ASIA-PACIFIC WEB CONFERENCE 2016: WEB TECHNOLOGIES AND APPLICATIONS》 * |
| XIAOYING CHEN等: "Spatio-temporal Queries in HBase", 《2015 IEEE INTERNATIONAL CONFERENCE ON BIG DATA》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110084714A (en) * | 2019-04-25 | 2019-08-02 | 太原理工大学 | Social network influence power maximization approach, device and equipment based on directed tree |
| CN110084714B (en) * | 2019-04-25 | 2021-05-07 | 太原理工大学 | Social network influence maximization method, device and equipment based on directed tree |
| CN110347925A (en) * | 2019-07-12 | 2019-10-18 | 腾讯科技（深圳）有限公司 | Information processing method and computer readable storage medium |
| CN110347925B (en) * | 2019-07-12 | 2023-11-14 | 腾讯科技（深圳）有限公司 | Information processing method and computer readable storage medium |
| CN110532437A (en) * | 2019-07-18 | 2019-12-03 | 平安科技（深圳）有限公司 | Electronic certificate reminding method, device, computer equipment and storage medium |
| CN110532437B (en) * | 2019-07-18 | 2023-08-01 | 平安科技（深圳）有限公司 | Electronic certificate prompting method, electronic certificate prompting device, computer equipment and storage medium |
| CN111858613A (en) * | 2020-07-31 | 2020-10-30 | 湖北亿咖通科技有限公司 | Service data retrieval method |
| CN112989228A (en) * | 2021-04-25 | 2021-06-18 | 湖南视觉伟业智能科技有限公司 | Distributed space-time query method and system |
| CN112989228B (en) * | 2021-04-25 | 2021-08-27 | 湖南视觉伟业智能科技有限公司 | Distributed space-time query method and system |
| CN113254451A (en) * | 2021-06-01 | 2021-08-13 | 北京城市网邻信息技术有限公司 | Data index construction method and device, electronic equipment and storage medium |
| CN113961573A (en) * | 2021-12-23 | 2022-01-21 | 北京力控元通科技有限公司 | Time sequence database query method and query system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108460102A (en) | Social network data querying method, device, computer equipment and storage medium | |
| Yuan et al. | Index-based densest clique percolation community search in networks | |
| US8700605B1 (en) | Estimating rows returned by recursive queries using fanout | |
| Baralis et al. | Generalized association rule mining with constraints | |
| CN103714134B (en) | Network flow data index method and system | |
| EP2746970B1 (en) | Timeline index for managing temporal data | |
| Liu et al. | U-skyline: A new skyline query for uncertain databases | |
| CN105912666B (en) | A kind of mixed structure data high-performance storage of facing cloud platform, querying method | |
| US20140317117A1 (en) | Method, device and computer storage media for user preferences information collection | |
| JP2017512344A (en) | System and method for rapid data analysis | |
| CN107145526B (en) | Reverse-nearest neighbor query processing method for geographic social keywords under road network | |
| CN101901242A (en) | Federated configuration data management | |
| US9135630B2 (en) | Systems and methods for large-scale link analysis | |
| CN110928882B (en) | Memory database indexing method and system based on improved red black tree | |
| CN107832333B (en) | Method and system for constructing user network data fingerprint based on distributed processing and DPI data | |
| US8150790B2 (en) | Lightweight physical design alerter | |
| Santoso et al. | Close dominance graph: An efficient framework for answering continuous top-$ k $ dominating queries | |
| US20110179013A1 (en) | Search Log Online Analytic Processing | |
| Issa et al. | Efficient access to temporally overlaying spatial and textual trajectories | |
| CN101256579A (en) | Method for inquesting data organization in database | |
| CN112434027A (en) | Indexing method and device for multi-dimensional data, computer equipment and storage medium | |
| US20160078071A1 (en) | Large scale offline retrieval of machine operational information | |
| CN111782663A (en) | Aggregation index structure and aggregation index method for improving aggregation query efficiency | |
| Chen et al. | Ranked window query retrieval over video repositories | |
| CN110263108A (en) | A kind of keyword Skyline fuzzy query method and system based on road network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180828 |