CN103544224A - Method, system and device for storing and representing adoptive relationship information - Google Patents
Method, system and device for storing and representing adoptive relationship information Download PDFInfo
- Publication number
- CN103544224A CN103544224A CN201310458815.XA CN201310458815A CN103544224A CN 103544224 A CN103544224 A CN 103544224A CN 201310458815 A CN201310458815 A CN 201310458815A CN 103544224 A CN103544224 A CN 103544224A
- Authority
- CN
- China
- Prior art keywords
- adoptive
- relationship
- adoptive relationship
- people
- foster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Medicines Containing Material From Animals Or Micro-Organisms (AREA)
Abstract
The invention discloses a method for storing and representing adoptive relationship information. According to the method, five kinds of genetic relationships capable of being described directly, for example, the foster father relationship, the foster mother relationship, the relationship of brothers and sisters of the same foster father, the relationship of brothers and sisters of the same foster mother and the adopted children relationship can be determined, the adoptive relationship information between two persons whom all kinds can be directly described is stored and represented through adoptive relationship nodes with a related person as the core, and the adoptive relationship information can be effectively stored and represented in a computer and the like so as to be convenient to analyze and utilize. The invention further discloses a complete corresponding system for storing and representing the adoptive relationship information and a device comprising the system. Meanwhile, the invention discloses attributes of a foster father, a foster mother, a next brother or sister of the same foster father, a next brother or sister of the same foster mother, one of the adoptive children and the like of the adoptive relationship nodes, and the reflected adoptive relationship of the adoptive related person with specified attributes.
Description
Technical field
The invention belongs to computer information processing field, relate in particular to a kind of adoptive relationship message store table and show method, system and equipment.
Background technology
People's information is the important content of computer information processing, but the no matter social management of Shi government or in the business application of enterprise, it is mostly handler's entity information, be some attributes of people itself, certainly in different business, paying close attention to separately people's entity information is not quite similar, permanent resident population's management system of typical example Shi China and the customer service system of enterprise, what permanent resident population's management system was paid close attention to is the entity information relevant with residence management, the client that customer service system is paid close attention to or potential customers are developed relevant entity information with business event.Marx points out, people is the summation of all social relationships, and social relationships are interpersonal contacts, existing people's entity information has more or less also reflected the social relationships information that some are relevant, but very not comprehensive and system, therefore also lack effective analysis and utilization instrument at present for social relationships information.
Sibship is most basic a kind of social relationships, and sibship comprises blood ties, marital relations and other sibship, as adoptive relationship etc.Adoptive relationship in other sibship is a kind of sibship of being drawn up by law or custom forming because adopting, although this sibship is compared basic sibship and is wanted much less, but also more common, and also fairly perfect at the law that modern society is relevant, the fosterling who is formed by adoptive relationship and adoptive parent enjoy the legal status being equal to blood ties, therefore can not ignore.If the basic sibship information of the sibship information spinner that residence management packets of information contains, but also have a small amount of adoptive relationship information, be also to describe by " with householder's relation " attribute, as " foster father " " foster mother " " adopted son " " adopted daughter ".There is the most authoritative control information register of adopting in the competent authorities of adopting, and because the corresponding Information System configuration time is more late, the whole nation is adopt control information register system and just formally enabled on January 1st, 2011, so early stage data are much paper-based form, preserves.Description for sibship in reality is also multifarious, description with the most use or to sibship between two people, and father and son, brother, man and wife etc., adoptive relationship is no exception.There is the problem that retrieval analysis efficiency is not high in a kind of general sibship storage method for expressing of application for a patent for invention, because between two complicated people, sibship may consist of sibship between two groups or above simple two people, and adopts common store represent that mode just need to repeatedly be retrieved and repeatedly judge; Also has in addition the problem of data redundancy, it is same because sibship may consist of sibship between two groups or above simple two people between two complicated people, may together exist and cause redundancy, and redundancy degree is uncontrollable, because various description for sibship between two people much has the content of mutual repeated overlapping.With common store method for expressing, describe adoptive relationship and also have the problems referred to above.
Summary of the invention
The present invention will solve the not high and uncontrollable problem of redundancy of the analysis recall precision that adopts common store to represent that mode exists, for addressing the above problem, the object of the present invention is to provide a kind of adoptive relationship message store table to show method, system and the equipment that comprises this system, make adoptive relationship information can be in computing machine etc. effectively storage represent to carry out analysis and utilization to facilitate.
Adoptive relationship is very similar with blood ties, but different is, adoptive parent is inevitable in pairs appearance the same as own parents not necessarily, may only have one of them, and blood ties have inherent blood relationship and link adoptive relationship and there is no this specific character, therefore by adoptive relationship, carry out being related to extension again by other sibship, its sibship effect is so firm far away from blood ties.In actual life, likely adoptor and adoptee's age differences are very large in addition, are not also father and mother in real life, but be grandparents, but adoptor's role remains adoptive parent's effect, so this situation be there is no need to distinguish again, be denoted as without exception adoptive parent.Therefore adoptive basic sibship only has two kinds of foster fathers, foster mother, and the sibship such as conventional sister adoptive brother who is derived on the basis of two kinds of basic sibships and fosterling, but a lot of for the description that relates to adoptive sibship in daily life, and often and blood ties mixed in together, if all consider a kind of realization for each relates to adoptive sibship in storage represents, so obviously, understand more complicated, and there are a lot of redundancies, and be unfavorable for analyzing retrieval, so only need to relate to adoptive conventional sibship kind by this storage method for expressing Direct function description to a part wherein, other relevant sibship all can be derived and draw thus, this storage method for expressing by the adoptive relationship information of Direct function description be called can two people of Direct function description between adoptive relationship information.Relate in addition adoptive conventional sibship kind is relatively-stationary for each relates to the people who adoptes, therefore can with this artificial core of party and using all categories can two people of Direct function description between adoptive relationship information as branch, build storage method for expressing, and the convenient retrieval analysis of this mode.The adoptive relationship message store table that the present invention proposes shows method, comprises the following steps:
From known sibship extract this storage method for expressing can two people of Direct function description between adoptive relationship information, other irrelevant relationship information can be ignored, then in order to the adoptive relationship node of this artificial core of party store represent all categories can two people of Direct function description between adoptive relationship information, the record that the way of realization of adoptive relationship node includes but not limited to show in program memory variable in service, database, with the structural data of the form storages such as file etc.
The adoptive relationship message store table that said method forms shows system, comprises following assembly:
An assembly is converter, from known sibship extract can two people of Direct function description between adoptive relationship information;
Another assembly is storage announcer, for the adoptive relationship node of this artificial core of party, store represent all categories can two people of Direct function description between adoptive relationship information.
Comprise the equipment that adoptive relationship message store table shows system, its technical scheme is:
By converter from known sibship extract can two people of Direct function description between adoptive relationship information;
By storage announcer with the adoptive relationship node of this artificial core of party store represent all categories can two people of Direct function description between adoptive relationship information.
For any one adoptatus, foster father, foster mother at least should have one, be mostly two, so foster father, foster mother's relation can be used as two relations the most basic in adoptive relationship, other adoptive relationship can be by these two relation derivations out, such as the same foster parent siblings relation of mutually having of same foster parent, with respect to foster parent, I am his or her adopted children, but the unidirectional relationship only from children to adoptive parent brings many difficulties to adoptive analysis retrieval, because retrieving the inverse relationship of above-mentioned unidirectional relationship comes just cumbersome, therefore, suitable redundancy or necessity, the situation the most frequently used according to adoptive relationship retrieval analysis, also need to increase the relations such as siblings and adopted children of adopting, and in the middle of reality, belonging to the children that same foster parent siblings and same foster parent adopt all may have a plurality of, if all indicating the size that will cause storage to represent in one by one cannot determine, therefore next same adoptive parent siblings' relation and one of them adopted children's relation can be set to address this problem, all same adoptive parent siblings all can form same adoptive parent siblings' chain by next same adoptive parent siblings' relation, adopted children are first navigated to one of them adopted children and then are found all adopted children by its same adoptive parent siblings' chain by one of them adopted children's relation, not everyly in actual life in addition adopt siblings all with a pair of adoptive parent, the situation that exists single foster parent to adopt in reality, also exist foster home to be recombine in the situation that different phase is adopt, therefore in order to describe accurately the siblings' relation of adopting, the next one need to be adopt to siblings' relation and be divided into two, next with foster father siblings' relation and next with foster mother siblings' relation, these two relations can be respectively by all same foster father siblings, same foster mother siblings' chain becomes siblings' chain, adopt each other siblings' relation, so just formed one with this artificial core of party, party's foster father, foster mother, with foster father siblings, with foster mother siblings, 5 kinds of fosterlings etc. can Direct function description the storage that is related to Ren Wei branch of sibship represent mode.Therefore above-mentioned adoptive relationship message store table shows method, adoptive relationship message store table shows system or comprises the adoptive relationship node in the equipment that adoptive relationship message store table shows system, with this artificial core of party and by attribute and the concrete fixed correspondence of adoptive relationship kind, sibship between party and other adoptive relationship people two people is described, on corresponding relation with this artificial present adoptive relationship node of core body of party and party, be that node can and must correspond on party, this can realize by an attribute that can indicate party self, also can realize by indicating the modes such as corresponding table of the attribute of corresponding adoptive relationship node or the party sibship node corresponding with it in party's entity information, and node comprise all categories can two people of Direct function description between the branch of adoptive relationship information, facilitate like this from party and analyze retrieval, this meets the most applications of retrieving for Genetic relationship in routine work and life, analyze retrieval particular kind of relationship people and have which sibship people and sibship kind, in convenient analysis retrieval, by attribute and the fixed correspondence of concrete blood ties kind, also can save storage sibship kind of information space, the description all categories of adoptive relationship node can two people of Direct function description between adoptive relationship information attribute and with the fixed correspondence of described concrete adoptive relationship kind of information be:
Comprise foster father, foster mother, next with foster father siblings, next with attributes such as foster mother siblings, one of them adopted children, it is foster father and adopted children's relation, foster mother and adopted children's relation, same foster father siblings' relation, same foster mother siblings' relation, adopted children and adoptive parent's relation that the described sibship information of each attribute is respectively party and my sibship that this attribute indicates.Indicate party can by property value be set to indicate sibship people sibship node and/or pointer or the index of corresponding people's entity information memory location, or be set to the key word, cryptographic hash of the corresponding people's entity information of sibship node and/or institute of this sibship of index people in the data of database or alternate manner storage etc., like this between each sibship node and just can pass through the indication realization link of attribute and associated between sibship node and corresponding people's entity information.Due to only by above-mentioned 5 kinds can Direct function description adoptive relationship whole adoptive relationship is described, the redundance of adoptive relationship information is like this controlled, can unrestrictedly not increase, thereby to a certain degree also just save space.
Accompanying drawing explanation
Fig. 1 is that adoptive relationship message store table shows method;
Fig. 2 is that adoptive relationship message store table shows system;
Fig. 3 is an adoptive relationship node schematic diagram (solid circles represents adoptive relationship people, and arrow represents the corresponding party of node linking and the corresponding concrete adoptive relationship of each attribute by attribute and the adoptive relationship people that indicates with attribute);
Fig. 4 is adoptive relationship node attribute composition and implication and links schematic diagram with adoptive relationship people that attribute indicates (the large solid box that dotted line frame surrounds is an adoptive relationship node, the attribute that each little solid box is node, solid circles represents adoptive relationship people, the adoptive relationship people that arrow points attribute indicates);
Fig. 5 is that adoptive relationship node forms adoptive relationship network diagram (arrow represents linking of adoptive relationship people that the corresponding party of node indicates by attribute and with attribute, word on arrow is in order to represent the adoptive relationship of this attribute description, and wherein unknown sibship does not mark by attribute arrow);
Below in conjunction with accompanying drawing, the invention will be further described.
Embodiment
Embodiment 1
Suppose to have certain family in census register management system to have 4 people V0, V1, V2, V3, householder is V0, the currency of V1 " with householder's relation " is " wife ", and the currency of V2 " with householder's relation " is " adopted son ", and the currency of V3 " with householder's relation " is " adopted daughter ".First to from above-mentioned known sibship information, extract can two people of Direct function description between adoptive relationship information, here between can two people of Direct function description adoptive relationship information category have foster father, foster mother, with foster father siblings, with 5 kinds of foster mother siblings, adopted children etc., in order to narrate conveniently, adopt tlv triple to describe the sibship information of extraction here, tlv triple (a, b, r) represent that b is the party with r sibship of a, as (first, second, son) represent that second is the people that first has son's relation, second is the son of first.From known above-mentioned sibship information, can extract following can two people of Direct function description between adoptive relationship information, by tlv triple, represent as follows:
(V0, V2, adopted son), (V0, V3, adopted daughter);
(V1, V2, adopted son), (V1, V3, adopted daughter);
(V2, V0, foster father), (V2, V1, foster mother), (V2, V3, with foster father brother and sister), (V2, V3, with foster mother brother and sister);
(V3, V0, foster father), (V3 V1, foster mother), (V3, V2, with foster father brother and sister), (V3, V2, with foster mother brother and sister);
Next in order to adoptive relationship node E0, E1, E2, the E3 of this artificial core of party store represent all categories can two people of Direct function description between adoptive relationship information, V0, V1, V2, V3 these 4 parties after arranging form adoptive relationship network as shown in Figure 5.
If search the foster mother of V3, directly get foster mother's attribute of corresponding adoptive relationship node E3, be V1 here;
If search the fosterling of V0, so directly get one of them fosterling's attribute of corresponding adoptive relationship node E0, here be V2, and the adoptive relationship people's who indicates by this attribute the next one searches for all same foster father siblings (searching V3 here) with foster father siblings' attribute and the next one is searched for all same foster mother siblings (searching V3 here) with foster mother siblings' attribute, then remove the party of repetition, only stay a V3, show that like this fosterling of V0 has V2 and V3.
If search V0, be who of V2, so can be first all properties by V2 obtain all adoptive relationship people V0, V1, V3 because be the V0 obtaining through foster father's attribute, can show that so V0 is the foster father of V2.
Claims (5)
1. an adoptive relationship message store table shows method, comprise the following steps: by known adoptive relationship information be converted to can two people of Direct function description between adoptive relationship information, in order to the adoptive relationship node of this artificial core of party store represent all categories can two people of Direct function description between adoptive relationship information.
2. adoptive relationship message store table shows a system, comprises following assembly:
Converter: by known adoptive relationship information be converted to can two people of Direct function description between adoptive relationship information;
Storage announcer: in order to the adoptive relationship node of this artificial core of party store represent all categories can two people of Direct function description between adoptive relationship information.
3. the equipment that comprises claim 2, is characterized in that:
By converter by known adoptive relationship information be converted to can two people of Direct function description between adoptive relationship information;
By storage announcer in order to the adoptive relationship node of this artificial core of party store represent all categories can two people of Direct function description between adoptive relationship information.
4. adoptive relationship message store table according to claim 1 shows that method or adoptive relationship message store table claimed in claim 2 show system or the adoptive relationship node comprising in the equipment that adoptive relationship message store table shows system claimed in claim 3, is characterized in that:
With this artificial core of party and by attribute and the concrete fixed correspondence of adoptive relationship kind, sibship between party and other adoptive relationship people two people is described.
5. adoptive relationship node according to claim 4, is characterized in that:
Comprise foster father, foster mother, next with foster father siblings, next with attributes such as foster mother siblings, one of them adopted children, the described adoptive relationship information of each attribute is respectively siblings' relation, adopted children and the adoptive parent's relation that adoptive relationship people that this attribute indicates and my sibship are foster father and adopted children's relation, foster mother and adopted children's relation, siblings' relation of same foster father, same foster mother.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310458815.XA CN103544224A (en) | 2013-10-07 | 2013-10-07 | Method, system and device for storing and representing adoptive relationship information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310458815.XA CN103544224A (en) | 2013-10-07 | 2013-10-07 | Method, system and device for storing and representing adoptive relationship information |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103544224A true CN103544224A (en) | 2014-01-29 |
Family
ID=49967676
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310458815.XA Pending CN103544224A (en) | 2013-10-07 | 2013-10-07 | Method, system and device for storing and representing adoptive relationship information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103544224A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110246064A (en) * | 2018-03-09 | 2019-09-17 | 北京国双科技有限公司 | A kind of relations of fact determines method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1845105A (en) * | 2006-05-22 | 2006-10-11 | 赵开灏 | Information retrieval and processing method based on ternary model |
| CN101324948A (en) * | 2008-07-24 | 2008-12-17 | 阿里巴巴集团控股有限公司 | Method and apparatus of recommending information |
| US20130218602A1 (en) * | 2001-12-28 | 2013-08-22 | Pertti Lahteenmaki | Method and arrangement for arranging an information service to determine nutrition and/or medication |
-
2013
- 2013-10-07 CN CN201310458815.XA patent/CN103544224A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130218602A1 (en) * | 2001-12-28 | 2013-08-22 | Pertti Lahteenmaki | Method and arrangement for arranging an information service to determine nutrition and/or medication |
| CN1845105A (en) * | 2006-05-22 | 2006-10-11 | 赵开灏 | Information retrieval and processing method based on ternary model |
| CN101324948A (en) * | 2008-07-24 | 2008-12-17 | 阿里巴巴集团控股有限公司 | Method and apparatus of recommending information |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110246064A (en) * | 2018-03-09 | 2019-09-17 | 北京国双科技有限公司 | A kind of relations of fact determines method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110168523B (en) | Change monitoring cross-graph query | |
| US10255378B2 (en) | Database structure for distributed key-value pair, document and graph models | |
| US9454599B2 (en) | Automatic definition of entity collections | |
| Kumar Kaliyar | Graph databases: A survey | |
| CN103348344B (en) | Composite term index for graph data | |
| Oussalah et al. | A software architecture for Twitter collection, search and geolocation services | |
| US9411840B2 (en) | Scalable data structures | |
| Pernelle et al. | An automatic key discovery approach for data linking | |
| CN105468605A (en) | Entity information map generation method and device | |
| US10002142B2 (en) | Method and apparatus for generating schema of non-relational database | |
| Brughmans | Networks of networks: A citation network analysis of the adoption, use, and adaptation of formal network techniques in archaeology | |
| CN106874425B (en) | Storm-based real-time keyword approximate search algorithm | |
| US20150100605A1 (en) | Determining collection membership in a data graph | |
| Hashem et al. | An Integrative Modeling of BigData Processing. | |
| CN100573531C (en) | A kind of document retrieval method based on association analysis | |
| CN113722600A (en) | Data query method, device, equipment and product applied to big data | |
| US8965910B2 (en) | Apparatus and method of searching for instance path based on ontology schema | |
| CN113495945A (en) | Text search method, text search device and storage medium | |
| Bao et al. | Query optimization of massive social network data based on hbase | |
| CN103544224A (en) | Method, system and device for storing and representing adoptive relationship information | |
| Klaib et al. | Investigation into indexing XML data techniques | |
| Kvalheim | The Little Mongo DB Schema Design Book | |
| Yan et al. | RDF knowledge graph keyword type search using frequent patterns | |
| CN103544223A (en) | Method, system and equipment for storage and representation of basic affinity information | |
| CN113934729A (en) | Data management method based on knowledge graph, related equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140129 |
|
| RJ01 | Rejection of invention patent application after publication |