METHOD, SYSTEM, AND COMPUTER PROGRAM FOR MIGRATING CONTENT FROM SOURCE DATABASE TO TARGET DATABASE

Abstract: In a software system (200/210/220) with a business application (200), database migration from a source database (210) to a physically different target database (230) is performed by a migration tool (260) that evaluates database instructions (201) that the application (200) consecutively sends to the source database (210). The migration tool (260) stores representations (254, 255) of an action type (205, D, I, U) and of a key (231) in a log table (250) when action type coincides with a predetermined action type (D, I, U), copies source table entries to the target table (240); and adjusts entries in the target table that have keys represented in the log table (250). During migration, application (200) and source table are still communicating.

Description: METHOD, SYSTEM, AND COMPUTER PROGRAM FOR MIGRATING CONTENT FROM SOURCE DATABASE TO TARGET DATABASE Field of the Invention The present invention generally relates to computers that implement database systems, and more particularly, relates to method, system and program for migrating data from a first database system to a second database system. Background of the Invention In the business software industry, 3-tier-solutions are convenient. Usually, such solutions comprise user- interface systems in a first layer, business application systems in a second layer, and database systems in a third layer ("system" hereinafter left out). Examples for 3-tier-solutions are the well-known software solutions, such as the R/3 and mySAP.com solution that are commercially available from SAP Aktiengesellschaft, Walldorf (Baden) , Germany. For the following discussion, the second and third layers deserve closer attention- The databases are usually implemented as relational databases that communicate with the applications by predefined and standardized statements, such as System Query Language (SQL) statements. Relational databases are well known in the art, information is structured in tables, or relations, in which data values are stored in rows, or tuples, under various column headings. Technological process, changing customer demands and other circumstances demand to migrate data to other databases. Usually, migrating requires time in that the application does not operate as required. .To copy database and/or applications to another location is possible in short time as long as the structure of the data remains unchanged. Data restructuring requires more time. However, the acceptance of a business application depends, among other things, on its availability. Customers that appreciate the database services of a patent office do not worry about non-availability during night hours . But there are many other systems that do practically allow non-availability only during certain times of a year, such as during certain holidays. In other words, many business application systems should ideally be available 24 hours a day, 365 days a year. From a relational database, information is retrieved by a query. When information is to be updated, inserted or deleted from the database by a so-called transaction, at least one table needs to be modified. There are several approaches to deal with database maintenance. For the discussion of prior art systems, the following references are useful: US 6,141,664; US 6,122,630; US 6,205,451; US 5,893,119; and US 6,006,216. In any case, there is a technical task to reduce the so- called system downtime during updating the system. Summary of the Invention As in claim 1, the present invention relates to a method for migrating content from a source table in a source database to a target table in a target database, wherein the databases are physically different. Before migrating, a business application consecutively sends database instructions to the source database; after migrating, the business application consecutively sends the database instructions to the target database. In either table, each entry has a unique key. Tne database instructions have predetermined action types. The method comprises: storing representations of the action type and of the key in a log table under the condition that the action type coincides with a predetermined action type; copying entries of the source table to the target table; and adjusting these entries in the target table that have keys represented in the log table, according to the action type representation stored in the log table. It is an advantage that adjusting at least partially takes place when the application still communicates with the source database. Sending instructions to the source database is still possible even when copying is completed. The downtime for the application is reduced. As in claims 2-4, preferably, the step copying comprises converting the coding of the entry, from a single-byte code such as ASCII to a multi-byte code such as Unicode. It is an advantage that by using a key that is valid both in the source database and in the target database, converting is performed during database migration. As in claim 5, preferably, adjusting is performed in a first adjustment period while the application is still sending database instructions, and in a second adjustment period while the application is silent. The second period is the shorter one. As in claims 6-7, preferably, the predetermined action types are selected from the group of insert, delete, and update; the instructions are SQL statements. This present invention is compatible with existing database systems. As in claim 8, preferably, the adjusting step comprises adjusting a first portion of the source table with a first portion of the target table substantially in parallel with adjusting a second portion of the source table with a second portion of the target table. As long as separate portions are assigned to separate adjustment processes, parallel processing further reduces the application down-time. As in claim 9, preferably, the copying step comprises copying a first portion of the source table to a first portion of the target table substantially in parallel with copying a second portion of the source table to a second portion of the target table. As long as separate portions are assigned to separate copy processes, parallel processing further reduces the overall migration time . As in claim 10, an article of manufacture comprises a computer readable medium having computer readable program code means embodied therein for executing the method. As in claim 11, the present invention also relates to a computer program product for migrating content from a source table in a source database to a target table in a target database, wherein the databases are physically different, wherein prior to migrating, a business application consecutively sends database instructions to the source database, and wherein after migrating, the business application consecutively sends the database instructions to the target database. In either table each entry has a unique key; the database instructions have action types . The computer program product has instructions that cause a processor to execute: storing representations of the action type and of the key in a log table under the condition that the action type coincides with a predetermined action type; copying entries of the source table to the target table, wherein the coding of the entry is converted; and adjusting these entries in the target table that have keys represented in the log table, according to the action type representation stored in the log table. As in claim 12, preferably, the instructions cause the processor to perform adjusting consecutively in a first adjustment period while the application is sending database instructions, and in a second adjustment period while the application is silent. As in claim 13, preferably, the instructions cause the processor to perform the adjusting step by adjusting a first portion of the source table with a first portion of the target table substantially in parallel to adjusting a second portion of the source table with a second portion of the target table. As in claim 14, the present invention also relates to a computer system for migrating content from a source table in a source database to a target table in a target database, wherein the databases are physically different, wherein prior to migrating, a business application consecutively sends database instructions to the source database, and wherein after migrating, the business application consecutively sends the database instructions to the target database. In either table each entry has a unique key; the database instructions have action types; the computer system has a migration tool implemented by a computer program running on a processor; the migration tool comprises: means for storing representations of the action type and of the key in a log table under the condition that the action type coincides with a predetermined action type; means for copying entries of the source table to the target table, wherein the coding of the entry is converted; and means for adjusting these entries in the target table that have keys represented in the log table, according o the action type representation stored in the log table. Brief Description of the Drawings FIG. 1 illustrates a simplified block diagram of the inventive computer network system having a plurality of computers; FIG. 2 illustrates a simplified block diagram of an application, a source database, a target database, a log table, and a migration tool; FIG. 3 illustrates a method of the present invention by a simplified flowchart diagram in combination with a time axis; FIG. 4 illustrates an overview of method step actions that take place at consecutive time points ; FIGS. 5-8 illustrate database tables at different time points; and FIG. 9 illustrates a simplified diagram of source and target tables with the adjusting und copying steps in a further embodiment of the present invention. Detailed Description FIG. 1 illustrates a simplified block diagram of the inventive computer network system 999 having a plurality of computers 900, 901, 902 (or 90q, with q=0...Q-l, Q any number) . Computers 900-902 are coupled via inter-computer network 990. Computer 900 comprises processor 910, memory 920, bus 930, and, optionally, input device 940 and output device 950 (I/O devices, user interface 960) . As illustrated, the invention" is present by computer program product 100 (CPP) , program carrier 970 and program signal 980, collectively "program". In respect to computer 900, computer 901/902 is sometimes referred to as "remote computer", computer 901/902 is, for example, a server, a router, a peer device or other common network node, and typically comprises many or all of the elements described relative to computer 900. Hence, elements 100 and 910-980 in computer 900 collectively illustrate also corresponding elements lOq and 91q-98q (shown for q=0) in computers 90q. Computer 900 is, for example, a conventional personal computer (PC) , a desktop and hand-held device, a multiprocessor computer, a pen computer, a microprocessor-based or programmable consumer electronics, a minicomputer, a mainframe computer, a personal mobile computing device, a mobile phone, a portable or stationary personal computer, a palmtop computer or the like. Processor 910 is, for example, a central processing unit (CPU) , a micro-controller unit (MCU) , digital signal processor (DSP), or the like. Memory 920 symbolizes elements that temporarily or permanently store data and instructions. Although memory 920 is conveniently illustrated as part of computer 900, memory function can also be implemented in network 990, in computers 901/902 and in processor 910 itself (e.g., cache, register), or elsewhere. Memory 920 can be a read only memory (ROM) , a random access memory (RAM) , or a memory with other access options. Memory 920 is physically implemented by computer-readable media, such as, for example: (a) magnetic media, like a hard disk, a floppy disk, or other magnetic disk, a tape, a cassette tape; (b) optical media, like Optical disk (CD-ROM, digital versatile disk - DVD) ; (c) semiconductor media, like DRAM, SRAM, EPROM, EEPROM, memory stick, or by any other media, like paper. Optionally, memory 920 is distributed across different media. Portions of memory 920 can be removable or non-removable. For reading from media and for writing in media, computer 900 uses devices well known in the art such as, for example, disk drives, tape drives. Memory 920 stores support modules such as, for example, a basic input output system (BIOS) , an operating system (OS ) , a program library, a compiler, an interpreter, and a text- processing tool. Support modules are commercially available and can be installed on computer 900 by those of skill in the art. For simplicity, these modules are not illustrated. CPP 100 comprises program instructions and - optionally - data that cause processor 910 to execute method steps of the present invention. Method steps are explained with more detail below. In other words, CPP 100 defines the operation of computer 900 and its interaction in system network system 999. For example and without the intention to be limiting, CPP 100 can be available as source code in any programming language, and as object code ("binary code") in a compiled form. Persons of skill in the art can use CPP 100 in connection with any of the above support modules (e.g., compiler, interpreter, operating system) . Although CPP 100 is illustrated as being stored in memory 920, CPP 100 can be located elsewhere. CPP 100 can also be embodied in carrier 970. Carrier 970 is illustrated outside computer 900. For communicating CPP 100 to computer 900, carrier 970 is conveniently inserted into input device 940. Carrier 970 is implemented as any computer readable medium, such as a medium largely explained above (cf . memory 920) . Generally, carrier 970 is an article of manufacture comprising a computer readable medium having computer readable program code means embodied therein for executing the method of the present invention. Further, program signal 980 can also embody computer program 100. Signal 980 travels on network 990 to computer 900. Having described CPP 100, program carrier 970, and program signal 980 in connection with computer 900 is convenient. Optionally, program carrier 971/972 (not shown) and program signal 981/982 embody computer program product (CPP) 101/102 to be executed by processor 911/912 (not shown) in computers 901/902, respectively. Input device 940 symbolizes a device that provides data and instructions for processing by computer 900. For example, device 940 is a keyboard, a pointing device (e.g., mouse, trackball, cursor direction keys), microphone, joystick, game pad, scanner. Although the examples are devices with human interaction, device 940 can also operate without human interaction, such as, a wireless receiver (e.g., with satellite dish or terrestrial antenna), a sensor (e.g., a thermometer), a counter (e.g., goods counter in a factory). Input device 940 can serve to read carrier 970. Output device 950 symbolizes a device that presents instructions and data that have been processed. For example, a monitor or other type of display, (cathode ray tube (CRT) , flat panel display, liquid crystal display (LCD) , a speaker, a printer, a plotter, a vibration alert device. Similar as above, output device 950 communicates with the user, but it can also communicate with further computers . Input device 940 and output device 950 can be combined to a single device; any device 940 and 950 can be provided optional . Bus 930 and network 990 provide logical and physical connections by conveying instruction and data signals. While connections inside computer 900 are conveniently referred to as "bus 930", connections between computers 900-902 are referred to as "network 990". Devices 940 and 950 are coupled to computer 900 by bus 930 (as illustrated) or by network 990 (optional) . While the signals inside computer 900 are mostly electrical signals, the signals in network are electrical, magnetic, optical or wireless (radio) signals. Networking environments (as network 990) are commonplace in offices, enterprise-wide computer networks, intranets and the internet (i.e. world wide web) . The physical distance between a remote computer and computer 900 is not important. Network 990 can be a wired or a wireless network. To name a few network implementations, network 990 is, for example, a local area network (LAN) , a wide area network (WAN) , a public switched telephone network (PSTN) ; a Integrated Services Digital Network (ISDN) , an infra-red (IR) link, a radio link, like Universal Mobile Telecommunications System (UMTS) , Global System for Mobile Communication (GSM) , Code Division Multiple Access (CDMA) , or satellite link. Transmission protocols and data formats are know, for example, as transmission control protocol/internet protocol (TCP/IP) , hyper text transfer protocol (HTTP) , secure HTTP, wireless application protocol, unique resource locator (URL) , a unique resource identifier (URI) , hyper text markup language HTML, extensible markup language (XML) , extensible hyper text markup language (XHTML), wireless application markup language (WML), etc. Interfaces coupled between * the elements are also well known in the art. For simplicity, interfaces are not illustrated. An interface can be, for example, a serial port interface, a parallel port interface, a game port, a universal serial bus (USB) interface, an internal or external modem, a video adapter, or a sound card. Computer and program are closely related. As used hereinafter, phrases, such as "the computer provides" and "the program provides", are convenient abbreviation to express actions by a computer that is controlled by a program. FIG. 2 illustrates a simplified block diagram of business application 200, source database 210, target database 220, log table 250, and migration tool 260, all being data processing functions using computers. For example, computer 900 implements application 200, log table 250 and migration tool 260; computer 901 implements source database 210; and computer 902 implements target database 230. Optionally, log table 250 is implemented on computer 901 together with source database 210. This is convenient but not required. Arrows between the boxes illustrate a convenient signal flow: Application 200 sends (cf. steps 405, 406) database instructions (i.e., query statements) to the databases. Application 200 either sends database instructions 201 to database 210, or sends database instructions 202 to database 230. Instructions 201, 202 have action types such as for insert (I) , delete (D) , update (U) or read (R) operations. The arrows are bidirectional: application receives data as well (e.g., read) . Migration tool 260 communicates with log table 250 and databases 210 and 220. Databases 210 and 220*are physically different. Source database 210 has a source table 220 with a plurality of entries 231/232, wherein each entry 231/232 has key 231 and content 232. Likewise, target database 220 has target table 240 with a plurality of entries 241/242, wherein each entry 241/242 has key 241 and content 242. As used herein, content refers to the information that is stored in the entries, such as alphanumerical information; the keys are objects to logically identify content. In both tables 230 and 240, keys 231 and 241 are further identified by numbers in parenthesis (1, (2), (n) ... (N) . Also, in both tables 230 and 240, exemplary content 232, 242 is abbreviated by lowercase letter triples, such as "abc", "def", the letters in any order. Since (as mentioned) , the databases are different, the form by that each database store content can be different as well. For example, database 210 uses single- byte coding and database 220 uses double-byte coding. For example, database 210 stores content "abc" - a string of 3 characters - by 3 ASCII-bytes. The key (1) identifies the physical address (l)+0 for byte 1, address (1)+1 for byte 2 and (l)+2 for byte 3. In the example, database 220 stores the same content by 3 unicode-double-bytes . The key (1) identifies the physical address (l)+0 for byte 1, (1)+1 for byte 2, and so on to address (l)+5 for byte 6. Rules to derive the address from the key are well known in the art and therefore not further explained. Although conveniently explained by double-byte coding, persons of skill in the art generally can use multi-byte coding as well (e.g., Unicode with up to 6 bytes) . Migration tool 260 comprises program instructions to execute a method for migrating content 232 from source table 230 in source database 210 to target table 240 in target database 220 according to the present invention. Log table 250 stores intermediate data such as key representation 254 and action type representation. FIG. 3 illustrates a simplified flowchart diagram of method 400 in combination with time axis 499. Boxes illustrate method steps 405, 410, 420 and 430. FIG. 3 also illustrates step 406 that follows method 400. Axis 499 indicates time points Tl to T25. Although the illustration shows time intervals of equal duration, the time intervals are not important for the present invention an may vary. Horizontal grid lines from axis 499 to the step boxes indicate that some sub-steps are substantially performed simultaneously. For example, sub- step I(3)ghi in step 405 coincides with sub-step (3)1 in step 410. Optionally, further steps are performed in parallel . Method 400 for migrating content 232 (cf. FIG. 2) from source table 230 in source database 210 to target table 240 in target database 220 (databases 210, 220 being physically different) starts when business application 200 consecutively sends (step 405) database instructions 201 to source database 210 (i.e. before migrating) . When method 400 has ended, business application 200 consecutively sends (step 406) database instructions 202 to target database 220, (i.e. after migrating) . In either table 230, 240, each entry 231/232, 241/242 has unique key 231, 241; database instructions 201, 202 have action types 205 (for example D, I, R, U) . Method 400 comprises the following steps: storing 410 representations 254, 255 of action type 205 (D, I, U) and of key 231 in log table 250 under the condition that the action type coincides with a predetermined action type (D, I, U) ; copying 420 entries 231/23Ϊ2 of source table 220 to target table 240 (entries 241/242); and adjusting 430 these entries in target table 240 that have keys represented in log table 250, according to action type representation 255 stored in log table 250. Preferably, step copying 420 comprises converting the coding of entry 231/232, for example from the single-byte code (e.g., ASCII) to the double-byte code (e.g., Unicode) . Preferably, adjusting step 420 is performed in a first adjustment period (T16 to T20) while application 200 is sending database instructions 201, and in a second adjustment period (T21 to T24) while application 200 is silent . Preferably, the predetermined action types are selected from the group of insert (I) , delete (D) , and update (U) . Preferably, database instructions 201, 202 are SQL statements. Optionally, adjusting step 430 comprises adjusting a first portion of source table 220 with a first portion of target table 240 substantially in parallel with adjusting a second portion of source table 220 with a second portion of the target table. Similarly, copying step 420 can comprise copying a first portion of source table 220 to a first portion of target table 240 substantially in parallel with copying a second portion of source table 220 to a second portion of the target table. Details are given in connection with FIG. 9. The method steps are now explained with more detail. Step 405 (sending database instructions) can start at any time prior to Tl . Application 200 sends statements 201 to source database 210 at consecutive time points Ti . For convenience, statements 201 are illustrated with action type 205, and key 231, and content 232. For example, statement 201-1 has action * type "I", content "abc", and key (1) . "D" abbreviates "delete" for removing key 231 and content 232 (not illustrated in FIG. 3) . "I" abbreviates "insert" for creating a new entry with key 231 and content 232 to table 230, as for example statement 201-1 to write "abc" to key (1) . "R" abbreviates "read" for returning content to application 200; for example, statement 201-4 returns content "abc" at key (1) . "U" abbreviates "update" for modifying content 232 at a given key without creating a new key; for example writing "bac" at key 1 by statement 201-5. It is an advantage that step 405 stops at a late time point, after step copying 420 is finished. It is an advantage of the present invention that application 200 still can operate with database 210 and table 230. Step 410 (storing in log table) can start at any time. If the action type of instruction 201 coincides with one of predetermined group of action types then key representation 254 and action type representation 255 are stored in log table 250. Otherwise, log table 250 remains unchanged. Conveniently, the group of action types is "D" , "I", and "U" . For convenience of explanation, action type 205 (from application 200) is identical to action type representation 254 (to log table 250) , and key 231 (from application 200) is identical to key representation 255 (to log table 250) . Using log table 250 has the advantage that any modification of D, I or U type to table 230 can be traced even if database 210 fails to operate. If for a particular key, log table 250 already stores an action type representation then migration tool 260 replaces the old representation by the new one. Step 420 (copying to target) copies everything what is in source table 230. Optionally, log table 250 is considered and entries 231/232 that have been copied are marked. In the example of ' FIG." 3, action type representations "D" , "I", or "U" are replaced by a different representation, such as "C" . Optionally, a time stamp can be added to log table 250. In other words, the availability of entries from log table 250 is removed when entries have been saved to target table 240 (in connection with steps 420 and 430) . As persons of skill in the art understand, removing the availability of entries can also comprise to delete the entry. This avoids a repetition of copy step 420 by error. This is important for maintaining data consistency in case of adjusting in parallel, and for allowing to start the whole process again. It does not matter whether an entry has been copied to target table 240 but is later modified (D, I or U) in source table 230. For example, content "bac" at key (1) of source table 230 is copied to key (1) at target table 240 but later updated at the same key (1) in source table 230 to "cab" that is finally copied to target table 240 in step adjusting 430. Step 420 can stop on request of a database administrator. There is no need of copying everything of source table 230, for example, at stop time T13 , source table 230 comprises an entry at key (4) that is not yet copied. Preferably, step 430 (adjusting) comprises to replace the action type representation by a different representation (e.g., "C") as in step 420. Step 430 (adjusting) is, preferably, performed in two phases. In the first phase, step 410 (storing log table) is still active, for example, until T22. In the second phase, step 410 is already disabled; entries are copied from source table 220 to target table 240 directly (e.g., "pqr" at key (6)) . If log table 250 shows action type representations "U" or "I", then step 430 comprises copying from source table # 230 to target table ' 240 ;' if log table 250 shows action type representation "D", then the corresponding entry in target table 240 is deleted (or the nonexistence of the entry in table 240 is verified) . FIGS. 4-8 illustrates an overview of method step actions that take place at consecutive time points in an example. The left column corresponds to axis 499 in FIG. 3. Column 405 lists instructions 201 application 200 sends (step 405) to source table until sending stops at T21; column 410 lists key and type representations written into log table 250 in step 410 as well as lists "C" to remove representations (steps 420, 430); columns 420 and 430 indicate keys 241 and content 242 written into target table 240 during steps 420 and 430. Conveniently, FIG. 4 refers to FIGS. 5-8 that illustrate the status of tables 220, 240 and 250 at different time points. Referring back to FIGS. 1-8, the example is explained for each time point. Reference numbers are sometimes left out for convenience. Before and after time point Tl, application 200 is sending database instructions 201 to source table 230 in source database 210 (step 405) . For convenience of explanation, target table 240 in target database 220 and log table 250 are initially (at Tl) assumed to be empty. At time point Tl, the application sends (step 405) instruction 201-1 "1(1) abc" to the source database that inserts (action type 205 "I") content 232 "abc" into the source table at key 231 (1) . At time point T2 , the application sends instruction "I(2)def" to the source database that inserts content "def " into the source table at key (2) . Although illustrated by only two insert actions, step 405 is the o normal operation of application 200/database 210 and is performed over a long time period with thousands of instructions . At time point T3 , storing step 410 starts (storing representations of action type and key) . T3 is, preferably, at the discretion of the database administrator. Since storing step 410 does not influence on how the application communicates with the source database, the storing step can start at any time. At time point T4, the application sends instruction "I(3)ghi" to the source database that inserts content "ghi" into the source table at key (3) . Since the action type "I" is one the predetermined types "D", "I" and "U" , action type representation 255 "I" and key representation (3) are stored (step 410) in log table 250. The tables are now in the state that is illustrated in FIG. 5. At time point T5 , the application sends instruction "R(l)" to the source database that returns content "abc" without altering the source table. Since the action type "R" does not belong to one of the predetermined types, log table 250 remains unchanged. At time point T6 , the application sends instruction "U(l)bac" to the source database that modifies the content in the source table at key (1) to "bac" . Since the action type "U" is one of the predetermined types, action type representation "U" and key representation (1) are stored in the log table. At time point T7 , the application sends instruction "1(4) "jkl" to the source database that inserts the content "jkl" to the source table at key (4) . Since the action type "I" belongs to one of the predetermined types, representations "I" and (4) are stored in the log table . At time point T8 , copying step 420 starts. T8, is preferably, at the discretion of the database administrator, but can start at substantially any time. At time point T9 , migration tool 260 copies the content "bac" at key (1) from the source table to target table 240. In the log table, the representation "U" for the key (1) is modified to "C" . Modifying log table 250 by copying step 420 is optional. It is also possible to keep log table (with (3)1) unchanged to copy "ghi" to the target table during adjusting. The tables are now in the state that is illustrated in FIG. 6. At time point T10, the migration tool copies content "def" at key (2) from the source table to the target table. At time point Til, the application sends the instruction "U(2)fed" to the source database that modifies the content of the source table at key (2) . Since the action type "U" is one of the predetermined types, representations "U" and (2) are stored (step 410) in the log table. So far, the target table with the old content "def" at key (2) remains unchanged. At time point T12 , the migration tool copies the content "ghi" at key (3) to the target table; also, the migration tool modifies the log table by replacing "I" by "C" for the key (3) . At time point T13, step copying 420 stops. Preferably, T13 is at the discretion of the database administrator, but automation can also be used. Conveniently, time points T8 and T13 for step copying 420 are chosen for a period where the application sends only few instructions to the source database, such as during the weekend. It is an advantage of the present invention that application-to-database interactions are allowed without any restrictions (cf . Til) . At time point T14, the application sends the instruction "I (5) mno" to the source database that inserts the content "mno" at key (5) . Since the action type "I" is one of the predetermined types, representations "I" and (5) are stored in the log table. Now, the situation is such that the application is still communicating with the source database, but copying to the target database (step 420) is already finished. At time point T15, the application sends the instructions "U(l)cab" to the source database that modifies the content at key (1) . Since the action type "U" is one of the predefined action types, representations "U" and (1) are stored in the log table (step 410) . In the example, the "C" at key (1) is replaced by "U" . The tables are now in the state that is illustrated in FIG. 7. At time point T16, adjusting step 430 starts. At time point T17, the migration tool reads representations "I" and (4) from the log table, copies the content "jkl" from the source table at key (4) to the target table at key (4) , and replaces "I" by "C" in the log table . At time point T18, the migration tool reads representations "U" and (2) from the log table, copies the content "fed" from the source table at key (2) to the target table at key (2) , and replaces "U" by "C" in the log table. At time point T19, the migration tool reads representations "I" and (5) from the log table, copies the content "mno" from the source table at key (5) to the target table at key (5), and replaces "I" by "C" in the log table. At time point T20, the application sends instruction "I(6)pqr" to the source database that inserts content "pqr" into the source table at * key (6). Since the actions type "I" is one of the predetermined types, representations "I" and (6) are stored (step 410) in the log table. It is an advantage of the present invention that while adjusting step 430 is being performed, the application are still allowed to send instructions to the source database. At time point T21, both step sending 405 and step storing 410 stop. Simultaneously stopping both steps is convenient: since database instructions are not expected from the application any longer, there are no representations "U", "D" or "I" to add in the log table. Time point T21 marks the beginning of a short transition period in that step adjusting is finished. At time point T22, the migration tool reads representations "I" and (6) from the log table, copies the content "pqr" from the source table at key (6) to the target table at key (6) , and replaces "I" by "C" in the log table, (not illustrated in FIG. 3) At time point T23, the migration tool reads representations "TJ" and (1) from the log table, copies the content "cab" from the source table at key (1) to the target table at key (1) , and replaces "U" by "C" in the log table. In the target table, existing "bac" at key (1) is overwritten. At time point T24, the tables are now in the state that is illustrated in FIG. 8. The migration tool reads that only "C" representations are left in the log table; adjusting step stops. Method 400 for migrating content from the source database to the target database is now completed. From time point T25, the application sends the instructions to the target database (step 406) . FIG. 9 illustrates a simplified diagram of source table 220 and target table 240 with the adjusting step 430 in a further embodiment of the present invention. First portion 238 of source table 220 is adjusted (431) with first portion 248 of target table 240 substantially in parallel while second portion 239 of source table 220 is adjusted (432) with second portion 249 of target table 240. Optionally, as indicated by reference numbers 420 (copying) , 421 (copy first portion) and 422 (copy second portion) , parallel operation is also possible for copying step 420. Persons of skill in the art can introduce additional steps without departing from the scope of the present invention. For example, exclusive locks can be provided that prevent database 210 to follow instruction 210 with "I", "D" or "U" actions to alter source table 230 while migration tool 260 adjusts an entry with identical key in target table 240. Having migration tool 260 implemented as a separate functional unit is convenient but not required for the present invention. Since migration tool 260 also evaluates instructions 201 (e.g., for providing log table 250), migration tool 260 can be integrated into application 200. The present invention is summarized as (cf. FIGS. 1-3) computer program product 100 for migrating content 232 from source table 230 in source database 210 to target table 240 in target database 220, wherein databases 210, 220 are physically different, wherein prior to migrating, business application 200 consecutively sends 405 database instructions 201 (SQL statements) to source database 210, and wherein after migrating, business application 200 consecutively sends 406 database instructions 202 to target database 220. In either table 230, 240, each entry 231/232, 241/242 has a unique key 231, 241; database instructions 201, 202 have action types 205 (D, I, R, U) . Computer program product 100 has instructions that cause processor 900 to execute the following steps: storing 410 representations 254, 255 of action type 205 and of key 231 in log table 250 under the condition that action type 205 coincides with a predetermined action type; copying 420 entries 231/232 of source table 220 to target table 240, wherein the coding of the entry is converted (single-byte to multi-byte, ASCII to Unicode) ; and adjusting 430 these entries in the target table that have keys represented in log table, according to the action type representation stored in log table 250. Preferably, the instructions cause processor 900 to perform adjusting consecutively in a first adjustment -period (T16 to T20) while application 200 is sending database instructions 201, and in a second adjustment period (T21 to T24) while application 200 is silent. Preferably (cf. FIG. 9), the instructions cause processor 900 to perform adjusting step 430 by adjusting 431 first portion 238 of source table 230 with first portion 248 of target table 240 substantially in parallel to adjusting 432 second portion 239 of source table 220 with second portion 249 of target table 240. The present invention is also summarized (cf . FIGS. 1-3) as computer system 999 for migrating content 232 from source table 230 in source database 210 to target table 240 in target database 220, wherein databases 210, 220 are physically different (e.g., computers 901, 902) , wherein prior to migrating, business application 200 (e.g., on computer 900) consecutively sends 405 database instructions 201, (e.g., SQL statements) to source database 210, and wherein after migrating, business application 200 consecutively sends 406 database instructions '202 to target database 220. In either table 230, 240 each entry 231/232, 241/242 has unique key 231, 241; database instructions 201, 202 have action types 205 (e.g., D, I, R, U) . Computer system 999 has migration tool 260 (e.g., implemented by CPP 100 running on processor 900) that comprises: means for storing (e.g., memory 920, cf. step 410) representations 254, 255 of action type 205 and of key 231 in log table 250 under the condition that action type 205 coincides with a predetermined action type (D, I, U) ; means for copying (e.g., network 990 with signals, cf. step 410) entries 231/232 of source table 220 to target table 240, wherein the coding of the entry is converted (e.g., from single-byte code to multi-byte code, ASCII to Unicode) ; and means for adjusting (430, processor 910) these entries in target table 240 that have keys represented in log table 250, according to the action type representation stored in log table 250. Preferably, processor 910 performs adjusting consecutively in a first adjustment period (e.g., T16 to T20) while application 200 is sending database instructions 201, and in a second adjustment period (e.g., T21 to T24) while application 200 is silent. Preferably, processor 910 performs adjusting step 430 by adjusting 431 first portion 238 of source table 230 with first portion 248 of target table 240 substantially in parallel to adjusting 432 second portion 239 of source table 220 with second portion 249 of target table 240. Reference Element 100 computer program product 200 business application 201 database instructions 202 database instructions 210 source database 220 target database 230 source table 231 (1) (n. ) (6) key 231/232 entries 232 content 238, 248 first portion 239, 249 second portion 240 target table 241 (1) (n ) (6) key 241/242 entries 242 content 250 log table 254 key representation 255 action type representation 260 migration tool 400 method 405, 406 sending 410 storing 420, 421, 422 copying 430, 431, 432 adjusting 499 axis 900, 901, 902 computer 910- ■ 980 processor, memory, bus, input, output, interface, signal 999 computer system

