Methods and systems for data migration

Description

A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.

TECHNICAL FIELD

The present disclosure relates generally to data processing and more specifically relates to data migration.

BACKGROUND

The subject matter discussed in the background section should not be assumed to be prior art merely as a result of its mention in the background section. Similarly, a problem mentioned in the background section or associated with the subject matter of the background section should not be assumed to have been previously recognized in the prior art. The subject matter in the background section merely represents different approaches, which in and of themselves may also be inventions.

Generally, data migration requires lots of planning to maintain data integrity and to prevent undesirable results caused by potential migrating errors. Migrating errors may cause the data that exists before migration to be different after migration. Because of this potential problem, users or developers tend to be reluctant having their data migrated because migrating errors can cause application failure. It is therefore important to provide the users or developers some types of assurance that their data is not affected by the migration.

BRIEF SUMMARY

For some embodiments, systems and methods for data migration may include, receiving, by a server computing system, a request to access a data element from a second data store, the data element having been migrated to the second data store from a first data store; accessing, by the server computing system, the data element from the second data store and its counterpart data element from the first data store; and based on the data element from the second data store being different from the counterpart data element from the first data store, responding, by the server computing system, to the request by providing the counterpart data element from the first data store instead of the data element from the second data store. A value associated with the data element may be a secret, and the first and second data store may be cryptographic data stores.

Other aspects and advantages of the present invention can be seen on review of the drawings, the detailed description and the claims, which follow.

BRIEF DESCRIPTION OF THE DRAWINGS

The included drawings are for illustrative purposes and serve only to provide examples of possible structures and process steps for the disclosed techniques. These drawings in no way limit any changes in form and detail that may be made to embodiments by one skilled in the art without departing from the spirit and scope of the disclosure.

FIG. 1 shows a diagram of an example computing system that may be used with some embodiments.

FIG. 2 shows a diagram of an example network environment that may be used with some embodiments.

FIG. 3 shows an example login flow that includes a second level verification, in accordance with some embodiments.

FIG. 4 shows an example login flow that uses encryption, in accordance with some embodiments.

FIG. 5 shows an example diagram of a verification application, in accordance with some embodiments.

FIG. 6 shows an example diagram of a hash values verification application, in accordance with some embodiments.

FIG. 7 is an example flow diagram of a migration verification process, in accordance with some embodiments.

FIG. 8A shows a system diagram illustrating architectural components of an applicable environment, in accordance with some embodiments.

FIG. 8B shows a system diagram further illustrating architectural components of an applicable environment, in accordance with some embodiments.

FIG. 9 shows a system diagram illustrating the architecture of a multi-tenant database environment, in accordance with some embodiments.

FIG. 10 shows a system diagram further illustrating the architecture of a multi-tenant database environment, in accordance with some embodiments.

DETAILED DESCRIPTION

Systems and methods for data migration from a first data store to a second data store are disclosed. The first data store may be associated with one cryptographic technique, and the second data store may be associated with another cryptographic technique. When a request to access a data element that has been migrated from the first data store to the second data store, both of the first data store and the second data store are available to service the request.

The systems and methods associated with data migration will be described with reference to example embodiments. These examples are being provided solely to add context and aid in the understanding of the present disclosure. It will thus be apparent to one skilled in the art that the techniques described herein may be practiced without some or all of these specific details. In other instances, well known process steps have not been described in detail in order to avoid unnecessarily obscuring the present disclosure. Other applications are possible, such that the following examples should not be taken as definitive or limiting either in scope or setting.

In the following detailed description, references are made to the accompanying drawings, which form a part of the description and in which are shown, by way of illustration, specific embodiments. Although these embodiments are described in sufficient detail to enable one skilled in the art to practice the disclosure, it is understood that these examples are not limiting, such that other embodiments may be used and changes may be made without departing from the spirit and scope of the disclosure.

As used herein, the term “multi-tenant database system” refers to those systems in which various elements of hardware and software of the database system may be shared by one or more customers. For example, a given application server may simultaneously process requests for a great number of customers, and a given database table may store rows for a potentially much greater number of customers.

The described subject matter may be implemented in the context of any computer-implemented system, such as a software-based system, a database system, a multi-tenant environment, or the like. Moreover, the described subject matter may be implemented in connection with two or more separate and distinct computer-implemented systems that cooperate and communicate with one another. One or more embodiments may be implemented in numerous ways, including as a process, an apparatus, a system, a device, a method, a computer readable medium such as a computer readable storage medium containing computer readable instructions or computer program code, or as a computer program product comprising a computer usable medium having a computer readable program code embodied therein.

The disclosed embodiments may include a method for data migration and may include receiving, by a server computing system, a request to access a data element from a second data store, the data element having been migrated to the second data store from a first data store; accessing, by the server computing system, the data element from the second data store and its counterpart data element from the first data store; and based on the data element from the second data store being different from the counterpart data element from the first data store, responding, by the server computing system, to the request by providing the counterpart data element from the first data store instead of the data element from the second data store.

The disclosed embodiments may include a system for performing data migration and may include one or more processors, and a non-transitory computer readable medium storing a plurality of instructions, which when executed, cause the one or more processors of a server computing system to receive a request to access a data element from a second data store, the data element having been migrated to the second data store from a first data store; access the data element from the second data store and its counterpart data element from the first data store; and based on the data element from the second data store being different from the counterpart data element from the first data store, respond to the request by providing the counterpart data element from the first data store instead of the data element from the second data store.

The disclosed embodiments may include a computer program product comprising computer-readable program code to be executed by one or more processors of a server computing system when retrieved from a non-transitory computer-readable medium, the program code including instructions to receive a request to access a data element from a second data store, the data element having been migrated to the second data store from a first data store; access the data element from the second data store and its counterpart data element from the first data store; and based on the data element from the second data store being different from the counterpart data element from the first data store, respond to the request by providing the counterpart data element from the first data store instead of the data element from the second data store.

While one or more implementations and techniques are described with reference to an embodiment relating to data migration implemented in a system having an application server providing a front end for an on-demand database service capable of supporting multiple tenants, the one or more implementations and techniques are not limited to multi-tenant databases nor deployment on application servers. Embodiments may be practiced using other database architectures, i.e., ORACLE®, DB2® by IBM and the like without departing from the scope of the embodiments claimed. Further, some embodiments may include using Hardware Security Module (HSM), a physical computing device that safeguards and manages digital keys for strong authentication, including, for example, the keys used to encrypt secrets associated with the data elements stored in the data stores. It may be noted that the term “data store” may refer to source control systems, file storage, virtual file systems, non-relational databases (such as NoSQL), etc. For example, the migrated data may be stored in a source control system and then exposed through a virtual file system.

Any of the above embodiments may be used alone or together with one another in any combination. The one or more implementations encompassed within this specification may also include embodiments that are only partially mentioned or alluded to or are not mentioned or alluded to at all in this brief summary or in the abstract. Although various embodiments may have been motivated by various deficiencies with the prior art, which may be discussed or alluded to in one or more places in the specification, the embodiments do not necessarily address any of these deficiencies. In other words, different embodiments may address different deficiencies that may be discussed in the specification. Some embodiments may only partially address some deficiencies or just one deficiency that may be discussed in the specification, and some embodiments may not address any of these deficiencies.

The described subject matter may be implemented in the context of any computer-implemented system, such as a software-based system, a database system, a multi-tenant environment, or the like. Moreover, the described subject matter may be implemented in connection with two or more separate and distinct computer-implemented systems that cooperate and communicate with one another. One or more implementations may be implemented in numerous ways, including as a process, an apparatus, a system, a device, a method, a computer readable medium such as a computer readable storage medium containing computer readable instructions or computer program code, or as a computer program product comprising a computer usable medium having a computer readable program code embodied therein.

Some embodiments of the present invention may include methods and systems for data migration. The methods and systems may enable one or more data elements to be migrated from a first data store to a second data store. The first data store may be associated with one cryptographic technique, and the second data store may be associated with another cryptographic technique. Data integrity verification may be performed to determine whether an application should use a migrated data element from the second data store or its counterpart data element from the first data store.

In general, for database security, when an application needs to access a database, the application may need to show that it has the appropriate authorization. This may be in the form of a secret. Typically, the secret may be hardcoded or embedded in the application. However, this may expose the secret to hackers who are able to obtain a copy of the application. Some embodiments of the present invention may relate to storing secrets in a data store and migrating the secrets from one data store to another data store. A data store may be secured using a cryptographic technique.

