CN107992294A - A kind of general information representation and the super data structure of information transmission - Google Patents

A kind of general information representation and the super data structure of information transmission Download PDF

Info

Publication number
CN107992294A
CN107992294A CN201711386528.7A CN201711386528A CN107992294A CN 107992294 A CN107992294 A CN 107992294A CN 201711386528 A CN201711386528 A CN 201711386528A CN 107992294 A CN107992294 A CN 107992294A
Authority
CN
China
Prior art keywords
data structure
super data
super
information transmission
information
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
Application number
CN201711386528.7A
Other languages
Chinese (zh)
Inventor
贺俊华
杨丰涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Gifted Data Co Ltd
Original Assignee
Chengdu Gifted Data Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chengdu Gifted Data Co Ltd filed Critical Chengdu Gifted Data Co Ltd
Priority to CN201711386528.7A priority Critical patent/CN107992294A/en
Publication of CN107992294A publication Critical patent/CN107992294A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/20Software design

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a kind of general information representation and the super data structure of information transmission, structure title:Super Data Structure, are abbreviated as SDS, belong to basic info-tech field.SDS data structure design solve available data structure information representation efficiency caused by logical construction and the limitation of time dimension it is low, and solve how time of fusion dimension with adapt to information change and transmit etc. brand-new technical problem.By designing and developing SDS technologies, data structure and basic info-tech can be integrated in a manner of systematization, and physical Design and the exploitation of novel computer are supported using super data structure SDS, provide general Data Structure Design for the information representation in basic information technology and information transmission.

Description