Claims: Claims 1. A method (400) for migrating content (232) from a source table (230) in a source database (210) to a target table (240) in a target database (220) , wherein the databases (210, 220) are physically different, before migrating, a business application (200) consecutively sending (405) database instructions (201) to the source database (210) , and after migrating, the business application (200) consecutively sending (406) the database instructions (202) to the target database (220), in either table (230, 240) each entry (231/232, 241/242) having a unique key (231, 241), the database instructions (201, 202) having action types (205, D, I, R, U) , the method (400) comprising the following steps: storing (410) representations (254, 255) of the action type (205, D, I, U) and of the key (231) in a log table (250) under the condition that the action type coincides with a predetermined action type (D, I, U) ; copying (420) entries (231/232) of the source table (220) to the target table (240); and adjusting (430) these entries in the target table that have keys represented in the log table (250) , according to the action type representation stored in the log table (250) . 2. The method of claim 1, wherein the step copying (420) comprises converting the coding of the entry. 3. The method of claim 2, wherein converting the coding of the entry comprises to convert from a single-byte code to a multi-byte code. 4. The method of claim 3 with converting from ASCII-code being the single-byte code to Unicode being the double-byte code. 5. The method of claim 1, wherein adjusting is performed in a first adjustment period (T16 to T20) while the application (200) is sending database instructions (201) , and in a second adjustment period (T21 to T24) while the application (200) is silent. 6. The method of claim 1, wherein the predetermined action types are selected from the group of insert, delete, and update. 7. The method of claim 1, wherein the database instructions (201, 202) are SQL statements. 8. The method of claim 1, wherein the adjusting step (430) comprises adjusting (431) a first portion (238) of the source table (230) with a first portion (248) of the target table (240) substantially in parallel with adjusting (432) a second portion (239) of the source table (220) with a second portion (249) of the target table (240) . 9. The method of claim 1, wherein the copying step (430) comprises copying (431) a first portion (238) of the source table (230) to a first portion (248) of the target table (240) substantially in parallel with copying (432) a second portion (239) of the source table (220) to a second portion (249) of the target table (240) . 10..An article (970) of manufacture comprising a computer readable medium having computer readable program code means embodied therein for executing the method of any of claims 1 to 9. 11. A computer program product (100) for migrating content (232) from a source table (230) in a source database (210) to a target table (240) in a target database (220), wherein the databases (210, 220) ' are physically different, wherein prior to migrating, a business application (200) consecutively sends (405) database instructions (201) to the source database (210) , and wherein after migrating, the business application (200) consecutively sends (406) the database instructions (202) to the target database (220), in either table (230, 240) each entry (231/232, 241/242) having a unique key (231, 241), the database instructions (201, 202) having action types (205, D, I, R, U) , the computer program product having instructions that cause a processor to execute the following steps : storing (410) representations (254, 255) of the action type (205) and of the key (231) in a log table (250) under the condition that the action type coincides with a predetermined action type (D, I, UK- copying (420) entries (231/232) of the source table (220) to the target table (240) , wherein the coding of the entry is converted; and adjusting (430) these entries in the target table that have keys represented in the log table (250) , according to the action type representation stored in the log table (250) . 12. The computer program product (100) of claim 11, wherein the instructions cause the processor to perform adjusting consecutively in a first adjustment period (T16 to T20) while the application (200) is sending database instructions (201) , and in a second adjustment period (T21 to T24) while the application (200) is silent. 13. The computer program product (100) of claim 11, wherein the instructions cause the processor to perform the adjusting step (430) by adjusting (431) a first portion (238) of the source table (230) with a first portion (248) of the target table (240) substantially in parallel to adjusting (432) a second portion (239) of the source table (220) with a second portion (249) of the target table (240) . 4. A computer system (999) for migrating content (232) from a source table (230) in a source database (210) to a target table (240) in a target database (220) , wherein the databases (210, 220) are physically different (901, 902), wherein prior to migrating, a business application (200 on computer 900) consecutively sends (405) database instructions (201) to the source database (210) , and wherein after migrating, the business application (200) consecutively sends (406) the database instructions (202) to the target database (220) , in either table (230, 240) each entry (231/232, 241/242) having a unique key (231, 241), the database instructions (201, 202) having action types (205, D, I, R, U) , the computer system (999) having a migration tool (260) comprising the following: means for storing representations (254, ' 255) of the action type (205) and of the key (231) in a log table (250) under the condition that the action type coincides with a predetermined action type (D, I, U) ; means for copying entries (231/232) of the source table (220) to the target table (240) , wherein the coding of the entry is converted; and means for adjusting these entries in the target table that have keys represented in the log table (250) , according to the action type representation stored in the log table (250) .

Inventors: BRIAM GUENTER, HAAS FRANK-MARTIN, KOHLER BERND, STAHL MARTIN, ZIEGLER TORSTEN, BRIAM, GUENTER, HAAS, FRANK-MARTIN, KOHLER, BERND, STAHL, MARTIN, ZIEGLER, TORSTEN
Applicants: BRIAM GUENTER, HAAS FRANK-MARTIN, KOHLER BERND, SAP AG, STAHL MARTIN, ZIEGLER TORSTEN, BRIAM, GUENTER, HAAS, FRANK-MARTIN, KOHLER, BERND, SAP AKTIENGESELLSCHAFT, STAHL, MARTIN, ZIEGLER, TORSTEN
Application year: 2001
Main classification: G06F17
IPC codes: G06F17