CN110989944A

CN110989944A - Family tree printing method and device

Info

Publication number: CN110989944A
Application number: CN201911167599.7A
Authority: CN
Inventors: 吴信东; 盛绍静; 卜晨阳; 周鹏
Original assignee: Hefei University of Technology
Current assignee: Hefei University of Technology
Priority date: 2019-10-11
Filing date: 2019-11-25
Publication date: 2020-04-10
Anticipated expiration: 2039-11-25
Also published as: CN110989944B

Abstract

The invention discloses a family tree printing method and device. Wherein, the method comprises the following steps: acquiring all family tree data of a target family tree to be printed, wherein the target family tree is a family tree stored in a graph database, family tree characters in the target family tree are indicated by nodes in the graph database, and the relationship between the family tree characters is indicated by directed edges between the nodes; receiving a family tree printing request, wherein the family tree printing request carries printing parameters of a printing target family tree; extracting family tree output data corresponding to the printing parameters from all the family tree data; and sending the printing link corresponding to the pedigree output data to the target terminal. The invention solves the storage problem of the data of the mass family tree and the technical problem that the user can not print the family tree in a personalized way in the related technology, processes the error of the data of the family tree caused by improper operation and ensures the completeness, effectiveness and correctness of the printing result of the family tree.

Description

Family tree printing method and device

Technical Field

The invention relates to the technical field of data printing, in particular to a family tree printing method and device.

Background

In the related art, after the family tree is built, when family tree data is stored, the traditional family tree data is mainly stored in a relational database such as MySql, and the query, processing and analysis performance of mass family tree data is poor. Meanwhile, the traditional family tree data storage is manually input, so that time and labor are consumed, and the correctness of data processing cannot be guaranteed. Moreover, the traditional family tree printing method is to convert the stored family tree data into a document after the construction of the family tree is completed, and the printing mode has various defects: a, the family tree building period is long, the number of people participating in building the family tree is large, the progress of work development is difficult to master anytime and anywhere by a family tree building core member, and wrong family tree data are difficult to correct in time; b, in the family tree revision process, the family tree revision member cannot check the correctness of the stored data in real time, and if the wrong family tree data cannot be processed in the on-line family tree printing process, the final printed family tree is bound to have errors; c, the family tree printing scheme is difficult to adjust according to the requirements of the user.

In view of the above problems, no effective solution has been proposed.

Disclosure of Invention

The embodiment of the invention provides a family tree printing method and device, which are used for at least solving the technical problems that in the related technology, the data of a large amount of family trees are stored and the family tree cannot be printed individually by a user.

According to an aspect of an embodiment of the present invention, there is provided a family tree printing method including: acquiring all family tree data of a target family tree to be printed, wherein the target family tree is a family tree stored in a graph database, the graph database indicates family tree characters in the target family tree by nodes, and indicates the relationship between the family tree characters by directed edges between the nodes; receiving a family tree printing request, wherein the family tree printing request carries printing parameters for printing the target family tree; extracting family tree output data corresponding to the printing parameters from all the family tree data; and sending the printing link corresponding to the pedigree output data to a target terminal.

Optionally, after acquiring all family tree data of the target family tree to be printed, the family tree printing method further includes: determining a data import scheme; importing the family tree data of the target family tree into the graphic database based on the data import scheme; determining each pedigree character of the target pedigree, the relationship between the pedigree characters and attribute values corresponding to the relationship between each pedigree character and the pedigree character; setting a node for each family tree character, setting a directed edge for the relationship between the family tree characters, and attaching the attribute value to the periphery of the node and the directed edge; and constructing a graphical family tree based on the nodes, the directed edges and the attribute values, wherein family tree data of the graphical family tree is stored in the graphical database.

Optionally, after receiving the family tree printing request, the family tree printing method further includes: analyzing the pedigree printing request to determine a printing type and printing information, wherein the printing type at least comprises: pedigree and pedigree, the printed information including at least one of: printing a pedigree name, printing a pedigree subheader, printing a ancestor character, printing a beginning algebra of the ancestor, printing an offspring algebra, and printing an associated character; determining the printing parameters based on the printing type and the printing information.

Optionally, the step of determining the print type and the print information comprises: when the printing type is a pedigree graph, determining a pedigree graph of the target pedigree; when the printing type is the family tree, determining all information of the designated family tree character of the target family tree; the determining of the starting generation number of the printing ancestor in the printing information includes: if the starting algebra is not indicated, defaulting the starting algebra to be the first generation in the target family tree; or if an algebraic number is received, taking the algebraic number as the starting algebraic number; or if the pedigree ancestor name is received, taking an ancestor algebra corresponding to the pedigree ancestor name indication ancestor as the starting algebra; the determining of the generation number of the subsequent generations printed in the printing information includes: if the printed descendant algebra are all descendants, printing and outputting all descendant pedigree characters by taking the starting algebra of the printing ancestor as a start; or if the printing generation number is the designated generation number N, printing all the pedigree characters of the N generations downwards by taking the starting generation number of the printing ancestor as the start.

Optionally, before extracting the pedigree output data corresponding to the printing parameter from the all pedigree data, the pedigree printing method further includes: when the printing type is a pedigree diagram, saving the printing ancestor characters in a first printing queue; marking out a queue from a queue head element in the first printing queue, and assigning a value to a query root node; inquiring the family tree of the target family tree based on the inquiry root node, wherein the family tree is decomposed into a plurality of family subtrees with the depth of n in advance, the inquiry root node is a starting root node, the family subtrees with the depth of n are inquired recursively, leaf nodes of children of the family subtrees are stored in a printing queue, and the nodes are taken out from the printing queue to serve as the root nodes of the next family tree subtree; recursively inquiring all child nodes taking root nodes as initial inquiry points in each family tree subtree; determining child node attribute values and special child node relationship types corresponding to each child node, wherein the child node attribute values at least comprise: ancestors, family ranks, parent names, the special child node relationship types at least include: relation between child rearing, child generation and waiting for examination; and outputting all family tree sub-tree information.

Optionally, the step of extracting the family tree output data corresponding to the printing parameter from the all family tree data includes: when the printing type is the family tree, storing the printing ancestor characters in a second printing queue; marking out a queue from the first queue element in the second printing queue, and assigning a value to a query root node; determining the figure information, spouse information and child information of the current pedigree figure based on the query root node; and taking the character information, the spouse information and the child information of all current family tree characters as family tree output information.

Optionally, the step of determining the persona information, spouse information and child information of the current pedigree persona based on the query root node includes: determining the persona information of the current pedigree persona comprises: determining a person basic attribute value of the current pedigree person, wherein the person basic attribute value comprises at least one of the following values: name, word, number, date of birth, date of death; filtering the null attribute value and the repeated semantic attribute value by using the character judgment statement; storing the character attribute name and the attribute value of the current family tree character to an attribute array; determining the spouse information of the current pedigree character comprises: determining the number of spouses of the current pedigree character and basic information of each spouse, wherein the basic information comprises at least one of the following: name, date of birth and date of death; storing the basic information of each spouse to the attribute array; determining the child information of the current pedigree character comprises: determining the number of children and the character information of each child of the current pedigree character; all the child information which is not empty is stored in the attribute array; and storing the information in the attribute array in a target array corresponding to the current pedigree character.

Optionally, after extracting the family tree output data corresponding to the printing parameter from the all family tree data, the family tree printing method further includes: creating a blank output file; inputting the printing information to the blank output file, wherein the printing information at least comprises: family tree name and family tree printing date; inputting pedigree description information into the blank output file, wherein the pedigree description information comprises at least one of the following information: family tree number information printing, ancestor character printing, ancestor starting algebra printing, descendant algebra printing, annotation printing and family tree printing date; if the printing type is a pedigree graph, inputting all pedigree subtrees to the blank output file, wherein preset characters are used for segmenting each pedigree subtree; if the printing type is the family tree, inputting all stored family tree character information into the blank output file, wherein each piece of family tree character information is divided by using preset characters; after all data are input into the blank output file, obtaining a print output file; and generating a file link corresponding to the printout file.