A kind of general information representation and the super data structure of information transmission
Technical field
The invention belongs to basic info-tech field, and in particular to a kind of general information representation and information transmission it is super Data structure.
Background technology
Data structure is the mode of computer storage and tissue data.Data structure refers to exist between each other a kind of or more The set of the data element of kind particular kind of relationship.Under normal conditions, the data structure selected meticulously can bring higher operation or Person's storage efficiency.Data Structure=(D, R), wherein D are the set of data element, R be in the set all elements it Between relation finite aggregate.
Data structure is referred specifically in same class data element, the correlation between each element, including three constituents, The logical construction of data, the storage organization and data operating structure of data.The logical construction of data:Refer to and reflect between data element Logical relation data structure.Logical construction includes:
1. set:Between element in data structure in addition to the correlation of " belonging to a set together ", do not closed without other System;
2. linear structure:There are man-to-man correlation for element in data structure;
3. tree structure:There are one-to-many correlation for element in data structure;
4. graphic structure:The correlation of element in data structure there are multi-to-multi.
The physical arrangement of data:Refer to Storage Format of the logical construction in computer memory space of data.
The computing of data structure:Refer to the operative algorithm defined in logic structure of data, such as retrieval, insertion, delete, renewal With sequence etc..
Its operation set of different data structures is different, but following operation must be indispensable:
1. the generation of structure;
2. the destruction of structure;
3. the data element for meeting rated condition is searched in the structure;
4. new data element is inserted into the structure;
5. delete existing data element in structure;
6. traversal.
The thought origin of super data structure is according to new science such as new quantum information theory and bioscience technologies Theoretical inspiration, the innovative supplement theoretical to data structure in existing basic info-tech, is quantum computer, biological computation The development of the future computers such as machine provides information representation, information transmission and information storage and provides theory and technology support.
The content of the invention
It is an object of the invention to:For the above-mentioned prior art, present invention aims at provide a kind of general information table Up to the super data structure with information transmission, solve available data structure and led due to logical construction and the limitation of time dimension The information representation efficiency of cause is low, and how time of fusion dimension with adapt to information change and transmit etc. brand-new technical problem.
The technical solution adopted by the present invention is as follows:
A kind of general information representation and the super data structure construction method of information transmission, the described method includes following step Suddenly:
Step 1:The temporal mode for defining super data structure is T;
Step 2:The logical construction for defining super data structure is L;
Step 3:The physical arrangement for defining super data structure is S;
Step 4:The computing for defining super data structure is C;
Step 5:The expression formula of the super data structure of parameter definition of combining step 1-4:Super Data Structure =(D, T.mode, L.structure, S.type, C.channel), obtains super data structure, this super data structure by when Between pattern, logical construction, physical arrangement and computing represent an information jointly, the data structure to representing information is supplemented With it is perfect, allow the expression parameter of information more to make information more three-dimensional, broken away from the prior art due to logical construction and time dimension Limitation caused by information representation efficiency it is low the problem of, it is while data structures are theoretical and method is generalized to new information and manages By in the middle, the theories integration of data structure is provided for new information representation and information transmission technique.
Preferably, the temporal mode in the step 1 includes constant type and non-constant formula, and constant type data structure is not at any time Between flowing and change;Non-constant formula includes periodicity temporal mode and aperiodicity temporal mode, non-constant formula temporal mode Need information change and the transmission of the extra super data structure of data structure parameter indexing.
Preferably, the logical construction in the step 2 includes basic logic structure and higher-order logic structure, basic logic knot Structure includes set, linear structure, tree structure and graphic structure, and higher-order logic structure includes superstructure and Probability Structure.
Preferably, the superstructure refers to certain composite construction formed on the basis of certain layer of structure or variation knot Structure;The Probability Structure refers to the characterization structure of the quantum state formed on the basis of probability wave, and this structure can be state Function, wave function, superposition state function and characterization equation group.
Preferably, the physical arrangement in the step 3 is depending on temporal mode, for the super data structure of constant type, Stored using superstructure or the corresponding computer-readable storage medium of Probability Structure;For the super data structure of non-constant formula Or Probability Structure, as fruit structure has reproducibility, then stored by the way of replicating on computer memory space, If having non-reproduction, generated using new computer-readable storage medium.
Preferably, the computing in the step 4 includes basic operations and high level operations, and basic operations include the life of structure Into, the destruction of structure, search in the structure and meet the data element of rated condition, be inserted into new data element in the structure, delete Except existing data element, traversal in structure;High level operations include translation operation, state computing and transmit computing.
Preferably, the expression formula in the step 5:Super Data Structure=(D, T.mode, L.structure, S.type, C.channel), wherein D is the set of the infrastructure elements of super data structure, and T.mode is super The setting of level data structure temporal mode, L.structure are the logical construction selections of super data structure, and S.type is super The storage class selection of data structure, C.channel is the setting of the arithmetic channel of super data structure.
In conclusion by adopting the above-described technical solution, the beneficial effects of the invention are as follows:
1st, in the present invention, super data structure definition temporal mode, physical arrangement, logical construction and computing, are new Information representation and transmission (such as:Biological information, quantum information etc.) technology provide data structure theories integration, be to data knot The supplement of structure and method and perfect.
2nd, in the present invention, super data structure allows data structure being capable of table by defining temporal mode and other parameters Show information, data structure theory and method be generalized in information theory, basic theory is provided for new computer language design, The theoretical research scope of data structure is widened.
3rd, in the present invention, the building method of super data structure has versatility and generality, this super data structure can Different type meter can be carried out between different computer physical medias into transmission computing in the case of row information transmission Computing between calculation machine.
Brief description of the drawings
Fig. 1 is the flow diagram of the present invention;
Fig. 2 is the flow diagram of the embodiment of the present invention.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to the accompanying drawings and embodiments, it is right The present invention is further elaborated.It should be appreciated that specific embodiment described herein is only to explain the present invention, not For limiting the present invention.
As illustrated in fig. 1 and 2, a kind of general information representation and the super data structure of information transmission, comprise the following steps:
Step 1:The temporal mode for defining super data structure is T, the periodicity temporal mode in non-constant formula pattern, about Determine expression formula T (Unsteady, Periodic), assignment T=(0,1) is denoted as non-constant pattern, periodicity pattern;Information representation The length and structure of formula need to be adjusted according to physical Design.
Step 2:The logical construction for defining super data structure is L, and super data structure P1 time points are linear structure, is surpassed Level data structure P2 time points are that network structure, P1 and P2 are circulated according to non-constant formula pattern and periodicity temporal mode, agreement Expression formula L (Linear_Structure;Network_Structure), it is linear structure to replicate L=(LS, NS) to be denoted as P1, P2 is network structure;The length and structure of information representation formula need to be adjusted according to physical Design.
Step 3:The physical arrangement for defining super data structure is S, as the super data structure of non-constant formula, linear structure It can be replicated with network structure, when storing physical arrangement, replicate the information representation of linear structure, and according to the net after conversion The information representation mode of network structural adjustment infrastructure elements, agreement expression formula S (Replicable, Adjustment), assignment S=S (1, layer), 1 is denoted as reproducible information, and layer is denoted as during being converted into network structure for linear structure, refers in BE Show that device needs to increase layer marks, form New ID;The length of information representation formula needs to be adjusted according to physical Design.
Step 4:The computing for defining super data structure is C, because the periodicity temporal mode of the present embodiment setting is There is very similar feature with computing is transmitted, therefore selected track inquiry (Trajectory query) computing is as an example, Arrange expression formula C (Trajectory query), assignment C=C (1, BE1->BE7) sign 1 is inquired about for track, indicates BE1-> BE7 is routing information of the BE1 nodes to BE7 nodes;The length and structure of information representation formula are according to physical Design and calculating process Need to be adjusted.
Step 5:Combining step 1-4 defines the expression formula of super data structure:Super Data Structure=(D, T.mode, L.structure, S.type, C.channel), wherein D is the set of the infrastructure elements of super data structure, T.mode is the setting of super data structure temporal mode, and L.structure is the logical construction selection of super data structure, S.type is the storage class selection of super data structure, and C.channel is the setting of the arithmetic channel of super data structure, most Super data structure Super Data Structure=((BE1 are obtained according to the parameter of step 1-5 eventually:BE7), (0,1), (LS, NS), (1, layer), (1, BE1->BE7)).Five contents of super data structure expression formula and parameter need mutual Match somebody with somebody, to ensure that super data structure can be realized in the physical Design of corresponding computer.
Above-described embodiment only describe super data structure temporal mode be non-constant pattern situation, its constant-mode Actual is exactly that data structure does not have any change on time dimension.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention All any modification, equivalent and improvement made within refreshing and principle etc., should all be included in the protection scope of the present invention.