FIG. 1 is a diagram of an example computing system that may be used with some embodiments of the present invention. In diagram 102, computing system 110 may be used by a user to establish a connection with a server computing system. For example, the user may be associated with an application (e.g., application 550 shown in FIG. 5) running on a server computing system, and the application may need to access data elements stored in one or more data stores. A data element may be a unit of data that is associated with a value and a name. For example, a data element may be an encryption key that has a value represented by a string of alphanumeric characters. As another example, a data element may be a password that has a value generated by a user. As yet another example, a data element may be viewed as a token, and an application having access to the token may indicate that the application has an authorization to retrieve information from a secured database. In some implementations, a value associated with a data element may be viewed as a secret and certain encryption operations may be applied to protect that secret, for example, from being hacked. In those situations, the value may be referred to as a raw value while its protected form may be referred to as an encrypted value. Embodiments of the present invention may be applicable with a data element or a collection of data elements.

The computing system 110 is only one example of a suitable computing system, such as a mobile computing system, and is not intended to suggest any limitation as to the scope of use or functionality of the design. Neither should the computing system 110 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated. The design is operational with numerous other general purpose or special purpose computing systems. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with the design include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, mini-computers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. For example, the computing system 110 may be implemented as a mobile computing system such as one that is configured to run with an operating system (e.g., iOS) developed by Apple Inc. of Cupertino, Calif. or an operating system (e.g., Android) that is developed by Google Inc. of Mountain View, Calif.

Some embodiments of the present invention may be described in the general context of computing system executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that performs particular tasks or implement particular abstract data types. Those skilled in the art can implement the description and/or figures herein as computer-executable instructions, which can be embodied on any form of computing machine program product discussed below.

Some embodiments of the present invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

Referring to FIG. 1, the computing system 110 may include, but are not limited to, a processing unit 120 having one or more processing cores, a system memory 130, and a system bus 121 that couples various system components including the system memory 130 to the processing unit 120. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) locale bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.

The computing system 110 typically includes a variety of computer program product. Computer program product can be any available media that can be accessed by computing system 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer program product may store information such as computer readable instructions, data structures, program modules or other data. Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computing system 110. Communication media typically embodies computer readable instructions, data structures, or program modules.

The system memory 130 may include computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system (BIOS) 133, containing the basic routines that help to transfer information between elements within computing system 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation, FIG. 1 also illustrates operating system 134, application programs 135, other program modules 136, and program data 137.

The computing system 110 may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only, FIG. 1 also illustrates a hard disk drive 141 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156 such as, for example, a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, USB drives and devices, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.

The drives and their associated computer storage media discussed above and illustrated in FIG. 1, provide storage of computer readable instructions, data structures, program modules and other data for the computing system 110. In FIG. 1, for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. The operating system 144, the application programs 145, the other program modules 146, and the program data 147 are given different numeric identification here to illustrate that, at a minimum, they are different copies.

A user may enter commands and information into the computing system 110 through input devices such as a keyboard 162, a microphone 163, and a pointing device 161, such as a mouse, trackball or touch pad or touch screen. Other input devices (not shown) may include a joystick, game pad, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled with the system bus 121, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. In addition to the monitor, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 190.

The computing system 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computing system 110. The logical connections depicted in

FIG. 1 includes a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.

When used in a LAN networking environment, the computing system 110 may be connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computing system 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user-input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computing system 110, or portions thereof, may be stored in a remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates remote application programs 185 as residing on remote computer 180. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

It should be noted that some embodiments of the present invention may be carried out on a computing system such as that described with respect to FIG. 1. However, some embodiments of the present invention may be carried out on a server, a computer devoted to message handling, handheld devices, or on a distributed system in which different portions of the present design may be carried out on different parts of the distributed computing system.

Another device that may be coupled with the system bus 121 is a power supply such as a battery or a Direct Current (DC) power supply) and Alternating Current (AC) adapter circuit. The DC power supply may be a battery, a fuel cell, or similar DC power source needs to be recharged on a periodic basis. The communication module (or modem) 172 may employ a Wireless Application Protocol (WAP) to establish a wireless communication channel. The communication module 172 may implement a wireless networking standard such as Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard, IEEE std. 802.11-1999, published by IEEE in 1999.

Examples of mobile computing systems may be a laptop computer, a tablet computer, a Netbook, a smart phone, a personal digital assistant, or other similar device with on board processing power and wireless communications ability that is powered by a Direct Current (DC) power source that supplies DC voltage to the mobile computing system and that is solely within the mobile computing system and needs to be recharged on a periodic basis, such as a fuel cell or a battery.

FIG. 2 shows a diagram of an example network environment that may be used with some embodiments of the present invention. Diagram 200 includes computing systems 290 and 291. One or more of the computing systems 290 and 291 may be a mobile computing system. The computing systems 290 and 291 may be connected to the network 250 via a cellular connection or via a Wi-Fi router (not shown). The network 250 may be the Internet. The computing systems 290 and 291 may be coupled with server computing systems 255 via the network 250. The server computing system 255 may be coupled with data stores 270A and 270B. For some embodiments, one or more data elements stored in the data store 270A may be migrated to the data store 270B.

Each of the computing systems 290 and 291 may include an application module such as module 208 or 214. For example, a user may use the computing system 290 and the application module 208 to connect to and communicate with the server computing system 255 and log into application 257 (e.g., a Salesforce.com® application).

For some embodiments, the server computing system 255 may include migration application 260 configured to perform data migration for data stored in one data store (e.g, data store 270A) to another data store (e.g., data store 270B). A user (e.g., a system administrator) may use the computing system 290, log in to the server computing system 255 via the application 257 and activate the migration application 260.

FIG. 3 shows an example diagram of a data store, in accordance with some embodiments. In diagram 300, data store 270A may be configured to store data of different types such as files, file systems, databases, etc. The data store 270A may be associated with data store manager 301A. The data store manager 301A may be configured to manage the data stored in the data store 270A based on some cryptographic techniques. The data store manager 301A may also be configured to process requests to access the content of the data store 270A. For example, when a data element is to be added to the data store 270A, the data store manager 301A may encrypt that data element using the cryptographic techniques associated with the data store manager 301A. The data store manager 301A may then store the encrypted form of the data element in the data store 270A. When there is a request for a data element, the data store manager 301A may decrypt the encrypted form of the data element and return the raw value of the data element as a response to the request. The combination of the data store manager 301A and the data store 270A may be referred to as cryptographic secure store. Examples of cryptographic secure stores may include Vault by HashiCorp of San Francisco, Calif. and AWS Secrets Manager by Amazon of Seattle, Wash. It may be noted that the data store 270A may not store the raw values of the data elements and instead may only store the data elements in their encrypted form.

The data store 270A is shown to include multiple data elements 310A-390A which may be in their encrypted form. A data element may be associated with metadata. The metadata may include, for example, information about an entity or an application that can access the data element. For some embodiments, a data element may be associated with a secret having secret value. A secret may be used exclusively by one application, or it may be shared by multiple applications. For example, the secrets may be database passwords, Hash-based message authentication code (HMAC) shared secrets to connect to external applications, shared secrets with other applications, encryption keys (AES 128, AES 256, or Elliptic-curve cryptography (ECC)-public-key cryptography based on the algebraic structure of elliptic curves over finite fields), connection strings, client secrets (used in Open Authorization or OAuth), etc. For some embodiments, the data elements may be included in one or more Extensible Markup Language (XML) files such as, for example, the XML file 305.

In the current example, XML file 305 is shown to include data elements 310A-390A. The migration of the data elements 310A-390A may result in the generation of data elements 310B-390B in the data store 270B. The data store 270B may be associated with data store manager 301B. The data store manager 301B may be configured to manage the data stored in a data store based on some cryptographic techniques which may be different from the cryptographic techniques associated with the data store manager 301A. The data store manager 301B may also be configured to process requests to access the content of the data store 270B. It may be noted that embodiments of the present invention may relate to data elements included in an XML file as well as data elements not included in the XML file such as, for example, YAML, JSON, and flat files.