Optionally, after extracting the family tree output data corresponding to the printing parameter from the all family tree data, the family tree printing method further includes: judging whether error data exist in the family tree output data or not; if the pedigree output data has error data, judging whether a daughter meeting a first error relationship exists in a daughter array corresponding to pedigree characters and child information in the error data, or judging whether a daughter meeting a second error relationship exists in the pedigree characters and the daughter array in the error data, or judging whether a child meeting a third error relationship exists in the pedigree characters and the daughter data in the error data, or judging whether a character with the same ID as the pedigree character exists in the daughter array in the error data, wherein the first error relationship is that a father-daughter relationship is established in a father-daughter relationship in the family tree daughter-in-law relationship, the second error relationship is that a mother-daughter relationship is established in a mother-daughter relationship, and the third error relationship is that a plurality of son-daughter directed edges and daughter directed edges are repeatedly established; if the child array corresponding to the pedigree characters and the child information in the error data has a daughter meeting a first error relationship, or if the pedigree characters and the child array in the error data have a daughter meeting a second error relationship, deleting the character information corresponding to the daughter from the child array; if the pedigree figures in the error data and children data have children meeting a third error relationship, deleting corresponding child information of the children from the child array; and if the character with the same identification as the family character exists in the child array in the error data, deleting the character.

According to another aspect of the embodiments of the present invention, there is also provided a family tree printing apparatus including: the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring all family tree data of a target family tree to be printed, the target family tree is a family tree stored in a graph database, family tree characters in the target family tree are indicated by nodes in the graph database, and the relationship between the family tree characters is indicated by directed edges between the nodes; the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a family tree printing request, and the family tree printing request carries printing parameters for printing the target family tree; an extraction unit, configured to extract the family tree output data corresponding to the printing parameter from among the all family tree data; and the sending unit is used for sending the printing link corresponding to the pedigree output data to the target terminal.

Optionally, the pedigree printing device further comprises: the system comprises a first determination unit, a second determination unit and a third determination unit, wherein the first determination unit is used for determining a data import scheme after acquiring all family tree data of a target family tree to be printed; a first importing unit, configured to import, based on the data importing scheme, the family tree data of the target family tree into the graph database; a second determination unit configured to determine each pedigree character of the target pedigree, a relationship between the pedigree characters, and an attribute value corresponding to the relationship between each pedigree character and the pedigree character; a first setting unit configured to set a node for each of the pedigree characters, set a directed edge for a relationship between the pedigree characters, and attach the attribute value around the node and the directed edge; and the first construction unit is used for constructing a graphical family tree based on the nodes, the directed edges and the attribute values, wherein family tree data of the graphical family tree is stored in the graphical database.

Optionally, the pedigree printing device further comprises: a first parsing unit, configured to parse, after receiving a family tree print request, the family tree print request to determine a print type and print information, where the print type at least includes: pedigree and pedigree, the printed information including at least one of: printing a pedigree name, printing a pedigree subheader, printing a ancestor character, printing a beginning algebra of the ancestor, printing an offspring algebra, and printing an associated character; a third determining unit configured to determine the printing parameter based on the printing type and the printing information.

Optionally, the parsing unit includes: the first determination module is used for determining a pedigree graph of the target pedigree when the printing type is the pedigree graph; the second determining module is used for determining all information of the appointed pedigree figures of the target pedigree when the printing type is the pedigree; a third determination module, configured to, when determining a starting generation number of the printing ancestor in the printing information, include: if the starting algebra is not indicated, defaulting the starting algebra to be the first generation in the target family tree; or if an algebraic number is received, taking the algebraic number as the starting algebraic number; or if the pedigree ancestor name is received, taking an ancestor algebra corresponding to the pedigree ancestor name indication ancestor as the starting algebra; the fourth determination module is used for determining the generation number of the subsequent generations printed in the printing information and comprises the following steps: if the printed descendant algebra are all descendants, printing and outputting all descendant pedigree characters by taking the starting algebra of the printing ancestor as a start; or if the printing generation number is the designated generation number N, printing all the pedigree characters of the N generations downwards by taking the starting generation number of the printing ancestor as the start.

Optionally, the pedigree printing device further comprises: the first saving unit is used for saving the printing ancestor characters into a first printing queue before extracting the pedigree output data corresponding to the printing parameters in all the pedigree data and when the printing type is a pedigree diagram; the first marking-out unit is used for marking out a queue from a queue head element in the first printing queue and assigning a query root node; the first query unit is used for querying the family tree of the target family tree based on the query root node, wherein the family tree is decomposed into a plurality of family subtrees with the depth of n in advance, the query root node is a starting root node, the family subtrees with the depth of n are queried recursively, leaf nodes of children of the family subtrees are stored in a printing queue, and the nodes are taken out from the printing queue and serve as root nodes of the next family tree; the second query unit is used for recursively querying all child nodes taking the root node as an initial query point in each family tree sub-tree; a fourth determining unit, configured to determine a child node attribute value and a special child node relationship type corresponding to each child node, where the child node attribute value at least includes: ancestors, family ranks, parent names, the special child node relationship types at least include: relation between child rearing, child generation and waiting for examination; and outputting all family tree sub-tree information.

Optionally, the extraction unit includes: the first storage module is used for storing the printing ancestor characters into a second printing queue when the printing type is the family tree; the first marking-out module is used for marking out a queue from a queue head element in the second printing queue and assigning a value to a query root node; the fifth determining module is used for determining the character information, the spouse information and the child information of the current pedigree character based on the query root node; and the sixth determining module is used for taking the character information, the spouse information and the child information of all current family tree characters as family tree output information.

Optionally, the fifth determining module includes: the first determining sub-module is used for determining the character information of the current pedigree character and comprises the following steps: determining a person basic attribute value of the current pedigree person, wherein the person basic attribute value comprises at least one of the following values: name, word, number, date of birth, date of death; filtering the null attribute value and the repeated semantic attribute value by using the character judgment statement; storing the character attribute name and the attribute value of the current family tree character to an attribute array; the second determining sub-module is used for determining the spouse information of the current pedigree character and comprises the following steps: determining the number of spouses of the current pedigree character and basic information of each spouse, wherein the basic information comprises at least one of the following: name, date of birth and date of death; storing the basic information of each spouse to the attribute array; a third determining sub-module, configured to determine child information of the current pedigree character, where the determining includes: determining the number of children and the character information of each child of the current pedigree character; all the child information which is not empty is stored in the attribute array; and storing the information in the attribute array in a target array corresponding to the current pedigree character.

Optionally, the pedigree printing device further comprises: a creating unit configured to create a blank output file after extracting the family tree output data corresponding to the printing parameter from among the all family tree data; a second input unit configured to input the print information to the blank output file, wherein the print information at least includes: family tree name and family tree printing date; a third input unit, configured to input pedigree specification information to the blank output file, where the pedigree specification information includes at least one of: family tree number information printing, ancestor character printing, ancestor starting algebra printing, descendant algebra printing, annotation printing and family tree printing date; a fourth input unit, configured to input all pedigree subtrees to the blank output file when the printing type is a pedigree graph, where each pedigree subtree is partitioned by using a preset character; a fifth input unit, configured to input all stored family tree character information into the blank output file when the print type is a family tree, where each piece of family tree character information is divided by using a preset character; a seventh determining module, configured to obtain a printout file after all data is input to the blank output file; and the first generation module is used for generating a file link corresponding to the printout file.

