Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Apparatus and method for combinatorial hypermap based data representations and operations

A technology of data representation and graph representation, applied in the field of apparatuses and methods for data representation and manipulation based on combined hypergraphs, and can solve problems such as multi-CPU time, consumption, etc.

Active Publication Date: 2017-10-13
KYNDI
View PDF9 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The encoding, manipulation and decoding of these integers consumes considerable CPU time

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Apparatus and method for combinatorial hypermap based data representations and operations
  • Apparatus and method for combinatorial hypermap based data representations and operations
  • Apparatus and method for combinatorial hypermap based data representations and operations

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] Graphs can provide powerful representations of knowledge and relationships in many domains. Graph databases store graph structures rather than tables of data. In general, graph databases can be applied in domains that need to store and retrieve complex topological information, such as neural networks, semantic networks, social networks, networks of related stories, scenes, routes, paths, roads, or geographic information systems (GIS). One of the main problems in graph databases is to retrieve membership graphs based on structural matching. Structural matching of graphs is a known NP-complete problem. In large graph databases, structural matching becomes very difficult because structural matching has to be performed against a large number of graphs in the database. Retrieval from dynamic topological graph databases is even harder than retrieval from pre-indexed attribute-based graph databases because there is no decomposition space and the space is always changing dyna...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A method and apparatus is provided for implementing combinatorial hypermaps (CHYMAPS) and / or generalized combinatorial maps (G-Maps) based data representations and operations, comprising: mapping term-algebras to tree-based numbers using a fast algorithm and representing a graph of the mapping structure as a CHYMAPS using reversible numeric encoding and decoding; generating a representation of CHYMAPS in a form optimized for sub-map (sub-graph) to map (graph) isomorphism and partial matching with a general matching process; performing operations on the CHYMAPS as operations on respective numerical representations; performing compression and decompression using a three bit self-delimiting binary code; and storing and retrieving codes.

Description

[0001] Cross References to Related Applications [0002] This application is based upon and claims the benefit of priority from Provisional US Application No. 62 / 090,190, filed December 10, 2014, which is hereby incorporated by reference in its entirety. technical field [0003] Embodiments disclosed herein generally relate to methods and apparatus for encoding composite hypergraphs (CHYMAPS) using unique reversible codes and a tree-based numbering system that embeds term algebra into CHYMAPS and more specifically, the apparatus and method provide complex data structure representation, pattern recognition, fast unification of subgraphs, and arithmetic operations on numbers where operations on term algebra are reversible and lossless (ie, bijective). Background technique [0004] The background description provided herein is for the purpose of generally presenting the context of the disclosure. The work of the presently named inventors, to the extent that work is described i...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30G06N3/02G06N5/00
CPCH03M7/04H03M7/30H03M7/3097H03M7/14H03M7/46G06F16/2452G06F16/28
Inventor A·马宗达
Owner KYNDI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products