EP3877866A1 - Procédé et dispositif de mémorisation de données et de relations entre ces dernières - Google Patents

Procédé et dispositif de mémorisation de données et de relations entre ces dernières

Info

Publication number
EP3877866A1
EP3877866A1 EP19783200.9A EP19783200A EP3877866A1 EP 3877866 A1 EP3877866 A1 EP 3877866A1 EP 19783200 A EP19783200 A EP 19783200A EP 3877866 A1 EP3877866 A1 EP 3877866A1
Authority
EP
European Patent Office
Prior art keywords
memory
data
date
relationship
data2
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
EP19783200.9A
Other languages
German (de)
English (en)
Inventor
Lea Kelbsch
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.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Publication of EP3877866A1 publication Critical patent/EP3877866A1/fr
Pending legal-status Critical Current

Links

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/22—Indexing; Data structures therefor; Storage structures

Definitions

  • the invention relates to a method for storing
  • the invention further relates to a database for storing at least two data related to one another.
  • the invention also relates to a
  • Computer program that can be executed on a computer.
  • Database and the software referred to as database management system are generally provided for the input and output as well as the administration of the data stored in the database, which in particular enables clearly defined access to the content of the database.
  • Relational databases are organized as a variety of tables, with each row of a table having one
  • Tables are expressed.
  • the basic structure of a relational database is that the interrelated data is stored within a row of a table.
  • ERP Entity Relationship Model
  • the object of the invention is to provide a way for that
  • the object is achieved by a method having the features of independent claim 1.
  • the object is further achieved by a memory arrangement and by a computer program in accordance with the further independent patent claims.
  • a special feature of the present invention is that the data and the relationships between individual items of this data are stored separately.
  • the relationships are formed by the references in such a way that the relationships of a plurality of data which are related to one another can be stored, although these relationships are only stored in pairs. This can be implemented in different embodiments, as is also described below.
  • a reference can in particular be a memory address which designates a memory location at which a date is located or at which another relationship is stored which relates at least indirectly to the respective date.
  • a reference can in particular be a memory address which designates a memory location at which a date is located or at which another relationship is stored which relates at least indirectly to the respective date.
  • Indirectly means here that a chain of possibly hierarchically ordered relationships ultimately to the
  • date and "relationship” can be understood very broadly in relation to the present invention. Neither the nature of a relationship nor the type of a date is specified. The invention even allows a date like that treat a relationship or treat a relationship like a date. This ensures that the
  • Storage methods according to the invention and the database according to the invention can be used for a large number of very different applications. For example, depending on the particular context or application in which the invention is used, a definition area of the term “date” and the term “relationship” can be determined.
  • Relationships of one level are treated as data in another level and vice versa.
  • Relationship is stored, also addressable, a first reference being stored in a first partial area and a second reference being stored in a second partial area.
  • These references are preferably implemented by memory addresses, which in turn refer to memory locations at which either a date or another relationship is stored in each case.
  • Partial areas for example always the first two, are provided for storing a relationship and a third partial area is reserved for storing a date.
  • Partial area no date can be saved. It is then clearly a storage space or one
  • Subarea of a line is stored, so in the other two subareas none realizing a relationship
  • this address could also be a reference to a relationship to a date or to another
  • Partial area used for storing the respective reference is described. However, if a date is saved, only one of the two sections is described. At this
  • Embodiment becomes the same functionality as the previous one described embodiment achieved, but less
  • Relationship storage area denotes, used and at least one other separate for storing the data
  • the relationship memory area comprises a plurality of addressable memory locations and each of these addressable memory locations comprises at least two partial areas for storing the two ones
  • the data storage area preferably comprises a plurality of addressable storage locations and each of these
  • addressable memory locations preferably also comprise at least two partial areas. If a date is now to be stored, it is stored in the subarea provided for storing data within the relevant line of the data storage area. The breadth of this
  • Partial area is adapted to the width of the data to be saved. At least when a date is first stored in the data storage area, an address is now additionally reserved in the relationship storage area. This address is stored in the second subarea of that line of the data storage area in which the date itself is also stored.
  • a plurality of data storage areas can be present in a database according to the invention. Different
  • Data storage areas can then be adapted to the data to be expected.
  • Input modules are preferably used for data input
  • the input modules taking into account the respective application and / or the type of data to be expected. Only in the input modules is there a specialization of the
  • Database system intended for a specific application. However, the database behind it is largely independent of the specific application and the type of data. In one embodiment, the
  • each input module can
  • multimedia content is stored in a different data area than measured values that belong to a specific application.
  • An address of the relationship memory area is preferably reserved for each available input module. This ensures that relationships between data and an input module can also be stored within the database.
  • Input modules can be saved within the database. As a result of the fact that a date can be assigned to an input module, further knowledge about the data is implicitly available.
  • Output modules are preferably used for data output
  • the output modules can thus also be assigned data in that they can have a relationship both to data and to relationships and of course also to input modules. Such relationships are the same within the database
  • Embodiments can be removed.
  • FIG. 1 shows a block diagram which shows a memory structure according to a first one which is suitable for carrying out the method according to the invention
  • FIG. 2 shows a block diagram which shows a memory structure according to a second one which is suitable for carrying out the method according to the invention
  • FIG. 3 shows a block diagram which is suitable for carrying out the method according to the invention
  • FIG. 4 shows the registration of
  • Figure 5 shows by means of a diagram
  • Figure 6 shows a preferred embodiment of a in
  • FIG. 1 shows a memory structure according to a possible embodiment.
  • a memory 1 comprises a plurality of lines 2, each line 2 comprising a first partial area 3, a second partial area 4 and a third partial area 5.
  • the first partial area 3 and the second partial area 4 are provided for storing references. These references
  • Subareas 3 and the second subarea 4 thus form a relationship memory 6.
  • the third subarea 5 is provided for the storage of data.
  • the entirety of the third partial areas forms a data memory 7.
  • Each line 2 is a unique address Al, A2, ...
  • Each of the lines 2 can be addressed in a known manner by means of these addresses and thus in particular enables read and write access to the lines 2 and the subareas contained therein.
  • Relationship memories 6 are dimensioned such that a memory address A1, A2,... Can be stored therein.
  • the third section 5 of the data memory 7 is dimensioned in dependence on the data to be stored therein such that the storage of an individual Date is ensured. If a date that is larger than the width of the third partial area should nevertheless be stored within the memory 1 during operation of a database that has been configured, then this can be done
  • Mechanisms can be provided, for example a division
  • the relationship memory 6 and the data memory 7 are thus implemented within a memory element, with one to be stored
  • a relationship is stored in that a reference to another line is stored in one line in the first partial area 3 and the second partial area 4.
  • a reference can in particular be the address of the relevant line. If, for example, a
  • Relationship between two data is stored, the address of the first date is stored in the first section of this line and the address of the second date in the second section.
  • Relationships between individual relationships and relationships between a relationship and a date can be saved in the same structure. If, for example, relationships are stored under the addresses A1 and A2, a relationship can be established again between these two relationships by the value A1 in the first partial area in another memory line and the value Al in the second
  • a relationship is to be saved in one line, the corresponding references or addresses are saved in the two subareas. If, on the other hand, a date is to be saved in one line, the second section is used for this. As a rule, this is wider than the first partial area, since it is assumed that the data to be stored are larger than the addresses to be stored. Whether a line is to be assigned to the relationship memory 6 or the data memory 7 depends on whether a value is stored in the first partial area. If this is the case, the line in question is part of the relationship memory 6.
  • the data memory 6 and the data memory 7 are formed within a common memory 6-7. Compared to that shown in Figure 1
  • Embodiment has that shown in Figure 2
  • Embodiment the advantage that only two sub-areas are required instead of three sub-areas per line 2, which reduces the total memory requirement.
  • FIG. 3 shows a particularly preferred exemplary embodiment of a possible memory structure for realizing the
  • Figure 3 shows a relationship memory
  • Each of the rows 2 comprises a first section 3 and a second
  • references realized preferably represent memory addresses.
  • a plurality of data memories 7 is also shown in FIG.
  • Each of the data memories 7 comprises a plurality of lines in a known manner.
  • Each of the lines has a first
  • Subarea 7-1 and a second subarea 7-2 In the first partial area 7-1 there are addresses of the relationship memory
  • Embodiment are in the first portion 7-1 of the
  • Relationship memory 6 assigned a line 2 to this date. No value is stored in the relationship memory 6 itself in this line 2 assigned to the date. However, the address of the assigned line 2 of the relationship memory 6 is stored in a partial area 7-1 of the data memory 7. This takes place in the partial area 7-1 of that line of the
  • the memory structure shown in FIG. 3 has the advantage that the relationship memory 6 is completely separated from the data memory 7. Consequently, only relationships are stored in the relationship memory 6. These relationships are completely independent of the type and content of a single date. The date itself is stored in a data store
  • the corresponding data memory 7 can then be selected for the specific output.
  • each date is
  • the same address of the relationship memory 6 is assigned in each data memory 7 and stored in the first partial area 7-1 of the respective line.
  • the relationship memory 6 thus abstracts completely from an actual representation of the data to be stored. Depending on the desired input and / or output, the
  • input modules and output modules can be implemented particularly advantageously. E.g. it can be provided that a special data memory is assigned to each input module. Likewise can
  • each output module has at least one
  • Acoustic information communicates specialized input and output modules can be provided for this.
  • the input and output of data then takes place in a data memory 7 optimized for the respective input and output form.
  • FIG. 3 clearly shows that a separation of the
  • Relationship memory 6 is realized by one or more data memories 7, which on the one hand guarantees high data consistency and on the other hand enables the database to be optimized with regard to input and output speed and the required storage space.
  • FIG. 4 shows a simplified flow diagram for a possible embodiment of the method according to the invention
  • an input module is first selected.
  • the module can be implemented in the form of an input mask, for example, by means of the customer data in one Companies should be saved.
  • individual text fields are provided for input. These text fields are related. E.g. there is one
  • Telephone number a person. These relationships are stored in the database according to the invention and are read out of the database when the input module is called up, provided that the input module is already present. This presence is first checked in a method step 101 not yet at the
  • Relationship memory one line assigned to this input module.
  • the input module is therefore from the point of view of the
  • Relationship memory treated the same way as a date.
  • a step 103 the address of the relationship memory 6 assigned to the input module is now selected as the starting point within the relationship memory 6.
  • a register can be provided in which an address that is current for processing is always stored within the data memory 6.
  • step 104 the data is input, for example.
  • a free memory cell of the relationship memory 6 is initially assigned to this datum and the address of this memory cell is in the data memory 7 assigned to this input module at a free location in the first partial area 7-1
  • a step 108 it is now checked whether further data have been transferred using the input module and must therefore be processed. If this is the case, it becomes
  • Step 105 branches back and further data are processed. If this is not the case, then in one step 109 checked whether a new relationship was specified by means of the input module, for example by the fact that the input module
  • step 109 further can
  • Input module has also been saved. This
  • Data available this can be displayed to a user of the database and he can be asked to correct or accept the data.
  • the method can be ended in a step 114. However, if a relationship is to be updated, it is first checked in a step 110 whether this relationship already exists. As previously described, this check can also be carried out in step 109. If a relationship does not yet exist, it is now created. A relationship is realized in that two memory addresses are stored together in one line of the relationship memory 6.
  • Relationships between other relationships are. As a result, a multidimensional relationship tree is created, which is mapped in the relationship memory 6. To determine whether one date is related to another, the latter can
  • a particularly fast search can be implemented by the device according to the invention, in which the memory structure according to the invention is simulated in hardware.
  • FIG. 5 shows a simplified diagram which outlines the structure on which the database is based.
  • Memory cells between which there is a connection E.g. the address A1 is assigned to a specific input module.
  • the line with the address A1 in the relationship memory 6 establishes a relationship between the memory cells with the
  • the memory cell with the address A2 contains a relationship between the memory cells A4 and A5. There are no entries in the memory cells with the addresses A4 and A5. This means that no further relationships are established here, but that these now directly represent data. This data is stored in the data memory 7 assigned to the relevant input module. This is also graphical in FIG. 5
  • Relationship memory allocated These two data are therefore related to each other and also related to the relationships at addresses A1 and A2.
  • the memory address A3 related to the address A2 in turn has a relationship to the content.
  • a relationship between the memory cells with the addresses A6 and A7 is stored there.
  • the ID with the address A6 represents another datum Data3, which is also stored in the data memory 7.
  • a relationship between the memory cells with the addresses A8 and A9 is stored in the memory cell with the address A7.
  • the memory cells with the addresses A8 and A9 represent further data Data4 and DataS, which are related to each other.
  • the structure shown in FIG. 5 can be used to describe a large number of relationships from the real world, which are stored in a database and are thus to be mapped in the database. This very abstract kind of
  • the method and the device which can be implemented both in software and in hardware, are made possible. This ensures a complete separation of the relationships on the one hand and the actual data on the other.
  • Relationships through addresses is that any point within the ones realized through the relationships
  • multi-dimensional structure can be used as a starting point to search for an entry within the database, to establish a connection or to save a new relationship or a new date.
  • the uniform structure also makes it possible to form sets over the relationships in a particularly efficient manner, for example
  • Both in the data store and in the relationship store can be due to the abstract structure general calculations generate statements, generate new knowledge and / or verify stored data and relationships. Based on the example shown in FIG. 4, it could be provided, for example, after or during the input of data relating to another person,
  • the device according to the invention enables imaging of
  • FIG. 6 shows an exemplary embodiment of a database according to the invention implemented in hardware according to a
  • Embodiment shown which corresponds to the basic functionality of the embodiment shown in Figure 3.
  • the relationship memory 6 shown in FIG. 6 includes two addressable memory elements M3, M4, with which the functionality of the two sub-areas 3 and 4 of
  • Relationship memory 6 can be realized.
  • hard disks or so-called RAM drives can be used as addressable storage elements M3, M4.
  • RAM modules are used as memory elements, which one
  • the maximum number of addressable data is determined by the address width, i.e. the maximum number of possible addresses. Above one
  • Address line 8 and a data line 9 are the same
  • Relationship memory 6 connected to a logic element 10. Since in the relationship memory 6 the relationships in the form of
  • Blocks M3, M4 have a square structure so that the data width corresponds to the address width.
  • FIG. 6 also shows a plurality of data memories 7, which also each have two RAM modules M7-1 and M7-2.
  • the functionality of the data memory 7 corresponds to the embodiment shown in FIG. 3.
  • Each data memory 7 or each subarea 7-1 and 7-2, which is implemented by the respective RAM modules M7-1 and M7-2, is also connected to the logic element 10 via an address line 8 and a data line 9. According to one possible
  • All RAM modules (M3, M4, M7-1, M7-2 have the same address or data width. This enables a particularly efficient implementation of the logic element 10.
  • the logic element 10 also has a data line for one
  • the logic element 10 determines the address A1, A2, ... of a free memory line 2 in the relationship memory 6. If a relationship is to be stored, this is done in the two RAM modules M3 and M4 by the logic element
  • the data memory 7 is selected, for example, as a function of the respective input module.
  • Relationship memory 6 can be selected to check whether a relationship to be saved already exists.
  • FIG. 7 shows a further possible embodiment of a
  • the index register 14 has three RAM
  • the index register 14 can be used for each memory location of the relationship memory 6 (which is determined by an address), the respective preceding address (ie a memory location which refers to this specific memory location) and one
  • the address which is in the memory location A3 could be stored in the RAM module 16, for example for the address A3 of the relationship memory
  • Blocks 16 and 17 are the double-linked list.
  • the index register 14 additionally has RAM modules 15 and 18. Furthermore, a RAM module 13 is additionally assigned to the relationship memory 6. This achieves the following: Using the RAM
  • Module 13 is assigned a free memory location in the index register 14 to each address of the relationship memory 6.
  • Relationship memory 6 acts.
  • FIGS. 6 and 7 could be provided
  • the data memory 7 shown is analogous to that in FIG. 2
  • this date then always being stored in the RAM module 4, for example, in the case of a date to be stored.
  • an allocation memory can be provided in the memory structure for the data memory 6 and, if necessary, for the index register 14, which returns the next free address in the data memory 6 or the index register 14 on request.
  • the logic element 10 is relieved and data and relationships can be written and erased even faster.

Abstract

L'invention concerne un procédé de mémorisation de données. Pour mettre à disposition une structure de mémoire particulièrement efficace, l'invention propose que, pour la mémorisation d'au moins deux lots de données (Data1, Data2,...) en relation dans une banque de données (1) comprenant une pluralité d'emplacements de mémoire, la première donnée (Data1) soit mémorisée dans un premier emplacement de mémoire (5 ; 7-2), la seconde donnée (Data2) soit mémorisée dans un second emplacement de mémoire (5 ; 7-2), et la relation entre les données soit mémorisée dans deux emplacements de mémoire (3, 4) associés de telle sorte qu'une référence à la première donnée (Data1) ou une relation associée au moins indirectement à la première donnée (Data1) est mémorisée dans un emplacement de mémoire (3) parmi les deux emplacements de mémoire associés, et une référence à la seconde de donnée (Data2) ou à une relation associée au moins indirectement à la seconde donnée (Data2) est mémorisée dans le second emplacement de mémoire (4) parmi les deux emplacements de mémoire associés.
EP19783200.9A 2018-11-09 2019-09-20 Procédé et dispositif de mémorisation de données et de relations entre ces dernières Pending EP3877866A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102018128048.3A DE102018128048A1 (de) 2018-11-09 2018-11-09 Verfahren und Vorrichtung zum Speichern von Daten und deren Beziehungen
PCT/DE2019/100829 WO2020094175A1 (fr) 2018-11-09 2019-09-20 Procédé et dispositif de mémorisation de données et de relations entre ces dernières

Publications (1)

Publication Number Publication Date
EP3877866A1 true EP3877866A1 (fr) 2021-09-15

Family

ID=68158845

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19783200.9A Pending EP3877866A1 (fr) 2018-11-09 2019-09-20 Procédé et dispositif de mémorisation de données et de relations entre ces dernières

Country Status (3)

Country Link
EP (1) EP3877866A1 (fr)
DE (1) DE102018128048A1 (fr)
WO (1) WO2020094175A1 (fr)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005081845A2 (fr) * 2004-02-20 2005-09-09 Intelitrac, Inc. Systeme et procede pour la gestion de base de donnees guidee par les donnees
US9747345B2 (en) * 2014-08-12 2017-08-29 Ancestry.Com Operations Inc. System and method for identifying relationships in a data graph

Also Published As

Publication number Publication date
DE102018128048A1 (de) 2020-05-14
WO2020094175A1 (fr) 2020-05-14

Similar Documents

Publication Publication Date Title
EP0910829B1 (fr) Systeme de banque de donnees
EP0855062B1 (fr) Systeme d'informations et procede de memorisation de donnees dans un systeme d'informations
DE60035432T2 (de) System zur verwaltung der rdbm fragmentierungen
DE10255128A1 (de) Computer-implementierte PDF-Dokumentenverwaltung
DE10040987B4 (de) Verfahren und Vorrichtung für übereinstimmende Aktualisierungen von redundanten Daten in relationalen Datenbanken
DE102016216843A1 (de) Verteiltes Zusammenführen von Dateien
DE10056763A1 (de) Generieren von Einschränkungsabfragen mit Hilfe von Tensordarstellungen
DE112010002620T5 (de) Ontologie-nutzung zum ordnen von datensätzen nachrelevanz
EP1276056A1 (fr) Méthode pour administrer une base de données
DE19715723A1 (de) Array-Verfahren
EP1941395A1 (fr) Procede pour commander un systeme de banque de donnees relationnelle
WO2012017056A1 (fr) Procédé et dispositif de traitement automatique de données en un format de cellule
WO2020094175A1 (fr) Procédé et dispositif de mémorisation de données et de relations entre ces dernières
DE10056765A1 (de) Generieren von Statistiken für Datenbankabfragen mit Hilfe von Tensordarstellungen
EP1412875A2 (fr) Procede de traitement de texte dans un ordinateur et ordinateur
EP1099172B1 (fr) Procede, dispositif et jeu de dispositifs pour l'elimination d'au moins une inconsistance dans un ensemble de banques de donnees comportant une banque de donnees et au moins une banque de donnees de copie de ladite banque de donnees
DE60315030T2 (de) Vermeiden von datenverlusten beim aktualisieren eines data warehouse
EP1515244A2 (fr) Mappage d'une hiérarchie des classes sur un système de base de données relationnelles
DE112018001458T5 (de) Elektronische datenbank und verfahren zu deren erstellung
EP2037375B1 (fr) Procédé de fonctionnement de bases de données
EP2136303B1 (fr) Procédé de commande d'une actualisation automatique de visualisations de données dans un système informatique
DE102018104437A1 (de) Computerimplementiertes Verfahren zum Abfragen von Daten
DE102021103571A1 (de) Relationales Datenbanksystem
DE2358689A1 (de) Verfahren und anordnung zur entwicklung einer funktionsspezifikation fuer ein rechnersystem
DE19726569C1 (de) Verfahren zum Zugriff auf eine Speichereinheit und Datenverarbeitungsanlage zum Eingeben einer Eingabefolge sowie zugehörige Speichereinheit

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20210608

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)