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.
The current invention relates generally to databases. More particularly the current invention relates to techniques for implementing batch processes on multi-tenant databases.
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.
In conventional database systems, users access their data resources in one logical database. A user of such a conventional system typically retrieves data from and stores data on the system using the user's own systems. A user system might remotely access one of a plurality of server systems that might in turn access the database system. Data retrieval from the system might include the issuance of a query from the user system to the database system. The database system might process the request for information received in the query and send to the user system information relevant to the request. The efficient retrieval of accurate information and subsequent delivery of this information to the user system has been and continues to be a goal of administrators of database systems.
Unfortunately, conventional database approaches might become inefficient if, for example, updating applications in the presence of complex data structures. A database system may also process a query relatively slowly if, for example, a relatively large number of users substantially concurrently access the database system.
Accordingly, it is desirable to provide techniques enabling an owner of the database system to improve the ease of use of the database system.
In accordance with embodiments, there are provided techniques for implementing batch processing in a multi-tenant on-demand database system. These techniques for implementing batch processing in a multi-tenant on-demand database system can enable embodiments to ease the burden of manipulating data when updating the database. It may also reduce the computational load on the database by holding execution of batch processes until a desired time.
In an embodiment and by way of example, a method implementing batch processing in a multi-tenant on-demand database system includes operating on instructions from a tenant to have the database system perform processes on a subset of content stored on the database system. Identified among the instructions is an object associated with a class to execute a batch code interface that invokes multiple methods to schedule and execute functions upon the subset. The batch code interface is executed asynchronously with operations of the database system by invoking the multiple methods, thereby providing a batch processing facility to the tenant.
The present invention is described with reference to an embodiment in which an apparatus implements a batch process in a multi-tenant on demand architecture. Although the invention is discussed with respect to supporting multiple tenants; the present invention is not limited to multi-tenant database systems. 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. Inventions 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 of the invention 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 of the invention do not necessarily address any of these deficiencies. In other words, different embodiments of the invention 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.
In the following drawings like reference numbers are used to refer to like elements. Although the following figures depict various examples of the invention, the invention is not limited to the examples depicted in the figures.
Systems and methods are provided to implement batch processing in a multi-tenant on-demand database system. As used herein, the term multi-tenant database system (MTS) refers to those systems in which various elements of hardware and software of the database system may be shared by one or more users. 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.
Server side facilities 12 access to a database 32 by multiple users 25-27 of client side facilities 14 over data communication network 16. To that end, network interface resources 22 include a plurality of virtual portals 33-35. Each virtual portal 33-35 provides an “instance” of a portal user interface coupled to allow access to database 32. Typically, tenants obtain rights to store information, referred to as tenant information 38 and 40, on database 32 and make the same accessible to one or more users 25-27 to whom the tenant provides authorization. This is typically achieved by rental agreements between the tenant and an owner/provider of architecture 10. In this manner, architecture 10 provides an on-demand database service to users 25-27 that are not necessarily concerned with building and/or maintaining the database system; rather, these functions are addressed between the tenant and the owner/provider.
With architecture 10, multiple users 25-27 may access database 32 through a common network address, in this example a universal resource locator (URL). In response, web-pages and other content may be provided to users 25-27 over network 16. The resources of database 32 that users 25-27 may access can be different, depending on user's 25-27 security or permission level and/or tenant association. As a result, data structures included in tenant information is managed so as to be allocated at the tenant level, while other data structures might be managed at the user level. Because architecture 10 supports multiple tenants including possible competitors, security protocols 42 and other system software 44, stored for example on hard drive 26, maintain applications and applications' use to only those users 25-27 with proper access rights. Also, because many tenants may desire access to architecture 10 rather than maintain their own system, redundancy, up-time, and backup are additional functions that may be implemented in architecture 10. In addition to user-specific data and tenant specific data, server side facilities 12 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.
For example, in certain embodiments architectures 10 may allow users 25-27 associated with the tenant, referred to as tenant users, access to a sub-portion of the content of the database information that the tenant may be allowed to access. The sub-portion that any one of users 25-27 may access may be the same as, or different from, the sub-portion that the remaining users 25-27 may access. Users 25-27 not associated with a tenant would not be allowed access to information 38 and 40. For example, assume users 25 and 26 are associated with the tenant corresponding to tenant information 38 and not associated with the tenant corresponding to tenant information 40. Users 25 and 26 would not be allowed access to tenant information 40 and would be allowed access to tenant information 38 or a sub-portion thereof. In the present example, user 25 may be allowed access to a first portion of tenant information 38 and user 26 may be allowed access to a second portion of tenant information 38, which is mutually exclusive. Similarly, were user 27 associated with the tenant corresponding to tenant information 40 and not the tenant corresponding to tenant information 38, user 27 would be allowed to access tenant information 40, or a portion thereof, and not tenant information 38. It is possible, however, that one of users 25-27 are associated to the tenants corresponding to both sets of tenant information 38 and 40.
Virtual portals 33, 34 and 35 facilitate providing resources of database 32 on behalf of a tenant to users 25-27 associated with the tenant. Each user 25-27 logs into one of virtual portals 33, 34 and 35 to access resources of database 32 through a unique uniform resource locator (URL) or other type of address. Based on the URL and other identifying information associated with users 25-27, architecture 10 may determine the resources of database 32 users 25-27 may access. For example, user 25 communicates with database through virtual portal 33, user 26 communicates with database 32 through virtual portal 34, and user 27 communicates with database through virtual portal 35. It is possible, however, that all users 25-27 may use a common portal, as well. To that end, users 25-27 desiring to access resources of database 32 employ virtual portals 33, 34 and 35 to validate against the information stored on architecture 10, corresponding to the user 25-27 requesting access to a sub-portion of content on database 32.
The result of the communications between users 25-27 and server side facilities 12 results in multiple processes 50, 52 and 54 being executed by processor sub-system 18. Thus, it is desired that processor sub-system 18 be capable of providing uninterrupted interaction with users 25-27 to provide online transaction processing (OLTP) to each of users 25-27. As a result, each of processes 50, 52 and 54 may include one or more threads of execution. This is shown as threads 56 associated with process 50, threads 58 associated with process 52 and threads 60 associated with process 54.
Referring to both
Moreover, to facilitate management of this information, the tenant associated with the salespersons may restrict each of the salespersons to access specific sales process information. However, a tenant, or representative thereof based upon a contractual relationship between the salesperson and the representative, may be able to view all sale process information for the salespersons associated with the tenant. An example of a contractual relationship is a managerial/supervisory relationship. The managerial relationship between the salesperson and the tenant representative may provide the representative with a higher permission level when compared to the permission level of the salesperson, because, inter alia, the tenant representative may be a manager/supervisor of the salesperson. Another contractual relationship may be the principle agent relationship wherein the tenant representative has no day-to-day management responsibility of the salesperson. Nonetheless, as the representative of the principle, e.g., the tenant, the representative may view all of the salesperson information, because the salespersons may be deemed to be merely agents of the tenant.
Tenant information 38 and 40 may be viewed as a collection of objects, such as a set 61-66 of logical tables, containing data fitted into predefined categories. This is shown as data objects 67-73 with respect to tenant set 63. 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 the present invention. It should be understood that “table” and “object” may be used interchangeably herein. Thus, it is realized that large amounts of objects having complex interrelationships may be subject to a request for manipulation, for example, a managerial relationship between a salesperson or thousands of salespersons, may change. To implement this change may require a substantial percentage of the computational resources of the processor sub-system 18. Thus, manipulating such a large quantity of data objects 67-73 may interfere with the computing experience of users 25-27 taking advantage of OLTP processes 50, 52, and 54.
Referring to both
First method 81 is the Database.QueryLocator start (START) method that identifies the full set 84 of objects 85-91 that is the subject of the batch request. Second method 82 is the void executeBatch (EXECUTE) method that executes the manipulation defined by a tenant and or user 25-27. Third method 83 is the void finish (FINISH) method that is invoked after START method 81 and EXECUTE method 82 have completed. The result that occur in response to invocation of FINISH method 83 is defined by tenants and/or users 25-27 and may include sending notifications to users 25-27 that the batch process is complete and/or further details concerning the changes to tenant information 38 and 40 as a result of the batch process.
To ensure that a single batch process does not consume too great a quantity of resources of processor sub-subsystem 18, START method 81 calls a QueryLocator object 92 that points to a maximum number of objects that may be scheduled for uninterrupted processing. Specifically, the QueryLocator object 92 represents a server side database cursor persisted on architecture 10. As a result, QueryLocator object 92 will retrieve a predetermined maximum number of objects 85-91 from set 84. As shown QueryLocator object 92 retrieves four different sub-groups 100, 101, 102 and 103, of objects 85-91. Sub-group 100 includes objects 85 and 86; sub-group 101 includes objects 87 and 88; sub-group 102 includes objects 89 and 90; and sub-group 103 includes object 91. As a result, EXECUTE method 82 is invoked four times by process 94, each time operating on a different one of sub-groups 100-103. In operation, the total number of objects in a result set that is identified by START method 81 may be in the millions. Therefore, the predetermined number retried by QueryLocator object 92 is a quantity defined by the owner of architecture 10 and is dependent upon several technological and business factors, such as the processing capacity of architecture 10 and/or the business arrangements with tenants and/or a priori information concerning the consumption history of the resources of architecture 10. For example, an instance of batch engine 44 is a process 94 executing in processor sub-system 18, which, inter alia, which monitors the operation of architecture 10 to determine an appropriate time for invoking methods 81-83. This may be determined by dynamically monitoring other processes executing in processor sub-system 18, such as OLTP process 50, 52 and 54 and/or on a particular time during which consumption of architecture has historically been reduced, e.g., on Christmas day, Sundays and the like. Additionally, process 94 monitors the number of batch requests that architecture has scheduled for different tenants and determines the sequence in which to execute the EXECUTE method 82.
Referring to
Referring to
With request 122 being first in request queue 110, start method 281 occurs before any of the remaining methods 282-283, 381-383, 481-483 and 581-583. However, this does not mean that request 122 will be completed before any of the remaining requests, 124, 126 and 128. Rather, as shown, multiple invocations of each of EXECUTE methods 282, 382, 482 and 582 occur in response requests 122, 124, 126 and 128, respectively. The invocation of any one of EXECUTE methods 282, 382, 482 and 582 is interleaved with the remaining EXECUTE methods 282, 382, 482 and 582. This results in at least one of EXECUTE methods 282, 382, 482 and 582 being invoked before completion of at least one request 122, 124, 126 and 128, in the present example. In this manner, no one request 122, 124, 126 and 128 prevents any of the remaining requests 122, 124, 126 and 128 to be subjected to an unreasonable amount of latency before execution of the methods associated therewith occurs. As shown, method 282 is invoked to operate upon a first sub-group of objects associated with identifier 130. However, before method 282 operates on a second sub-group of objects associated with identifier 134, method 382 is invoked to operate on a sub-group of objects associated with identifier 131, method 482 is invoked to operate on a sub-group of objects associated with identifier 132 and method 582 is invoked to operate on a sub-group of objects associated with identifier 133. Thus, process 94 interleaves invocation of the various methods 282, 382, 482 and 582 associated with requests 122, 124, 126 and 128, respectively.
Referring to both
Application platform 606 may be a framework that allows the applications of architecture 10 to run, such as the hardware and/or software, e.g., the operating system. In an embodiment, application platform 606 may enable creation, managing and executing one or more applications developed by the owner/provider of architecture 10, users 25-27 accessing architecture 10 via user systems 602, or third party application developers accessing architecture 10 via user systems 602.
In one embodiment, server system 600 implements a web-based customer relationship management (CRM) system. For example, in one embodiment, server system 600 includes application servers configured to implement and execute CRM software applications as well as provide related data, code, forms, webpages and other information to and from user systems 602 and to store to, and retrieve from, database system related data, objects, and Webpage content. Architecture 10 typically stores data for multiple tenants in the same physical database object, however, tenant data typically is arranged so that data of one tenant 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, server system 600 implements applications other than, or in addition to, the CRM application discussed above. For example, server system 600 may provide tenant access to multiple hosted (standard and custom) applications, including a CRM application. User (or third party developer) applications, which may or may not include CRM, may be supported by the application platform 606, 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 server system 600.
Referring to
Data corresponding with each user 25-27 may be separate from the data corresponding to the remaining users 25-27 regardless of the tenant associated with users 25-27; however, some data might be shared or accessible by a plurality of users 25-27 or all of users 25-27 associated with a tenant. Thus, there might be some data structures managed by server system 600 that are allocated at the tenant level while other data structures might be managed at the user level. Because an MTS typically 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, server system 600 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.
According to one embodiment, server system 600 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 one or more logically and/or physically connected servers distributed locally or across one or more geographic locations. Additionally, the term “server” is meant to include a computer 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.
Referring to
Referring to
Referring again to
Application platform 606 includes an application setup mechanism 810 that supports application developers' creation and management of applications, which may be saved as metadata by save routines 808 for execution by subscribers as one or more tenant process spaces 84 managed by tenant management process 86, for example. Invocations to such applications may be coded using PL/SOQL 806 that provides a programming language style interface extension to API 804. A detailed description of some PL/SOQL language embodiments is discussed in commonly owned co-pending U.S. patent application Ser. No. 11/859,498 entitled, METHOD AND SYSTEM FOR ALLOWING ACCESS TO DEVELOPED APPLICATIONS VIA A MULTI-TENANT ON-DEMAND DATABASE SERVICE, by Craig Weissman, filed Sep. 21, 2007, which is incorporated in its entirety herein for all purposes. Invocations to applications may be detected by one or more system processes, which manage retrieving application metadata for the subscriber making the invocation and executing the metadata as an application in a virtual machine.
Each HTTP application servers 8121-812N may be communicably coupled to database systems, e.g., database 32, via a different network connection. For example, one HTTP application server 8121 might be coupled via the network 16 (e.g., the Internet), another HTTP application servers 8121-812N might be coupled via a direct network link, and another one of HTTP application servers 8121-812N might be coupled by yet a different network connection. Transfer Control Protocol and Internet Protocol (TCP/IP) are typical protocols for communicating between HTTP application servers 8121-812N and database 32. However, it will be apparent to one skilled in the art that other transport protocols may be used to optimize the system depending on the network interconnect used.
In certain embodiments, each of HTTP application servers 8121-812N 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 one of HTTP application servers 8121-812N. In one embodiment, therefore, an interface system implementing a load balancing function (e.g., an F5 Big-IP load balancer) is communicably coupled between HTTP application servers 8121-812N and the user systems 602 to distribute requests to HTTP application servers 8121-812N. In one embodiment, the load balancer uses a least connections algorithm to route user requests to HTTP application servers 8121-812N. 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 25-27 could hit three different HTTP application servers 8121-812N, and three requests from different user systems 602 could hit a common HTTP application server 8121-812N. In this manner, server system 800 is multi-tenant, wherein server system 800 handles storage of, and access to, different objects, data and applications across disparate users and organizations.
In certain embodiments, user systems 602 (which may be client systems) communicate with HTTP application servers 8121-812N to request and update system-level and tenant-level data from server system 800 that may require sending one or more queries to database 32. Server system 800 (e.g., an application server 812 in server system 800) automatically generates one or more SQL statements (e.g., one or more SQL queries) that are designed to access the desired information. Database may generate query plans to access the requested data from the database.
While the invention has been described by way of example and in terms of the specific embodiments, it is to be understood that the invention is not limited to the disclosed embodiments. To the contrary, it is intended to cover various modifications and similar arrangements as would be apparent to those skilled in the art. For example, the present processes may be embodied as a computer program product that 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 the server system to intercommunicate and to process webpages, 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 as is well known, 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, as is well known, or transmitted over any other conventional network connection as is well known (e.g., extranet, VPN, LAN, etc.) using any communication medium and protocols (e.g., TCP/IP, HTTP, HTTPS, Ethernet, etc.) as are well known. It will also be appreciated that computer code for implementing embodiments of the present invention 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.). Therefore, the scope of the appended claims should be accorded the broadest interpretation so as to encompass all such modifications and similar arrangements.
Number | Name | Date | Kind |
---|---|---|---|
5072370 | Durdik | Dec 1991 | A |
5577188 | Zhu | Nov 1996 | A |
5608872 | Schwartz et al. | Mar 1997 | A |
5649104 | Carleton et al. | Jul 1997 | A |
5715450 | Ambrose et al. | Feb 1998 | A |
5761419 | Schwartz et al. | Jun 1998 | A |
5819038 | Carleton et al. | 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 |
5950190 | Yeager et al. | Sep 1999 | A |
5963953 | Cram et al. | Oct 1999 | A |
6092083 | Brodersen et al. | Jul 2000 | A |
6112198 | Lohman et al. | Aug 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 |
6266669 | Brodersen et al. | Jul 2001 | B1 |
6295530 | Ritchie et al. | Sep 2001 | B1 |
6324568 | Diec | Nov 2001 | B1 |
6324693 | Brodersen et al. | Nov 2001 | B1 |
6336137 | Lee et al. | Jan 2002 | B1 |
D454139 | Feldcamp | Mar 2002 | S |
6367077 | Brodersen et al. | Apr 2002 | B1 |
6393605 | Loomans | May 2002 | B1 |
6405220 | Brodersen et al. | Jun 2002 | B1 |
6434550 | Warner et al. | Aug 2002 | B1 |
6438562 | Gupta 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 et al. | Jul 2003 | B1 |
6604117 | Lim et al. | Aug 2003 | B2 |
6604128 | Diec | Aug 2003 | B2 |
6609150 | Lee et al. | Aug 2003 | B2 |
6621834 | Scherpbier et al. | Sep 2003 | B1 |
6654032 | Zhu et al. | Nov 2003 | B1 |
6665648 | Brodersen et al. | Dec 2003 | B2 |
6665655 | Warner et al. | Dec 2003 | B1 |
6684438 | Brodersen et al. | Feb 2004 | B2 |
6711565 | Subramaniam et al. | Mar 2004 | B1 |
6721765 | Ghosh et al. | Apr 2004 | B2 |
6724399 | Katchour et al. | Apr 2004 | B1 |
6728702 | Subramaniam et al. | Apr 2004 | B1 |
6728960 | Loomans | 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 et al. | Jul 2004 | B1 |
6768904 | Kim | Jul 2004 | B2 |
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 et al. | Nov 2004 | B2 |
6829655 | Huang et al. | Dec 2004 | B1 |
6839608 | Sarabi et al. | Jan 2005 | B2 |
6842748 | Warner et al. | Jan 2005 | B1 |
6850895 | Brodersen et al. | Feb 2005 | B2 |
6850949 | Warner et al. | Feb 2005 | B2 |
6947927 | Chaudhuri et al. | Sep 2005 | B2 |
7174483 | Becher et al. | Feb 2007 | B2 |
7206805 | McLaughlin, Jr. | Apr 2007 | B1 |
7206807 | Cheenath | Apr 2007 | B2 |
7209929 | Dominguez, Jr. et al. | Apr 2007 | B2 |
7249118 | Sandler et al. | Jul 2007 | B2 |
7305577 | Zhang | Dec 2007 | B2 |
7340411 | Cook | Mar 2008 | B2 |
7350237 | Vogel et al. | Mar 2008 | B2 |
7373364 | Chapman | May 2008 | B1 |
7448079 | Tremain | Nov 2008 | B2 |
7484219 | Mitra | Jan 2009 | B2 |
7529728 | Weissman et al. | May 2009 | B2 |
7580975 | Cheenath | Aug 2009 | B2 |
7599953 | Galindo-Lagaria et al. | Oct 2009 | B2 |
7620655 | Larsson et al. | Nov 2009 | B2 |
7661027 | Langen et al. | Feb 2010 | B2 |
7693820 | Larson et al. | Apr 2010 | B2 |
7734608 | Fell et al. | Jun 2010 | B2 |
7769825 | Karakashian et al. | Aug 2010 | B2 |
7774366 | Fisher et al. | Aug 2010 | B2 |
7779039 | Weissman et al. | Aug 2010 | B2 |
7814052 | Bezar et al. | Oct 2010 | B2 |
7814470 | Mamou et al. | Oct 2010 | B2 |
7827138 | Salmon et al. | Nov 2010 | B2 |
20010044791 | Richter et al. | Nov 2001 | A1 |
20020022986 | Coker et al. | Feb 2002 | A1 |
20020029161 | Brodersen et al. | Mar 2002 | A1 |
20020029376 | Ambrose et al. | Mar 2002 | A1 |
20020035577 | Brodersen et al. | Mar 2002 | A1 |
20020042264 | Kim | Apr 2002 | A1 |
20020042843 | Diec | Apr 2002 | A1 |
20020072951 | Lee et al. | Jun 2002 | A1 |
20020082892 | Raffel et al. | Jun 2002 | A1 |
20020129352 | Brodersen et al. | Sep 2002 | A1 |
20020133392 | Angel et al. | Sep 2002 | A1 |
20020140731 | Subramaniam et al. | Oct 2002 | A1 |
20020143997 | Huang et al. | Oct 2002 | A1 |
20020152102 | Brodersen et al. | Oct 2002 | A1 |
20020161734 | Stauber et al. | Oct 2002 | A1 |
20020162090 | Parnell et al. | Oct 2002 | A1 |
20020165742 | Robins | Nov 2002 | A1 |
20030004971 | Gong et al. | Jan 2003 | A1 |
20030018705 | Chen et al. | Jan 2003 | A1 |
20030018830 | Chen et al. | Jan 2003 | A1 |
20030066031 | Laane | 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 | Apr 2003 | A1 |
20030088545 | Subramaniam et al. | May 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 | Oct 2003 | A1 |
20030189600 | Gune et al. | Oct 2003 | A1 |
20030191743 | Brodersen et al. | Oct 2003 | A1 |
20030204427 | Gune et al. | Oct 2003 | A1 |
20030206192 | Chen et al. | Nov 2003 | A1 |
20030225730 | Warner et al. | Dec 2003 | A1 |
20040001092 | Rothwein et al. | Jan 2004 | A1 |
20040010489 | Rio | Jan 2004 | A1 |
20040015578 | Karakashian et al. | Jan 2004 | A1 |
20040015981 | Coker et al. | Jan 2004 | A1 |
20040027388 | Berg et al. | Feb 2004 | A1 |
20040044656 | Cheenath | Mar 2004 | A1 |
20040045004 | Cheenath | Mar 2004 | A1 |
20040064503 | Karakashian et al. | Apr 2004 | A1 |
20040111410 | Burgoon et al. | Jun 2004 | A1 |
20040128001 | Levin et al. | Jul 2004 | A1 |
20040143645 | Cheenath | Jul 2004 | A1 |
20040186860 | Lee et al. | Sep 2004 | A1 |
20040193510 | Catahan, Jr. et al. | Sep 2004 | A1 |
20040199489 | Barnes-Leon et al. | Oct 2004 | A1 |
20040199536 | Barnes Leon et al. | Oct 2004 | A1 |
20040199543 | Braud et al. | Oct 2004 | A1 |
20040220952 | Cheenath | Nov 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 |
20050065925 | Wiessman et al. | Mar 2005 | A1 |
20050091098 | Brodersen et al. | Apr 2005 | A1 |
20050223022 | Weissman et al. | Oct 2005 | A1 |
20050262188 | Mamou et al. | Nov 2005 | A1 |
20050283478 | Choi et al. | Dec 2005 | A1 |
20060136382 | Dettinger et al. | Jun 2006 | A1 |
20060206834 | Fisher et al. | Sep 2006 | A1 |
20070078705 | Abels et al. | Apr 2007 | A1 |
20070088741 | Brooks et al. | Apr 2007 | A1 |
20070124276 | Weissman et al. | May 2007 | A1 |
20070130130 | Chan et al. | Jun 2007 | A1 |
20070130137 | Oliver et al. | Jun 2007 | A1 |
20070150303 | Cheenath | Jun 2007 | A1 |
20070150546 | Karakashian et al. | Jun 2007 | A1 |
20080010243 | Weissman et al. | Jan 2008 | A1 |
20080077566 | Fell et al. | Mar 2008 | A1 |
20080082540 | Weissman et al. | Apr 2008 | A1 |
20080082555 | Salmon et al. | Apr 2008 | A1 |
20080082572 | Ballard et al. | Apr 2008 | A1 |
20080082986 | Cheenath et al. | Apr 2008 | A1 |
20080086358 | Doshi et al. | Apr 2008 | A1 |
20080086447 | Weissman et al. | Apr 2008 | A1 |
20080086479 | Fry et al. | Apr 2008 | A1 |
20080086482 | Weissman et al. | Apr 2008 | A1 |
20080086514 | Weissman et al. | Apr 2008 | A1 |
20080086567 | Langen et al. | Apr 2008 | A1 |
20080086735 | Cheenath et al. | Apr 2008 | A1 |
20080126333 | Bezar et al. | May 2008 | A1 |
20080155310 | Langen et al. | Jun 2008 | A1 |
20080162544 | Weissman et al. | Jul 2008 | A1 |
20080201701 | Hofhansel et al. | Aug 2008 | A1 |
20080270354 | Weissman et al. | Oct 2008 | A1 |
20080270987 | Weissman et al. | Oct 2008 | A1 |
20090030906 | Doshi et al. | Jan 2009 | A1 |
20090049065 | Weissman et al. | Feb 2009 | A1 |
20090049101 | Weissman et al. | Feb 2009 | A1 |
20090049102 | Weissman et al. | Feb 2009 | A1 |
20090049288 | Weissman et al. | Feb 2009 | A1 |
20090276395 | Weissman et al. | Nov 2009 | A1 |
20090276405 | Weissman et al. | Nov 2009 | A1 |
20100205216 | Durdik | Aug 2010 | A1 |
20100223284 | Brooks et al. | Sep 2010 | A1 |
Entry |
---|
[online];[published on Oct. 17, 2008];[retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Push—technology. |
[online];[published on Oct. 16, 2008];[retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Customer—Realtionship—Management. |
[online];[published on Apr. 22, 2008];[retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Flat—file—database. |
[online];[published on Apr. 25, 2008];[retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Relational—database. |
First named inventor: Smith, Andrew, U.S. Appl. No. 12/369,710, filed Feb. 11, 2009. |
First named inventor: Bezar, Eric, U.S. Appl. No. 12/569,603, filed Sep. 29, 2009. |
First named inventor: Yancey, Scott, U.S. Appl. No. 12/636,675, filed Dec. 11, 2009. |
First named inventor: Yancey, Scott, U.S. Appl. No. 12/720,538, filed Mar. 9, 2010. |
[online]; [published on Oct. 17, 2008]; [retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Push—technology. |
[online]; [published on Oct. 16, 2008]; [retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Customer—Relationship—Management. |
[online]; [published on Apr. 22, 2008]; [retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Flat—file—database. |
[online]; [published on Apr. 25, 2008]; [retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.org/wiki/Relational—database. |
First named inventor: Yancey, Scott, U.S. Appl. No. 12/636,658, filed Dec. 11, 2009. |
First named inventor Yancey, Scott, U.S. Appl. No. 12/636,675, filed Dec. 11, 2009. |
First named inventor: Doshi, Kedar, U.S. Appl. No. 12/167,991, filed Jul. 3, 2008. |
First named inventor: Bezar, Eric, U.S. Appl. No. 12/569,603, Sep. 2, 2010. |
First named inventor: Yancey, Scott, U.S. Appl. No. 12/132,409, filed Jun. 3, 2008. |
First named inventor: Durdik, Paul, U.S. Appl. No. 12/549,349, filed Aug. 27, 2009. |
Lee et al: “Composition of executable business process models by combining business rules and process flows”, Expert Systems With Application, Oxford, GB, vol. 33, No. 1, Dec. 22, 2006, pp. 221-229. |
Mietzer et al: “Combining Different Multi-tenancy Patterns in Service Oriented Applications”, IEE International Enterprise Distributed Object Computing Conference, NJ, USA, Sep. 1, 2009, pp. 131-140. |
Wang et al: “Integrated Constraint Violation Handling for Dynamic Services Composition”, IEE International Conference on Services Computing, NJ, USA, Sep. 21, 2009, pp. 168-175. |
Wermelinger et al: “Using coordination contracts for flexible adaptation to changing business rules”, Proceedings of the Sixth International Workshop on Software Evolution, NJ, USA, Sep. 1, 2003, pp. 115-120. |
Wang et al: “A Study and Performance Evaluation of the Multi-Tenant Data Tier Design Patterns for Service Oriented Computing”, IEE International Conference on E-Business Engineering, NJ, USA, Oct. 22, 2008, pp. 94-101. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration. International Application No. PCT/US2010/050021. International Filing Date: Sep. 23, 2010. |