CN112287245A - Social relationship query method, server and computer-readable storage medium - Google Patents
Social relationship query method, server and computer-readable storage medium Download PDFInfo
- Publication number
- CN112287245A CN112287245A CN202011296616.XA CN202011296616A CN112287245A CN 112287245 A CN112287245 A CN 112287245A CN 202011296616 A CN202011296616 A CN 202011296616A CN 112287245 A CN112287245 A CN 112287245A
- Authority
- CN
- China
- Prior art keywords
- social relationship
- person
- cellular
- social
- network
- 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
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000001413 cellular effect Effects 0.000 claims abstract description 126
- 238000004590 computer program Methods 0.000 claims description 15
- 238000010586 diagram Methods 0.000 description 9
- 238000013507 mapping Methods 0.000 description 7
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
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/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9536—Search customisation based on social or collaborative filtering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a social relationship query method, a server and a computer readable storage medium, wherein the method comprises the following steps: establishing a honeycomb social relationship network according to social relationship data of each target person in a plurality of target persons; acquiring a social relationship query request sent by terminal equipment, wherein the social relationship query request carries an identity of a person to be queried; then, according to the identity of the person to be inquired, determining the position coordinates of the person to be inquired in the honeycomb social relationship network; and then inquiring the social relationship of the person to be inquired in the cellular social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment. According to the method and the device, when a social relationship query request is received, the social relationship of the person to be queried is queried in the honeycomb social relationship network according to the position coordinates of the person to be queried, so that the accuracy of social relationship management and the convenience and accuracy of the social relationship of the person to be queried are greatly improved.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a social relationship query method, a server, and a computer-readable storage medium.
Background
In the current information age, with the development of science and technology and the rapid development of intelligent equipment, big data services already involve everyone, and the social relationship of everyone can be positioned by using the big data services.
At present, generally, social relationship information of each person is obtained and stored in a server, when the social relationship information of a certain person needs to be searched, the social relationship information of the person is obtained through a large number of person number relationship queries and recursive queries, but the large number of person number relationship queries and the recursive queries require a large amount of time and have high requirements on a data server. Therefore, how to accurately and quickly find out the social relationship of the target person is a problem to be solved urgently at present.
Disclosure of Invention
The main purpose of the present application is to provide a social relationship query method, a server and a computer readable storage medium, which aim to accurately and quickly query the social relationship of a person to be queried, and improve the accuracy of social relationship management and the convenience of query.
In a first aspect, the present application provides a social relationship query method, including:
establishing a cellular social relationship network according to social relationship data of each of a plurality of target persons;
acquiring a social relationship query request sent by terminal equipment, wherein the social relationship query request carries an identity of a person to be queried;
determining the position coordinates of the person to be inquired in the honeycomb social relationship network according to the identity of the person to be inquired;
and inquiring the social relationship of the person to be inquired in the honeycomb social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment.
In a second aspect, the present application further provides a server comprising a processor, a memory, and a computer program stored on the memory and executable by the processor, wherein the computer program, when executed by the processor, implements the steps of the social relationship querying method as described above.
In a third aspect, the present application further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the social relationship querying method as described above.
The application provides a social relationship query method, a server and a computer readable storage medium for querying personnel relationship, and establishes a honeycomb social relationship network according to social relationship data of each target personnel in a plurality of target personnel; when a social relationship query request sent by terminal equipment is obtained, wherein the social relationship query request carries an identity of a person to be queried; then, according to the identity of the person to be inquired, determining the position coordinates of the person to be inquired in the honeycomb social relationship network; and then inquiring the social relationship of the person to be inquired in the cellular social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment. According to the scheme, the honeycomb social relationship network is established firstly, and when a social relationship query request is received, the social relationship of the person to be queried is queried in the honeycomb social relationship network according to the position coordinate of the person to be queried, so that the accuracy of social relationship management and the convenience and accuracy of the social relationship of the querying person are greatly improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flowchart illustrating steps of a social relationship query method according to an embodiment of the present application;
FIG. 2 is a flow diagram illustrating sub-steps of the social relationship query method of FIG. 1;
FIG. 3 is a schematic diagram of a cellular social relationship subnetwork in an embodiment of the present application;
FIG. 4 is a diagram illustrating the determination of coordinates by a cellular social networking subnetwork in an embodiment of the present application;
fig. 5 is a schematic diagram of a cellular social relationship network according to an embodiment of the present application;
fig. 6 is another diagram of a cellular social relationship network in an embodiment of the present application;
fig. 7 is a block diagram schematically illustrating a structure of a server according to an embodiment of the present disclosure.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The flow diagrams depicted in the figures are merely illustrative and do not necessarily include all of the elements and operations/steps, nor do they necessarily have to be performed in the order depicted. For example, some operations/steps may be decomposed, combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
The embodiment of the application provides a social relationship query method, a server and a computer readable storage medium. The social relationship query method may be applied to a server, and the server may be a single server or a server cluster formed by a plurality of servers, which is not specifically limited in this application. In some embodiments, the social relationship query method may be applied to a terminal device, where the terminal device may be a terminal device such as a mobile phone, a tablet computer, a notebook computer, a desktop computer, and a personal digital assistant, for example, when the terminal device is a desktop computer, the desktop computer establishes a cellular social relationship network according to social relationship data of each of a plurality of target people; acquiring a social relationship query request sent by terminal equipment, wherein the social relationship query request carries an identity of a person to be queried; determining the position coordinates of the person to be inquired in the honeycomb social relationship network according to the identity of the person to be inquired; and inquiring the social relationship of the person to be inquired in the honeycomb social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment.
Some embodiments of the present application will be described in detail below with reference to the accompanying drawings. The embodiments described below and the features of the embodiments can be combined with each other without conflict.
Referring to fig. 1, fig. 1 is a schematic flowchart illustrating steps of a social relationship query method according to an embodiment of the present disclosure.
As shown in fig. 1, the social relationship query method includes steps S101 to S104.
Step S101, according to the social relationship data of each target person in a plurality of target persons, a honeycomb type social relationship network is established.
The cellular social relationship network comprises cellular social relationship sub-networks corresponding to the target persons, and the heights of different cellular social relationship sub-networks in the cellular social relationship network are different.
Illustratively, the cellular social relationship network includes a cellular social relationship subnetwork 1 corresponding to the target person 1, a cellular social relationship subnetwork 2 corresponding to the target person 2, a cellular social relationship subnetwork 3 corresponding to the target person 3, and a cellular social relationship subnetwork 4 corresponding to the target person 4, when the cellular social relationship subnetwork 1 corresponding to the target person 1 and the cellular social relationship subnetwork 2 corresponding to the target person 2 have an associated hexagon, the cellular social relationship subnetwork 1 and the cellular social relationship subnetwork 2 are connected by the associated hexagon, and the height of the cellular social relationship subnetwork 1 can be set to 1, the cellular social relationship subnetwork 2 can be set, and of course, the heights of the cellular social relationship subnetwork 1 and the cellular social relationship subnetwork 2 can also be set to other heights, similarly, the heights of the cellular social relationship subnetwork 3 corresponding to the target person 3 and the cellular social relationship subnetwork 4 corresponding to the target person 4 may be set.
In one embodiment, as shown in fig. 2, step S101 includes sub-step S1011 to sub-step S1013.
And a substep S1011, establishing a cellular social relationship sub-network of each target person according to the social relationship data of each target person.
Exemplarily, according to the social relationship data of the target person, determining the social relationship depth between the target person and the associated person of the target person; according to the social relation depth, outward diffusing and arranging a regular hexagon corresponding to each related person by taking a target person as a center to generate a corresponding honeycomb social relation sub-network; and setting the position coordinates of each regular hexagon in the cellular social relation sub-network according to the network level of each regular hexagon in the cellular social relation sub-network. Similarly, the cellular social relationship sub-networks corresponding to the rest of the target persons can be established and obtained in the same manner, so that the cellular social relationship sub-network of each target person is obtained.
In one embodiment, according to the social relationship data of the target person, the manner of determining the social relationship depth between the target person and the associated person of the target person may be: the method comprises the steps of obtaining identity information of a target person, obtaining information of persons related to the target person according to the identity information of the target person, and determining social relations and social relation depths of the target person and the related persons according to the identity information of the target person and the information of the related persons. The social relationship comprises family relationship, friend relationship, coworker relationship, customer relationship, net friend relationship and the like, the social relationship depth is used for describing the intimacy degree between the associated personnel and the target personnel, the higher the intimacy degree is, the higher the social relationship depth is, for example, the social relationship comprises family relationship, friend relationship, coworker relationship, customer relationship and net friend relationship, and the social relationship depth is the family relationship, friend relationship, coworker relationship, customer relationship and net friend relationship from high to low in sequence.
The higher the social relationship depth is, the closer the regular hexagon corresponding to the related person is to the central regular hexagon and the smaller the number of the regular hexagon is, and conversely, the lower the social relationship depth is, the farther the regular hexagon corresponding to the related person is from the central regular hexagon and the larger the number of the regular hexagon is. The number of regular hexagons corresponding to the associated persons that can be arranged in each network layer of the cellular social relationship subnetwork is (N-1) × 6, that is, the first layer of the cellular social relationship subnetwork only includes a central regular hexagon, and the second layer of the cellular social relationship subnetwork can arrange the regular hexagons corresponding to the 6 associated persons.
Illustratively, target person a includes 18 associated persons, and since the first level of the cellular social relationship subnetwork includes only the central regular hexagon, the second level is capable of arranging 6 associated persons, and the third level is capable of arranging 12 associated persons, target person a cellular social relationship subnetwork includes three network levels. As shown in fig. 3, the regular hexagons corresponding to each related person are arranged in a regular hexagonal outward diffusion manner with the target person a as the center, so that a regular hexagon corresponding to the related person B, a regular hexagon corresponding to the related person C, a regular hexagon corresponding to the related person D, a regular hexagon corresponding to the related person E, and a regular hexagon corresponding to the related person F on the second floor can be obtained.
After the second layer is completely arranged, regular hexagons corresponding to the associated person are arranged from the third layer, and further, a regular hexagon corresponding to the associated person 1, a regular hexagon corresponding to the associated person 2, a regular hexagon corresponding to the associated person 3, a regular hexagon corresponding to the associated person 4, a regular hexagon corresponding to the associated person 5, a regular hexagon corresponding to the associated person 6, a regular hexagon corresponding to the associated person 7, a regular hexagon corresponding to the associated person 8, a regular hexagon corresponding to the associated person 9, a regular hexagon corresponding to the associated person 10, a regular hexagon corresponding to the associated person 11, and a regular hexagon corresponding to the associated person 12 are obtained, and finally, a honeycomb social relationship sub-network centered on the target person a is obtained.
In an embodiment, at least one side of the central regular hexagon overlaps with one side of the regular hexagon corresponding to the associated person, the area of the central regular hexagon is the same as that of the regular hexagon corresponding to the associated person, and the area of the regular hexagon corresponding to each associated person is the same.
In an embodiment, according to the network hierarchy of each regular hexagon in the cellular social relationship subnetwork, the position coordinates of each regular hexagon in the cellular social relationship subnetwork may be set by: acquiring the target position coordinates of the central regular hexagon in the honeycomb social relationship sub-network and the side length of the central regular hexagon; and setting the position coordinates of each regular hexagon in the cellular social relation subnetwork according to the target position coordinates, the side length and the network hierarchy of each regular hexagon. The target position coordinate of the central regular hexagon in the cellular social relationship sub-network is the position coordinate of the center of the central regular hexagon in the cellular social relationship sub-network.
For example, according to the target position coordinate, the side length, and the network hierarchy of each regular hexagon, the position coordinate of each regular hexagon in the cellular social relationship subnetwork may be set by: establishing a rectangular coordinate system by taking the target position coordinates as an origin, and determining a coordinate quadrant of the center of each regular hexagon under the rectangular coordinate system; and setting the position coordinates of each regular hexagon in the honeycomb social relation subnetwork according to the coordinate quadrant, the network level and the side length of the center of each regular hexagon under the rectangular coordinate system.
In one embodiment, the network level of the regular hexagon corresponding to the associated person is determined, the center of the regular hexagon corresponding to the associated person and the angle of the central regular hexagon connecting line relative to the coordinate axis are obtained, and the position coordinates of each regular hexagon in the honeycomb social relationship sub-network are set according to the quadrant of the regular hexagon corresponding to the associated person, the network level and the angle relative to the coordinate axis.
For example, as shown in fig. 4, a rectangular coordinate system is established with the center of a central regular hexagon, and the side length of the central regular hexagon is set to be 1, so that the regular hexagon corresponding to the related person BHas the coordinates of
The coordinate of the regular hexagon corresponding to the related person C is
The coordinate of the regular hexagon corresponding to the related person D is
The coordinate of the regular hexagon corresponding to the related person E is
Coordinates of regular hexagon corresponding to related person F
Coordinates of regular hexagon corresponding to related person G
Similarly, the coordinates of the regular hexagon corresponding to the associated people at other levels of the cellular social relationship subnetwork may also be set according to the above method, which is not described herein again.
And a substep S1012, determining the social relationship between each target person according to the social relationship data of each target person.
The social relationship comprises family relationship, friend relationship, colleague relationship, customer relationship and net friend relationship.
And a substep S1013 of connecting each cellular social relationship sub-network according to the social relationship between each target person to obtain a cellular social relationship network.
In one embodiment, the association regular hexagon between each honeycomb social relationship sub-network is determined according to the social relationship between each target person; and connecting each cellular social relation sub-network according to the associated regular hexagon among each cellular social relation sub-network to obtain the cellular social relation network. Wherein the associated regular hexagon comprises one or more. The honeycomb social relationship sub-networks are connected through the associated regular hexagons among the honeycomb social relationship sub-networks, and a height is set for each honeycomb social relationship sub-network, so that the honeycomb social relationship network is obtained, and the accuracy of building the honeycomb social relationship network is improved.
Illustratively, as shown in fig. 5, a cellular social relationship subnetwork a established with target person 1 as the center includes target person 1, target person 2, target person 3, target person 4, target person 5, target person 6, target person 7, target person 8, and target person 9 (the remaining other target persons are not labeled), the cellular social relationship subnetwork B established with the target person 8 as the center includes the target person 8, the target person 10, the target person 11, the target person 12, the target person 13, the target person 14, and the target person 15 (the remaining other target persons are not shown), cellular social relationship subnetwork C, which is established with target person 9 as a center, includes target person 9, target person 16, target person 17, target person 18, target person 19, target person 20, and target person 21 (the remaining other target persons are not labeled).
As can be seen from fig. 5, the regular hexagons corresponding to the target person 8 in the cellular social relationship subnetwork a and the cellular social relationship subnetwork B are associated regular hexagons, the cellular social relationship sub-network a and the cellular social relationship sub-network B are connected by the regular hexagon corresponding to the target person 8, and sets the height of cellular social relationship subnetwork a to 1 and the height of cellular social relationship subnetwork B to 2, as can be seen from fig. 5, the regular hexagons corresponding to the target person 9 in the cellular social relationship subnetwork a and the cellular social relationship subnetwork C are associated regular hexagons, the cellular social relationship sub-network a and the cellular social relationship sub-network C are connected by the regular hexagon corresponding to the target person 9, and setting the height of the cellular social relationship subnetwork C to be 3 to obtain the cellular social relationship network.
For another example, as shown in fig. 6, a cellular social relationship subnetwork D established with the target person 1 as the center includes a target person 1, a target person 2, a target person 3, a target person 4, a target person 5, a target person 6, a target person 7, and a target person 8 (the remaining other target persons are not shown), the cellular social relationship subnetwork E established with the target person 8 as the center includes the target person 8, the target person 10, the target person 11, the target person 12, the target person 13, the target person 14, and the target person 15 (the remaining other target persons are not shown), cellular social relationship subnetwork F, which is established with target person 15 as a center, includes target person 15, target person 16, target person 17, target person 18, target person 19, target person 20, and target person 21 (the remaining other target persons are not labeled).
As can be seen from fig. 6, the regular hexagons corresponding to the target person 8 in the cellular social relationship subnetwork D and the cellular social relationship subnetwork E are associated regular hexagons, the cellular social relationship subnetwork D and the cellular social relationship subnetwork E are connected by the regular hexagon corresponding to the target person 8, and sets the height of the cellular social relationship subnetwork D to 1 and the height of the cellular social relationship subnetwork E to 2, as can be seen from fig. 6, the regular hexagons corresponding to the target person 15 in the cellular social relationship subnetwork E and the cellular social relationship subnetwork F are associated regular hexagons, the cellular social relationship subnetwork E and the cellular social relationship subnetwork F are connected by the regular hexagon corresponding to the target person 15, and setting the height of the cellular social relationship sub-network F to be 3 to obtain the cellular social relationship network.
The height setting of the cellular social relationship subnetwork can be set according to actual conditions, and the present application is not particularly limited to this. The connection relationships between cellular social relationship subnetworks are not limited to the two connection relationships described above, and in some embodiments, each regular hexagon in a cellular social relationship subnetwork may serve as a central regular hexagon of the other cellular social relationship subnetwork, and thus each regular hexagon may be connected to the other cellular social relationship subnetwork.
Step S102, a social relationship query request sent by the terminal equipment is obtained, wherein the social relationship query request carries the identity of the person to be queried.
The identity is information for proving the identity of the target person, and the identity can be set according to actual conditions, which is not specifically limited in the present application, for example, the identity may be an identification number.
And receiving a social relationship query request generated by the terminal equipment to obtain the social relationship query request. The terminal device may be determined according to actual conditions, which is not specifically limited in this application, and for example, the terminal device may be a mobile phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant, and the like.
Step S103, determining the position coordinates of the person to be inquired in the honeycomb social relationship network according to the identity of the person to be inquired.
And acquiring a mapping relation table between a preset identity and a position coordinate in the cellular social relation network, and determining the position coordinate of the person to be inquired in the cellular social relation network according to the identity of the person to be inquired and the mapping relation table. The mapping relation table is a mapping relation table established in advance according to the identity and the position coordinate, and the mapping relation table can be established according to actual conditions, which is not specifically limited in the present application. The position coordinates of the person to be inquired can be quickly inquired through the mapping relation table, and the social relation inquiring efficiency is greatly improved.
And step S104, inquiring the social relationship of the person to be inquired in the honeycomb social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment.
The social relationship query request carries the identity identifications of at least two persons to be queried.
In an embodiment, according to the identities of at least two persons to be queried, the identities of the at least two persons to be queried are queried in a mapping relation table between a preset identity and a position coordinate in a cellular social relationship network, so as to obtain the position coordinates of the at least two persons to be queried in the cellular social relationship network. And inputting the position coordinates of the at least two to-be-inquired persons in the honeycomb social relationship network into the honeycomb social relationship network to obtain the social relationship of the to-be-inquired persons, and generating the inquired social relationship to the terminal equipment. The position coordinates of the person to be inquired can be rapidly obtained through the identity of the person to be inquired and according to the identity, the social relationship of the person to be inquired can be determined according to the position coordinates of the person to be inquired, and the accuracy of inquiring the social relationship of the person to be inquired is greatly improved.
In the social relationship query method provided in the above embodiment, a cellular social relationship network is established according to social relationship data of each of a plurality of target persons; when a social relationship query request sent by terminal equipment is obtained, wherein the social relationship query request carries an identity of a person to be queried; then, according to the identity of the person to be inquired, determining the position coordinates of the person to be inquired in the honeycomb social relationship network; and then inquiring the social relationship of the person to be inquired in the cellular social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment. According to the scheme, the honeycomb social relationship network is established firstly, and when a social relationship query request is received, the social relationship of the person to be queried is queried in the honeycomb social relationship network according to the position coordinate of the person to be queried, so that the accuracy of social relationship management and the convenience and accuracy of the social relationship of the querying person are greatly improved.
Referring to fig. 7, fig. 7 is a schematic block diagram of a server according to an embodiment of the present disclosure.
As shown in fig. 7, the server 200 includes a processor 202 and a memory 203 connected by a system bus 201, wherein the memory 203 may include a nonvolatile storage medium and an internal memory.
The non-volatile storage medium may store a computer program. The computer program includes program instructions that, when executed, cause a processor to perform any of the social relationship querying methods.
The internal memory provides an environment for running a computer program in the non-volatile storage medium, and the computer program, when executed by the processor, causes the processor to execute any one of the social relationship query methods.
Those skilled in the art will appreciate that the architecture shown in fig. 7 is a block diagram of only a portion of the architecture associated with the subject application, and does not constitute a limitation on the servers to which the subject application applies, as a particular server may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
It should be understood that the bus 201 is, for example, an I2C (Inter-Integrated Circuit) bus, the Memory 203 may be a Flash chip, a Read-Only Memory (ROM), a magnetic disk, an optical disk, a usb disk, or a removable hard disk, the Processor 202 may be a Central Processing Unit (CPU), and the Processor may also be other general-purpose processors, Digital Signal Processors (DSP), Application Specific Integrated Circuits (ASIC), Field Programmable Gate Arrays (FPGA) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, or the like. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Wherein, in one embodiment, the processor is configured to execute a computer program stored in the memory to implement the steps of:
establishing a cellular social relationship network according to social relationship data of each of a plurality of target persons;
acquiring a social relationship query request sent by terminal equipment, wherein the social relationship query request carries an identity of a person to be queried;
determining the position coordinates of the person to be inquired in the honeycomb social relationship network according to the identity of the person to be inquired;
and inquiring the social relationship of the person to be inquired in the honeycomb social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment.
In one embodiment, the cellular social relationship network includes a cellular social relationship subnetwork corresponding to each of the target persons, and different cellular social relationship subnetworks have different heights in the cellular social relationship network.
In one embodiment, the processor, in implementing the establishing a cellular social relationship network based on social relationship data for each of a plurality of target people, is configured to implement:
establishing a honeycomb social relationship sub-network of each target person according to the social relationship data of each target person;
determining the social relationship between each target person according to the social relationship data of each target person;
and connecting each honeycomb social relationship sub-network according to the social relationship among the target persons to obtain a honeycomb social relationship network.
In one embodiment, the processor, in implementing the establishing of the cellular social relationship subnetwork for each of the target persons according to the social relationship data of each of the target persons, is configured to implement:
determining social relation depth between the target person and the associated person of the target person according to the social relation data of the target person;
according to the social relation depth, outward diffusing and arranging a regular hexagon corresponding to each associated person by taking the target person as a center regular hexagon to generate a corresponding honeycomb social relation sub-network;
and setting the position coordinates of each regular hexagon in the cellular social relation sub-network according to the network level of each regular hexagon in the cellular social relation sub-network.
In one embodiment, at least one side of the central regular hexagon overlaps with one side of the regular hexagon corresponding to the associated person, and the area of the central regular hexagon is the same as that of the regular hexagon corresponding to the associated person.
In one embodiment, the processor, in implementing the setting of the position coordinate of each regular hexagon in the cellular social relationship sub-network according to the network hierarchy of each regular hexagon in the cellular social relationship sub-network, is configured to implement:
acquiring the target position coordinates of the central regular hexagon in the honeycomb social relationship sub-network and the side length of the central regular hexagon;
and setting the position coordinates of each regular hexagon in the cellular social relation subnetwork according to the target position coordinates, the side length and the network hierarchy of each regular hexagon.
In one embodiment, the processor, when implementing the connecting of each cellular social relationship subnetwork according to the social relationship between each target person to obtain a cellular social relationship network, is configured to implement:
determining an associated regular hexagon between each honeycomb social relationship sub-network according to the social relationship between each target person;
and connecting each cellular social relation sub-network according to the associated regular hexagon among the cellular social relation sub-networks to obtain the cellular social relation network.
In one embodiment, when the social relationship query request is implemented to carry the identifiers of at least two persons to be queried and the position coordinates of the persons to be queried in the cellular social relationship network are determined according to the identifiers of the persons to be queried, the processor is configured to implement:
determining the position coordinates of the at least two persons to be inquired in the honeycomb social relationship network according to the identity marks of the at least two persons to be inquired;
the inquiring the social relationship of the person to be inquired in the honeycomb social relationship network according to the position coordinates of the person to be inquired comprises the following steps:
and determining the social relationship between the at least two persons to be inquired according to the position coordinates of the at least two persons to be inquired in the honeycomb social relationship network.
It should be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the server described above may refer to the corresponding process in the foregoing social relationship query method embodiment, and details are not described herein again.
Embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, where the computer program includes program instructions, and a method implemented when the program instructions are executed may refer to the embodiments of the social relationship query method in the present application.
The computer-readable storage medium may be an internal storage unit of the server according to the foregoing embodiment, for example, a hard disk or a memory of the server. The computer readable storage medium may also be an external storage device of the server, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the server.
It is to be understood that the terminology used in the description of the present application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of the present application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should also be understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items. It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments. While the invention has been described with reference to specific embodiments, the scope of the invention is not limited thereto, and those skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A social relationship query method, comprising:
establishing a cellular social relationship network according to social relationship data of each of a plurality of target persons;
acquiring a social relationship query request sent by terminal equipment, wherein the social relationship query request carries an identity of a person to be queried;
determining the position coordinates of the person to be inquired in the honeycomb social relationship network according to the identity of the person to be inquired;
and inquiring the social relationship of the person to be inquired in the honeycomb social relationship network according to the position coordinates of the person to be inquired, and sending the social relationship to the terminal equipment.
2. The social relationship query method of claim 1, wherein the cellular social relationship network comprises a cellular social relationship subnetwork corresponding to each of the target persons, and heights of different cellular social relationship subnetworks in the cellular social relationship network are different.
3. The social relationship query method of claim 1, wherein the establishing a cellular social relationship network based on the social relationship data of each of a plurality of target people comprises:
establishing a honeycomb social relationship sub-network of each target person according to the social relationship data of each target person;
determining the social relationship between each target person according to the social relationship data of each target person;
and connecting each honeycomb social relationship sub-network according to the social relationship among the target persons to obtain a honeycomb social relationship network.
4. The social relationship query method of claim 3, wherein the establishing a cellular social relationship subnetwork for each of the target persons according to the social relationship data of each of the target persons comprises:
determining social relation depth between the target person and the associated person of the target person according to the social relation data of the target person;
according to the social relation depth, outward diffusing and arranging a regular hexagon corresponding to each associated person by taking the target person as a center regular hexagon to generate a corresponding honeycomb social relation sub-network;
and setting the position coordinates of each regular hexagon in the cellular social relation sub-network according to the network level of each regular hexagon in the cellular social relation sub-network.
5. The social relationship query method of claim 4, wherein at least one side of the central regular hexagon overlaps with one side of a regular hexagon corresponding to the associated person, and the central regular hexagon has the same area as the regular hexagon corresponding to the associated person.
6. The social relationship query method of claim 4, wherein the setting the position coordinates of each regular hexagon in the cellular social relationship sub-network according to the network level of each regular hexagon in the cellular social relationship sub-network comprises:
acquiring the target position coordinates of the central regular hexagon in the honeycomb social relationship sub-network and the side length of the central regular hexagon;
and setting the position coordinates of each regular hexagon in the cellular social relation subnetwork according to the target position coordinates, the side length and the network hierarchy of each regular hexagon.
7. The social relationship query method of claim 3, wherein the connecting each cellular social relationship subnetwork according to the social relationship between each target person to obtain a cellular social relationship network comprises:
determining an associated regular hexagon between each honeycomb social relationship sub-network according to the social relationship between each target person;
and connecting each cellular social relation sub-network according to the associated regular hexagon among the cellular social relation sub-networks to obtain the cellular social relation network.
8. The social relationship query method according to any one of claims 1 to 6, wherein the social relationship query request carries identities of at least two persons to be queried, and the determining the location coordinates of the persons to be queried in the cellular social relationship network according to the identities of the persons to be queried comprises:
determining the position coordinates of the at least two persons to be inquired in the honeycomb social relationship network according to the identity marks of the at least two persons to be inquired;
the inquiring the social relationship of the person to be inquired in the honeycomb social relationship network according to the position coordinates of the person to be inquired comprises the following steps:
and determining the social relationship between the at least two persons to be inquired according to the position coordinates of the at least two persons to be inquired in the honeycomb social relationship network.
9. A server, characterized in that the server comprises a processor, a memory, and a computer program stored on the memory and executable by the processor, wherein the computer program, when executed by the processor, implements the steps of the social relationship querying method according to any one of claims 1 to 8.
10. A computer-readable storage medium, having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the social relationship query method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011296616.XA CN112287245A (en) | 2020-11-18 | 2020-11-18 | Social relationship query method, server and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011296616.XA CN112287245A (en) | 2020-11-18 | 2020-11-18 | Social relationship query method, server and computer-readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112287245A true CN112287245A (en) | 2021-01-29 |
Family
ID=74397988
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011296616.XA Pending CN112287245A (en) | 2020-11-18 | 2020-11-18 | Social relationship query method, server and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112287245A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115048406A (en) * | 2022-08-16 | 2022-09-13 | 北京虹鳟在线科技有限公司 | Associated person data information query method based on multi-party credible graph computing technology |
-
2020
- 2020-11-18 CN CN202011296616.XA patent/CN112287245A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115048406A (en) * | 2022-08-16 | 2022-09-13 | 北京虹鳟在线科技有限公司 | Associated person data information query method based on multi-party credible graph computing technology |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9654577B2 (en) | Techniques to generate mass push notifications | |
| TWI694700B (en) | Data processing method and device, user terminal | |
| CN109684093B (en) | Data processing method and system | |
| WO2017045450A1 (en) | Resource operation processing method and device | |
| CN107465687B (en) | Method, device and terminal for realizing permission configuration | |
| AU2017268599A1 (en) | Method, device, server and storage medium of searching a group based on social network | |
| CN111177776A (en) | Multi-tenant data isolation method and system | |
| WO2023051235A1 (en) | Threat intelligence big data sharing method and system | |
| CN112287245A (en) | Social relationship query method, server and computer-readable storage medium | |
| CN114240344A (en) | Enterprise personnel data processing method and device, computer equipment and storage medium | |
| CN110874365B (en) | Information query method and related equipment thereof | |
| CN110580312B (en) | Data query method, device and computer readable storage medium | |
| CN111865701A (en) | Asset determination method and device, electronic equipment and storage medium | |
| CN112583761B (en) | Management method and device of security entity, computer equipment and storage medium | |
| CN110837499A (en) | Data access processing method and device, electronic equipment and storage medium | |
| CN110888901B (en) | System management method, device, computer equipment and storage medium | |
| CN112217849B (en) | Task scheduling method, system and computer equipment in SD-WAN system | |
| CN114254278A (en) | User account merging method and device, computer equipment and storage medium | |
| CN113704309A (en) | Graph data processing method and device, computer equipment and storage medium | |
| CN109325057B (en) | Middleware management method, device, computer equipment and storage medium | |
| CN111488362A (en) | Resource information query method, system, equipment and medium of server | |
| CN111291136B (en) | Identification association relation processing method, device, computer equipment and storage medium | |
| TWI804949B (en) | Method for automatically activating account, electronic device and computer storage medium | |
| CN115914361B (en) | Method, device, computer equipment and storage medium for obtaining information of block chain | |
| CN117041980B (en) | Network element management method and device, storage medium and electronic equipment |
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 |