Claims (7)

1. a kind of general information representation and the super data structure construction method of information transmission, it is characterised in that the method Comprise the following steps:
Step 1:The temporal mode for defining super data structure is T;
Step 2:The logical construction for defining super data structure is L;
Step 3:The physical arrangement for defining super data structure is S;
Step 4:The computing for defining super data structure is C;
Step 5:The expression formula of the super data structure of parameter definition of combining step 1-4:Super Data Structure=(D, T.mode, L.structure, S.type, C.channel), obtain super data structure.
2. general information representation according to claim 1 and the super data structure construction method of information transmission, it is special Sign is:Temporal mode in the step 1 includes constant type and non-constant formula, and constant type data structure is not with the flowing of time And change;Non-constant formula includes periodicity temporal mode and aperiodicity temporal mode, and non-constant formula temporal mode needs extra The super data structure of data structure parameter indexing information change and transmission.
3. general information representation according to claim 1 and the super data structure construction method of information transmission, it is special Sign is:Logical construction in the step 2 includes basic logic structure and higher-order logic structure, and basic logic structure includes collection Conjunction, linear structure, tree structure and graphic structure, higher-order logic structure include superstructure and Probability Structure.
4. general information representation according to claim 3 and the super data structure construction method of information transmission, it is special Sign is:The superstructure refers to certain composite construction formed on the basis of certain layer of structure or variant structure;It is described general Rate structure refers to the characterization structure of the quantum state formed on the basis of probability wave, and this structure can be function of state, ripple letter Number, superposition state function and characterization equation group.
5. general information representation according to claim 1 and the super data structure construction method of information transmission, it is special Sign is:Physical arrangement in the step 3 is depending on temporal mode, for the super data structure of constant type, using superjunction Structure or the corresponding computer-readable storage medium of Probability Structure are stored;For the super data structure or probability of non-constant formula Structure, as fruit structure has reproducibility, is then stored, if had by the way of replicating on computer memory space Non-reproduction, then generated using new computer-readable storage medium.
6. general information representation according to claim 1 and the super data structure construction method of information transmission, it is special Sign is:Computing in the step 4 includes basic operations and high level operations, and basic operations include the generation of structure, structure Destruction, in the structure lookup meet the data element of rated condition, are inserted into new data element in the structure, delete in structure Through existing data element, traversal;High level operations include translation operation, state computing and transmit computing.
7. general information representation according to claim 1 and the super data structure construction method of information transmission, it is special Sign is:Expression formula in the step 5:Super Data Structure=(D, T.mode, L.structure, S.type, C.channel), wherein D is the set of the infrastructure elements of super data structure, when T.mode is super data structure Between pattern setting, L.structure be super data structure logical construction selection, S.type is depositing for super data structure Type selection is stored up, C.channel is the setting of the arithmetic channel of super data structure.
CN201711386528.7A 2017-12-20 2017-12-20 A kind of general information representation and the super data structure of information transmission Pending CN107992294A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711386528.7A CN107992294A (en) 2017-12-20 2017-12-20 A kind of general information representation and the super data structure of information transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711386528.7A CN107992294A (en) 2017-12-20 2017-12-20 A kind of general information representation and the super data structure of information transmission

Publications (1)

Publication Number Publication Date
CN107992294A true CN107992294A (en) 2018-05-04

Family