Storing the secrets in the data store 270A or the data store 270B may be advantageous because the developers don't have to hardcode or embed the secrets in their applications. For example, to access a secret associated with the data element 310A, an application may send a request to the data store manager 301A at run time. For example, the request may be sent using an application programming interface (API). For security, the data store manager 301A may be configured to accept only requests received via a secure communication protocol. The data store manager 301A may respond to the request by accessing the secret associated with the data element 310A from the data store 270A, perform the appropriate decryption, and send the raw value of the data element 310A to the requester. The raw value in this example refers to the actual secret itself.

FIG. 4 shows an example diagram of a migration application that may be used to perform the migration, in accordance with some embodiments. Diagram 400 includes migration application 260 configured to migrate data elements from the data store 270A to the data store 270B. A data element may be associated with a developer or an application of a developer. The migration may be applied to all of the data elements or to selected data elements included in the data store 270A. For example, some developers may be willing to have their data elements migrated to the data store 270B, while some may prefer to keep their data elements in the data store 270A.

For some embodiments, the selected data elements may be included in an XML file. In this scenario, the migration application 260 may be configured to search the data store 270A for XML files (e.g., XML file 305 shown in FIG. 3), read the data elements in the XML files, and perform the migration to migrate the data elements from the data store 270A to the data store 270B. The migration application 260 may be configured to iterate over each data element until all of the data elements in the XML file 305 are processed. The migration application 260 may be configured to generate a hash value of each of the data elements that is migrated based on the raw form of the data element and a hash function. The hash values 405 may then be stored in a storage area so that they can be used later to verify the accuracy of the migration without exposing the raw values associated with the data elements. For some embodiments, when the migration is completed, the encrypted values of the migrated data elements may be packaged together and be associated with a version using a version control service to keep track of changes among different migrations.

FIG. 5 shows an example diagram of a verification application 505, in accordance with some embodiments. Verification application 505 may be included in the server computing system 255, and may be activated when a request is received to access a data element that has been migrated to the data store 270B. The request may be generated by application 550, which may be associated with a developer. For example, the application 550 may generate a request to access the data element 310B (shown in FIG. 3) in the data store 270B. The verification application 505 may recognize that the data element 310B was generated based on a migration from the data store 270A to the data store 270B.

To ensure that the application 550 gets the correct data element and its associated raw value, the verification application 505 may cause both the data element 310A and the data element 310B to be accessed. This may be performed via the data store manager 301A and the data store manager 301B. The verification application 505 may then compare the raw values of the data elements 310A and 310B. When the two raw values are the same, the raw value 520 (either from the data element 310A or the data element 310B) may then be transmitted to the requesting application 550. In some situations, the verification application 505 may detect that the two raw values are different. For example, a developer or system administrator may update the raw value (e.g., the secret) of the data element 310A but not the corresponding raw value of the data element 310B causing the raw values to be out of sync.

For some embodiment, when the two raw values are different, the verification application 505 may transmit the raw value associated with the data element 310A to the requesting application 550, and alerts 510 may be generated. The alerts 510 may then be used by a user to perform analysis to determine the cause of the migration error associated with the data element 310A. One of the advantages of some embodiments is the ability to provide information to users with much lower privileges (such as a read only user) about data in the system. This includes things like which keys or secrets are not matched up, without revealing the underlying contents of the secrets. The analysis may result in updating the raw value of the data element 310B to be the same as the raw value of the data element 310A.

It may be noted that the alerts 510 may not include the raw value of the data element 310A or 310B. Instead, the alerts 510 may include some metadata relating to the data element 310A to enable the system administrator to identify the data element 310A for analysis. It may be noted that the verification application 505 may require the availability of both the data store 270A and the data store 270B in order for it to ensure that the requesting application 550 will always get the correct raw value (e.g., the secret) of the desired data element. A raw value is used to refer to an unencrypted value.

For some embodiments, when a secret is removed from a data store, the data element associated with the secret may be assigned a null value. For example, when a developer is satisfied that the migration is successful for a particular data element, the developer may request to have that data element removed from the data store 270A. This may be accomplished by replacing the raw value associated with that data element with a null value. When the verification application 505 performs a comparison of a data element and its counterpart data element, the one that has a non-null value may be selected over the one that has a null value.

It may be possible for a secret migrated from one data store to another data store to be changed due to external factors such as, for example, geographical differences or hosting service. In this scenario, the verification application 505 may be configured to recognize and take into account those differences when performing the comparison. The operation of the verification application 505 may also accommodate a situation when the raw value of the data element in the data store 270A is intentionally modified. For example, the raw value may be a secret and periodic rotation of the secret may be necessary for security. In this scenario, the verification application 505 may recognize the differences in the two raw values in the data store 270A and 270B, and the correct raw value (e.g., the rotated secret) in the data store 270A may be selected.

FIG. 6 shows an example diagram of a hash values verification application 605, in accordance with some embodiments. For some embodiments, when the data elements are retrieved from the data store 270B (such as, for example, during run time of an application), hash values of the data elements 610 may be generated and stored for integrity and consistency verification. It may be noted that the raw values (e.g, the secrets) of the data elements may not be stored, only their hash values.

Hash values verification application 605 may be included in the server computing system 255 and may be configured to compare the hash values of the data elements 610 with the hash values generated by the migration application 405 (shown in FIG. 4) to identify if there is any differences. It may be noted that the hash values verification application 605 may be activated without having to receive a request for a data element, such as a request by application 550 shown in FIG. 5. It may also be noted that the hash values generated by the migration application 405 are based on the raw values of the data elements stored in the data store 270A, and the hash values of the data elements 610 are based on the raw values of the counterpart data elements stored in the data store 270B.

When the migration is successful, it is anticipated that the hash values generated by the migration application 405 and the hash values of the data elements 610 are the same. For example, if a secret is successfully migrated from one data store to another data store, it is anticipated that the hash values of the secret will be the same. If the hash values verification application 605 detects differences in hash values, hash value alerts 620 may be generated for analysis. The comparison performed by the hash values verification application 605 may be useful to developers to enable them to confirm that the migration of their associated data elements is successful without them knowing the raw values of those data elements.

FIG. 7 is an example flow diagram of a migration verification process, in accordance with some embodiments. Flow diagram 700 may be performed by a verification application 505 (as shown in FIG. 5) after the data elements have been migrated from a first data store (e.g., data store 270A) to a second data store (e.g., data store 270B). At block 705, a request to access a data element is received. For example, the request may have been generated by an application that needs to retrieve a secret to access a database. At block 710, the verification application may access a raw value associated with the requested data element from each of the first data store and the second data store. The retrieval may be via the appropriate data store manager and decryption operations may be performed by the data store managers.

At block 715, the verification application may perform a comparison of both raw values to determine if they are similar. When the two raw values are similar, the process may flow to block 720 where the raw value may be provided to the requesting application. When the two raw values are different, the process may flow to block 725 where the raw value from the first data store may be provided to the requesting application. It may be noted that the raw value from the first data store is provided to ensure that the requesting application is getting the correct raw value without the effect of the migration. At block 730, alerts may be generated to indicate potential migrating errors.

It may be noted that, although the description may refer to migrating secrets from one data store to another data store and performing verification of the migration operations of those secrets, the techniques may also be applicable to migrating other data elements from one data store to another data store as long as both data stores are available to service the request.

FIG. 8A shows a system diagram 800 illustrating architectural components of an on-demand service environment, in accordance with some embodiments. A client machine located in the cloud 804 (or Internet) may communicate with the on-demand service environment via one or more edge routers 808 and 812. The edge routers may communicate with one or more core switches 820 and 824 via firewall 816. The core switches may communicate with a load balancer 828, which may distribute server load over different pods, such as the pods 840 and 844. The pods 840 and 844, which may each include one or more servers and/or other computing resources, may perform data processing and other operations used to provide on-demand Services. Communication with the pods may be conducted via pod switches 832 and 836. Components of the on-demand service environment may communicate with a database storage system 856 via a database firewall 848 and a database switch 852.

As shown in FIGS. 8A-8B, accessing an on-demand service environment may involve communications transmitted among a variety of different hardware and/or software components. Further, the on-demand service environment 800 is a simplified representation of an actual on-demand service environment. For example, while only one or two devices of each type are shown in FIGS. 8A and 8B, some embodiments of an on-demand service environment may include anywhere from one to many devices of each type. Also, the on-demand service environment need not include each device shown in FIGS. 8A-8B, or may include additional devices not shown in FIGS. 8A-8B.

