基于亲属关系网络的图模式匹配方法研究-计算机科学与技术专业论文.docxVIP

存储模式下，针对相同规模亲属关系网络数据，以相同查询目标进行查询方法的比对以 存储模式下，针对相同规模亲属关系网络数据，以相同查询目标进行查询方法的比对以 及查询效率的评估。实验结果表明，以图模式存储的数据查询效率优于关系数据库。 (4)将限制图模式匹配应用于亲属关系网络的家庭结构查询。 为了实现家庭结构的模式匹配，扩展亲属关系网络，添加家庭户节点以及人与户之 间的关系边，利用人口学中家庭分类的标准，分别对核心家庭、直系家庭、单亲家庭构 建相应的模式图，根据限制模式图匹配规则，在亲属关系网络匹配中进行查询，并对结 果的准确性进行评估。 关键词： 亲属关系网络图模式匹配图数据库限制模式图 IV 万方数据 Abst Abst ract Kinship network is a network which describes kinship and marriage relationship between people．With the increasing scale and complexity of data，it is difficult problem how to find special pattern structure in the kinship network．Relational databases can’t meet the requirements of the complex relational queries．By contrast，Graph database has obvious advantages in certain areas such data modeling，data management etc．Kinship structure querying is kind of graph pattern matching in kinship network．Subgraph isomorphism method can’t match specific structure pattern because of missing semantic restrictions about the pattern graph． In this thesis，we the graph modeling kinship network compared with relational model．We propose semantic restrictions graph pattern matching method by adding quantity and type restrictions the nodes and relationships．We apply semantic restrictions graph pattern matching method in searching family structure in the kinship network with family data． We visualize and analysis the experiment result． (1)Modeling and storing kinship networks in graph database． In order to search the complex kinship network efficiently,we should store the data reasonably．In this thesis，we analyze the size and meaning of the kinship network and property graph to describe the kinship network．Compared with relational model，we model the network in the graph model．We implement the data storage conversion from relational model to graph model．Experiment shows that the queries base graph pattern is more neatly and more efficiently than relational queries the relation ship depth growing (2)Semantic restrictions graph pattern matching method． Kinship structure qu