WO2002039209A2 - Procede pour maintenir l'identite d'une paire de bases de donnees hierarchiques completees interconnectees ainsi que reseau de communication pour la mise en oeuvre de ce procede - Google Patents

Procede pour maintenir l'identite d'une paire de bases de donnees hierarchiques completees interconnectees ainsi que reseau de communication pour la mise en oeuvre de ce procede Download PDF

Info

Publication number
WO2002039209A2
WO2002039209A2 PCT/RU2001/000454 RU0100454W WO0239209A2 WO 2002039209 A2 WO2002039209 A2 WO 2002039209A2 RU 0100454 W RU0100454 W RU 0100454W WO 0239209 A2 WO0239209 A2 WO 0239209A2
Authority
WO
WIPO (PCT)
Prior art keywords
base
eτοy
bases
πaρy
pair
Prior art date
Application number
PCT/RU2001/000454
Other languages
English (en)
Russian (ru)
Other versions
WO2002039209A3 (fr
Inventor
Mikhail Mikhaylovich Makarchouk
Original Assignee
Makarchouk Mikhail Mikhaylovic
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
Priority claimed from RU2000127879/09A external-priority patent/RU2000127879A/ru
Application filed by Makarchouk Mikhail Mikhaylovic filed Critical Makarchouk Mikhail Mikhaylovic
Priority to AU2002217635A priority Critical patent/AU2002217635A1/en
Publication of WO2002039209A2 publication Critical patent/WO2002039209A2/fr
Publication of WO2002039209A3 publication Critical patent/WO2002039209A3/fr

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/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/282—Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes

Definitions

  • the invention is related to the field of communication, namely, telephones, television,
  • the information in the message that is, in the meantime, is the transmission of the message.
  • the invention enables the use of multiple multi-level communication networks with the smallest number of trunk lines or
  • channels of channels and in existing networks to increase the number of subscribers using the communication channel. This is achieved due to the reduction in the time of transmission of the message in the network.
  • Each next level of the base contains links or addresses to
  • the message is transmitted through the communication channel to the recipient, where it is used by the user.
  • the message has been substantially complied with in comparison with the unauthorized forwarding of the message.
  • the data of the user may be updated.
  • the update programs are available both in the unit, in the unit and in the unit. If there are other sources of updating the databases, then they are involved and others that correspond to them with the updating programs.
  • the method of maintaining the identity of interconnected databases of such a type as the transmitter and the receiver is subject to different conditions of interconnection and is a separate part of it. Therefore, the method of maintaining the identity provided in this application is also applicable and in the case of other sources of complementation of the databases of the interconnected database.
  • the closest analogue of the claimed method is the method of updating the database used in the encryption program. This method is free in that the two databases are merged into one, which excludes the possibility of transferring the payment to the site.
  • Another source of communication is the hi-tech communication network for transmitting messages with improved information. It is known that a message is made up of addresses and information. There are two reasons for the reduction in transmission time. ⁇ - ⁇ e ⁇ vy ⁇ , ie ⁇ a ⁇ iches ⁇ aya se ⁇ , analizi ⁇ uya ad ⁇ esnuyu Part s ⁇ bscheniya, ⁇ zv ⁇ lyae ⁇ is ⁇ lyuchi ⁇ zhos ⁇ uyu ma ⁇ sh ⁇ u ⁇ izatsiyu and bys ⁇ ee name ⁇ i ⁇ for ⁇ e ⁇ edachi s ⁇ bscheny vi ⁇ ualny ⁇ anal, ⁇ y ⁇ ealizue ⁇ sya che ⁇ ez ne ⁇ b ⁇ dimuyu ⁇ mmu ⁇ atsiyu l ⁇ alny ⁇ se ⁇ ey ⁇ azlichny ⁇ u ⁇ vney. Well, at the expense of complying with the information part, the message itself is reduced.
  • Local networks are connected via multiple bus junctions and are connected to the local bus (Patent ⁇ 21 ° 18069, 1998). This allows you to send the message directly to the local network of the recipient. Due to the direct access to the device, the address of the destination is reduced by the total transmission time of the network without the need for computing power. Local networks of any level may have a broad broadcasting, such as "tree”, "bus”, “star”, or ring circuit. With this, a complete extension of the messages sent is always possible.
  • the closest analogue of the claimed network is the above-mentioned hierarchical communication network (Patent ⁇ ⁇ 2118069, 1998), which is used to transmit messages without complying with information and communications. This concludes the drawback of such a network, because it does not achieve a potential reduction in the transmission of messages.
  • the claimed method of transmitting the identities of the pairs of interconnected and complementary databases solves the problem of transmitting the messages of the base of the
  • the distribution program with the help of which the information part of the message has been completed, has been completed.
  • the task of the method is to upgrade and use the recipient to achieve the identity of this pair of bases.
  • the interconnected pair of bases, the switch and the transmitter, can change their settings over time.
  • the order of the buffers and the order of the bases are indicated in the exchange directory, which regulates the conditions and the start and end of the exchange.
  • the commencement of the exchange may, for example, be divided by the last moment of the termination of the communication with one of the two users or the user.
  • any subscriber is associated with a few other different users, then, to communicate with others, this user is independant of their own and have an independent base. Out of stock 7 of these databases will generate anesthetic features. Wherever from the data provided in the subscriber section, it makes up an interconnected pair of bases with the base of the corresponding subscriber. Some of these databases in the subscriber section, the original and the second one, and the process of reconditioning, reconditioning, ⁇ As a result, the total volume of databases of the subscriber item may increase.
  • the subscriber item from them allocates the general part - the non-renewable hierarchical database.
  • the subscriber’s part is made up of this general, unexpandable database and a number of large databases are the number of connections of this telephone subscriber.
  • not v ⁇ dyaschey in s ⁇ s ⁇ av ni ⁇ a ⁇ g ⁇ ab ⁇ nen ⁇ s ⁇ g ⁇ ⁇ un ⁇ a, ⁇ a ⁇ lse, ⁇ a ⁇ and ⁇ alsduyu s ⁇ v ⁇ u ⁇ n ⁇ s ⁇ bases isy ⁇ ⁇ alsd ⁇ g
  • the written method also means that it is not necessary to fix elements that are used to upgrade the databases, which are used only when the base is inoperative.
  • the described method is so small that there are a few databases, one of which is connected to a single database.
  • the above described method means that there is no other way to refer to the most recent database, which is not included in any abstract item or in any other basic parameter.
  • the hi-tech communication network for the transmission of messages with updated information which are made up of different networks from local networks,
  • the quick connects are many to the internal bus junctions,
  • the network is small, that is, in the informative part of the message
  • Additional includes an index-number of the program-storage
  • the network is small, which includes an additional part of the communication of the accessories of the computer
  • the network is small, which, as a part of the communication of accessories, includes an accessory for the power supply of the charger.
  • the network is small, that is, in the informative part of the message
  • the network is small, which, in the informative part of the message, also includes a complete message box.
  • the network can be distinguished by the fact that it maintains the identity of the databases of the interconnected pair of bases, for which, if you upgrade only a large base
  • This base sends you an address that sends this address to such an LS
  • the network is smaller than that for the addition of only one base from
  • the network described above may be different from each other.
  • the network is smaller than the addition of a base from
  • the above described network is young, which is supplemented by kalsdoy
  • the network is smaller than the addition of a base from
  • the network is small in that it fixes the elements intended for
  • Variations of the bases for steam are made at varied intervals in the case of an accidental basis for the cured base of this pair.
  • the network may be different in that there are a few databases from one of Kalsda
  • interconnected database units integrate one address into the subscriber point.
  • the network is distinguished by the fact that in every database that is not included in any
  • a quick subscriber point such as a shortcut, as well as a quick turnaround in the database of a quick pass
  • the universal non-executable non-rudimentary database of data generally includes
  • the network is small, that is, in the informative part of the message

Abstract

Selon l'invention, un procédé pour maintenir l'identité d'une paire de bases de données hiérarchiques complétées interconnectées consiste en ce qui suit: lorsqu'une seule base faisant partie d'une paire interdépendante de bases de données est complétée, chaque élément qui complète un niveau donné de cette base à une adresse donnée est envoyé à la même adresse et au même niveau dans l'autre base de cette paire. L'invention concerne aussi un réseau de communication hiérarchique, destiné à la transmission de messages à forte densité d'informations, qui est composé de réseaux locaux de niveaux différents qui sont reliés par des unités de connexion à ports multiples à bus interne, connectées entre elles; elles ce distinguent en ce que chaque abonné connecté à un réseau local est pourvu de programmes de codage à niveaux multiples du message à transmettre, de programmes de décodage à niveaux multiples du message reçu par le réseau et de programmes pour compléter une base de données hiérarchique qui se crée chez l'abonné. On inclut dans la partie informationnelle du message codé et transmis par le réseau l'adresse de l'abonné expéditeur.
PCT/RU2001/000454 2000-11-09 2001-10-29 Procede pour maintenir l'identite d'une paire de bases de donnees hierarchiques completees interconnectees ainsi que reseau de communication pour la mise en oeuvre de ce procede WO2002039209A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2002217635A AU2002217635A1 (en) 2000-11-09 2001-10-29 Method for maintaining the identity of a pair of interacting augmented hierarchical data bases and communication network for carrying out said method

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
RU2000127879 2000-11-09
RU2000127879/09A RU2000127879A (ru) 2000-11-09 Способ поддержания идентичности пары взаимосвязанных иерархических пополняемых баз данных
RU2000130055 2000-12-01
RU2000130055/09A RU2000130055A (ru) 2000-12-01 Иерархическая сеть связи для передачи сообщений с уплотненной информацией

Publications (2)

Publication Number Publication Date
WO2002039209A2 true WO2002039209A2 (fr) 2002-05-16
WO2002039209A3 WO2002039209A3 (fr) 2002-08-01

Family

ID=26654065

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/RU2001/000454 WO2002039209A2 (fr) 2000-11-09 2001-10-29 Procede pour maintenir l'identite d'une paire de bases de donnees hierarchiques completees interconnectees ainsi que reseau de communication pour la mise en oeuvre de ce procede

Country Status (2)

Country Link
AU (1) AU2002217635A1 (fr)
WO (1) WO2002039209A2 (fr)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5428646A (en) * 1992-12-24 1995-06-27 Motorola, Inc. Device and method for frame synchronization in a multi-level trellis coding system
US5579318A (en) * 1994-06-30 1996-11-26 Bellsouth Corporation Processes and apparatus for maintaining data concurrence between databases in telecommunications networks
US5764978A (en) * 1994-03-03 1998-06-09 Fujitsu Limited Database system having a hierarchical network database and a corresponding relational database
US5787443A (en) * 1995-11-14 1998-07-28 Cooperative Computing, Inc. Method for determining database accuracy
RU2118069C1 (ru) * 1997-07-10 1998-08-20 Сергей Васильевич Закурдаев Иерархическая сеть связи
EP0920164A2 (fr) * 1997-11-28 1999-06-02 Nokia Mobile Phones Ltd. Procédé de codage et de modulation, et dispositif pour sa mise en oeuvre

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5428646A (en) * 1992-12-24 1995-06-27 Motorola, Inc. Device and method for frame synchronization in a multi-level trellis coding system
US5764978A (en) * 1994-03-03 1998-06-09 Fujitsu Limited Database system having a hierarchical network database and a corresponding relational database
US5579318A (en) * 1994-06-30 1996-11-26 Bellsouth Corporation Processes and apparatus for maintaining data concurrence between databases in telecommunications networks
US5787443A (en) * 1995-11-14 1998-07-28 Cooperative Computing, Inc. Method for determining database accuracy
RU2118069C1 (ru) * 1997-07-10 1998-08-20 Сергей Васильевич Закурдаев Иерархическая сеть связи
EP0920164A2 (fr) * 1997-11-28 1999-06-02 Nokia Mobile Phones Ltd. Procédé de codage et de modulation, et dispositif pour sa mise en oeuvre

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
I.N. NORENKOV ET AL.: 'Telekommunikatsionnye tekhnologii i seti' IZDATELSTVO MGTU IM. N.E. BAUMANA 1998, MOSCOW, pages 118 - 119, 128-129 *

Also Published As

Publication number Publication date
AU2002217635A1 (en) 2002-05-21
WO2002039209A3 (fr) 2002-08-01

Similar Documents

Publication Publication Date Title
US6249806B1 (en) Apparatus and method for providing information about two-way computer communication services
CN101246486B (zh) 用于改进的表达式处理的方法和装置
CN105391811A (zh) 域名解析方法、应用服务器的访问方法及其终端
EP0485252A2 (fr) Appareil et procédé pour le découplage de détails d'échange de données pour fournir une communication à haute performance entre des processus de logiciel
CN101019410B (zh) 传送来自dsl系统部件的信息的方法和设备
CN106656650A (zh) 业务测试环境的生成方法和系统、业务测试的方法、装置和系统
CN103416042A (zh) 用于混合通信网络的寻址方案
CN110503220A (zh) 排课方法、装置、电子设备和存储介质
CN109194736A (zh) 消息去重方法、装置、电子设备、介质和无人车
CN100581273C (zh) 一种实现移动终端音乐类业务跨平台交互的系统及方法
CN1325578A (zh) 配置用于数据传输的通信链路的方法
WO2002039209A2 (fr) Procede pour maintenir l'identite d'une paire de bases de donnees hierarchiques completees interconnectees ainsi que reseau de communication pour la mise en oeuvre de ce procede
CN112486825A (zh) 多泳道环境架构系统、消息消费方法、装置、设备及介质
CN109921875A (zh) 数据传输方法、系统及设备
US8027838B2 (en) Method and system for connecting characters, words and signs to a telecommunication number
US20060080396A1 (en) Electronic mail charging system and electronic mail charging method
US7272211B2 (en) Property management system protocol auto-detection
CN106897058A (zh) 业务对象安装包的融合方法与装置
Coughlin Telecommunications: equipment fundamentals and network structures
CN116723239B (zh) 区块链数据的传输方法、装置、电子设备和可读介质
CN109885555A (zh) 一种用户信息管理方法及装置
KR100784068B1 (ko) 단문 메시지를 이용한 통화 대기음 변경 방법과 이를 위한통화 대기음 제공 시스템
CN110209644A (zh) 日志管理的方法、装置及系统
CN109726224A (zh) 应用程序间的数据共享方法及装置、终端、服务器及介质
CN102238220A (zh) 应用于车载系统的天气资讯提供方法及装置

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

AK Designated states

Kind code of ref document: A3

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase in:

Ref country code: JP