Moreover, one or more of the devices in the on-demand service environment 800 may be implemented on the same physical device or on different hardware. Some devices may be implemented using hardware or a combination of hardware and software. Thus, terms such as “data processing apparatus,” “machine,” “server” and “device” as used herein are not limited to a single hardware device, but rather include any hardware and software configured to provide the described functionality.

The cloud 804 is intended to refer to a data network or plurality of data networks, often including the Internet. Client machines located in the cloud 804 may communicate with the on-demand service environment to access services provided by the on-demand service environment. For example, client machines may access the on-demand service environment to retrieve, store, edit, and/or process information.

In some embodiments, the edge routers 808 and 812 route packets between the cloud 804 and other components of the on-demand service environment 800. The edge routers 808 and 812 may employ the Border Gateway Protocol (BGP). The BGP is the core routing protocol of the Internet. The edge routers 808 and 812 may maintain a table of IP networks or ‘prefixes’ which designate network reachability among autonomous systems on the Internet.

In one or more embodiments, the firewall 816 may protect the inner components of the on-demand service environment 800 from Internet traffic. The firewall 816 may block, permit, or deny access to the inner components of the on-demand service environment 800 based upon a set of rules and other criteria. The firewall 816 may act as one or more of a packet filter, an application gateway, a stateful filter, a proxy server, or any other type of firewall.

In some embodiments, the core switches 820 and 824 are high-capacity switches that transfer packets within the on-demand service environment 800. The core switches 820 and 824 may be configured as network bridges that quickly route data between different components within the on-demand service environment. In some embodiments, the use of two or more core switches 820 and 824 may provide redundancy and/or reduced latency.

In some embodiments, the pods 840 and 844 may perform the core data processing and service functions provided by the on-demand service environment. Each pod may include various types of hardware and/or software computing resources. An example of the pod architecture is discussed in greater detail with reference to FIG. 8B.

In some embodiments, communication between the pods 840 and 844 may be conducted via the pod switches 832 and 836. The pod switches 832 and 836 may facilitate communication between the pods 840 and 844 and client machines located in the cloud 804, for example via core switches 820 and 824. Also, the pod switches 832 and 836 may facilitate communication between the pods 840 and 844 and the database storage 856.

In some embodiments, the load balancer 828 may distribute workload between the pods 840 and 844. Balancing the on-demand service requests between the pods may assist in improving the use of resources, increasing throughput, reducing response times, and/or reducing overhead. The load balancer 828 may include multilayer switches to analyze and forward traffic.

In some embodiments, access to the database storage 856 may be guarded by a database firewall 848. The database firewall 848 may act as a computer application firewall operating at the database application layer of a protocol stack. The database firewall 848 may protect the database storage 856 from application attacks such as structure query language (SQL) injection, database rootkits, and unauthorized information disclosure.

In some embodiments, the database firewall 848 may include a host using one or more forms of reverse proxy services to proxy traffic before passing it to a gateway router. The database firewall 848 may inspect the contents of database traffic and block certain content or database requests. The database firewall 848 may work on the SQL application level atop the TCP/IP stack, managing applications' connection to the database or SQL management interfaces as well as intercepting and enforcing packets traveling to or from a database network or application interface.

In some embodiments, communication with the database storage system 856 may be conducted via the database switch 852. The multi-tenant database system 856 may include more than one hardware and/or software components for handling database queries. Accordingly, the database switch 852 may direct database queries transmitted by other components of the on-demand service environment (e.g., the pods 840 and 844) to the correct components within the database storage system 856. In some embodiments, the database storage system 856 is an on-demand database system shared by many different organizations. The on-demand database system may employ a multi-tenant approach, a virtualized approach, or any other type of database approach. An on-demand database system is discussed in greater detail with reference to FIGS. 9 and 10.

FIG. 8B shows a system diagram illustrating the architecture of the pod 844, in accordance with one embodiment. The pod 844 may be used to render services to a user of the on-demand service environment 800. In some embodiments, each pod may include a variety of servers and/or other systems. The pod 844 includes one or more content batch servers 864, content search servers 868, query servers 882, Fileforce servers 886, access control system (ACS) servers 880, batch servers 884, and app servers 888. Also, the pod 844 includes database instances 890, quick file systems (QFS) 892, and indexers 894. In one or more embodiments, some or all communication between the servers in the pod 844 may be transmitted via the switch 836.

In some embodiments, the application servers 888 may include a hardware and/or software framework dedicated to the execution of procedures (e.g., programs, routines, scripts) for supporting the construction of applications provided by the on-demand service environment 800 via the pod 844. Some such procedures may include operations for providing the services described herein. The content batch servers 864 may request internal to the pod. These requests may be long-running and/or not tied to a particular customer. For example, the content batch servers 864 may handle requests related to log mining, cleanup work, and maintenance tasks.

The content search servers 868 may provide query and indexer functions. For example, the functions provided by the content search servers 868 may allow users to search through content stored in the on-demand service environment. The Fileforce servers 886 may manage requests information stored in the Fileforce storage 898. The Fileforce storage 898 may store information such as documents, images, and basic large objects (BLOBs). By managing requests for information using the Fileforce servers 886, the image footprint on the database may be reduced.

The query servers 882 may be used to retrieve information from one or more file systems. For example, the query system 872 may receive requests for information from the app servers 888 and then transmit information queries to the NFS 896 located outside the pod. The pod 844 may share a database instance 890 configured as a multi-tenant environment in which different organizations share access to the same database. Additionally, services rendered by the pod 844 may require various hardware and/or software resources. In some embodiments, the ACS servers 880 may control access to data, hardware resources, or software resources.

In some embodiments, the batch servers 884 may process batch jobs, which are used to run tasks at specified times. Thus, the batch servers 884 may transmit instructions to other servers, such as the app servers 888, to trigger the batch jobs. For some embodiments, the QFS 892 may be an open source file system available from Sun Microsystems® of Santa Clara, Calif. The QFS may serve as a rapid-access file system for storing and accessing information available within the pod 844. The QFS 892 may support some volume management capabilities, allowing many disks to be grouped together into a file system. File system metadata can be kept on a separate set of disks, which may be useful for streaming applications where long disk seeks cannot be tolerated. Thus, the QFS system may communicate with one or more content search servers 868 and/or indexers 894 to identify, retrieve, move, and/or update data stored in the network file systems 896 and/or other storage systems.

In some embodiments, one or more query servers 882 may communicate with the NFS 896 to retrieve and/or update information stored outside of the pod 844. The NFS 896 may allow servers located in the pod 844 to access information to access files over a network in a manner similar to how local storage is accessed. In some embodiments, queries from the query servers 882 may be transmitted to the NFS 896 via the load balancer 820, which may distribute resource requests over various resources available in the on-demand service environment. The NFS 896 may also communicate with the QFS 892 to update the information stored on the NFS 896 and/or to provide information to the QFS 892 for use by servers located within the pod 844.

In some embodiments, the pod may include one or more database instances 890. The database instance 890 may transmit information to the QFS 892. When information is transmitted to the QFS, it may be available for use by servers within the pod 844 without requiring an additional database call. In some embodiments, database information may be transmitted to the indexer 894. Indexer 894 may provide an index of information available in the database 890 and/or QFS 892. The index information may be provided to Fileforce servers 886 and/or the QFS 892.

FIG. 9 shows a block diagram of an environment 910 wherein an on-demand database service might be used, in accordance with some embodiments. Environment 910 includes an on-demand database service 916. User system 912 may be any machine or system that is used by a user to access a database user system. For example, any of user systems 912 can be a handheld computing system, a mobile phone, a laptop computer, a work station, and/or a network of computing systems. As illustrated in FIGS. 9 and 10, user systems 912 might interact via a network 914 with the on-demand database service 916.

An on-demand database service, such as system 916, is a database system that is made available to outside users that do not need to necessarily be concerned with building and/or maintaining the database system, but instead may be available for their use when the users need the database system (e.g., on the demand of the users). Some on-demand database services may store information from one or more tenants stored into tables of a common database image to form a multi-tenant database system (MTS). Accordingly, “on-demand database service 916” and “system 916” will be used interchangeably herein. A database image may include one or more database objects. A relational database management system (RDBMS) or the equivalent may execute storage and retrieval of information against the database object(s). Application platform 918 may be a framework that allows the applications of system 916 to run, such as the hardware and/or software, e.g., the operating system. In an implementation, on-demand database service 916 may include an application platform 918 that enables creation, managing and executing one or more applications developed by the provider of the on-demand database service, users accessing the on-demand database service via user systems 912, or third party application developers accessing the on-demand database service via user systems 912.