Optionally, the pedigree printing device further comprises: a first judging unit, configured to judge whether there is error data in the family tree output data after extracting the family tree output data corresponding to the printing parameter from among all the family tree data; a second judging unit, configured to, when there is error data in the pedigree output data, judge whether there is a daughter meeting a first error relationship in a child array corresponding to a pedigree character and child information in the error data, or judge whether there is a daughter meeting a second error relationship in the pedigree character and the child array in the error data, or judge whether there is a child meeting a third error relationship in the pedigree character and the child array in the error data, or judge whether there is a character with an ID identical to the pedigree character in the child array in the error data, where the first error relationship is to establish a father-daughter relationship with a pulsatile daughter-in-law relationship, the second error relationship is to establish a mother-daughter relationship with a mother-daughter relationship, and the third error relationship is to repeatedly establish a plurality of son-daughter connecting edges and daughter connecting edges; if the child array corresponding to the pedigree characters and the child information in the error data has a daughter meeting a first error relationship, or if the pedigree characters and the child array in the error data have a daughter meeting a second error relationship, deleting the character information corresponding to the daughter from the child array; if the pedigree figures in the error data and children data have children meeting a third error relationship, deleting corresponding child information of the children from the child array; and if the character with the same identification as the family character exists in the child array in the error data, deleting the character.

In the embodiment of the invention, all family tree data of a target family tree to be printed are acquired, wherein the target family tree is a family tree stored in a graphic database, family tree characters in the target family tree are indicated by nodes in the graphic database, the relationship between the family tree characters is indicated by the direction between the nodes, then a family tree printing request is received, wherein the printing parameters for printing the target family tree are carried in the family tree printing request, then family tree output data corresponding to the printing parameters in all the family tree data are extracted, and finally, a printing link corresponding to the family tree output data is sent to a target terminal, so that the family tree printing is completed through the target terminal. In the embodiment, the personalized family tree printing of the user can be met according to the family tree printing request, the printing mode is diversified, and the using satisfaction of the user can be improved, so that the technical problems that the data of the mass family tree is stored and the family tree cannot be printed in a personalized mode by the user in the related technology are solved.

Drawings

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:

FIG. 1 is a flow chart of an alternative pedigree printing method according to an embodiment of the invention;

FIG. 2 is a schematic diagram of an alternative pedigree character error relationship according to an embodiment of the invention;

fig. 3 is a schematic diagram of an alternative pedigree printing device according to an embodiment of the invention.

Detailed Description

In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. 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 invention.

It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

In order to facilitate the understanding of the present invention for those skilled in the art, the following explanation is provided for the meaning of some terms or nouns and characters involved in the embodiments of the present invention:

the family tree, also called as a genealogy, family tree, and parcel tree, is an important source of historical data, which records the contents of the family status, source flow of surnames, family rules, and trainings.

The pedigree in the embodiment of the invention focuses on the association analysis among the characters, the pedigree characters are represented by points, the association relation of the characters is represented by edges, and a graphic database about the pedigree is formed and better meets the storage requirement of the pedigree. The type of the graphic database is not limited in the embodiments of the present invention, and includes but is not limited to: neo4j, graphDB, etc.

According to the embodiment of the invention, the family tree data is stored by adopting the graphic database, the printing requirements of the user are received from the perspective of the user requirements, the personalized family tree printing method is provided, the family tree using requirements of different users are met, the requirements of different family tree processing formats are met by utilizing a recursion and queue method, and the personalized printing of each user is rapidly completed.

According to an embodiment of the present invention, there is provided a pedigree printing method embodiment, it should be noted that the steps shown in the flowchart of the drawings may be executed in a computer system such as a set of computer-executable instructions, and that while a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in an order different from that here.

Fig. 1 is a flowchart of an alternative pedigree printing method according to an embodiment of the present invention, as shown in fig. 1, the method includes the following steps:

step S102, acquiring all family tree data of a target family tree to be printed, wherein the target family tree is a family tree stored in a graph database, the family tree characters in the target family tree are indicated by nodes in the graph database, and the relationship between the family tree characters is indicated by directed edges between the nodes;

step S104, receiving a family tree printing request, wherein the family tree printing request carries printing parameters of a printing target family tree;

step S106, extracting family tree output data corresponding to the printing parameters from all the family tree data;

and step S108, transmitting the printing link corresponding to the pedigree output data to the target terminal.

Through the steps, all family tree data of a target family tree to be printed can be obtained, wherein the target family tree is stored in the graph database, the nodes in the graph database indicate family tree characters in the target family tree, the directed edges between the nodes indicate the relation between the family tree characters, then a family tree printing request is received, printing parameters for printing the target family tree are carried in the family tree printing request, then family tree output data corresponding to the printing parameters in all the family tree data are extracted, and finally a printing link corresponding to the family tree output data is sent to the target terminal, so that the family tree printing is completed through the target terminal. In the embodiment, the personalized family tree printing of the user can be met according to the family tree printing request, the printing mode is diversified, and the using satisfaction of the user can be improved, so that the technical problems that the data of the mass family tree is stored and the family tree cannot be printed in a personalized mode by the user in the related technology are solved.

The following will explain the embodiments of the present invention in detail with reference to the above steps.

Step S102, acquiring all family tree data of a target family tree to be printed, wherein the target family tree is a family tree stored in a graph database, nodes in the graph database indicate family tree characters in the target family tree, and directed edges between the nodes indicate relations between the family tree characters.

Optionally, after acquiring all family tree data of the target family tree to be printed, the family tree printing method further includes: determining a data import scheme; importing the family tree data of the target family tree into a graphic database based on a data import scheme; determining each family tree character of the target family tree, the relationship between the family tree characters and the attribute value corresponding to the relationship between each family tree character and the family tree character; setting nodes for each family tree character, setting directed edges for the relationship between the family tree characters, and attaching attribute values to the periphery of the nodes and the directed edges; and constructing a graphical family tree based on the nodes, the directed edges and the attribute values, wherein the family tree data of the graphical family tree is stored in a graphical database.

Before acquiring the family tree data, the embodiment of the invention stores the family tree data in various ways and stores the acquired family tree data into the system in a specified format, and the embodiment of the invention provides two schemes for realizing data storage: the method comprises the steps that firstly, batch import is conducted, namely a system provides a family tree data automatic import function, data are sorted according to a file format (WORD or EXCEL) specified by the system, and the data are imported into the system in batches; scheme II: and inputting one by one, and the user can input the family tree data such as the attributes and the relations of the family tree characters, the character relations (family relations and social relations), the character attribute values and the like one by one through a terminal interface.

When the family tree data is stored specifically, a graph database can be used, nodes are used for representing family tree characters, relationship edges between the nodes represent relationships between the family tree characters, the characters are mainly distinguished by ID values, different attributes are set for the nodes, attributes such as birth dates of the characters are stored, and different relationships between the characters are marked by the attributes.

After storing and acquiring the family tree data, a print request of the user may be received, the print request being an instruction input by the user through the terminal device.

And step S104, receiving a family tree printing request, wherein the family tree printing request carries printing parameters of a printing target family tree.

As an optional embodiment of the present invention, after receiving the request for printing the family tree, the method for printing the family tree further comprises: analyzing the family tree printing request to determine a printing type and printing information, wherein the printing type at least comprises the following steps: pedigree and family tree, the printed information includes at least one of the following: printing a pedigree name, printing a pedigree subheader, printing a ancestor character, printing a beginning algebra of the ancestor, printing an offspring algebra, and printing an associated character; based on the print type and the print information, print parameters are determined. For example, a "print setting" is set, which can select all descendants, up to a specified generation number, up to a specified descendant, and the like.

