+

WO1999015992A1 - Systeme de traitement de donnees - Google Patents

Systeme de traitement de donnees Download PDF

Info

Publication number
WO1999015992A1
WO1999015992A1 PCT/GB1998/002845 GB9802845W WO9915992A1 WO 1999015992 A1 WO1999015992 A1 WO 1999015992A1 GB 9802845 W GB9802845 W GB 9802845W WO 9915992 A1 WO9915992 A1 WO 9915992A1
Authority
WO
WIPO (PCT)
Prior art keywords
storage
data
file
data processing
data file
Prior art date
Application number
PCT/GB1998/002845
Other languages
English (en)
Inventor
Jonathan Stephen Fowler
Original Assignee
British Telecommunications Public Limited Company
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 British Telecommunications Public Limited Company filed Critical British Telecommunications Public Limited Company
Priority to AU91738/98A priority Critical patent/AU9173898A/en
Priority to GB0005479A priority patent/GB2345560A/en
Priority to PL98339436A priority patent/PL339436A1/xx
Priority to HU0004515A priority patent/HUP0004515A2/hu
Publication of WO1999015992A1 publication Critical patent/WO1999015992A1/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/10—File systems; File servers

Definitions

  • the storage means comprises a plurality of interconnected storage mediums each storage location comprising at least an area of a said storage medium.
  • a particular example of such an arrangement is in a network of computers wherein a data processing application running on a particular computer can have access to the disc drive storage on any of the networked computers.
  • the physical location at which the data file is stored can be a directory of any hard disc in the network. If the data processing application is required to determine where to store the data file, this would require a knowledge of the network.
  • the data processing application has no need to know anything about the structure of the storage that is to be used for the data and instead the simple identification is used for identifying the data file that is required.
  • the storage interface receives the data together with the write instruction from the data processing application 1 0 and it can then determine where is appropriate to store the data in the storage locations 1 2 for example by determining where there is sufficient space Before, or once the data is written to the storage location, the storage interface can pass the information on the location of the data file to the storage mapping module 1 1 which has already received information identifying the data file from the data processing application 1 0 to allow information to be stored for future retrieval of the data file.
  • the apparatus can comprise a single computer in which the storage locations comprise a single storage medium segmented into separate areas.
  • Figure 2a illustrates an alternative embodiment wherein the data processing application 1 0, the storage mapping module 1 1 , the storage interface 1 3, and a single storage location 14 are provided within a computer 30 which is connected over a network to other storage locations at other nodes in the network 50, 60 and 70
  • the other nodes in the network 50, 60 and 70 may comprise other computers like computer 30.
  • each may contain a storage mapping module each of which are identical and which require simultaneous updating.
  • only one of the computers may hold the storage mapping module 1 1 and the other computers would require access to it.
  • Figure 2c illustrates yet another embodiment wherein the storage mapping module 1 1 is provided in a totally separate node 41 of the network.
  • the node 41 can comprise a high speed server accessible by all of the other computers running data processing applications to enable the location of data files to be determined and updated rapidly.
  • DMSUs Digital Local Exchanges
  • the calls can be routed by the DLEs to the DMSUs in order to pass calls over long distances.
  • the DMSUs can comprise points of interconnection between the first and third networks and the second and third networks.
  • DMSU and DLE for Indirect Access (IA) calls For every call that passes between network 3 and network 1 or network 2 a call detail record is produced by the exchange (DMSU and DLE for Indirect Access (IA) calls) at the point of interconnection.
  • NMP Network Mediation Processor
  • step S1 0 rows of the streamed file database 2b with the status R are copied into the streamed file database 5a in the master processor 5
  • step S1 1 the status of each row which has been copied is set to A in the streamed file databases 2b and 5a of the streamer system 2 and the master processor 5 respectively
  • step S1 2 the slaves of the cluster 8 then process the streamed files as will be described hereinafter in further detail.
  • the master processor receives a merge file, and errors and warnings file, and an itemised call records file from a slave for a processed file.
  • step S1 5 it is determined that call processing has been successful i.e. the status of the row is M, in the row details of the streamed file database 5a the locations of the merge file, the errors and warnings file, and the itemised call records file are entered and the status of the errors and warnings file is set to A or N depending upon whether there are errors and warnings present and the status of the itemised call records file is set to A.
  • step S22B the location of the merge file is identified from the database entry and in step S23B the merge file is read.
  • step S24B the summary information is merged to form a summary table.
  • the summary tables can hold both daily summaries and monthly summaries and provide the basis from which end users can produce billing reports. Information held on these summary tables include the number of calls made, the duration of these calls and various items of settlement information. Call details are grouped by items such as operator, date of calls, the accounting period they were processed in, the wholesale call class, the type of service, direction, point of interconnection, route, tariff period, tariff options and time period.
  • step S25B it is determined whether the merge processing has been successful. If not in step S26B the main status of a row is set to W and in step S27B an operator can manually intervene to try to correct the reason for the merge failure.
  • step S28B it is determined whether the correction attempt has been successful and if so in step S31 B the main status of the row is re-set to M and the process returns to step S22B. If in step S28B it is determined that the correction attempt has not been successful, in step S29B the main status of the row is set to Z and in step S30B an error report is raised for the file. The process can then return to step S1 2 to process another file.
  • step S32B If in step S25B it is determined that the merge processing has been successful, in step S32B the main status of the row is changed to P and the merge file is deleted.
  • step S34B the errors and warning file is then loaded into the call record error analyser 1 05 for analysis.
  • step S35B it is determined whether the loading has been successful and if not in step S37B the errors and warnings status is set to F.
  • step S38B an operator can manually intervene to try to correct the reason for the error file loading failure.
  • step S39B it is determined whether the correction is possible and if so the errors and warning status is set to A in step S40 and the process returns to step S33B. If correction is not possible in step S41 B the errors and warnings status is set to K and in step S42B an error report for the file is raised. The process then returns in step S1 2 for the processing of another file.
  • the information on the storage location of the data is stored in a table or database thus allowing the changing of the data storage structure or movement of the data without affecting the data processing operations i.e. there is no need to change the code of the data processing applications
  • the table of Figure 1 2 indicates the location of the data, the status of the storage location and the free space available in the storage location, in this way the storage of data can be controlled simply using this table
  • this table can also include a column indicating the formats of the data stored in the location. In this way data can be held in different formats such as normal and compressed without the need for the data processing applications to have to take into consideration such formats. This greatly simplifies the programming required for the data processing applications.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention concerne une application informatique traitant des fichiers de données et générant des instructions de mémoire pour des fichiers de données identifiés par des informations d'identification indépendantes de l'emplacement mémoire des fichiers de données. Une pluralité d'emplacements mémoire est fournie de façon à mettre des fichiers de données en mémoire. Un topogramme mémoire conserve, d'une part des informations sur les emplacements mémoire des fichiers de données mis en mémoire dans ces emplacements mémoire, et d'autre part des informations d'identification concernant les fichiers de données en mémoire. Les informations d'identification générées par l'application informatique sont utilisées pour consulter des informations d'emplacement mémoire. Une interface, qui reçoit les informations d'emplacement mémoire et les instructions de mémoire indiquant une opération de mémoire à effectuer, exécute les instructions de mémoire concernant le fichier de données dans un emplacement mémoire indiqué par les informations d'emplacement mémoire.