One arrangement for elements of system 916 is shown in FIG. 9, including a network interface 920, application platform 918, tenant data storage 922 for tenant data 923, system data storage 924 for system data 925 accessible to system 916 and possibly multiple tenants, program code 926 for implementing various functions of system 916, and a process space 928 for executing MTS system processes and tenant-specific processes, such as running applications as part of an application hosting service. Additional processes that may execute on system 916 include database indexing processes.

The users of user systems 912 may differ in their respective capacities, and the capacity of a particular user system 912 might be entirely determined by permissions (permission levels) for the current user. For example, where a call center agent is using a particular user system 912 to interact with system 916, the user system 912 has the capacities allotted to that call center agent. However, while an administrator is using that user system to interact with system 916, that user system has the capacities allotted to that administrator. In systems with a hierarchical role model, users at one permission level may have access to applications, data, and database information accessible by a lower permission level user, but may not have access to certain applications, database information, and data accessible by a user at a higher permission level. Thus, different users may have different capabilities with regard to accessing and modifying application and database information, depending on a user's security or permission level.

Network 914 is any network or combination of networks of devices that communicate with one another. For example, network 914 can be any one or any combination of a LAN (local area network), WAN (wide area network), telephone network, wireless network, point-to-point network, star network, token ring network, hub network, or other appropriate configuration. As the most common type of computer network in current use is a TCP/IP (Transfer Control Protocol and Internet Protocol) network (e.g., the Internet), that network will be used in many of the examples herein. However, it should be understood that the networks used in some embodiments are not so limited, although TCP/IP is a frequently implemented protocol.

User systems 912 might communicate with system 916 using TCP/IP and, at a higher network level, use other common Internet protocols to communicate, such as HTTP, FTP, AFS, WAP, etc. In an example where HTTP is used, user system 912 might include an HTTP client commonly referred to as a “browser” for sending and receiving HTTP messages to and from an HTTP server at system 916. Such an HTTP server might be implemented as the sole network interface between system 916 and network 914, but other techniques might be used as well or instead. In some embodiments, the interface between system 916 and network 914 includes load sharing functionality, such as round-robin HTTP request distributors to balance loads and distribute incoming HTTP requests evenly over a plurality of servers. At least as for the users that are accessing that server, each of the plurality of servers has access to the MTS' data; however, other alternative configurations may be used instead.

In some embodiments, system 916, shown in FIG. 9, implements a web-based customer relationship management (CRM) system. For example, in some embodiments, system 916 includes application servers configured to implement and execute CRM software applications as well as provide related data, code, forms, web pages and other information to and from user systems 912 and to store to, and retrieve from, a database system related data, objects, and Webpage content. With a multi-tenant system, data for multiple tenants may be stored in the same physical database object, however, tenant data typically is arranged so that data of one ten ant is kept logically separate from that of other tenants so that one tenant does not have access to another tenant's data, unless such data is expressly shared. In certain embodiments, system 916 implements applications other than, or in addition to, a CRM application. For example, system 916 may provide tenant access to multiple hosted (standard and custom) applications. User (or third party developer) applications, which may or may not include CRM, may be supported by the application platform 918, which manages creation, storage of the applications into one or more database objects and executing of the applications in a virtual machine in the process space of the system 916.

Each user system 912 could include a desktop personal computer, workstation, laptop, PDA, cell phone, or any wireless access protocol (WAP) enabled device or any other computing system capable of interfacing directly or indirectly to the Internet or other network connection. User system 912 typically runs an HTTP client, e.g., a browsing program, such as Microsoft's Internet Explorer® browser, Mozilla's Firefox® browser, Opera's browser, or a WAP-enabled browser in the case of a cell phone, PDA or other wireless device, or the like, allowing a user (e.g., subscriber of the multi-tenant database system) of user system 912 to access, process and view information, pages and applications available to it from system 916 over network 914.

Each user system 912 also typically includes one or more user interface devices, such as a keyboard, a mouse, trackball, touch pad, touch screen, pen or the like, for interacting with a graphical user interface (GUI) provided by the browser on a display (e.g., a monitor screen, LCD display, etc.) in conjunction with pages, forms, applications and other information provided by system 916 or other systems or servers. For example, the user interface device can be used to access data and applications hosted by system 916, and to perform searches on stored data, and otherwise allow a user to interact with various GUI pages that may be presented to a user. As discussed above, embodiments are suitable for use with the Internet, which refers to a specific global internetwork of networks. However, it should be understood that other networks can be used instead of the Internet, such as an intranet, an extranet, a virtual private network (VPN), a non-TCP/IP based network, any LAN or WAN or the like.

According to some embodiments, each user system 912 and all of its components are operator configurable using applications, such as a browser, including computer code run using a central processing unit such as an Intel Pentium® processor or the like. Similarly, system 916 (and additional instances of an MTS, where more than one is present) and all of their components might be operator configurable using application(s) including computer code to run using a central processing unit such as processor system 917, which may include an Intel Pentium® processor or the like, and/or multiple processor units.

A computer program product implementation includes a machine-readable storage medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the processes of the embodiments described herein. Computer code for operating and configuring system 916 to intercommunicate and to process web pages, applications and other data and media content as described herein are preferably downloaded and stored on a hard disk, but the entire program code, or portions thereof, may also be stored in any other volatile or non-volatile memory medium or device, such as a ROM or RAM, or provided on any media capable of storing program code, such as any type of rotating media including floppy disks, optical discs, digital versatile disk (DVD), compact disk (CD), microdrive, and magneto-optical disks, and magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.

Additionally, the entire program code, or portions thereof, may be transmitted and downloaded from a software source over a transmission medium, e.g., over the Internet, or from another server, or transmitted over any other conventional network connection (e.g., extranet, VPN, LAN, etc.) using any communication medium and protocols (e.g., TCP/IP, HTTP, HTTPS, Ethernet, etc.). It will also be appreciated that computer code for implementing embodiments can be implemented in any programming language that can be executed on a client system and/or server or server system such as, for example, C, C++, HTML, any other markup language, Java™, JavaScript®, ActiveX®, any other scripting language, such as VBScript, and many other programming languages as are well known may be used. (Java™ is a trademark of Sun Microsystems®, Inc.).

According to some embodiments, each system 916 is configured to provide web pages, forms, applications, data and media content to user (client) systems 912 to support the access by user systems 912 as tenants of system 916. As such, system 916 provides security mechanisms to keep each tenant's data separate unless the data is shared. If more than one MTS is used, they may be located in close proximity to one another (e.g., in a server farm located in a single building or campus), or they may be distributed at locations remote from one another (e.g., one or more servers located in city A and one or more servers located in city B). As used herein, each MTS could include logically and/or physically connected servers distributed locally or across one or more geographic locations. Additionally, the term “server” is meant to include a computing system, including processing hardware and process space(s), and an associated storage system and database application (e.g., OODBMS or RDBMS) as is well known in the art.

It should also be understood that “server system” and “server” are often used interchangeably herein. Similarly, the database object described herein can be implemented as single databases, a distributed database, a collection of distributed databases, a database with redundant online or offline backups or other redundancies, etc., and might include a distributed database or storage network and associated processing intelligence.

FIG. 10 also shows a block diagram of environment 910 further illustrating system 916 and various interconnections, in accordance with some embodiments. FIG. 10 shows that user system 912 may include processor system 912A, memory system 912B, input system 912C, and output system 912D. FIG. 10 shows network 914 and system 916. FIG. 10 also shows that system 916 may include tenant data storage 922, tenant data 923, system data storage 924, system data 925, User Interface (UI) 1030, Application Program Interface (API) 1032, PL/SOQL 1034, save routines 1036, application setup mechanism 1038, applications servers 10001-1000N, system process space 1002, tenant process spaces 1004, tenant management process space 1010, tenant storage area 1012, user storage 1014, and application metadata 1016. In other embodiments, environment 910 may not have the same elements as those listed above and/or may have other elements instead of, or in addition to, those listed above.