Alternatively, the step of determining the print type and the print information includes: when the printing type is a pedigree graph, determining a pedigree graph of a printing target pedigree; when the printing type is the family tree, determining all information of the designated family tree characters of the printing target family tree; the determining of the starting generation number of the printing ancestor in the printing information includes: if the starting algebra is not indicated, the default starting algebra is the first generation in the target family tree; or, if an algebraic number is received, taking the algebraic number as a starting algebraic number; or if the pedigree ancestor name is received, taking an ancestor algebra corresponding to the pedigree ancestor name indication ancestor as a starting algebra (the system defaults to 1, the system analyzes the pedigree ancestor and printing ancestor direct relation, and calculates and obtains the starting algebra of the printing ancestor); the determining of the generation number of the subsequent generations printed in the printing information includes: if the printed descendant algebra are all descendants, printing and outputting all descendant pedigree characters by taking the initial algebra of the printing ancestor as a start algebra; or if the printing descendant generation number is the designated descendant numerical value N, printing all the pedigree characters of the N generations downwards by using the starting generation number of the printing ancestor as the starting generation number; if the generation number of the printing descendants is set to the designated descendant, all the directly related characters between the printing ancestor and the designated descendant characters are printed and output.

In the embodiment of the invention, the following printing options are mainly provided according to the created family tree:

option 1: printing type selection (printType)

① pedigree map (dendrogram) printing family pedigree map;

② family tree (genealogy) printing the detailed information of family tree character;

option 2: family tree name (title): self-defining the family tree name, and defaulting to creating the family tree name;

option 3: print subtitle (subtitle): defining a family score subtitle and defaulting to be null;

option 4: printing ancestor characters (printprocessors): self-defining the family tree ancestor, and automatically prompting and complementing through a system to select and print ancestor characters;

option 5: starting generation (generation): the user-defined family tree printing ancestor starting algebra mainly comprises three options:

first, by default: the starting generation number of the printing ancestor is 1, and the printing generation is 1;

second, manual input: manually inputting the starting algebra of the printing ancestor through a terminal interface, wherein the part is input with Arabic numbers, and the printGeneration is 1, 2 and 3 …;

third, progenitor is designated: the name of the pedigree ancestor accumulator (system automatic prompt and completion) and the pedigree ancestor generation (default to 1) are input, and the starting algebra of the printing ancestor is calculated according to the input result.

Option 6: print setting (printSetting): specific options for setting the pedigree printing include: all progeny (unlimited): printing and outputting all descendant characters of the printing ancestor by taking the printing ancestor as a start; specification algebra (N): printing and outputting all the genealogy characters of the N generations downwards by taking the printing ancestor as a starting point; designated offspring (descement): the printout begins with printing all directly related characters from ancestor to descendant.

In the embodiment of the invention, after the family tree printing request is received, the acquired family tree data can be preprocessed. The pretreatment comprises the following steps 1 to 3:

step 1, data processing is carried out according to printing parameter options, and global parameters are initialized; the step 1 comprises the following steps:

step 1.1, setting option preprocessing, preprocessing the option influencing the final output of the family tree data in the printing parameters, and mainly comprising the following preprocessing modules:

the preprocessing module A acquires a family tree subtree temporary disconnection node array: initializing a subtree disconnection array disconnectrarr ═ array (), and updating the disconnectrarr;

a pre-processing module B comprising: starting algebraic preprocessing, acquiring a relation Path Path1 of 'printing ancestor' and 'designated ancestor' when the parameter option is 'designated ancestor', and when Path1 is empty, 'printing ancestor' starting algebraic is: the generation | + generation-1 is performed with Path1| + generation. Otherwise, returning prompt information: there is no direct path between the "designated ancestor" and the "printing ancestor", and the input is again confirmed! .

The preprocessing module C designates algebraic preprocessing, acquires an updated algebraic N, and divides a printing cutoff generation into N (printing generation + N-1);

the preprocessing module D is used for processing the relationship Path between the printing ancestor and the descendant, acquiring the printing person relationship Path2 when the printing setting is set as the designated descendant, saving the Path2 to the printSetting when the Path2 is not empty, and otherwise returning the prompt information: there is no direct parent-child relationship between "print ancestor" and "designated descendant," please re-enter! .

As an optional embodiment of the present invention, when processing a printing algebra, the method includes:

and (3) adjusting the value of a printing algebra by inquiring the family tree:

step 1, inputting: printing a ancestor processor, designating an algebra N, and executing the step 2;

step 2, calling a database query statement to query the largest descendant node of the printing ancestor as querydemesn (anecessor.id), and executing step 3;

step 3, if N is greater than deemestn, then N is deemestn, and step 4 is executed;

and 4, returning to N.

After the data preprocessing is completed, step 1.2 is performed.

Step 1.2, initializing a global parameter queue, comprising: defining: queue Φ, result array: result ═ array (), people statistics array: printpeoplescount ═ array (); setting a printing ancestor attribute printprocessor. Executing the step 2;

step 2, acquiring data, determining a target family tree, and querying related data in the family tree at one time by calling a batch database query statement and storing the related data in a corresponding array, such as idrar ═ queryID (genealogyID), attrArr ═ queryAttr (ideArr), fatherArr ═ queryFather (ideArr), childrenArr ═ queryChildren (ideArr), and spoueArr ═ querySpouse (ideArr); executing the step 3;

step 3, processing the selection module; print mode selection, printType ═ heavy'.

After the data preprocessing is completed, processing can be performed for two printing types of pedigree graph and pedigree graph respectively.

first, processing for pedigree maps.

As an optional embodiment of the present invention, before extracting the family tree output data corresponding to the printing parameter from all the family tree data, the family tree printing method further includes: when the printing type is the pedigree diagram, saving the printing ancestor characters in a first printing queue; marking out a queue from a first queue element in a first printing queue, and assigning a query root node; inquiring a family tree of a target family tree based on an inquiry root node, wherein the family tree is decomposed into a plurality of family subtrees with the depth of n in advance, the inquiry root node is a starting root node, the family subtrees with the depth of n are inquired recursively, leaf nodes of children of the family subtrees are stored in a printing queue, and the nodes are taken out from the printing queue to serve as root nodes of the next family tree subtree; recursively inquiring all child nodes taking the root node as an initial inquiry point in each family tree sub-tree; determining child node attribute values and special child node relationship types corresponding to each child node, wherein the child node attribute values at least comprise: generation, family ranking, parent name, special child node relationship types including at least: relation between child rearing, child generation and waiting for examination; and outputting all family tree sub-tree information.

In connection with steps 1 to 3 above, the processing of the pedigree map may be listed as step 4, which comprises steps 4.1 to 4.4, wherein,

step 4.1, storing the printAncessor in the Queue;

step 4.2, when the Queue is not empty, dequeuing the Queue head element of the Queue and assigning the dequeue value to person, and executing the step 4.3;

and 4.3, inquiring the family tree subtree for processing. This step 4.3 comprises:

step 4.3.1, initializing a current result array result2 ═ array (), a rootNode ═ person, and setting a child node recursive query condition, where start _ rank ═ person. Executing step 4.4 result2 ═ subtreeQuery (start _ rank, end _ rank, depth, rootNode, result2) to obtain the child node array with depth; step 4.3.2 is performed.

Step 4.3.2, process the subtree form, result1 ═ process treefrom (rootNode, result2), and then save 1 to result;

step 4.4, recursively inquiring the family tree subtrees: subtreeQuery (start _ rank, end _ rank, depth, rootNode, result2), the step 4.4 includes:

step 4.4.1, where start _ rank is start _ rank +1, and start _ rank is not greater than end _ rank, executing step 4.4.2, otherwise, executing step 4.4.4;

step 4.4.2, acquiring all children child 1 ═ getchild (rootNode, child nrarr) of the root node of the current graph character; when child node 1 is not empty, processing error data to obtain an updated child node array child, then making child node 1 be processchild (child node 1), setting the generation, family row and parent information of the child node array child, marking the special relationship types in the child (such as relationships to be investigated, Fahrenheit 31079, subsequent child, child-nurturing and the like), and then executing step 4.4.3;

step 4.4.3, for each child node child in child 1, whether there are still child nodes: haschildren (child), child 2 ═ subtreeQuery (start _ rank, end _ rank, depth, child, reult2), if any; saving the array child 2 as a child attribute into child, and result2 ═ child 1; if the start _ rank is equal to end _ rank, the leaf node with depth of the current subtree is continuously processed and judged; then, step 4.4.5 is performed;