PCT/GB1998/002845 1997-09-24 1998-09-21 Systeme de traitement de donnees WO1999015992A1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
AU91738/98A AU9173898A (en) 1997-09-24 1998-09-21 Data processing system
GB0005479A GB2345560A (en) 1997-09-24 1998-09-21 Data processing system
PL98339436A PL339436A1 (en) 1997-09-24 1998-09-21 Data processing system
HU0004515A HUP0004515A2 (hu) 1997-09-24 1998-09-21 Adatfeldolgozó berendezés és eljárás adatfeldolgozásra

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GB9720395.4 1997-09-24
GBGB9720395.4A GB9720395D0 (en) 1997-09-24 1997-09-24 Data processing system

Publications (1)

Publication Number Publication Date
WO1999015992A1 true WO1999015992A1 (fr) 1999-04-01

Family

ID=10819625

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/GB1998/002845 WO1999015992A1 (fr) 1997-09-24 1998-09-21 Systeme de traitement de donnees

Country Status (5)

Country Link
AU (1) AU9173898A (fr)
GB (2) GB9720395D0 (fr)
HU (1) HUP0004515A2 (fr)
PL (1) PL339436A1 (fr)
WO (1) WO1999015992A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1193962A1 (fr) * 2000-09-21 2002-04-03 Siemens Aktiengesellschaft Transmission de données en temps réel depuis un élément de réseau vers un serveur d'application avec une méthode de récupération en cas de rupture de liaison
EP1274010A3 (fr) * 2001-07-02 2006-08-02 Hitachi, Ltd. Système de traitement d'information et méthode d'allocation de stockage
CN108287706A (zh) * 2017-05-10 2018-07-17 腾讯科技（深圳）有限公司 数据处理方法及装置
US11329803B2 (en) 2020-09-29 2022-05-10 Amazon Technologies, Inc. Redundancy controls in convergent encryption using dynamic salt values
US11582025B2 (en) 2020-09-29 2023-02-14 Amazon Technologies, Inc. Efficient deduplication using block-based convergent encryption

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5619690A (en) * 1993-06-21 1997-04-08 Hitachi, Ltd. Computer system including a computer which requests an access to a logical address in a secondary storage system with specification of a local address in the secondary storage system
EP0774723A2 (fr) * 1995-11-20 1997-05-21 Matsushita Electric Industrial Co., Ltd. Système de gestion de fichiers virtuels

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5619690A (en) * 1993-06-21 1997-04-08 Hitachi, Ltd. Computer system including a computer which requests an access to a logical address in a secondary storage system with specification of a local address in the secondary storage system
EP0774723A2 (fr) * 1995-11-20 1997-05-21 Matsushita Electric Industrial Co., Ltd. Système de gestion de fichiers virtuels

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1193962A1 (fr) * 2000-09-21 2002-04-03 Siemens Aktiengesellschaft Transmission de données en temps réel depuis un élément de réseau vers un serveur d'application avec une méthode de récupération en cas de rupture de liaison
US6892244B2 (en) 2000-09-21 2005-05-10 Siemens Aktiengesellschaft Method of transmitting real-time data from a network element to an application server
EP1274010A3 (fr) * 2001-07-02 2006-08-02 Hitachi, Ltd. Système de traitement d'information et méthode d'allocation de stockage
CN108287706A (zh) * 2017-05-10 2018-07-17 腾讯科技（深圳）有限公司 数据处理方法及装置
US11329803B2 (en) 2020-09-29 2022-05-10 Amazon Technologies, Inc. Redundancy controls in convergent encryption using dynamic salt values
US11582025B2 (en) 2020-09-29 2023-02-14 Amazon Technologies, Inc. Efficient deduplication using block-based convergent encryption