User system 912, network 914, system 916, tenant data storage 922, and system data storage 924 were discussed above in FIG. 9. Regarding user system 912, processor system 912A may be any combination of processors. Memory system 912B may be any combination of one or more memory devices, short term, and/or long term memory. Input system 912C may be any combination of input devices, such as keyboards, mice, trackballs, scanners, cameras, and/or interfaces to networks. Output system 912D may be any combination of output devices, such as monitors, printers, and/or interfaces to networks. As shown by FIG. 10, system 916 may include a network interface 920 (of FIG. 9) implemented as a set of HTTP application servers 1000, an application platform 918, tenant data storage 922, and system data storage 924. Also shown is system process space 1002, including individual tenant process spaces 1004 and a tenant management process space 1010. Each application server 1000 may be configured to tenant data storage 922 and the tenant data 923 therein, and system data storage 924 and the system data 925 therein to serve requests of user systems 912. The tenant data 923 might be divided into individual tenant storage areas 1012, which can be either a physical arrangement and/or a logical arrangement of data. Within each tenant storage area 1012, user storage 1014 and application metadata 1016 might be similarly allocated for each user. For example, a copy of a user's most recently used (MRU) items might be stored to user storage 1014. Similarly, a copy of MRU items for an entire organization that is a tenant might be stored to tenant storage area 1012. A UI 1030 provides a user interface and an API 1032 provides an application programmer interface to system 916 resident processes to users and/or developers at user systems 912. The tenant data and the system data may be stored in various databases, such as Oracle™ databases.

Application platform 918 includes an application setup mechanism 1038 that supports application developers' creation and management of applications, which may be saved as metadata into tenant data storage 922 by save routines 1036 for execution by subscribers as tenant process spaces 1004 managed by tenant management process 1010 for example. Invocations to such applications may be coded using PL/SOQL 34 that provides a programming language style interface extension to API 1032. A detailed description of some PL/SOQL language embodiments is discussed in commonly assigned U.S. Pat. No. 7,730,478, titled METHOD AND SYSTEM FOR ALLOWING ACCESS TO DEVELOPED APPLICATIONS VIA A MULTI-TENANT ON-DEMAND DATABASE SERVICE, by Craig Weissman, filed Sep. 21, 4007, which is hereby incorporated by reference in its entirety and for all purposes. Invocations to applications may be detected by system processes, which manage retrieving application metadata 1016 for the subscriber making the invocation and executing the metadata as an application in a virtual machine.

Each application server 1000 may be communicably coupled to database systems, e.g., having access to system data 925 and tenant data 923, via a different network connection. For example, one application server 10001 might be coupled via the network 914 (e.g., the Internet), another application server 1000N-1 might be coupled via a direct network link, and another application server 1000N might be coupled by yet a different network connection. Transfer Control Protocol and Internet Protocol (TCP/IP) are typical protocols for communicating between application servers 1000 and the database system. However, other transport protocols may be used to optimize the system depending on the network interconnect used.

In certain embodiments, each application server 1000 is configured to handle requests for any user associated with any organization that is a tenant. Because it is desirable to be able to add and remove application servers from the server pool at any time for any reason, there is preferably no server affinity for a user and/or organization to a specific application server 1000. In some embodiments, therefore, an interface system implementing a load balancing function (e.g., an F5 Big-IP load balancer) is communicably coupled between the application servers 1000 and the user systems 912 to distribute requests to the application servers 1000. In some embodiments, the load balancer uses a least connections algorithm to route user requests to the application servers 1000. Other examples of load balancing algorithms, such as round robin and observed response time, also can be used. For example, in certain embodiments, three consecutive requests from the same user could hit three different application servers 1000, and three requests from different users could hit the same application server 1000. In this manner, system 916 is multi-tenant, wherein system 916 handles storage of, and access to, different objects, data and applications across disparate users and organizations.

As an example of storage, one tenant might be a company that employs a sales force where each call center agent uses system 916 to manage their sales process. Thus, a user might maintain contact data, leads data, customer follow-up data, performance data, goals and progress data, etc., all applicable to that user's personal sales process (e.g., in tenant data storage 922). In an example of a MTS arrangement, since all of the data and the applications to access, view, modify, report, transmit, calculate, etc., can be maintained and accessed by a user system having nothing more than network access, the user can manage his or her sales efforts and cycles from any of many different user systems. For example, if a call center agent is visiting a customer and the customer has Internet access in their lobby, the call center agent can obtain critical updates as to that customer while waiting for the customer to arrive in the lobby.

While each user's data might be separate from other users' data regardless of the employers of each user, some data might be organization-wide data shared or accessible by a plurality of users or all of the users for a given organization that is a tenant. Thus, there might be some data structures managed by system 916 that are allocated at the tenant level while other data structures might be managed at the user level. Because an MTS might support multiple tenants including possible competitors, the MTS should have security protocols that keep data, applications, and application use separate. Also, because many tenants may opt for access to an MTS rather than maintain their own system, redundancy, up-time, and backup are additional functions that may be implemented in the MTS. In addition to user-specific data and tenant specific data, system 916 might also maintain system level data usable by multiple tenants or other data. Such system level data might include industry reports, news, postings, and the like that are sharable among tenants.

In certain embodiments, user systems 912 (which may be client machines/systems) communicate with application servers 1000 to request and update system-level and tenant-level data from system 916 that may require sending one or more queries to tenant data storage 922 and/or system data storage 924. System 916 (e.g., an application server 1000 in system 916) automatically generates one or more SQL statements (e.g., SQL queries) that are designed to access the desired information. System data storage 924 may generate query plans to access the requested data from the database.

Each database can generally be viewed as a collection of objects, such as a set of logical tables, containing data fitted into predefined categories. A “table” is one representation of a data object, and may be used herein to simplify the conceptual description of objects and custom objects according to some embodiments. It should be understood that “table” and “object” may be used interchangeably herein. Each table generally contains one or more data categories logically arranged as columns or fields in a viewable schema. Each row or record of a table contains an instance of data for each category defined by the fields. For example, a CRM database may include a table that describes a customer with fields for basic contact information such as name, address, phone number, fax number, etc. Another table might describe a purchase order, including fields for information such as customer, product, sale price, date, etc. In some multi-tenant database systems, standard entity tables might be provided for use by all tenants. For CRM database applications, such standard entities might include tables for account, contact, lead, and opportunity data, each containing pre-defined fields. It should be understood that the word “entity” may also be used interchangeably herein with “object” and “table”.

In some multi-tenant database systems, tenants may be allowed to create and store custom objects, or they may be allowed to customize standard entities or objects, for example by creating custom fields for standard objects, including custom index fields. U.S. Pat. No. 7,779,039, titled CUSTOM ENTITIES AND FIELDS IN A MULTI-TENANT DATABASE SYSTEM, by Weissman, et al., and which is hereby incorporated by reference in its entirety and for all purposes, teaches systems and methods for creating custom objects as well as customizing standard objects in a multi-tenant database system. In some embodiments, for example, all custom entity data rows are stored in a single multi-tenant physical table, which may contain multiple logical tables per organization. In some embodiments, multiple “tables” for a single customer may actually be stored in one large table and/or in the same table as the data of other customers.

These and other aspects of the disclosure may be implemented by various types of hardware, software, firmware, etc. For example, some features of the disclosure may be implemented, at least in part, by machine-program product that include program instructions, state information, etc., for performing various operations described herein. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher-level code that may be executed by the computer using an interpreter. Examples of machine-program product include, but are not limited to, magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media; and hardware devices that are specially configured to store and perform program instructions, such as read-only memory devices (“ROM”) and random access memory (“RAM”).

While one or more embodiments and techniques are described with reference to an implementation in which a service cloud console is implemented in a system having an application server providing a front end for an on-demand database service capable of supporting multiple tenants, the one or more embodiments and techniques are not limited to multi-tenant databases nor deployment on application servers. Embodiments may be practiced using other database architectures, i.e., ORACLE®, DB2® by IBM and the like without departing from the scope of the embodiments claimed.

Any of the above embodiments may be used alone or together with one another in any combination. Although various embodiments may have been motivated by various deficiencies with the prior art, which may be discussed or alluded to in one or more places in the specification, the embodiments do not necessarily address any of these deficiencies. In other words, different embodiments may address different deficiencies that may be discussed in the specification. Some embodiments may only partially address some deficiencies or just one deficiency that may be discussed in the specification, and some embodiments may not address any of these deficiencies.

While various embodiments have been described herein, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of the present application should not be limited by any of the embodiments described herein, but should be defined only in accordance with the following and later-submitted claims and their equivalents.