step 4.4.4, result2 ═ array (), perform step 4.4.5;

step 4.4.5, return to result 2.

When the family tree character enqueue processing is realized, the child nodes of the current family tree character can be judged to be continuously printed and output according to the printing parameters; the following steps 1 to 5 are then performed.

Step 1, inputting a printType person, a child array child and a spouse array, and then executing step 2;

step 2, if the printType is equal to "dendrogram", executing step 4; otherwise, executing step 3;

step 3, firstly, processing an error relation, and processing error data to obtain an updated child array child; secondly, setting parent description information in the current child node: children, step 4 is performed;

step 4, judging whether child in child is existed in disconnectrar one by one, removing child existed in disconnectrar from child, and executing step 5;

step 5, judging whether the child continues to enqueue, wherein the method mainly comprises the following three conditions:

first, when printSetting ═ unlimited ", all child nodes in children are saved in a Queue;

secondly, when the printSetting is equal to "N", taking any child in child, and judging whether child rank is smaller than printsetting.n; if yes, all child nodes in child are stored in a Queue;

thirdly, when the printSetting is equal to "Path 2", judging whether the child and printSetting. Path2 have an intersection, and if so, storing the intersection node into the Queue.

And secondly, processing the family tree.

As an optional embodiment of the present invention, the step of extracting the family tree output data corresponding to the printing parameter from all the family tree data includes: when the printing type is the family tree, storing the printing ancestor characters in a second printing queue; marking out a queue from a queue head element in the second printing queue, and assigning a query root node; determining character information, spouse information and child information of the current pedigree character based on the query root node; and taking the character information, the spouse information and the child information of all current family tree characters as family tree output information.

Optionally, the step of determining the persona information, spouse information, and child information of the current pedigree persona based on the query root node includes: the determining of the person information of the current family tree person comprises the following steps: determining a basic character attribute value of the current family character, wherein the basic character attribute value comprises at least one of the following values: name, word, number, date of birth, date of death; filtering the null attribute value and the repeated semantic attribute value by using the character judgment statement; storing the character attribute name and the attribute value of the current family tree character to an attribute array; determining spouse information of the current pedigree character comprises: determining the number of spouses of the current pedigree character and basic information of each spouse, wherein the basic information comprises at least one of the following items: name, date of birth, and date of death (which may also include burial ground, etc., in which case, the null attribute values and repeated semantic attribute values may be filtered using the character judgment sentences as well); storing the basic information of each spouse to an attribute array; determining the child information of the current pedigree character comprises: determining the number of children and the character information of each child of the current pedigree character; all the child information which is not empty is stored in the attribute array; and storing the information in the attribute array in a target array corresponding to the current pedigree character.

In conjunction with the above steps 1 to 4, the step of processing the family tree is defined as step 5, which includes the following steps 5.1 to 5.3, wherein,

step 5.1, storing the printAncessor in the Queue,

when the Queue is not empty, dequeuing a Queue head element of the Queue and assigning the dequeue value to person, and executing the step 5.2; next, it is determined whether hasChildren (person) is true.

Step 5.2, processing information of the current person, the spouse and the children, wherein the step 5.2 comprises the following steps:

step 5.2.1, initialize basicfnfo ″, spoosenfo ″, childrennfo ″;

step 5.2.2, person information processing, basic information: basic info (person, attrArr), wherein basic attributes of people such as character characters, numbers, birth dates, and dates of death are mainly processed, and characters are used for judging a sentence to process a null attribute value and a repeated semantic attribute; unifying the character string to divide the character into commas; and finally, the attribute value of the person is expressed by' attribute name 1: attribute value 1, attribute name 2: the attribute value 2, … "is saved to basicInfo; step 5.2.3 is executed;

step 5.2.3, acquiring a child array child of the current person, namely child array child ═ getchild (person.id, child nar), a spouse array spout ═ getspout (person.id, spout ar), and acquiring an updated child array; step 5.2.4 is executed;

step 5.2.4, processing the current character spouse information, wherein the spouse information is as follows: spooseinfo ═ processspooseinfo (spout, attrArr); wherein, the basic information of each spouse (a plurality of spouses exist) is consistent with the person processing method, and the form of the spouse information is as follows: "preparing: spouse 1, spouse 2 … …, spouse 1, basicInfo, … … "; step 5.2.5 is executed;

step 5.2.5, processing the information of the current character children, wherein the information of the children: childrenInfo ═ processchildchildreninfo (children, attrArr); the format of the child information is as follows: "son: son1, son2, … …, daughter: daughter 1, daughter 2, … …, … … "was saved to childrenInfo, where all the non-empty child information is listed; step 5.3 is executed;

and 5.3, storing the character information, namely storing the basisinfo, the spouseInfo and the childrenInfo into the current character in a corresponding attribute form and storing the current character into result.

After the data processing is completed, the output data is prepared and the print link is output.

Optionally, after extracting the family tree output data corresponding to the printing parameter from all the family tree data, the family tree printing method further includes: creating a blank output file; inputting printing information to a blank output file, wherein the printing information at least comprises: family tree name and family tree printing date; inputting family tree description information into a blank output file, wherein the family tree description information comprises at least one of the following information: family tree number information printing, ancestor character printing, ancestor starting algebra printing, descendant algebra printing, annotation printing and family tree printing date; if the printing type is a pedigree graph, inputting all family tree subtrees to a blank output file, wherein each family tree subtree is divided by using preset characters; if the printing type is the family tree, inputting all stored family tree character information into a blank output file, wherein preset characters are used for segmenting each piece of family tree character information; after all data are input into the blank output file, a print output file is obtained; a file link corresponding to the print output file is generated.

In connection with the above steps 1 to 5, the step of defining the output data and generating the file link is step 6, which includes steps 6.1 to 6.6, wherein,

step 6.1, creating a blank output file;

step 6.2, outputting basic information of the family tree by the home page: outputting basic information of the family tree in a file, which mainly comprises: family tree name (title), family tree subtitle (subtitle, not output empty), family tree print time (currentDate); step 6.2 is executed;

and 6.2, processing and outputting family tree description information, wherein the family tree description information mainly comprises the following 4 types:

① counting the number of people printed with family tree, and outputting title + 'pedigree diagram total' + | printpeoplescount | + 'people';

②, basic information is printed, which is mainly divided into two parts,

a) if the pedigree ancestor is not empty, info1 ═ is "operator. name +" is the pedigree generation ancestor "+ generation +" and printing starts from "+ print operator. name +" ("+ generation +"); otherwise, info1 is "print with" name + "th" + printing generation + "generation ancestor;

b) if printSetting ═ unilimited, info2 ═ and all descendant information "; if printSetting ═ N, info2 ═ and up to the "+ N +" generation pedigree information; if the printSetting ═ N, info2 ═ to "+ dependent.name +" ("+ dependent.rank +") to family tree information "

The output format is: info1+ info2+ "; ";

③ print comments outputting "the character after the name indicates that its descendant information is not found in the genealogy";

④ date of printing family tree, the output is "" this tree is updated in "+ currentDate +";

after the treatment is finished, executing the step 6.3;

step 6.3, basic information is printed and output, and if the printType is equal to dendrogram, ①②③④ items in the step 6.2 are output, and the step 6.4 is executed, otherwise, ①②④ items in the step 6.2 are output, and the step 6.5 is executed;

step 6.4, outputting a pedigree graph, namely outputting subtrees stored in result to a file, dividing the pedigree subtrees by spaces, judging whether the current page can display complete subtrees (ensuring the completeness of subtree display as much as possible) in advance during output, and otherwise, displaying the page in a page changing manner; until all data in result are output; step 6.6 is executed;

step 6.5, outputting the family tree: outputting the character information stored in the result to a file, and displaying characters by space segmentation until all data in the result are output; step 6.6 is executed;

and 6.6, generating a file link.