ID=62039256

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711386528.7A Pending CN107992294A (en) 2017-12-20 2017-12-20 A kind of general information representation and the super data structure of information transmission

Country Status (1)

Country Link
CN (1) CN107992294A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108875380A (en) * 2018-07-09 2018-11-23 广州驱创知识产权运营有限公司 A kind of processing system and method communicating big data

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1751307A (en) * 2002-01-18 2006-03-22 伊迪蒂克公司 A design for storage and retrieval of arbitrary content and application data
US20100153151A1 (en) * 2008-12-16 2010-06-17 Leonard Peter Toenjes Method and Apparatus for Determining Applicable Permits and Permitting Agencies for a Construction Project
CN102629271A (en) * 2012-03-13 2012-08-08 北京工商大学 Complex data visualization method and equipment based on stacked tree graph
US8301430B2 (en) * 2002-06-14 2012-10-30 Genomatica, Inc. Systems and methods for constructing genomic-based phenotypic models
CN103890856A (en) * 2011-10-27 2014-06-25 惠普发展公司,有限责任合伙企业 Shiftable memory supporting in-memory data structures
CN105830078A (en) * 2013-10-21 2016-08-03 七桥基因公司 Systems and methods for using paired-end data in directed acyclic structure
CN106971007A (en) * 2017-04-28 2017-07-21 成都优易数据有限公司 A kind of data processing of utilization data structure control and data analysis framework

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1751307A (en) * 2002-01-18 2006-03-22 伊迪蒂克公司 A design for storage and retrieval of arbitrary content and application data
US8301430B2 (en) * 2002-06-14 2012-10-30 Genomatica, Inc. Systems and methods for constructing genomic-based phenotypic models
US20100153151A1 (en) * 2008-12-16 2010-06-17 Leonard Peter Toenjes Method and Apparatus for Determining Applicable Permits and Permitting Agencies for a Construction Project
CN103890856A (en) * 2011-10-27 2014-06-25 惠普发展公司,有限责任合伙企业 Shiftable memory supporting in-memory data structures
CN102629271A (en) * 2012-03-13 2012-08-08 北京工商大学 Complex data visualization method and equipment based on stacked tree graph
CN105830078A (en) * 2013-10-21 2016-08-03 七桥基因公司 Systems and methods for using paired-end data in directed acyclic structure
CN106971007A (en) * 2017-04-28 2017-07-21 成都优易数据有限公司 A kind of data processing of utilization data structure control and data analysis framework

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LUCAS LACASA, VINCENZO NICOSIA & VITO LATORA: ""Network structure of multivariate time series"", 《SCIENTIFIC REPORTS》 *
易琳: ""地理数据多尺度特征提取与结构解析方法研究"", 《中国博士学位论文全文数据库-基础科学辑》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108875380A (en) * 2018-07-09 2018-11-23 广州驱创知识产权运营有限公司 A kind of processing system and method communicating big data

Similar Documents

Publication Publication Date Title
Mo et al. Efficient analysis of multi-state k-out-of-n systems
Lin Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints
Ahuja et al. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem
Wu et al. An adaptive multilevel indexing method for disaster service discovery
CN109902203A (en) The network representation learning method and device of random walk based on side
Anwar et al. Capturing the spatiotemporal evolution in road traffic networks
Yeh A fast algorithm for quickest path reliability evaluations in multi-state flow networks
CN105809389A (en) Method and apparatus for generating BOM trees
Lee et al. Incremental and interactive mining of web traversal patterns
CN102611576A (en) Method and device for generating network management configuration model file
Yemeni et al. Reliable spatial and temporal data redundancy reduction approach for WSN
Song et al. Uniwalk: Unidirectional random walk based scalable simrank computation over large graph
CN106682285A (en) Static timing analysis method and device
CN111506552B (en) Dynamic database design method and system of tree structure
CN107992294A (en) A kind of general information representation and the super data structure of information transmission
Fan et al. A hierarchical contraction scheme for querying big graphs
CN105843809A (en) Data processing method and device
CN101917282A (en) Method, device and system for processing alarm shielding rules
CN104820682B (en) A kind of bullet train demand data example construction method and device
McCrabb et al. DyGraph: a dynamic graph generator and benchmark suite
Chakraborty et al. Data fusion in wireless sensor network-a survey
CN103150346A (en) Wireless sensor network data compression method based on extensible markup language
CN107292049A (en) A kind of Design of Simulation System method based on ICD data flows
KR100639985B1 (en) Apparatus for generating a on-chip network topology and method therefor
CN104932982B (en) A kind of Compilation Method and relevant apparatus of message memory access

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20180504