US7693890B2 - Methods and systems for moving data objects - Google Patents

Methods and systems for moving data objects Download PDF

Info

Publication number
US7693890B2
US7693890B2 US10/526,747 US52674705A US7693890B2 US 7693890 B2 US7693890 B2 US 7693890B2 US 52674705 A US52674705 A US 52674705A US 7693890 B2 US7693890 B2 US 7693890B2
Authority
US
United States
Prior art keywords
storage location
data object
type lock
stored
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime, expires
Application number
US10/526,747
Other languages
English (en)
Other versions
US20060101094A1 (en
Inventor
Martin Fischer
Thorsten Pferdekämper
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SAP SE
Original Assignee
SAP SE
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 SAP SE filed Critical SAP SE
Priority to US10/526,747 priority Critical patent/US7693890B2/en
Assigned to SAP AG reassignment SAP AG ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: FISCHER, MARTIN, PFERDEKAEMPER, THORSTEN
Publication of US20060101094A1 publication Critical patent/US20060101094A1/en
Application granted granted Critical
Publication of US7693890B2 publication Critical patent/US7693890B2/en
Assigned to SAP SE reassignment SAP SE CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: SAP AG
Adjusted expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

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
    • 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/23—Updating
    • G06F16/2308—Concurrency control
    • G06F16/2336—Pessimistic concurrency control approaches, e.g. locking or multiple versions without time stamps
    • G06F16/2343—Locking methods, e.g. distributed locking or locking implementation details
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing
    • Y10S707/99938—Concurrency, e.g. lock management in shared database
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99943—Generating database or data structure, e.g. via user interface
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99951—File or database maintenance
    • Y10S707/99952—Coherency, e.g. same view to multiple users
    • Y10S707/99955—Archiving or backup

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 data moving.
  • Moving 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 moving data objects is the archiving process, by which data objects are moved from a first to a second storage location for safety and/or performance reasons.
  • ERP enterprise resource planning software
  • ERP software is further used to manage company information of enterprises of various kinds in any field of technology by means of automatic data processing systems such as computers or computer systems.
  • a huge amount of data is usually created, which contains important business information and which has to be archived from time to time.
  • archiving can be performed automatically by archiving software tools, which can be part of the ERP software.
  • Such tools can consist of a writing module, which stores (writes) the data objects to be archived sequentially in archive files, and a deleting module, which deletes the successfully archived data from the original data object base.
  • the writing module can select the data objects to be archived from the data base according to specific criteria, e.g. the creation time of the data. It usually does not modify the original data objects or data base.
  • the deleting module staggeredly reads the archive file sequentially and deletes the data objects found in the archive file from the original data base.
  • data objects in the original database are read by the writing module and are simultaneously modified by another software application.
  • the data can be transferred from an archiveable status to a non-archiveable status.
  • data objects which are not archiveable are written into the archive file and are deleted from the original database. In effect, this can result in a loss of data.
  • the invention and its embodiments are further directed to a computer readable medium and a carrier signal comprising instructions for processing data according to the inventive method and in its embodiments.
  • One advantage of the invention and its embodiments is that the security against data loss in data moving and archiving procedures may be greatly improved. This may avoid spending a lot of time and money for data retrieval.
  • FIG. 1 is a schematic block diagram of the implementation of an exemplary computer system for implementing methods consistent with the present invention.
  • FIG. 2 is a schematic diagram of an exemplary structure of a data object in accordance with the principles of the inventive method.
  • FIG. 3 is a flow diagram of an exemplary implementation of the selecting module shown in FIG. 1 .
  • FIG. 4 is a flow diagram of an exemplary method for implementation by the writing module shown in FIG. 1 .
  • FIG. 5 is a flow diagram of an exemplary method for implementation by the deleting module shown in FIG. 1 .
  • FIG. 6 is a flow chart of an exemplary method for implementation by the selection and writing module shown in FIG. 1 .
  • FIG. 7 is a flow chart of an exemplary method to demonstrate how any software application may use the concept of the P and T-locks.
  • FIG. 8 is a flow chart of an exemplary method to demonstrate how any software application may use the concept of the P and T-locks, including a conditional deletion of a P-lock.
  • FIG. 9 is a flow chart for an exemplary method for implementation by a software module through which the locks can be deleted.
  • phrases, such as “the computer provides” and “the program provides or performs specific actions,” and “a user performs a specific action” are convenient abbreviations to express actions by a computer system that is controlled by a program or to express that the program or program module is designed to enable the computer system to perform the specific action or the enable a user to perform the specific action by means of a computer system.
  • a computer system can be a stand alone computer such as a PC or a laptop or a series of computers connected as a network, e.g. a network within a company, or a series of computers connected via the internet.
  • a data object to be archived can be 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 nonvolatile memory.
  • data objects according to the present invention can be implemented as one or more fields of one or more tables, particularly of tables of a relational data base system, or as objects in an object orientated programming language.
  • ERP software shall be considerer to comprise any software application that supports the business processes of an enterprise.
  • a storage location is volatile or nonvolatile storage means accessible by the computer system. It can be any kind of computer storage means known to one of ordinary skill, e.g. RAM, magnetical or optical storage, such as floppy disk, hard disk, MO-Disk, CD-ROM, CD RW, DVD ROM, DVD RW, etc.
  • the first and second storage location can be identical. In this case, the archived data objects have to be stored at a place different to the place of the original data objects to be archived.
  • the second storage location can also be implemented as a file, located anywhere in the accessible nonvolatile storage means. Such file is subsequently referred to as archive file.
  • An identifier is a type of data, which allows an unambiguous identification of the data object to be archived. It can be implemented, for example, as a number or a combination of alphanumerical characters or as a characteristic part of the data object to be archived. It is clear from that definition that a data object can have a wide variety of IDs.
  • a lock object is a data object, in which the identifiers are stored. It can be implemented, e.g., as a file on a storage means or as a data array in computer memory.
  • a first lock object is stored advantageously in a nonvolatile storage means and a second lock object is stored in volatile and/or nonvolatile storage means.
  • the assignment of the second storage location to an ID can be implemented by a table, in which one field of a line contains the ID and another field of that line contains a link to the second storage location, e.g. a file name.
  • This table can be stored as a file on a nonvolatile storage means.
  • FIG. 1 is a schematic block diagram of an exemplary implementation of a computer system.
  • FIG. 1 shows a computer system 101 comprising a computer 103 having a CPU 105 , a working storage 112 , in which an ERP software 111 is stored for processing by CPU 105 .
  • ERP software 111 comprises program modules 106 , 109 , 110 for carrying out the inventive data archiving process.
  • Computer system 101 further comprises input means 113 , output means 112 for interaction with a user, and general input/output means 104 , including a net connection 114 , for sending and receiving data.
  • a plurality of computer systems 101 can be connected via the net connection 114 in the form of a network 113 .
  • Computer system 103 further comprises a first storage means 107 , in which data to be archived and the lock object are stored, and a second storage means 108 , in which the archived data are stored.
  • selection module 110 assigns an ID to each of the selected data objects and stores the ID in the lock object at the storage location 107 .
  • Writing module 106 reads the data objects and the lock object and stores such data objects, the ID of which are contained in the lock object to the second storage location 108 . Additionally, the second storage location 108 is assigned to the respective ID of the data object in the lock object.
  • Deleting module 109 then reads the archived data objects in the second storage location 108 and deletes the data objects, which it could successfully read from the original set of data objects in the first storage location 107 . After deleting a specific data object, to which an ID was assigned, that ID is deleted from the lock object.
  • the lock object may be created by the selection module and not by the writing module.
  • a data object to be archived may comprise of one or more fields of one or more tables, and the ID of the respective object may comprise of one or more key fields of that data object.
  • FIG. 2 various sets of data objects are created in the form of two-dimensional data arrays, i.e., two tables (table 1 and table 2) having columns named field A to field X and field A to field Y, respectively, and a certain, unspecified number of lines.
  • a field of the array or table is defined by the name of the column and the respective line.
  • Such a field can contain data to be archived. It can alternatively contain a reference to a line of a further table.
  • field X in line 2 contains a reference to line 3 in table 2.
  • a data object to be archived comprises of fields of one line of the respective table. If one of the fields contains a reference to a line of an other table, fields of this referenced line belong to the data object as well.
  • a data object to be archived comprises the fields of line 2 in table 1 and fields of line 3 in table 2.
  • An ID of such a data object can be implemented by the content of one or more so-called key fields, if the combination of these key fields is unique within the respective table.
  • the fields of “held A” and “field B” can be used as key fields for table 1, whereas field A alone is key field in table 2.
  • assigning an ID to the data object means to use the content of the fields of columns field A and B of the respective lines as the ID for that particular line.
  • the IDs for the data object to be archived are stored as a first type ID in a first type lock object named permanent lock object in FIG. 2 and as a second type ID in a second type lock object named transactional lock object.
  • the permanent lock object may be implemented as a table having two columns, the first of which contains the first type ID 1 .
  • the second type ID, ID 2 may be implemented as a one-dimensional data array stored in the working memory of the computer system. However, it can be implemented as a file on a nonvolatile storage means, too.
  • the first type ID, ID 1 is deleted after the selected data object has been deleted according to the inventive process, and the second type ID, ID 2 , may be deleted immediately after.
  • type ID 1 IDs can be deleted after all the selected data objects have been deleted. As can be seen, both ID types have identical content, the ID of the respective lines of the data to be archived. However, this is not a necessary condition.
  • line BB is deleted, that this line has already been archived, whereas line BC has not yet been stored to the archive file.
  • the two types can also be stored together in one lock object.
  • the permanent lock objects further contain a column by which a filename may be assigned to the ID of the data object, i.e. that data object to be archived.
  • line 1 is archived in a file named 001 , lines 2 and 3 in file 002 , and line 4 in file 003 .
  • the selection of the data object can be implemented by an automatic procedure, such as by a simple query, that returns all lines having a certain field that satisfies a certain condition.
  • the procedure could return all lines in which the content of a date field pre-dates or post-dates a certain deadline.
  • Selection can also be implemented by a user to whom a selection table is presented via a graphical user interface.
  • a further embodiment may comprise storing the ID in a second lock object immediately after assigning at least one identifier (ID) of at least one type for the respective data object.
  • ID identifier
  • the second type of ID of the selected data object is stored before storing the data object assigned to that ID is started.
  • a further embodiment may comprise storing the IDs of the first type of all selected data objects before storing the data object at the second storage location.
  • the invention may comprise checking whether an ID for that data object has been stored in a lock object, and if the ID has been stored, not storing the data object at the second location and assigning the second storage location to the ID in the lock object for that data object.
  • the invention may comprise checking whether the data object is contained in the second storage location, and if the data object is contained, not storing the data object, the ID of which is contained in the lock object, at the second location and assigning the second storage location to the ID in the lock object for that data object.
  • Another embodiment may comprise checking by querying a lock object.
  • Another embodiment may comprise checking whether the data object assigned to the respective ID has been completely stored in the second location and, if the data object has not been stored, skipping the step of deleting the data object from the first storage location and the step of deleting the ID from the lock object after the respective data object assigned to that ID has been deleted for that data object and deleting the ID from the lock object.
  • FIGS. 3 to 5 are schematic flow diagrams of exemplary methods that may be implemented by the selecting, writing and deleting modules, respectively, as shown in FIG. 1 .
  • a first type ID is called a P-lock (permanent)
  • a second type ID is called a T-lock (transactional). Therefore, setting a P or T-lock for a selected object means to store an ID of that object in a respective lock object.
  • the term “permanent” results for the property of the P-lock of existing permanently, as long as the data object is not yet deleted from its original storage location.
  • the term “transactional” results from the property of the T-lock of existing only as long as a specific action (e.g. checking of archiveability) is performed on a selected data object or, in other words, of being deleted after the respective action has been performed.
  • a data object is selected in a first step 301 .
  • a T-lock is set on this object in step 302 . If the T-lock was successfully set (step 303 ), that is, if it did not yet exist, it is checked in step 304 whether a P-lock already exists in the selected data object. If not, the next data object is selected in step 309 .
  • the selling of the T-lock (step 302 ) and the check (step 303 ), whether it is successfully, set can advantageously be implemented as one “atomic” step. This means that both steps can be executed essentially at the same time or, in other words, the time gap between both can be essentially zero.
  • Both checks can also be implemented by querying the respective lock objects. If a P-lock exists, the T-lock is deleted (step 308 ) and the next data object is selected (step 309 ). If no P-lock exists, it is checked in steps 305 and 306 whether the data object is archiveable. Such checking comprises a test of whether the data in the data object is readable, complete, or not fraught with obvious failures etc. If the test is successful, a P-lock is set on that data object in step 307 , whereby no archive file is assigned to the data object at that point. Then the T-lock is deleted (step 308 ) and the next data object is selected (step 309 ).
  • a data object is selected in a first step 401 .
  • a T-lock is set on this object in step 402 . If the T-lock was successfully set (step 403 ), it is checked in step 404 whether a P-lock already exists in the selected data object, whereby no file must be assigned to that data object at that point of the process. If the condition is not fulfilled, the T-lock is deleted in step 407 , and the next data object is selected in step 408 .
  • the data object is stored in an archive file in step 405 and the archive file is assigned to the data object in step 406 , e.g., by adding the file name to the lock object as shown in FIG. 2 . Subsequently, the T-lock is deleted (step 407 ), and the next data object is selected (step 408 ).
  • a data object that has already been archived is selected (step 501 ). This can be implemented by checking the archive files. If a data object has been selected and successfully read from the archive file, that data object is deleted from the original storage location (step 502 ), the P-lock is deleted (step 503 ), and the next data object is selected (step 504 ).
  • a data object is selected in a first step 601 .
  • a T-lock is set on this object in step 602 . If the T-lock was successfully set (step 603 ), it is checked in step 604 whether a P-lock already exists in the selected data object. If the T-lock could not be set successfully, the next data object is selected (step 610 ). If a P-lock exists on that object, the T-lock is deleted (step 609 ) and the next data object is selected (step 610 ). If no P-lock exists on that object, it is checked in step 605 whether the data object is archiveable.
  • step 606 If this check fails (step 606 ), the T-lock is deleted (step 609 ), and the next data object is selected (step 610 ). If the check is positive, the data object is stored (step 605 ) in an archive file, a P-lock is set (step 608 ) with the archive file assigned, the T-lock is deleted (step 609 ), and the next data object is selected (step 610 ).
  • FIG. 7 shows a flow chart of an exemplary method to demonstrate how any software application can use the concept of the P and T-locks to ensure that the measures, that the software application is going to apply on the data object do not influence the archiving process.
  • a software application that is programmed to have a read and/or write access to data objects, which can be subject of an archiving process as described, may comprise the following steps as shown in FIG. 7 .
  • a first step 701 the data object is selected.
  • a T-lock is set in step 702 on that object by the application. If the T-lock is successfully set (step 703 ), it is checked in step 704 , whether a P-lock exists on that object; otherwise the application terminates in step 707 .
  • step 704 If a P-lock exists on that object (step 704 ), the T-lock is deleted (step 706 ), and the application terminates (step 707 ). If no P-lock exists, i.e., the data object is not subject to an archiving process, the application can have read/write access to the data object in a working step 705 . Subsequently, the application deletes the T-lock (step 706 ) and terminates (step 707 ).
  • FIG. 8 is a flow chart of another exemplary method to demonstrate how any software application may use the concept of the P and T-locks, including a conditional deletion of a P-lock.
  • a first step 801 the data object is selected. Then, a T-lock is set on that object by the application (step 802 ). If the T-lock is successfully set (step 803 ), it is checked (step 804 ) whether a P-lock exists on that object; otherwise the application terminates (step 809 ). If no P-lock exists (step 804 ), i.e., the data object is not subject to an archiving process, the application can have read/write access to the data object in working step 807 .
  • the application deletes the T-lock (step 808 ) and terminates (step 809 ). If a P-lock exists (step 804 ), it is checked (step 805 ) whether a file is assigned to it. If a file is assigned, the application deletes the T-lock (step 808 ) and terminates (step 809 ). If no file is assigned, the P-lock is deleted (step 806 ), and the application can have read/write access to the data object (step 807 ). Subsequently, the application deletes the T-lock (step 808 ) and terminates (step 809 ).
  • This procedure is particularly useful, in that data objects, which are not yet stored in an archive file, can be still altered. Consequently, they can be archived only at the next archive run.
  • FIG. 9 is a flow chart of an exemplary method for implementation by a software module through which the locks set by the modules described above can be deleted. This can be useful in cases in which no archive files are assigned to P-locks or in which P-locks have been deleted for a user. Therein, a P-lock is nothing else than a data object and can be treated in the same way as described above.
  • a P-lock is nothing else than a data object and can be treated in the same way as described above.
  • a P-lock is selected.
  • a T-lock is set to the P-lock in (step 902 ). If the T-lock is successfully set (step 903 ), it is checked (step 904 ), whether the P-lock has a file assigned. If the T-lock is not set successfully, the module terminates (step 907 ).
  • step 904 If the selected P-lock has no file assigned (step 904 ), the P-lock is deleted (step 905 ). Then the T-lock is deleted (step 906 ) and the module terminates (step 907 ). Alternative to the termination step 907 , a next P-lock can be selected.
  • 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.
US10/526,747 2002-09-09 2003-09-04 Methods and systems for moving data objects Expired - Lifetime US7693890B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/526,747 US7693890B2 (en) 2002-09-09 2003-09-04 Methods and systems for moving data objects

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
US40890102P 2002-09-09 2002-09-09
US40890502P 2002-09-09 2002-09-09
US40890302P 2002-09-09 2002-09-09
US40890202P 2002-09-09 2002-09-09
US40959302P 2002-09-11 2002-09-11
US40960602P 2002-09-11 2002-09-11
PCT/EP2003/009828 WO2004025479A2 (en) 2002-09-09 2003-09-04 Methods and systems for moving data objects using locks
US10/526,747 US7693890B2 (en) 2002-09-09 2003-09-04 Methods and systems for moving data objects

Publications (2)

Publication Number Publication Date
US20060101094A1 US20060101094A1 (en) 2006-05-11
US7693890B2 true US7693890B2 (en) 2010-04-06

Family

ID=31999857

Family Applications (3)

Application Number Title Priority Date Filing Date
US10/526,747 Expired - Lifetime US7693890B2 (en) 2002-09-09 2003-09-04 Methods and systems for moving data objects
US10/656,209 Active 2024-12-23 US7222142B2 (en) 2002-09-09 2003-09-08 Methods and systems for moving data objects utilizing data identifiers and lock objects
US10/656,208 Active 2024-07-27 US7756814B2 (en) 2002-09-09 2003-09-08 Methods and systems for controlling access to a data object

Family Applications After (2)

Application Number Title Priority Date Filing Date
US10/656,209 Active 2024-12-23 US7222142B2 (en) 2002-09-09 2003-09-08 Methods and systems for moving data objects utilizing data identifiers and lock objects
US10/656,208 Active 2024-07-27 US7756814B2 (en) 2002-09-09 2003-09-08 Methods and systems for controlling access to a data object

Country Status (6)

Country Link
US (3) US7693890B2 (de)
EP (6) EP1540527B1 (de)
AT (6) ATE371903T1 (de)
AU (6) AU2003273824A1 (de)
DE (6) DE60330254D1 (de)
WO (6) WO2004025479A2 (de)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100287553A1 (en) * 2009-05-05 2010-11-11 Sap Ag System, method, and software for controlled interruption of batch job processing
US9164998B2 (en) 2010-07-29 2015-10-20 Sap Se Archive-system-independent archive-type objects
US9270617B2 (en) 2013-06-05 2016-02-23 Sap Se Load controller framework
US9892207B2 (en) 2013-02-01 2018-02-13 Sap Se Automatic migration for on-premise data objects to on-demand data objects
US10114843B2 (en) 2011-11-09 2018-10-30 Sap Se Content migration framework
US10963459B2 (en) 2014-08-29 2021-03-30 Sap Se Generic utilization of on-premise query frameworks by new on-demand applications

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2002366867A1 (en) 2001-12-21 2003-07-09 Micronas Gmbh Method and device for the exchange of data
AU2003273824A1 (en) * 2002-09-09 2004-04-30 Sap Aktiengesellschaft Methods and systems for data moving using locks
US7457933B2 (en) * 2002-09-09 2008-11-25 Sap Ag Methods and systems for archiving data
US7756813B2 (en) * 2002-09-09 2010-07-13 Sap Ag Electronic data structure for controlling access to data objects using locks
US7693881B2 (en) 2002-09-09 2010-04-06 Sap Ag Methods and systems for moving data using locks
US7653667B2 (en) * 2002-09-09 2010-01-26 Sap Ag Methods and systems for data moving using locks
US20060149696A1 (en) * 2002-09-09 2006-07-06 Thorsten Pferdekaemper Method and systems for controlling access to a data object by means of locks
US7779386B2 (en) 2003-12-08 2010-08-17 Ebay Inc. Method and system to automatically regenerate software code
EP1566744A1 (de) 2004-02-19 2005-08-24 Sap Ag Optimierung der Sperrgranularität mittels Bereichssperren
US7664966B2 (en) * 2004-05-17 2010-02-16 Microsoft Corporation Secure storage on recordable medium in a content protection system
US8676748B2 (en) * 2004-11-18 2014-03-18 International Business Machines Corporation Clearing metadata tracks in a storage system
US20060106873A1 (en) * 2004-11-18 2006-05-18 International Business Machines (Ibm) Corporation Selective clearing of persistent metadata in a storage subsystem
EP1684194A1 (de) 2005-01-25 2006-07-26 Sap Ag Ein zentraler Sperrdienst für Datenbankanwendungen
EP1684193A1 (de) * 2005-01-25 2006-07-26 Sap Ag Zentraler Sperrdienst für Datenbankanwendungen
US7844578B2 (en) * 2005-03-31 2010-11-30 Sap Ag Parallel archiving for a messaging system
ITTO20060534A1 (it) * 2006-07-20 2008-01-21 Si Sv El S P A Gestione automatica di archivi digitali in particolare di file audio e/o video
US7861093B2 (en) * 2006-08-30 2010-12-28 International Business Machines Corporation Managing data access via a loop only if changed locking facility
US20080154994A1 (en) * 2006-12-22 2008-06-26 Sap Ag Managing aged index data for a database
US7827160B2 (en) * 2007-03-30 2010-11-02 Sap Ag Managing distributed index data
US8510720B2 (en) * 2007-12-20 2013-08-13 Sap Ag System landscape trace
GB2520361A (en) 2013-11-19 2015-05-20 Ibm Method and system for a safe archiving of data
US10331498B1 (en) * 2017-04-26 2019-06-25 EMC IP Holding Company LLC ColoredLock synchronization object, allowing flow specific policy of lock canceling
EP3882794A4 (de) * 2018-11-13 2022-08-03 Nippon Telegraph And Telephone Corporation Proprietäres endgerät, benutzerendgerät, neues proprietäres endgerät, proprietäres programm, benutzerprogramm, neues proprietäres programm, inhaltsverwendungssystem und datenstruktur zum routing von objektdaten

Citations (44)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0499422A2 (de) 1991-02-15 1992-08-19 International Business Machines Corporation Übertragung einer Seite in einem Datensystem mit gemeinschaftlichem Zugang mit Verriegelung der Aufzeichnung
US5504900A (en) 1991-05-21 1996-04-02 Digital Equipment Corporation Commitment ordering for guaranteeing serializability across distributed transactions
US5548750A (en) * 1992-12-08 1996-08-20 Telefonaktiebolaget Lm Ericsson System for taking backup in a data base
US5557792A (en) 1992-04-15 1996-09-17 International Business Machines Corporation Efficient data base access using a shared electronic store in a multi-system environment with shared disks
US5566319A (en) 1992-05-06 1996-10-15 International Business Machines Corporation System and method for controlling access to data shared by a plurality of processors using lock files
US5748870A (en) * 1990-11-07 1998-05-05 Non-Stop Networks Limited Fault-tolerant networkable computer software with access locking
US5822773A (en) 1996-10-17 1998-10-13 Fwb Software Llc Method and system for accelerating the copying of repetitively copied computer data
US5835953A (en) 1994-10-13 1998-11-10 Vinca Corporation Backup system that takes a snapshot of the locations in a mass storage device that has been identified for updating prior to updating
US5835906A (en) 1996-07-01 1998-11-10 Sun Microsystems, Inc. Methods and apparatus for sharing stored data objects in a computer system
US5913213A (en) 1997-06-16 1999-06-15 Telefonaktiebolaget L M Ericsson Lingering locks for replicated data objects
US6088693A (en) 1996-12-06 2000-07-11 International Business Machines Corporation Data management system for file and database management
US6226641B1 (en) 1997-10-07 2001-05-01 International Business Machines Corporation Access control for groups of related data items
US6269382B1 (en) * 1998-08-31 2001-07-31 Microsoft Corporation Systems and methods for migration and recall of data from local and remote storage
US6324581B1 (en) 1999-03-03 2001-11-27 Emc Corporation File server system using file system storage, data movers, and an exchange of meta data among data movers for file locking and direct access to shared file systems
US6334134B1 (en) 1998-08-18 2001-12-25 International Business Machines Corporation Insert performance on a multi-system transaction environment
US20010056425A1 (en) 2000-06-19 2001-12-27 Hewlett-Packard Company Automatic backup/recovery process
US6343296B1 (en) * 1999-09-03 2002-01-29 Lucent Technologies Inc. On-line reorganization in object-oriented databases
US6353836B1 (en) * 1998-02-13 2002-03-05 Oracle Corporation Method and apparatus for transferring data from the cache of one node to the cache of another node
US6405274B1 (en) 1998-12-30 2002-06-11 Oracle Corporation Anticipatory lock mode conversions in a lock management system
US6412034B1 (en) * 1999-04-16 2002-06-25 Oracle Corporation Transaction-based locking approach
US20020087476A1 (en) 1997-07-15 2002-07-04 Pito Salas Method and apparatus for controlling access to a product
US20030004945A1 (en) 2001-06-28 2003-01-02 International Business Machines Corporation System and method for avoiding deadlock situations due to pseudo-deleted entries
US20030004975A1 (en) * 2001-06-27 2003-01-02 Yukio Nakano Database management system with rebalance architectures
EP1283477A1 (de) 2001-08-07 2003-02-12 Sap Ag Verfahren und Computersystem zum Identifizieren der zu archivierenden Objekte
US6557082B1 (en) 2000-03-30 2003-04-29 International Business Machines Corporation Method and apparatus for ensuring cache coherency for spawned dependent transactions in a multi-system environment with shared data storage devices
US6594683B1 (en) 1998-01-23 2003-07-15 Sun Microsystems, Inc. Method, apparatus and computer program product for locking interrelated data structures in a multi-threaded computing environment
US6651123B1 (en) 2000-03-30 2003-11-18 International Business Machines Corporation File system locking
US6772255B2 (en) 1998-06-30 2004-08-03 Sun Microsystems, Inc. Method and apparatus for filtering lock requests
US6772155B1 (en) 2001-04-04 2004-08-03 Ncr Corporation Looking data in a database system
US6772177B2 (en) 2001-06-01 2004-08-03 International Business Machines Corporation System and method for parallelizing file archival and retrieval
US6775750B2 (en) 2001-06-29 2004-08-10 Texas Instruments Incorporated System protection map
US6839819B2 (en) 2001-12-28 2005-01-04 Storage Technology Corporation Data management appliance
US6850938B1 (en) 2001-02-08 2005-02-01 Cisco Technology, Inc. Method and apparatus providing optimistic locking of shared computer resources
US6880102B1 (en) 1998-10-23 2005-04-12 Oracle International Corporation Method and system for managing storage systems containing multiple data storage devices
US6950834B2 (en) 2000-03-29 2005-09-27 International Business Machines Corporation Online database table reorganization
US6952707B1 (en) 1999-06-11 2005-10-04 International Business Machines Corporation Efficient sequence number generation in a multi-system data-sharing environment
US7028287B2 (en) 2001-11-14 2006-04-11 Sun Microsystems, Inc. Method and apparatus for facilitating compact object headers
US7036043B2 (en) * 2001-12-28 2006-04-25 Storage Technology Corporation Data management with virtual recovery mapping and backward moves
US20060101094A1 (en) 2002-09-09 2006-05-11 Martin Fischer Methods and systems for moving data objects
US20060129768A1 (en) 2002-09-09 2006-06-15 Thorsten Pferdekaemper Methods and systems for archiving data
US20060149736A1 (en) 2002-09-09 2006-07-06 Thorsten Pferdekaemper Electronic data structure for controlling access to data objects using locks
US20060149696A1 (en) 2002-09-09 2006-07-06 Thorsten Pferdekaemper Method and systems for controlling access to a data object by means of locks
US20060155704A1 (en) 2002-09-09 2006-07-13 Martin Fischer Methods and systems for moving data using locks
US7251661B1 (en) 2002-03-29 2007-07-31 Ncr Corp. Movable objects in a database

Patent Citations (49)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5748870A (en) * 1990-11-07 1998-05-05 Non-Stop Networks Limited Fault-tolerant networkable computer software with access locking
US5327556A (en) 1991-02-15 1994-07-05 International Business Machines Corporation Fast intersystem page transfer in a data sharing environment with record locking
EP0499422A2 (de) 1991-02-15 1992-08-19 International Business Machines Corporation Übertragung einer Seite in einem Datensystem mit gemeinschaftlichem Zugang mit Verriegelung der Aufzeichnung
US5504900A (en) 1991-05-21 1996-04-02 Digital Equipment Corporation Commitment ordering for guaranteeing serializability across distributed transactions
US5557792A (en) 1992-04-15 1996-09-17 International Business Machines Corporation Efficient data base access using a shared electronic store in a multi-system environment with shared disks
US5761660A (en) 1992-04-15 1998-06-02 International Business Machines Corporation Computer program product and program storage device for database access using a shared electronic store in a multi-system environment having shared disks
US5566319A (en) 1992-05-06 1996-10-15 International Business Machines Corporation System and method for controlling access to data shared by a plurality of processors using lock files
US5548750A (en) * 1992-12-08 1996-08-20 Telefonaktiebolaget Lm Ericsson System for taking backup in a data base
US5835953A (en) 1994-10-13 1998-11-10 Vinca Corporation Backup system that takes a snapshot of the locations in a mass storage device that has been identified for updating prior to updating
US5835906A (en) 1996-07-01 1998-11-10 Sun Microsystems, Inc. Methods and apparatus for sharing stored data objects in a computer system
US5822773A (en) 1996-10-17 1998-10-13 Fwb Software Llc Method and system for accelerating the copying of repetitively copied computer data
US6088693A (en) 1996-12-06 2000-07-11 International Business Machines Corporation Data management system for file and database management
US5913213A (en) 1997-06-16 1999-06-15 Telefonaktiebolaget L M Ericsson Lingering locks for replicated data objects
US20020087476A1 (en) 1997-07-15 2002-07-04 Pito Salas Method and apparatus for controlling access to a product
US6226641B1 (en) 1997-10-07 2001-05-01 International Business Machines Corporation Access control for groups of related data items
US6594683B1 (en) 1998-01-23 2003-07-15 Sun Microsystems, Inc. Method, apparatus and computer program product for locking interrelated data structures in a multi-threaded computing environment
US6353836B1 (en) * 1998-02-13 2002-03-05 Oracle Corporation Method and apparatus for transferring data from the cache of one node to the cache of another node
US6507853B2 (en) 1998-02-13 2003-01-14 Oracle Corporation Recovering data from a failed cache using recovery logs of caches that updated the data
US6772255B2 (en) 1998-06-30 2004-08-03 Sun Microsystems, Inc. Method and apparatus for filtering lock requests
US6334134B1 (en) 1998-08-18 2001-12-25 International Business Machines Corporation Insert performance on a multi-system transaction environment
US6269382B1 (en) * 1998-08-31 2001-07-31 Microsoft Corporation Systems and methods for migration and recall of data from local and remote storage
US6880102B1 (en) 1998-10-23 2005-04-12 Oracle International Corporation Method and system for managing storage systems containing multiple data storage devices
US6405274B1 (en) 1998-12-30 2002-06-11 Oracle Corporation Anticipatory lock mode conversions in a lock management system
US6324581B1 (en) 1999-03-03 2001-11-27 Emc Corporation File server system using file system storage, data movers, and an exchange of meta data among data movers for file locking and direct access to shared file systems
US6412034B1 (en) * 1999-04-16 2002-06-25 Oracle Corporation Transaction-based locking approach
US6952707B1 (en) 1999-06-11 2005-10-04 International Business Machines Corporation Efficient sequence number generation in a multi-system data-sharing environment
US6343296B1 (en) * 1999-09-03 2002-01-29 Lucent Technologies Inc. On-line reorganization in object-oriented databases
US6950834B2 (en) 2000-03-29 2005-09-27 International Business Machines Corporation Online database table reorganization
US6557082B1 (en) 2000-03-30 2003-04-29 International Business Machines Corporation Method and apparatus for ensuring cache coherency for spawned dependent transactions in a multi-system environment with shared data storage devices
US6651123B1 (en) 2000-03-30 2003-11-18 International Business Machines Corporation File system locking
US20010056425A1 (en) 2000-06-19 2001-12-27 Hewlett-Packard Company Automatic backup/recovery process
US6850938B1 (en) 2001-02-08 2005-02-01 Cisco Technology, Inc. Method and apparatus providing optimistic locking of shared computer resources
US6772155B1 (en) 2001-04-04 2004-08-03 Ncr Corporation Looking data in a database system
US6772177B2 (en) 2001-06-01 2004-08-03 International Business Machines Corporation System and method for parallelizing file archival and retrieval
US20030004975A1 (en) * 2001-06-27 2003-01-02 Yukio Nakano Database management system with rebalance architectures
US6944615B2 (en) * 2001-06-28 2005-09-13 International Business Machines Corporation System and method for avoiding deadlock situations due to pseudo-deleted entries
US20030004945A1 (en) 2001-06-28 2003-01-02 International Business Machines Corporation System and method for avoiding deadlock situations due to pseudo-deleted entries
US6775750B2 (en) 2001-06-29 2004-08-10 Texas Instruments Incorporated System protection map
EP1283477A1 (de) 2001-08-07 2003-02-12 Sap Ag Verfahren und Computersystem zum Identifizieren der zu archivierenden Objekte
US7028287B2 (en) 2001-11-14 2006-04-11 Sun Microsystems, Inc. Method and apparatus for facilitating compact object headers
US6839819B2 (en) 2001-12-28 2005-01-04 Storage Technology Corporation Data management appliance
US7036043B2 (en) * 2001-12-28 2006-04-25 Storage Technology Corporation Data management with virtual recovery mapping and backward moves
US7251661B1 (en) 2002-03-29 2007-07-31 Ncr Corp. Movable objects in a database
US20060101094A1 (en) 2002-09-09 2006-05-11 Martin Fischer Methods and systems for moving data objects
US20060129768A1 (en) 2002-09-09 2006-06-15 Thorsten Pferdekaemper Methods and systems for archiving data
US20060149736A1 (en) 2002-09-09 2006-07-06 Thorsten Pferdekaemper Electronic data structure for controlling access to data objects using locks
US20060149696A1 (en) 2002-09-09 2006-07-06 Thorsten Pferdekaemper Method and systems for controlling access to a data object by means of locks
US20060155704A1 (en) 2002-09-09 2006-07-13 Martin Fischer Methods and systems for moving data using locks
US7222142B2 (en) 2002-09-09 2007-05-22 Sap Ag Methods and systems for moving data objects utilizing data identifiers and lock objects

Non-Patent Citations (13)

* Cited by examiner, † Cited by third party
Title
Cabrera, Luis-Felipe et al., "Applying Database Technology in the ADSM Mass Storage System," Proceedings of the 21st VLDB Conference, 1995, pp. 597-605.
Daugherty et al., "Multi-Axial Subassemblage Testing System (Mast) Data Collection and Telepresence Systems Specification," A Report from the National Science Foundation, George E. Brown, Jr. Network for Earthquake Engineering Simulation (NEES), Department of Civil Engineering, Institute of Technology, University of Minnesota, Jul. 15, 2002.
Martin Fischer et al., U.S. Appl. No. 10/526,749, filed Nov. 14, 2005, entitled "Methods and Systems for Moving Data Using Locks."
Martin Fischer et al., U.S. Appl. No. 10/656,208, filed Sep. 8, 2003, entitled "Methods and Systems for Controlling Access to a Data Object."
PCT Search Report mailed Mar. 30, 2004 for PCT/EP2003/09828.
R. Schaarschmidt et al., "Konzepte und Implementierungsaspekte anwendungsorientierten Archivierens in Datenbanksystemen," Computer Science, Research & Development, 1998, vol. 13, pp. 79-89.
Ralf Schaarschmidt et al. "Datenbankbasiertes Archivieren im SAP System R/3," WI-Aufsatz, Wirtschaftsinformatik 39 (1997) 5, pp. 469-477.
Stefani, "Datenarchivierung mit SAP", SAP Press, Galileo Press, Bonn, XP002266517, pp. 34-40, p. 57, pp. 63-75, pp. 84-85, and pp. 211-212, (May 2002).
Tanenbaum, "Synchronization in Distributed Systems", Modern Operating Systems, Prentice-Hall International, Inc., New Jersey, USA, XP002266518, ISBN: 0-13-595752-4, pp. 494-496, (1992).
Thorsten Pferdekaemper et al., U.S. Appl. No. 10/526,504, filed Oct. 24, 2005, entitled "Methods and Systems for Archiving Data."
Thorsten Pferdekaemper et al., U.S. Appl. No. 10/526,748, filed Nov. 8, 2005, entitled "Methods and Systems for Data Moving Using Locks."
Thorsten Pferdekaemper et al., U.S. Appl. No. 10/526,750, filed Nov. 14, 2005, entitled "Methods and Systems for Controlling Access to a Data Object by Means of Locks."
Thorsten Pferdekaemper et al., U.S. Appl. No. 10/526,751, filed Nov. 14, 2005, entitled "Electronic Data Structure for Controlling Access to Data Objects Using Locks."

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100287553A1 (en) * 2009-05-05 2010-11-11 Sap Ag System, method, and software for controlled interruption of batch job processing
US9740522B2 (en) 2009-05-05 2017-08-22 Sap Se Controlled interruption and resumption of batch job processing
US9164998B2 (en) 2010-07-29 2015-10-20 Sap Se Archive-system-independent archive-type objects
US10114843B2 (en) 2011-11-09 2018-10-30 Sap Se Content migration framework
US9892207B2 (en) 2013-02-01 2018-02-13 Sap Se Automatic migration for on-premise data objects to on-demand data objects
US9270617B2 (en) 2013-06-05 2016-02-23 Sap Se Load controller framework
US10963459B2 (en) 2014-08-29 2021-03-30 Sap Se Generic utilization of on-premise query frameworks by new on-demand applications

Also Published As

Publication number Publication date
US20060101094A1 (en) 2006-05-11
AU2003287947A8 (en) 2004-04-30
ATE473484T1 (de) 2010-07-15
DE60315996T2 (de) 2008-05-21
EP1540516B1 (de) 2009-11-25
US7756814B2 (en) 2010-07-13
EP1540517B1 (de) 2010-07-07
DE60306674D1 (de) 2006-08-17
EP1540532A1 (de) 2005-06-15
ATE451653T1 (de) 2009-12-15
WO2004025479A3 (en) 2004-10-14
ATE332534T1 (de) 2006-07-15
EP1540527B1 (de) 2007-08-29
WO2004025506A1 (en) 2004-03-25
ATE332535T1 (de) 2006-07-15
DE60306674T2 (de) 2007-06-28
AU2003267042A1 (en) 2004-04-30
DE60333303D1 (de) 2010-08-19
EP1540517A1 (de) 2005-06-15
WO2004025502A1 (en) 2004-03-25
DE60315996D1 (de) 2007-10-11
ATE450010T1 (de) 2009-12-15
AU2003264263A1 (en) 2004-04-30
AU2003258703A1 (en) 2004-04-30
AU2003273824A1 (en) 2004-04-30
DE60306663D1 (de) 2006-08-17
US20040153457A1 (en) 2004-08-05
EP1559039B1 (de) 2006-07-05
WO2004025505A1 (en) 2004-03-25
US20040243773A1 (en) 2004-12-02
DE60330482D1 (de) 2010-01-21
WO2004025503A1 (en) 2004-03-25
EP1540516A1 (de) 2005-06-15
AU2003287947A1 (en) 2004-04-30
EP1559039A1 (de) 2005-08-03
EP1552434B1 (de) 2009-12-09
WO2004025479A2 (en) 2004-03-25
EP1540532B1 (de) 2006-07-05
ATE371903T1 (de) 2007-09-15
US7222142B2 (en) 2007-05-22
EP1540527A2 (de) 2005-06-15
DE60306663T2 (de) 2007-06-28
AU2003264264A1 (en) 2004-04-30
WO2004025504A1 (en) 2004-03-25
DE60330254D1 (de) 2010-01-07
EP1552434A1 (de) 2005-07-13

Similar Documents

Publication Publication Date Title
US7457933B2 (en) Methods and systems for archiving data
US7693890B2 (en) Methods and systems for moving data objects
US5613113A (en) Consistent recreation of events from activity logs
US7756813B2 (en) Electronic data structure for controlling access to data objects using locks
US7693881B2 (en) Methods and systems for moving data using locks
US7653667B2 (en) Methods and systems for data moving using locks
US20060149696A1 (en) Method and systems for controlling access to a data object by means of locks
CA2505275C (en) Avoiding data loss when refreshing a data warehouse

Legal Events

Date Code Title Description
AS Assignment

Owner name: SAP AG,GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FISCHER, MARTIN;PFERDEKAEMPER, THORSTEN;REEL/FRAME:017227/0729

Effective date: 20051011

Owner name: SAP AG, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FISCHER, MARTIN;PFERDEKAEMPER, THORSTEN;REEL/FRAME:017227/0729

Effective date: 20051011

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: SAP SE, GERMANY

Free format text: CHANGE OF NAME;ASSIGNOR:SAP AG;REEL/FRAME:033625/0334

Effective date: 20140707

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552)

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12