Claims

1. A method comprising: receiving, by a server computing system, a request to access a data element from a second data store, the data element having been migrated to the second data store from a first data store;accessing, by the server computing system, the data element from the second data store and its counterpart data element from the first data store;comparing, by the server computing system, a secret associated with the data element from the second data store with a secret associated with the counterpart data element from the first data store;
2. The method of claim 1, wherein both the first data store and the second data store are available to service the request after the data element has been migrated to the second data store from the first data store.
3. The method of claim 1, further comprising generating, by the server computing system, alerts based on the data element from the second data store being different from the counterpart data element from the first data store.
4. The method of claim 3, wherein the first data store is associated with a first cryptographic technique and the second data store is associated with a second cryptographic technique, wherein the counterpart data element from the first data store is decrypted using the first cryptographic technique.
5. The method of claim 4, wherein the decrypted counterpart data element is encrypted using the second cryptographic technique prior to being stored with the data element in the second data store.
6. The method of claim 5, wherein said accessing the data element from the second data store comprises decrypting the data element using the second cryptographic technique to obtain the secret associated with the data element, and wherein said accessing the counterpart data element from the first data store comprises decrypting the counterpart data element using the first cryptographic technique to obtain the secret associated with the counterpart data element.
7. A system comprising: one or more processors; anda non-transitory computer readable medium storing a plurality of instructions, which when executed, cause the one or more processors of a server computing system to:receive a request to access a data element from a second data store, the data element having been migrated to the second data store from a first data store;access the data element from the second data store and its counterpart data element from the first data store;compare a secret associated with the data element from the second data store with a secret associated with the counterpart data element from the first data store;
8. The system of claim 7, wherein both the first data store and the second data store are available to service the request after the data element has been migrated to the second data store from the first data store.
9. The system of claim 7, further comprising instructions to generate alerts based on the data element from the second data store being different from the counterpart data element from the first data store.
10. The system of claim 9, wherein the first data store is associated with a first cryptographic technique and the second data store is associated with a second cryptographic technique, wherein the counterpart data element from the first data store is decrypted using the first cryptographic technique.
11. The system of claim 10, wherein the decrypted counterpart data element is encrypted using the second cryptographic technique prior to being stored with the data element in the second data store.
12. The system of claim 11, wherein said accessing the data element from the second data store comprises decrypting the data element using the second cryptographic technique to obtain the secret associated with the data element, and wherein said accessing the counterpart data element from the first data store comprises decrypting the counterpart data element using the first cryptographic technique to obtain the secret associated with the counterpart data element.
13. A computer program product comprising computer-readable program code to be executed by one or more processors when retrieved from a non-transitory computer-readable medium, the program code including instructions to: receive a request to access a data element from a second data store, the data element having been migrated to the second data store from a first data store;access the data element from the second data store and its counterpart data element from the first data store;compare a secret associated with the data element from the second data store with a secret associated with the counterpart data element from the first data store; andrespond to the request by providing the counterpart data element and the secret associated with the counterpart data element from the first data store instead of the data element from the second data store when the data element from the second data store is different from the counterpart data element from the first data store.
14. The computer program product of claim 13, wherein both the first data store and the second data store are available to service the request after the data element has been migrated to the second data store from the first data store.
15. The computer program product of claim 14, further comprising instructions to generate alerts based on the data element from the second data store being different from the counterpart data element from the first data store.
16. The computer program product of claim 15, wherein the first data store is associated with a first cryptographic technique and the second data store is associated with a second cryptographic technique, wherein the counterpart data element from the first data store is decrypted using the first cryptographic technique.
17. The computer program product of claim 16, wherein the decrypted counterpart data element is encrypted using the second cryptographic technique prior to being stored with the data element in the second data store.
18. The computer program product of claim 17, wherein said accessing the data element from the second data store comprises decrypting the data element using the second cryptographic technique to obtain the secret associated with the data element, and wherein said accessing the counterpart data element from the first data store comprises decrypting the counterpart data element using the first cryptographic technique to obtain the secret associated with the counterpart data element.

CLAIM OF PRIORITY

This application is a continuation-in-part application of U.S. application Ser. No. 15/638,245, filed Jun. 29, 2017 and U.S. application Ser. No. 15/638,249, filed Jun. 29, 2017, both of which are incorporated in their entirety herein by reference.

US Referenced Citations (228)