As an optional embodiment of the present invention, after completing outputting the family tree data and generating the file link, the family tree printing method further includes: and performing path analysis on the direct parent-child relationship of the two pedigree figures, wherein the analysis scheme comprises the following steps:

by recursively querying the direct parent-child relationship between two characters,

step 1, inputting: a subtree disconnection array disconnectrarr, a ancestor person1 and a descendant person2, wherein a relationship Path array Path is initialized to array () and a failure to person 2;

step 2, storing the false.ID into Path, using a database query statement to query the father of the false, making the false be queryFather (false.ID), when the false is not empty, firstly judging whether the false.ID is in disconnectrArr, if so, executing step 4, otherwise, judging whether the false and person2 are equal, if so, executing step 3, otherwise, continuing executing step 2, and when the false is empty, executing step 4;

step 3, storing the family ID in the Path to obtain a relationship Path array Path from person1 to person2, and executing step 5;

step 4, executing step 5 when Path is equal to array ();

and 5, returning to Path.

In the embodiment of the present invention, when processing the error relationship in the family tree character data, optionally, after extracting the family tree output data corresponding to the printing parameter from all the family tree data, the family tree printing method further includes: judging whether error data exist in the family tree output data or not; if the pedigree output data has error data, judging whether a daughter meeting a first error relationship exists in a child array corresponding to pedigree characters and child information in the error data, or judging whether a daughter meeting a second error relationship exists in the pedigree characters and the child array in the error data, or judging whether a child meeting a third error relationship exists in the pedigree characters and the child array in the error data, or judging whether a character with the same ID as the pedigree characters exists in the child array in the error data, wherein the first error relationship is that a pulsatile daughter-in-law relationship is established as a father-daughter relationship, the second error relationship is that a mother-daughter relationship is established, and the third error relationship is that a plurality of son-daughter connecting edges and daughter connecting edges are repeatedly established; if the child array corresponding to the pedigree characters and the child information in the error data has a daughter meeting a first error relationship, or if the pedigree characters and the child array in the error data have a daughter meeting a second error relationship, deleting the character information corresponding to the daughter from the child array; if the pedigree characters in the error data and children data have children meeting a third error relationship, deleting corresponding child information of the children from the child array; and if the person with the same identification as the family tree person exists in the child array in the error data, deleting the person.

Fig. 2 is a schematic diagram of an optional error relationship of family characters according to an embodiment of the present invention, as shown in fig. 2, a gray circle indicates a male, a white circle indicates a female, and characters between the circles indicate the relationship between the two, in fig. 2, four error relationships are schematically illustrated, including:

FIG. 2(1) shows that the relation of the root daughter-in-law (which does not exist in the system) is established as a parent relation (i.e. the first error relation);

FIG. 2(2) shows that a mother-daughter relationship (i.e., the second error relationship described above) is established by error as a mother-daughter relationship (not present in the system);

FIG. 2(3) shows the repeated establishment of a plurality of son/daughter relationship edges (i.e., the third error relationship);

fig. 2(4) shows that a parent relationship edge is erroneously established for itself.

When processing error data, processing is performed for each error relation, and the processing mode comprises the following steps:

step 1, inputting person, child array child and wife array spout, and executing step 2;

step 2, judging whether the persons meeting the error relationship in fig. 2 exist one by one, wherein the method mainly comprises the following four conditions:

① judging whether there is daughter meeting the relation mode of fig. 2(1) in person and child array child, if yes, deleting daughter from child;

② judging whether there is daughter meeting the relation mode of fig. 2(2) in wife array spout and child array child, if yes, deleting daughter from child;

③ judging whether there is children satisfying the relation of fig. 2(3) in person and child array child, if yes, deleting the repeated children;

④ judging whether there is a person with the same ID as person in child array child, if yes, deleting the person;

and step 3, returning to the child array child after the processing is finished.

After the data processing is completed, the printing link can be sent to the target terminal sending the family tree printing request, so that the family tree user can download and print the family tree.

In the embodiment of the present invention, in addition to completing the output of the family tree data, the family tree printing method further includes the step of counting the number of people of the family tree people, and the counting includes the following steps:

step 1, inputting a person of a current pedigree, judging whether the person.ID is in a printPeopleCount or not, and if not, storing the person.ID in the printPeopleCount;

step 2, obtaining the statistics conditions of the family tree number: the countCondition is obtained by querying a database through a family tree ID (genealogyID);

step 3, acquiring a spouse and child array of the current character, wherein, distance is getSpouse (person.ID, spooseArr), and childrenn is getChildren (person.ID, childrenAlarrr), inquiring the error relationship of the family tree character, excluding the error relationship character, then judging that children child exists in childrens in disconnectrArr one by one, and removing the children existing in disconnectrArr;

step 4, storing the IDs of person and the person related to person, wherein the IDs can be divided into the following 4 cases;

①, if the countCondition is ═ all', it is determined in turn whether the IDs of all the characters in the array spout and children are in the array printpeoplescount, and if not, the IDs are saved in the array printpeoplescount, otherwise, the IDs are not saved.

②, if the countCondition is 'excludeFemal', sequentially judging whether the IDs of all male characters in the array children are in the array printpeoplescount, if not, storing the IDs in the array printpeoplescount, otherwise, not storing the IDs.

③, if the countCondition is 'excludescope', it is sequentially determined whether the IDs of all the characters in the array child are in the array printpeoplescount, and if not, the IDs are saved in the array printpeoplescount, otherwise, the IDs are not saved.

④ if the countCondition is 'exclugdaughter', sequentially judging whether the IDs of all the characters in the array spout and children are in the array printpeoplescount, wherein children only judges the female character, if not, the ID is saved in the array printpeoplescount, otherwise, the ID is not saved.

Through the embodiment, the number of people in the family tree to be printed can be inquired, and thus when the printing link is returned, the total number of people to be printed can be returned.

In the embodiment of the invention, the graph database can be used for storing the family tree data, the nodes represent family tree characters, the edges between the nodes represent the relationship between the family tree characters, and the attribute values of the nodes and the edges represent the attribute values of the relationship between the characters. Meanwhile, the method can provide a personalized family tree printing method from the perspective of user requirements, solve the family tree use requirements of different users, solve the requirements of different family tree processing formats by using a recursion and queue method, generate visual documents of different family tree data in real time, and improve the use interest of the users.

Fig. 3 is a schematic diagram of an alternative pedigree printing device according to an embodiment of the present invention, and as shown in fig. 3, the pedigree printing device may include: an acquisition unit 31, a receiving unit 33, an extraction unit 35, a sending unit 37, wherein,

an obtaining unit 31, configured to obtain all family tree data of a target family tree to be printed, where the target family tree is a family tree stored in a graph database, a node in the graph database indicates a family tree character in the target family tree, and a directed edge between nodes indicates a relationship between the family tree characters;

the receiving unit 33 is configured to receive a family tree printing request, where the family tree printing request carries a printing parameter of a printing target family tree;

an extracting unit 35, configured to extract family tree output data corresponding to the printing parameter from all the family tree data;

a transmission unit 37 for transmitting the print link corresponding to the family tree output data to the target terminal.

The pedigree printing device can adopt the acquiring unit 31 to acquire all pedigree data of a target pedigree to be printed, wherein the target pedigree is a pedigree stored in a graphic database, pedigree characters in the target pedigree are indicated by nodes in the graphic database, the relationship between the pedigree characters is indicated by directed edges between the nodes, then a pedigree printing request is received through the receiving unit 33, wherein the pedigree printing request carries printing parameters for printing the target pedigree, then pedigree output data corresponding to the printing parameters in all the pedigree data are extracted through the extracting unit 35, and finally a printing link corresponding to the pedigree output data is sent to a target terminal through the sending unit 37, so that the pedigree printing is completed through the target terminal. In the embodiment, the personalized family tree printing of the user can be met according to the family tree printing request, the printing mode is diversified, and the using satisfaction of the user can be improved, so that the technical problems that the data of the mass family tree is stored and the family tree cannot be printed in a personalized mode by the user in the related technology are solved.