Also Published As

Publication number Publication date
GB2345560A (en) 2000-07-12
HUP0004515A2 (hu) 2001-05-28
AU9173898A (en) 1999-04-12
PL339436A1 (en) 2000-12-18
GB9720395D0 (en) 1997-11-26
GB0005479D0 (en) 2000-04-26

Similar Documents

Publication Publication Date Title
US5890156A (en) Distributed redundant database
US6493680B2 (en) Method and apparatus for processing billing transactions
EP0366341B1 (fr) Dispositif sûr de gestion de banque de données
US6292889B1 (en) Distributed computer network including hierarchical resource information structure and related method of distributing resources
JP4187178B2 (ja) 迅速なデータベース同期の通信システム
US5333183A (en) Universal MDR data record collection and reporting system
US7100005B2 (en) Record storage and retrieval solution
US8577795B2 (en) System and method for revenue and authorization management
US6832248B1 (en) System and method for managing usage quotas
CN107247778B (zh) 用于实施可扩展数据存储服务的系统和方法
EP0586550A1 (fr) Analyseur d'utilisation de memoire de base de donnees relationnelle
WO1992021090A9 (fr) Analyseur d'utilisation de memoire de base de donnees relationnelle
WO1997024688A9 (fr) Procede et dispositif de traitement des transactions de facturation
US20020048284A1 (en) System and method for data protection with multidimensional parity
EP0692172A1 (fr) Systeme de correction de donnees pour reseau de transmission
CN101443761A (zh) 对文件系统的支持qos的生命周期管理
JP2002505044A (ja) Ｓｃｐデータベースの移動
US20030145013A1 (en) Service package application and a service activation manager for use with a service control point in an advanced intelligent network
US6134560A (en) Method and apparatus for merging telephone switching office databases
WO1999015992A1 (fr) Systeme de traitement de donnees
Bowen et al. A scalable database architecture for network services
Yeung et al. Selective broadcast data distribution systems
WO1999016232A1 (fr) Systeme de traitement de donnees pour reseau de communications
MXPA00002688A (en) Data processing system for communications network
US20040220974A1 (en) System for processing data for storage and retrieval

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 09171981

Country of ref document: US

AK Designated states

Kind code of ref document: A1

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

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SZ 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 BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

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

Ref country code: GB

Ref document number: 200005479

Kind code of ref document: A

Format of ref document f/p: F

NENP Non-entry into the national phase

Ref country code: KR

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: CA

122 Ep: pct application non-entry in european phase
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载