Number	Name	Date	Kind
5577188	Zhu	Nov 1996	A
5608872	Schwartz	Mar 1997	A
5613142	Matsumoto	Mar 1997	A
5649104	Carleton	Jul 1997	A
5684990	Boothby	Nov 1997	A
5715450	Ambrose et al.	Feb 1998	A
5761419	Schwartz	Jun 1998	A
5819038	Carleton	Oct 1998	A
5821937	Tonelli et al.	Oct 1998	A
5831610	Tonelli et al.	Nov 1998	A
5873096	Lim et al.	Feb 1999	A
5918159	Fomukong et al.	Jun 1999	A
5963953	Cram et al.	Oct 1999	A
6092083	Brodersen et al.	Jul 2000	A
6161149	Achacoso et al.	Dec 2000	A
6169534	Raffel et al.	Jan 2001	B1
6178425	Brodersen et al.	Jan 2001	B1
6189011	Lim et al.	Feb 2001	B1
6216135	Brodersen et al.	Apr 2001	B1
6233617	Rothwein et al.	May 2001	B1
6243715	Bogantz	Jun 2001	B1
6266669	Brodersen et al.	Jul 2001	B1
6295530	Ritchie et al.	Sep 2001	B1
6324568	Diec et al.	Nov 2001	B1
6324693	Brodersen et al.	Nov 2001	B1
6336137	Lee et al.	Jan 2002	B1
D454139	Feldcamp et al.	Mar 2002	S
6367077	Brodersen et al.	Apr 2002	B1
6393605	Loomans	May 2002	B1
6405220	Brodersen et al.	Jun 2002	B1
6405364	Bowman-Amuah	Jun 2002	B1
6434550	Warner et al.	Aug 2002	B1
6446089	Brodersen et al.	Sep 2002	B1
6535909	Rust	Mar 2003	B1
6549908	Loomans	Apr 2003	B1
6553563	Ambrose et al.	Apr 2003	B2
6560461	Fomukong et al.	May 2003	B1
6574635	Stauber et al.	Jun 2003	B2
6577726	Huang et al.	Jun 2003	B1
6601087	Zhu	Jul 2003	B1
6604117	Lim et al.	Aug 2003	B2
6604128	Diec	Aug 2003	B2
6609150	Lee et al.	Aug 2003	B2
6621834	Scherpbier	Sep 2003	B1
6654032	Zhu	Nov 2003	B1
6665648	Brodersen et al.	Dec 2003	B2
6665655	Warner et al.	Dec 2003	B1
6684389	Tanaka	Jan 2004	B1
6684438	Brodersen et al.	Feb 2004	B2
6711565	Subramaniam et al.	Mar 2004	B1
6724399	Katchour et al.	Apr 2004	B1
6728702	Subramaniam et al.	Apr 2004	B1
6728960	Loomans et al.	Apr 2004	B1
6732095	Warshavsky et al.	May 2004	B1
6732100	Brodersen et al.	May 2004	B1
6732111	Brodersen et al.	May 2004	B2
6754681	Brodersen et al.	Jun 2004	B2
6763351	Subramaniam et al.	Jul 2004	B1
6763501	Zhu	Jul 2004	B1
6768904	Kim	Jul 2004	B2
6772229	Achacoso et al.	Aug 2004	B1
6782383	Subramaniam et al.	Aug 2004	B2
6804330	Jones et al.	Oct 2004	B1
6826565	Ritchie et al.	Nov 2004	B2
6826582	Chatterjee et al.	Nov 2004	B1
6826745	Coker	Nov 2004	B2
6829655	Huang et al.	Dec 2004	B1
6842748	Warner et al.	Jan 2005	B1
6850895	Brodersen et al.	Feb 2005	B2
6850927	Hsu	Feb 2005	B1
6850949	Warner et al.	Feb 2005	B2
7062502	Kesler	Jun 2006	B1
7340411	Cook	Mar 2008	B2
7356482	Frankland et al.	Apr 2008	B2
7401094	Kesler	Jul 2008	B1
7620655	Larsson	Nov 2009	B2
7698160	Beaven et al.	Apr 2010	B2
7730478	Weissman	Jun 2010	B2
7761465	Nonaka	Jul 2010	B1
7779039	Weissman et al.	Aug 2010	B2
7779475	Jakobson et al.	Aug 2010	B2
7851004	Hirao et al.	Dec 2010	B2
7926049	Kumar	Apr 2011	B1
8010663	Firminger et al.	Aug 2011	B2
8014943	Jakobson	Sep 2011	B2
8015495	Achacoso et al.	Sep 2011	B2
8032297	Jakobson	Oct 2011	B2
8032940	Dhanani	Oct 2011	B1
8082301	Ahlgren et al.	Dec 2011	B2
8095413	Beaven et al.	Jan 2012	B1
8095594	Beaven et al.	Jan 2012	B2
8161536	Subramaniam	Apr 2012	B1
8209308	Jakobson et al.	Jun 2012	B2
8275836	Beaven et al.	Sep 2012	B2
8484111	Frankland et al.	Jul 2013	B2
8490025	Jakobson et al.	Jul 2013	B2
8504945	Jakobson et al.	Aug 2013	B2
8510664	Rueben et al.	Aug 2013	B2
8539228	Mason	Sep 2013	B1
8566301	Rueben et al.	Oct 2013	B2
8571882	Teitelbaum	Oct 2013	B1
8572547	Urh	Oct 2013	B1
8646103	Jakobson et al.	Feb 2014	B2
8707024	Kwan	Apr 2014	B2
8930947	Derbeko	Jan 2015	B1
8996873	Pahl	Mar 2015	B1
9336246	Gorelik	May 2016	B2
9430539	Kalantzis	Aug 2016	B2
9600513	Bourbonnais	Mar 2017	B2
9626525	Momchilov	Apr 2017	B2
9674162	Miller	Jun 2017	B1
9722974	Fuller	Aug 2017	B1
9959217	Eperiesi-Beck	May 2018	B2
10282433	Caruso	May 2019	B1
10291401	Norum	May 2019	B1
20010044791	Richter et al.	Nov 2001	A1
20010052108	Bowman-Amuah	Dec 2001	A1
20020067833	Han	Jun 2002	A1
20020072951	Lee et al.	Jun 2002	A1
20020082892	Raffel	Jun 2002	A1
20020129352	Brodersen et al.	Sep 2002	A1
20020140731	Subramanian et al.	Oct 2002	A1
20020143997	Huang et al.	Oct 2002	A1
20020162090	Parnell et al.	Oct 2002	A1
20020165742	Robbins	Nov 2002	A1
20020198953	O'Rourke	Dec 2002	A1
20030004971	Gong	Jan 2003	A1
20030018705	Chen et al.	Jan 2003	A1
20030018830	Chen et al.	Jan 2003	A1
20030037029	Holenstein	Feb 2003	A1
20030066031	Laane et al.	Apr 2003	A1
20030066032	Ramachandran et al.	Apr 2003	A1
20030069936	Warner et al.	Apr 2003	A1
20030070000	Coker et al.	Apr 2003	A1
20030070004	Mukundan et al.	Apr 2003	A1
20030070005	Mukundan et al.	Apr 2003	A1
20030074418	Coker et al.	Apr 2003	A1
20030120675	Stauber et al.	Jun 2003	A1
20030151633	George et al.	Aug 2003	A1
20030159136	Huang et al.	Aug 2003	A1
20030187921	Diec et al.	Oct 2003	A1
20030189600	Gune et al.	Oct 2003	A1
20030204427	Gune et al.	Oct 2003	A1
20030206192	Chen et al.	Nov 2003	A1
20040001092	Rothwein et al.	Jan 2004	A1
20040015981	Coker et al.	Jan 2004	A1
20040027388	Berg et al.	Feb 2004	A1
20040128001	Levin et al.	Jul 2004	A1
20040186860	Lee et al.	Sep 2004	A1
20040193510	Catahan et al.	Sep 2004	A1
20040199489	Barnes-Leon et al.	Oct 2004	A1
20040199536	Barnes Leon et al.	Oct 2004	A1
20040249854	Barnes-Leon et al.	Dec 2004	A1
20040260534	Pak et al.	Dec 2004	A1
20040260659	Chan et al.	Dec 2004	A1
20040268299	Lei et al.	Dec 2004	A1
20050050555	Exley et al.	Mar 2005	A1
20050091098	Brodersen et al.	Apr 2005	A1
20050154873	Cam-Winget	Jul 2005	A1
20050273859	Chess	Dec 2005	A1
20060218391	Glazer	Sep 2006	A1
20060259973	Sima	Nov 2006	A1
20060282897	Sima	Dec 2006	A1
20070160203	Sudhakar	Jul 2007	A1
20080034008	Burke	Feb 2008	A1
20080209221	Vennelakanti	Aug 2008	A1
20080232598	Vennelakanti	Sep 2008	A1
20080317248	Naono	Dec 2008	A1
20090063415	Chatfield et al.	Mar 2009	A1
20090100342	Jakobson	Apr 2009	A1
20090171959	Xu	Jul 2009	A1
20090177744	Marlow et al.	Jul 2009	A1
20100100724	Kaliski, Jr.	Apr 2010	A1
20100293373	McBrearty	Nov 2010	A1
20110138059	Schleifer	Jun 2011	A1
20110153953	Khemani	Jun 2011	A1
20110202755	Orsini	Aug 2011	A1
20110320433	Mohiuddin	Dec 2011	A1
20120233137	Jakobson et al.	Sep 2012	A1
20120321089	Braun	Dec 2012	A1
20130145145	Dittmer-Roche	Jun 2013	A1
20130218948	Jakobson	Aug 2013	A1
20130218949	Jakobson	Aug 2013	A1
20130218966	Jakobson	Aug 2013	A1
20130219176	Akella	Aug 2013	A1
20130238577	Driesen	Sep 2013	A1
20130305039	Gauda	Nov 2013	A1
20140006849	Ramirez	Jan 2014	A1
20140359537	Jakobson et al.	Dec 2014	A1
20140372374	Bourbonnais	Dec 2014	A1
20140379656	Driesen	Dec 2014	A1
20150007050	Jakobson et al.	Jan 2015	A1
20150052353	Kang	Feb 2015	A1
20150095162	Jakobson et al.	Apr 2015	A1
20150172563	Jakobson et al.	Jun 2015	A1
20150222604	Ylonen	Aug 2015	A1
20150288665	El Emam	Oct 2015	A1
20160080217	McHardy	Mar 2016	A1
20160094555	Kiperberg	Mar 2016	A1
20160099810	Li	Apr 2016	A1
20160269371	Coimbatore	Sep 2016	A1
20160294548	Qian	Oct 2016	A1
20160294549	Qian	Oct 2016	A1
20160342519	Liashenko	Nov 2016	A1
20170033930	Costa	Feb 2017	A1
20170039397	Furuhashi	Feb 2017	A1
20170054800	DiVincenzo	Feb 2017	A1
20170070505	Lindley	Mar 2017	A1
20170078200	Jin	Mar 2017	A1
20170123700	Sinha	May 2017	A1
20170171174	Campagna	Jun 2017	A1
20170171219	Campagna	Jun 2017	A1
20170288871	Dimitrakos	Oct 2017	A1
20180046823	Durham	Feb 2018	A1
20180060600	Hamel	Mar 2018	A1
20180062835	Hamel	Mar 2018	A1
20180115535	Mehta	Apr 2018	A1
20180137158	Hoffmann	May 2018	A1
20180145831	Garagnon	May 2018	A1
20180189373	Shevade	Jul 2018	A1
20180314827	Wells	Nov 2018	A1
20180316685	Eberlein	Nov 2018	A1
20180322184	Voss	Nov 2018	A1
20180351928	Yoo	Dec 2018	A1
20190149341	Robison	May 2019	A1
20190245857	Pe'er	Aug 2019	A1
20190320320	Li	Oct 2019	A1
20190364041	Durski	Nov 2019	A1

Related Publications (1)

	Number	Date	Country
	20190228187 A1	Jul 2019	US

Continuation in Parts (2)

	Number	Date	Country
Parent	15638245	Jun 2017	US
Child	16371428		US
Parent	15638249	Jun 2017	US
Child	15638245		US

Methods and systems for data migration

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Disclaimer