Optionally, the family tree printing device further includes: the system comprises a first determination unit, a second determination unit and a third determination unit, wherein the first determination unit is used for determining a data import scheme after acquiring all family tree data of a target family tree to be printed; the first importing unit is used for importing the family tree data of the target family tree into the graphic database based on the data importing scheme; a second determination unit configured to determine each of the family tree characters of the target family tree, a relationship between the family tree characters, and an attribute value corresponding to the relationship between each of the family tree characters and the family tree characters; a first setting unit configured to set a node for each of the pedigree characters, set a directed edge for a relationship between the pedigree characters, and attach an attribute value around the node and the directed edge; the first construction unit is used for constructing the graphical family tree based on the nodes, the directed edges and the attribute values, wherein the family tree data of the graphical family tree is stored in the graphical database.

Optionally, the family tree printing device further comprises: a first parsing unit, configured to parse the pedigree printing request to determine a printing type and printing information after receiving the pedigree printing request, where the printing type at least includes: pedigree and family tree, the printed information includes at least one of the following: printing a pedigree name, printing a pedigree subheader, printing a ancestor character, printing a beginning algebra of the ancestor, printing an offspring algebra, and printing an associated character; a third determining unit for determining the printing parameters based on the printing type and the printing information.

Optionally, the parsing unit includes: the first determining module is used for determining a family tree pedigree graph of a printing target family tree when the printing type is the family tree graph; the second determining module is used for determining all information of the designated family tree characters of the printing target family tree when the printing type is the family tree; a third determination module, configured to, when determining a starting generation number of the printing ancestor in the printing information, include: if the starting algebra is not indicated, the default starting algebra is the first generation in the target family tree; or, if an algebraic number is received, taking the algebraic number as a starting algebraic number; or if the pedigree ancestor name is received, using an ancestor algebra corresponding to the pedigree ancestor name indication ancestor as a starting algebra; the fourth determination module is used for determining the generation number of the subsequent generations printed in the printing information and comprises the following steps: if the printed descendant algebra are all descendants, printing and outputting all descendant pedigree characters by taking the initial algebra of the printing ancestor as a start algebra; or if the printing generation number is the designated generation number N, printing all the pedigree characters of the N generations downwards from the starting generation number of the printing ancestor.

Optionally, the family tree printing device further comprises: the first saving unit is used for saving the printing ancestor characters into a first printing queue when the printing type is a pedigree graph before extracting the pedigree output data corresponding to the printing parameters in all the pedigree data; the first marking-out unit is used for marking out a queue from a queue head element in the first printing queue and assigning a value to a query root node; the system comprises a first query unit, a second query unit and a third query unit, wherein the first query unit is used for querying a family tree of a target family tree based on a query root node, the family tree is decomposed into a plurality of family subtrees with the depth of n in advance, the query root node is a starting root node, the family subtrees with the depth of n are queried recursively, leaf nodes of children of the family subtrees are stored in a printing queue, and the nodes are taken out from the printing queue and serve as root nodes of the next family tree subtrees; the second query unit is used for recursively querying all child nodes taking the root node as an initial query point in each family tree sub-tree; a fourth determining unit, configured to determine a child node attribute value and a special child node relationship type corresponding to each child node, where the child node attribute value at least includes: generation, family ranking, parent name, special child node relationship types including at least: relation between child rearing, child generation and waiting for examination; and outputting all family tree sub-tree information.

Optionally, the extraction unit comprises: the first storage module is used for storing the printing ancestor characters into the second printing queue when the printing type is the family tree; the first marking-out module is used for marking out the queue from the queue head element in the second printing queue and assigning a value to the query root node; the fifth determining module is used for determining the character information, the spouse information and the child information of the current pedigree character based on the query root node; and the sixth determining module is used for taking the character information, the spouse information and the child information of all current family tree characters as family tree output information.

Optionally, the fifth determining module includes: the first determining sub-module is used for determining the character information of the current pedigree character and comprises the following steps: determining a basic character attribute value of the current family character, wherein the basic character attribute value comprises at least one of the following values: name, word, number, date of birth, date of death; filtering the null attribute value and the repeated semantic attribute value by using the character judgment statement; storing the character attribute name and the attribute value of the current family tree character to an attribute array; the second determining sub-module is used for determining the spouse information of the current pedigree character and comprises the following steps: determining the number of spouses of the current pedigree character and basic information of each spouse, wherein the basic information comprises at least one of the following items: name, date of birth and date of death, burial ground, utilize the character to judge the empty attribute value of statement filtering and repeating the semantic attribute value at the same time; storing the basic information of each spouse to an attribute array; the third determining sub-module is used for determining the child information of the current pedigree character and comprises: determining the number of children and the character information of each child of the current pedigree character; all the child information which is not empty is stored in the attribute array; and storing the information in the attribute array in a target array corresponding to the current pedigree character.

Optionally, the family tree printing device further comprises: a creating unit configured to create a blank output file after extracting the family tree output data corresponding to the printing parameter from among all the family tree data; a second input unit for inputting printing information to the blank output file, wherein the printing information at least includes: family tree name and family tree printing date; a third input unit, configured to input the family tree description information to the blank output file, where the family tree description information includes at least one of: family tree number information printing, ancestor character printing, ancestor starting algebra printing, descendant algebra printing, annotation printing and family tree printing date; a fourth input unit, configured to input all the pedigree subtrees into a blank output file when the printing type is a pedigree graph, wherein each pedigree subtree is segmented using preset characters; a fifth input unit, configured to input all stored family tree character information into a blank output file when the printing type is a family tree, where each family tree character information is divided by using preset characters; the seventh determining module is used for obtaining a printout file after all data are input into the blank output file; and the first generation module is used for generating a file link corresponding to the print output file.

Optionally, the family tree printing device further comprises: the first judgment unit is used for judging whether the family tree output data has error data or not after the family tree output data corresponding to the printing parameters in all the family tree data is extracted; a second judging unit, configured to, when there is error data in the family tree output data, judge whether there is a daughter meeting a first error relationship in a child array corresponding to the family tree character and the child information in the error data, or judge whether there is a daughter meeting a second error relationship in the family tree character and the child array in the error data, or judge whether there is a child meeting a third error relationship in the family tree character and the child array in the error data, or judge whether there is a character of the same ID as the family tree character in the child array in the error data, where the first error relationship is to establish a father-daughter relationship with a pulsatilla daughter-in-law relationship, the second error relationship is to establish a mother-daughter relationship with a mother-daughter relationship, and the third error relationship is to repeatedly establish a plurality of son-daughter connecting edges; if the child array corresponding to the pedigree characters and the child information in the error data has a daughter meeting a first error relationship, or if the pedigree characters and the child array in the error data have a daughter meeting a second error relationship, deleting the character information corresponding to the daughter from the child array; if the pedigree characters in the error data and children data have children meeting a third error relationship, deleting corresponding child information of the children from the child array; and if the person with the same identification as the family tree person exists in the child array in the error data, deleting the person.

The pedigree printing device may further include a processor and a memory, wherein the acquiring unit 31, the receiving unit 33, the extracting unit 35, the transmitting unit 37, and the like are stored in the memory as program units, and the processor executes the program units stored in the memory to implement corresponding functions.

The processor comprises a kernel, and the kernel calls a corresponding program unit from the memory. The kernel can be set to be one or more than one, and the printing link for printing the family tree data is output by adjusting the kernel parameters, so that a user can conveniently obtain the family tree data to be printed.

The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.

The embodiment of the invention provides equipment, which comprises a processor, a memory and a program which is stored on the memory and can run on the processor, wherein the processor executes the program and realizes the following steps: acquiring all family tree data of a target family tree to be printed, wherein the target family tree is a family tree stored in a graph database, family tree characters in the target family tree are indicated by nodes in the graph database, and the relationship between the family tree characters is indicated by directed edges between the nodes; receiving a family tree printing request, wherein the family tree printing request carries printing parameters of a printing target family tree; extracting family tree output data corresponding to the printing parameters from all the family tree data; and sending the printing link corresponding to the pedigree output data to the target terminal.

