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/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Definitions

• the technical field of this invention is in the area of electronic data processing. More particularly, the invention relates to methods, computer program products and systems for replicating data objects.
• replication The replication of data objects is well known to every user of a computer and is a standard procedure, which is routinely applied.
• a special application of replicating data objects is the copying or the archiving process, by which data objects are copied from a source system to a target system for safety and/or performance reasons . In these special applications, the data objects remain unchanged.
• the more general term "replication" comprises also such processes, in which the data objects are changed during the replication process. Such changes may be a consequence of the need to concentrate the amount of data or of the wish of the user of the target system to receive only a particular part of the data object.
• ERP enterprise resource planning software
• a source system may be the computer and software system of the financial and or controlling department and the target system may be the computer and software system of the management .
• financial data e.g. the posting data may be replicated (transferred under changes such as aggregations or concentrations or copied) from the financial system to the management system.
• the transactions of the enterprise are stored in the computer system independently and at any ⁇ time.
• These data replications usually take place less frequently, and in order to reduce the amount of the transferred data volume, only data objects which are new or amended since the previous replication process should be replicated.
• One method to reach this goal is the time stamp process.
• a time stamp is assigned to the data object to be stored in the source system.
• the time stamp is usually the time at which the data object is stored or a time shortly after the storage process has started.
• the replication application this is a software application, which replicates the data object from the source to the target system - replicates at a particular run only such data objects, the time stamps of which are within a particular, predefinable time interval.
• this method has the disadvantage that the time stamp is not necessarily identical with time of the actual commit of the data base (application) , which physically stores/writes the data object on the physical storage means. This discrepancy may cause failures, particularly missing data objects, in the replication process, if the replication process takes place between at a time between the time stamp and the time of the commit and /or of the storing and replication processes run parallel.
• a time stamp t s , a commit t c , and a replication interval from ti to t 2 where ti ⁇ t s ⁇ t 2 ⁇ t c .
• the particular data object is, due to the lacking commit (t 2 ⁇ t c ) , not yet visible for the replication application and will thus not be replicated.
• the time stamp of that data object is not within the interval because of t s ⁇ t 2 .
• This problem is usually defused by using a time t 2 + ⁇ t as the upper level of the replication interval and starting the subsequent replication run exactly at t 2 .
• a usual length of ⁇ t is about 30 min.
• methods and systems consistent with the principles of the invention provide an electronic data element for access for data object processing processes in a computer system comprising said element being settable to at least: a) a first state, in which said element can be accessed by one or more of the data object processing processes and whereby said element is assignable to one or more of the data objects, b) a second state, in which said element can not be accessed by one or more of the data processing processes but is assignable to one or more of the data objects, and c) a third state, in which said element can not be accessed by one or more of the data processing processes and is not assignable to the one or more data objects .
• inventive electronic data element in data processing, software applications, which require access to data objects for data processing, storing or replication purpose, can check by querying the electronic data element and its state, what operations on the on the electronic data element and/or the data objects are allowed or not allowed, particularly whether the data objects having that electronic data element assigned are ready for the replication process. If they are, such data objects may be replicated from their source system to a target system. Further, it is assured that no further data objects can be assigned to that particular electronic data element. Thus, no data object can be omitted by the replication process.
• methods and systems consistent with the principles of the invention provide a method for processing data objects by means of one or more processes running in a computer system having one or more previous electronic data elements, which are in a first state, comprising: a) selecting one of the previous electronic data elements, and assigning it to one or more data objects and storing the data objects.
• the invention further comprises a method for processing data objects in a computer system comprising: creating one or more of the inventive electronic data elements and setting it to the first state.
• the invention is further directed to data structures having electronic data elements, to a computer system, a computer program, a computer readable medium and a carrier signal comprising instructions for processing data according to the inventive method and in its embodiments, respectively.
• Fig. 1 is a schematic block diagram for illustrating an implementation of the inventive electronic data element within a computer system.
• Fig. 2 is an exemplary block diagram for illustrating operations applicable on the electronic data element.
• Fig. 3 is an exemplary flow diagram for illustrating a first implementation of data processing process using the electronic data element.
• Fig. 4 is an exemplary flow diagram for illustrating a second implementation of data processing process using the electronic data element.
• Fig. 5 is an is an exemplary flow diagram for illustrating a third implementation of data processing process using the electronic data element.
• Fig. 6 is an exemplary flow diagram for illustrating a first implementation of data replicating process using the electronic data element .
• Fig. 7 is an exemplary flow diagram for illustrating a second implementation of data replicating process using the electronic data element .
• Fig. 7a is an exemplary flow diagram for illustrating a further implementation of data replicating process using the electronic data element .
• Fig. 8 is an illustration of the chronological sequence of the states of the electronic data element and of steps according to the inventive method, performed by several independent processes.
• a computer system broadly refers to any stand alone computer such as a PC or a laptop or a series of computers connected via a network, e.g. a network within a company, or a series of computers connected via the internet .
• Computer systems and programs may be closely related.
• phrases, such as “the computer provides” and “the program provides or performs specific actions”, "a user performs a specific action” are used to express actions by a computer system that may be controlled by a program or to express that the program or program module may be designed to enable the computer system to perform the specific action or to enable a user to perform the specific action by means of a computer system.
• data object broadly refers to any kind or type of data, e.g. numerical or textual data, image data, meta data, irrespective whether the data are implemented as whole files or parts of files or fields in tables, irrespective whether they are stored in volatile memory or non volatile memory.
• data objects may be implemented as one or more fields of one or more tables, particularly of tables of a relational data base system. Processing of such data objects comprises usual operations on data, such as calculating, amending, copying, deleting, inserting ...
• commit broadly refers to a final step in the successful completion of a previously started database change as part of handling a transaction in a computing or computer system.
• an inventive electronic data element may be implemented as one or more lines of one or more tables, each line having one or more fields.
• object orientated programming an electronic data element may be implemented by an instance of a class. The class then has at least a variable for an identifier (abbreviated as "ID") and a variable for the state.
• ID an identifier
• a first embodiment of the electronic data element is characterized in that said data element is implemented as one or more first fields and a second field of a table, whereby the one or more first fields contain an identifier and the second field contains information on the state for the identifier in the one or more first field.
• An alternative embodiment of the electronic data element is characterized in that said data element is implemented as one or more first fields in a first table and a second field in a second table, whereby the one or more first fields in the first table contain an identifier and the second field in the second table contains information on the state for the identifier in the one or more first fields of the first table.
• One or more of the following operations may be allowed to be performed on the electronic data element: create an electronic data element having the first state, changing the first state to the second or third state, changing the second state to the third state, blocking or deblocking a change of state, setting/deleting a lock (see below) , particularly a shared lock, on the ID, requesting the state of the ID.
• the change of the state may be made dependent on predefinable conditions, e.g. whether a (shared) lock is set on the ID.
• the setting of a lock may be made dependent on the state-, if the state is the second state, no shared lock is allowed to be set on the ID, what is one example of a possible implementation of the second state.
• a change in state from III to I or II is forbidden.
• a further variable may be available, which may have a state/content "default" or "non default", so defining the respective electronic data element as a default element .
• a change in state may be implemented by changing the entry in the field for the state information from a symbol (e.g. character, number, sign or combinations thereof) for the first or second state to a symbol for the third state.
• a symbol e.g. character, number, sign or combinations thereof
• a lock is a mechanism of a database or software application, which prevents a particular data from being accessed by other applications. This is now explained in more detail .
• a computer database system automatically sets database locks when it receives change statements (INSERT, UPDATE, MODIFY, DELETE) from a program.
• Database locks are physical locks on the database entries affected by these statements. Only a lock for an existing database entry can be set, since the lock mechanism uses a lock flag in the entry. These flags are automatically deleted in each database commit . This means that database locks can never be set for longer than a single database LUW (logical unit of work) .
• Physical locks in the database system may therefore in some circumstances be insufficient for the requirements of locking data.
• locks must remain set for the duration of several LUW steps. They must also be capable of being handled by different work processes and even different applications.
• so called logical locks have been created.
• the setting of logical locks means that a locked data object is not physically locked in the database table.
• a logical lock may be implemented merely as an entry of a lock argument in a central lock table.
• the lock argument may be the primary key field of the data object to be locked, e.g. the ID.
• the logical lock is independent of database LU s .
• Shared locks (or read locks) set by an application (or program) allow to prevent data from being changed by other applications while being read by that application.
• Shared locks prevent other programs from setting an exclusive lock (write lock) to change the object. It does not, however, prevent other programs from setting further shared locks.
• Exclusive locks (or write locks) set by an application allow to prevent data from being changed while that application is changing the data itself.
• An exclusive lock as its name suggests, locks an data object for exclusive use by the program that sets it. No other program can then set either a shared lock or an exclusive lock for the same application object.
• an inventive electronic data element When being in the first state, an inventive electronic data element can be accessed by processes, which processes a data object, and can be assigned to one or more data objects, processed by any of this processes. Assigning an electronic data element to a data object may be implemented e.g. by storing a copy of it together with the data object or by storing a copy of it together with a second ID, which unambiguously identifies the particular data object, in a separate table. Alternatively, a link to the electronic data element may be added and stored. Further alternatively, a link to the data object or an identifier of it and the ID of the electronic data element may be stored in a separate table.
• a data processing process is allowed to set a shared lock on the electronic data element . If the electronic data element is in the second state, the electronic data element can still be read and assigned to the data objects. However, the electronic data element can not be accessed, i.e. setting a shared lock on that electronic data element is not allowed for that data processing process.
• the electronic data element If the electronic data element is in the third state, it can neither be accessed by a data processing process nor be assigned to a data object. However, replicating processes can us this third state to select all data objects, which have a particular electronic data element of the third state assigned. Because of the properties of the three states as described above, this (or these) particular third state electronic data element (s) can no more be assigned nor accessed by any other data processing process. Thus, by using replication processes, which select data objects having third state electronic data elements assigned, it is assured that no data object can be omitted because of time gap problems as described in the related art section.
• a first embodiment of the inventive method as described in the summary section is characterized in that the method further comprises a step of b) setting the selected electronic data element to the second state.
• This may be implemented by an independent program, which may also create IDs automatically by incrementing, or "manually" by a user of the computer system.
• a second embodiment of the inventive method is characterized in that the method further comprises c) setting the selected electronic data element to the third state if the storing of the assigned data objects is committed.
• a third embodiment comprises dependent or independent of steps a) to c) , d) creating a further electronic data element and setting it to the first state.
• a further embodiment comprises e) defining the further electronic data element as default element and setting the previous electronic data elements to the second state .
• a further embodiment is characterized by defining the further electronic data element as default and changing the state of a previous electronic data element, which has been defined as a default element, to the second state .
• a further embodiment is characterized in that in step a) selecting the default element for assigning it to the one or more data objects.
• the invention comprises in step a) : setting a block having a reference to the process, which sets the block, on the electronic data element, said block preventing the change of the state of the electronic data element to the third state if the state is the first or second state. Additionally, a still further embodiment comprises in step a) : deleting the block, the reference of which points to that process, if the state is the first or second state and if the storing is committed.
• An other embodiment is characterized by irreversibly blocking the change of the state of the electronic data element if the state is the third state.
• the blocking is implemented by setting a shared lock on the selected electronic data element.
• Deblocking may be implemented by deleting the shared lock.
• a still further embodiment is characterized by the blocking is implemented in step a) by setting a shared lock on the electronic data element previous to assignment of the electronic data element to that data object.
• a still further embodiment is characterized in that the deblocking is implemented in step a) by deleting the shared lock as soon as the storing is committed.
• a still further embodiment of the inventive method is characterized by preceding step c) : f) checking whether a shared lock is set on the electronic data element and in case no shared lock is set, performing step c) .
• a still further embodiment comprises g) in case step c) failed, waiting a predefinable time and returning to f) .
• a still further embodiment is characterized by repeating step g) a preselectable number of times.
• a still further embodiment is characterized by the checking is implemented by trying to set an exclusive lock on the electronic data element and in case the exclusive lock has been set, returning that no shared lock is set on the electronic data element.
• a still further embodiment is characterized by steps b) and/or c) being performed independently by independent processes .
• a still further embodiment comprises after creating an data element in the first sate: h) creating a predefinable numbers of sub processes for processing the correspondent number of data objects, i) performing step a) for each data object in the corresponding sub process j) in the process which created the sub processes: waiting until the corresponding number of shared locks has been set on the data element before changing the state of the data element to the second state, k) processing and storing the data objects in the respective sub processes.
• a still further embodiment of the inventive method is characterized by 1) replicating the data objects, the assigned data elements of which are set to the third state, to a target system.
• GUID is known in the art and broadly refers to a global unique identifier. It is a term used for a number that programming generates to create a unique identity for an entity such as a Word document.
• GUIDs are widely used in products to identify interfaces, replica sets, records, and other objects. Different kinds of objects have different kinds of GUIDs - for instance, a Microsoft Access database uses a 16-byte field to establish a unique identifier for replication.
• a time stamp contains date and time of a specific action performed on the data object. Date and/or time may be stored in separate fields of the ID part of the electronic data element.
• a still further embodiment is characterized by the data elements in the third state are numbered consecutively.
• a still further embodiment is characterized in that the shared locks are logical read locks or data base read locks .
• a still further embodiment is a the inventive method for use in an enterprise resource planning software.
• a particular use is the processing, storing and replicating of data objects of the financial area, e.g. booking, accounting, invoicing, receipt, voucher ... objects .
• Fig. 1 depicts one example of an implementation of an embodiment of the invention: A computer system with program modules for performing the inventive method.
• Fig. 1 shows a computer system 101 comprising a computer 103 having a CPU 105, a working storage 102 (memory) , in which an sof ware application 111 is stored for being processed by CPU 105.
• Software application 111 comprises program modules 109, 110 for carrying out data replication and data processing according to the inventive method.
• the inventive electronic data elements are implemented in a table 106 comprising a column for identifiers (abbreviated as "ID" and numbered consecutively, e.g.
• ID identifiers
• Computer system 103 further comprises a first storage means 107, in which the data objects of the source system are stored.
• a second storage means 108 is the storage means of the target system.
• the source system in Fig. 1 is the computer system 103 minus storage means 107
• the target system is the computer system 103 minus the storage means 108.
• the target or source system may be any other network computer 114.
• any data objects, which are transferred to the modules 110 are processed by these modules 110.
• the inventive processing comprises checking, within each module 110, whether a DID is available. In the example in Fig. 1, an ID "ID3" is defined as DID. Module 110 then checks, whether the DID is in state I . This may be performed by querying table 106. An alternative method is trying to set a shared lock on that DID. In case the shared lock has been set, the DID is in state I. Then, the DID is assigned to the data objects processed by module 110 and the data objects are processed and stored on the storage means 108. After the commit of the storage of the data objects assigned to the DID, the state of the DID is set to III by making an entry in the table 106. If a shared lock has been set, the shared lock on the
• a replication module 109 may be processed. Such a module checks whether there is an ID in state III. This check may be performed by querying table 106 or, alternatively, by trying to set an exclusive lock on one or more of the IDs contained in the central lock table 106. If the exclusive lock has been set on one of the Ids, the respective ID is in state III. Then, the data objects assigned to that ID - ID1 in Fig. 1 - are replicated to the target system.
• the data objects may be changed by the replication process (e.g. compressed, or deprived of redundant or superfluous information) .
• Fig. 2 shows an implementation of an electronic data element in the form of five lines of a table 200 having the three columns ID, state and default. This organization of table 200 can be interpreted as the structure of the electronic data element .
• the following operations may be allowed to be performed on the table 200, basically by independent processes:
• a new electronic data element in state I may be created by a process 201 by adding a new line with corresponding contents of the respective fields to the table 200.
• a process 202 may change the state from I to II.
• a process 203 may change the state of an electronic data element from II to III, if this change has not been blocked by a one or more processes such as process 205.
• a change in state from III to II or I is not allowed.
• the blocked change in state I or II may be deblocked by a process 206 for the own block.
• Blocking and deblocking may be implemented by setting and deleting a shared lock on an electronic data element.
• a specific ID may be defined as a default ID by a process 207 by a corresponding entry in the "default?" column.
• the process 207 assures that only one DID exist at a time.
• a process 204 may request the state of an electronic data element and may transfer it to an other process. Basically, a plurality of electronic data elements may exist in each of the three states.
• the DO is then stored in step 312. If the storing is committed in step 313, the block on the ID set in step 307 is deleted. The process 301 then terminates or restarts with a new DO.
• Fig. 4 shows a flow diagram of a process according with the principles of the invention using default IDs.
• a software application or program module In a step 401 a software application or program module
• SA processes a data object in a computer system.
• the SA reads in a step 402 from a table 409 the actual DID in the computer system.
• the SA then tries to set in step 403 a shared lock on said DID.
• step 404 it is checked, whether the state of the DID is I or II. If no, i.e. if the state is III, the SA returns to step 40 .
• This loop may be run through a predefinable number of times and may, in case no lock could be set, then be broken off with an error message.
• the setting of the shared lock in 403 and the check whether it is successfully set may advantageously be implemented as one "atomic" step.
• step 407 in may be included in a loop that the SA waits for the commit of the storing process from the system routine, which writes the data object to the storage device. Again, this loop may be run through a predefinable number of times and may, in case of no commit, then be broken off with an error message.
• step 408 the SA may be terminated or a further data object may be selected for processing in step 409.
• Fig. 5 is an is an exemplary flow diagram of a further implementation of data processing process using the electronic data element for processing at least two DO in parallel.
• a software application or program module (abbreviated as "SA") processes four data objects I to IV in a computer system.
• the SA creates an ID as DID and sets it to state I.
• the SA 501 creates four sub processes I to IV for further processing the DO I to IV in a respective sub process.
• the sub processes (“SP") I to IV run independently from each other and parallel . For simplicity, only the sub process 504 I is described in the following section. SP I sets in a step 505 I a shared lock on the DID.
• step 506 I the DID is assigned to the DO in step 507 I
• the DO is stored in step 508 I and after the commit of the storing process, the shared lock set on the DID by the SP I is deleted.
• the SP then ends in step 510 I.
• the main process SA 501 waits in the loop 511, 512 until all sub processes have successfully set the respective shared locks. If this condition is fulfilled, the SA changes the state of the DID from I to II in step 513. This means that from that time on the DID can not be accessed by any other process, i.e. no other process can use. However, the assignment of the DID by processes, which have already accessed the DID, i.e. SP I to IV, is not restricted.
• the SA then ends in step 514.
• Fig. 7 shows an other example of a flow chart for a process, which uses the electronic data element for replicating data objects.
• a software application (SA) 701 which may run in parallel to processes for processing data objects, starts in a state at which an ID (the expression “electronic data element” and “ID” are used synonymously) "old” is in a state I and defined as default ID according to table 702a in order to replicate one or more data objects.
• Table 702 comprises three columns. The first contains in its field information on the ID, i.e. the ID, the second on the state, i.e. "I” or “II” or "III", the third on the default property, i.e. "yes” or "no".
• the table contains one electronic data element: consisting of the fields of the table containing "old”, "I”, "yes".
• SA creates in step 703 a new ID "new” and sets it to state I, table 702b.
• the new ID is defined as default, what means that "yes” is entered in the corresponding field of the default? column.
• the old ID is redefined as non default by entering "no" into the corresponding default? field, 702c.
• step 705 the state of the old ID is changed from I to II.
• Fig. 8 shows an illustration of the chronological sequence of steps according to the inventive method as described with respect to Fig. 2, performed by several independent processes.
• Six software applications 801 to 806 process each one or more different data objects (abbreviated "DO") .
• DO data objects
• the ID2 is the default ID.
• the new ID ID3 is the default ID and the state of the ID2 is changed from I to II.
• no process can access ID2 and use it for assigning it to the DO.
• the checking of whether the ID is in state I or II can be implemented by querying the respective state field of the electronic data element if this is implemented as a line of a table as described above.
• the change in state may be performed by an independent process, not shown in the figure.
• Each of the processes reads the actual DID (comp. Fig. 4) .
• a process 801 to 806 blocks a change of the state from I, II to III of the actual valid DID by setting a shared lock (abbreviated "SL") on the actual valid DID, which is ID2 in the for the processes 801 to 803 and ID3 for the processes 804 to 806.
• SL shared lock
• the processes 801 to 806 assign the respective DID, on which they have set the SL to the data objects and store the data objects to the source system. Consequently, process 803 assigns still ID2 to its DO although ID2 is at the time of assignment not the actual valid DID.
• the processing of the DO and the storing takes a certain period of time, depending on the DO and process. This time ends at a time t3 (p) , at which the commit of the storing routine is received. After that receipt, the processes 801 to 806 delete the respective SL.
• 6, 4 and 7/7a may be installed and run in parallel on a computer system.
• the invention can be implemented on a computer system having a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor for displaying information to the user and a keyboard and a pointing device such as a mouse or a trackball by which the user can provide input to the compute .
• a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor for displaying information to the user
• a keyboard and a pointing device such as a mouse or a trackball by which the user can provide input to the compute .
• Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, such as visual feedback, auditory feedback, or haptic feedback; and input from the user can be received in any form, including acoustic, speech, or haptic input.
• processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer.
• a processor will receive instructions and data from a read-only memory or a random access memory or both.
• the essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data.
• a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices (storage means) for storing data, e.g., magnetic, magneto-optical disks, or optical disks.
• Information carriers suitable for embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
• semiconductor memory devices such as EPROM, EEPROM, and flash memory devices
• magnetic disks such as internal hard disks and removable disks
• magneto-optical disks and CD-ROM and DVD-ROM disks.
• the processor and the memory can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits) .
• ASICs application-specific integrated circuits
• Programs based on the written description and flow charts of this invention are within the skill of an experienced developer.
• the various programs or program modules can be created using any of the techniques known to one skilled in the art or can be designed in connection with existing software.
• programs or program modules can be designed in or by means of ® Java, C++, HTML, XML, or HTML with included Java applets or in SAP R/3 or ABAP .
• One or more of such modules can be integrated in existing e- mail or browser software.

Landscapes

• Engineering & Computer Science (AREA)
• Databases & Information Systems (AREA)
• Theoretical Computer Science (AREA)
• Computing Systems (AREA)
• Data Mining & Analysis (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Debugging And Monitoring (AREA)
• Devices For Checking Fares Or Tickets At Control Points (AREA)

Applications Claiming Priority (9)

Publications (1)

Family

ID=32398270

Family Applications (4)

Family Applications Before (3)

Country Status (7)

Families Citing this family (3)

Family Cites Families (4)

• 2003
  • 2003-11-24 JP JP2004554431A patent/JP4414891B2/ja not_active Expired - Lifetime
  • 2003-11-24 CA CA002476603A patent/CA2476603C/en not_active Expired - Lifetime
  • 2003-11-24 WO PCT/EP2003/013158 patent/WO2004049202A1/en active IP Right Grant
  • 2003-11-24 JP JP2004554433A patent/JP4414893B2/ja not_active Expired - Lifetime
  • 2003-11-24 EP EP03811769A patent/EP1567957A2/de not_active Withdrawn
  • 2003-11-24 CA CA002505276A patent/CA2505276C/en not_active Expired - Lifetime
  • 2003-11-24 EP EP03789072A patent/EP1522032B1/de not_active Expired - Lifetime
  • 2003-11-24 AU AU2003292085A patent/AU2003292085B2/en not_active Expired
  • 2003-11-24 CA CA2505270A patent/CA2505270C/en not_active Expired - Lifetime
  • 2003-11-24 EP EP03780034A patent/EP1567952A1/de not_active Withdrawn
  • 2003-11-24 AU AU2003288151A patent/AU2003288151B2/en not_active Expired
  • 2003-11-24 JP JP2004554432A patent/JP4414892B2/ja not_active Expired - Lifetime
  • 2003-11-24 WO PCT/EP2003/013159 patent/WO2004049203A1/en not_active Application Discontinuation
  • 2003-11-24 AU AU2003293716A patent/AU2003293716B2/en not_active Expired
  • 2003-11-24 CA CA002505275A patent/CA2505275C/en not_active Expired - Lifetime
  • 2003-11-24 AU AU2003302184A patent/AU2003302184B2/en not_active Expired
  • 2003-11-24 JP JP2004554430A patent/JP4414890B2/ja not_active Expired - Lifetime
  • 2003-11-24 AT AT03789072T patent/ATE367612T1/de not_active IP Right Cessation
  • 2003-11-24 EP EP03767620A patent/EP1567947A1/de not_active Withdrawn
  • 2003-11-24 WO PCT/EP2003/013160 patent/WO2004049155A2/en not_active Application Discontinuation
  • 2003-11-24 DE DE60315030T patent/DE60315030T2/de not_active Expired - Lifetime
  • 2003-11-24 WO PCT/EP2003/013157 patent/WO2004049201A1/en not_active Application Discontinuation
• 2009
  • 2009-10-16 JP JP2009239551A patent/JP5043913B2/ja not_active Expired - Lifetime

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events