The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.

In the above embodiments of the present invention, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units may be a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.

The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.

Claims

1. A family tree printing method is characterized by comprising the following steps:

acquiring all family tree data of a target family tree to be printed, wherein the target family tree is a family tree stored in a graph database, the graph database indicates family tree characters in the target family tree by nodes, and indicates the relationship between the family tree characters by directed edges between the nodes;

receiving a family tree printing request, wherein the family tree printing request carries printing parameters for printing the target family tree;

extracting family tree output data corresponding to the printing parameters from all the family tree data;

and sending the printing link corresponding to the pedigree output data to a target terminal.

2. The method according to claim 1, wherein after acquiring all family tree data of a target family tree to be printed, the family tree printing method further comprises:

determining a data import scheme;

importing the family tree data of the target family tree into the graphic database based on the data import scheme;

determining each pedigree character of the target pedigree, the relationship between the pedigree characters and attribute values corresponding to the relationship between each pedigree character and the pedigree character;

setting a node for each family tree character, setting a directed edge for the relationship between the family tree characters, and attaching the attribute value to the periphery of the node and the directed edge;

and constructing a graphical family tree based on the nodes, the directed edges and the attribute values, wherein family tree data of the graphical family tree is stored in the graphical database.

3. The method according to claim 1, wherein after receiving the request for printing the family tree, the method for printing the family tree further comprises:

analyzing the pedigree printing request to determine a printing type and printing information, wherein the printing type at least comprises: pedigree and pedigree, the printed information including at least one of: printing a pedigree name, printing a pedigree subheader, printing a ancestor character, printing a beginning algebra of the ancestor, printing an offspring algebra, and printing an associated character;

determining the printing parameters based on the printing type and the printing information.

4. The method of claim 3, wherein the step of determining the print type and the print information comprises:

when the printing type is a pedigree graph, determining a pedigree graph of the target pedigree;

when the printing type is the family tree, determining all information of the designated family tree character of the target family tree;

the determining of the starting generation number of the printing ancestor in the printing information includes: if the starting algebra is not indicated, defaulting the starting algebra to be the first generation in the target family tree; or if an algebraic number is received, taking the algebraic number as the starting algebraic number; or if the pedigree ancestor name is received, taking an ancestor algebra corresponding to the pedigree ancestor name indication ancestor as the starting algebra;

the determining of the generation number of the subsequent generations printed in the printing information includes: if the printed descendant algebra are all descendants, printing and outputting all descendant pedigree characters by taking the starting algebra of the printing ancestor as a start; or if the printing generation number is the designated generation number N, printing all the pedigree characters of the N generations downwards by taking the starting generation number of the printing ancestor as the start.

5. The method according to claim 3, wherein before extracting the family tree output data corresponding to the print parameter from among the all family tree data, the family tree printing method further comprises:

when the printing type is a pedigree diagram, saving the printing ancestor characters in a first printing queue;

marking out a queue from a queue head element in the first printing queue, and assigning a value to a query root node;

inquiring the family tree of the target family tree based on the inquiry root node, wherein the family tree is decomposed into a plurality of family subtrees with the depth of n in advance, the inquiry root node is a starting root node, the family subtrees with the depth of n are inquired recursively, leaf nodes of children of the family subtrees are stored in a printing queue, and the nodes are taken out from the printing queue to serve as the root nodes of the next family tree subtree;

recursively inquiring all child nodes taking root nodes as initial inquiry points in each family tree subtree;

determining child node attribute values and special child node relationship types corresponding to each child node, wherein the child node attribute values at least comprise: ancestors, family ranks, parent names, the special child node relationship types at least include: relation between child rearing, child generation and waiting for examination;

and outputting all family tree sub-tree information.

6. The method according to claim 3, wherein the step of extracting the family tree output data corresponding to the printing parameter from the all family tree data comprises:

when the printing type is the family tree, storing the printing ancestor characters in a second printing queue;

marking out a queue from the first queue element in the second printing queue, and assigning a value to a query root node;

determining the figure information, spouse information and child information of the current pedigree figure based on the query root node;

and taking the character information, the spouse information and the child information of all current family tree characters as family tree output information.

7. The method of claim 6, wherein the step of determining the persona information, spouse information and child information of the current pedigree persona based on the query root node comprises:

determining the persona information of the current pedigree persona comprises: determining a person basic attribute value of the current pedigree person, wherein the person basic attribute value comprises at least one of the following values: name, word, number, date of birth, date of death; filtering the null attribute value and the repeated semantic attribute value by using the character judgment statement; storing the character attribute name and the attribute value of the current family tree character to an attribute array;

determining the spouse information of the current pedigree character comprises: determining the number of spouses of the current pedigree character and basic information of each spouse, wherein the basic information comprises at least one of the following: name, date of birth and date of death; storing the basic information of each spouse to the attribute array;

determining the child information of the current pedigree character comprises: determining the number of children and the character information of each child of the current pedigree character; all the child information which is not empty is stored in the attribute array;

and storing the information in the attribute array in a target array corresponding to the current pedigree character.

8. The method according to claim 6, wherein after extracting the family tree output data corresponding to the print parameter from among the all family tree data, the family tree printing method further comprises:

creating a blank output file;

inputting the printing information to the blank output file, wherein the printing information at least comprises: family tree name and family tree printing date;

inputting pedigree description information into the blank output file, wherein the pedigree description information comprises at least one of the following information: family tree number information printing, ancestor character printing, ancestor starting algebra printing, descendant algebra printing, annotation printing and family tree printing date;

if the printing type is a pedigree graph, inputting all pedigree subtrees to the blank output file, wherein preset characters are used for segmenting each pedigree subtree;

if the printing type is the family tree, inputting all stored family tree character information into the blank output file, wherein each piece of family tree character information is divided by using preset characters;

after all data are input into the blank output file, obtaining a print output file;

and generating a file link corresponding to the printout file.

9. The method according to claim 6, wherein after extracting the family tree output data corresponding to the print parameter from among the all family tree data, the family tree printing method further comprises:

judging whether error data exist in the family tree output data or not;

if the pedigree output data has error data, judging whether a daughter meeting a first error relationship exists in a child array corresponding to pedigree characters and child information in the error data, or judging whether a daughter meeting a second error relationship exists in the pedigree characters and the child array in the error data, or judging whether a child meeting a third error relationship exists in the pedigree characters and the child array in the error data, or judging whether a character with the same ID as the pedigree characters exists in the child array in the error data, wherein the first error relationship is that a father-daughter relationship is established with a father-daughter relationship in the family tree daughter-in-law relationship, the second error relationship is that a mother-daughter relationship is established with a mother-daughter relationship, and the third error relationship is that a plurality of son-daughter connecting edges are repeatedly established;

if the child array corresponding to the pedigree characters and the child information in the error data has a daughter meeting a first error relationship, or if the pedigree characters and the child array in the error data have a daughter meeting a second error relationship, deleting the character information corresponding to the daughter from the child array;

if the pedigree figures in the error data and children data have children meeting a third error relationship, deleting corresponding child information of the children from the child array;

and if the character with the same identification as the family character exists in the child array in the error data, deleting the character.

10. A family tree printing apparatus, comprising:

the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring all family tree data of a target family tree to be printed, the target family tree is a family tree stored in a graph database, family tree characters in the target family tree are indicated by nodes in the graph database, and the relationship between the family tree characters is indicated by directed edges between the nodes;

the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a family tree printing request, and the family tree printing request carries printing parameters for printing the target family tree;

an extraction unit, configured to extract the family tree output data corresponding to the printing parameter from among the all family tree data;

and the sending unit is used for sending the printing link corresponding to the pedigree output data to the target terminal.