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 processing query statements on a multi-tenant on demand architecture in a database network system.
The subject matter discussed in the background section should not be assumed to be prior art merely as a result of its mentioned 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 sent 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 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 processing group membership data in a multi-tenant database system. These mechanisms and methods for processing group membership data in a multi-tenant database system can enable embodiments to ease the burden of manipulation data when updating the database. It may also reduce the processing cycles required to process queries to the database.
In an embodiment and by way of example, a method of processing group membership data in a multi-tenant database system includes receiving a request for access to a sub-portion of content on the database system. The request has requester identification data. Groups are identified that have access to the sub-portion. Data stored on the database in first and second sets system is joined to identify member information associated with the groups. It is determined whether the requester identification data corresponds to the member information; and access is granted to the sub-portion in response to determining that the requester identification data corresponding to the member information.
The present invention is described with reference to an embodiment in which an apparatus processes group membership data in a multi-tenant on demand architecture. The application server provides a front end for an on-demand database service capable of supporting multiple tenants; the present invention is not limited to multi-tenant database systems nor deployment on application servers. Embodiments may be practiced using other database architectures, i.e., ORACLE®, DB2C® 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 for processing group membership data in a multitenant 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.
Each virtual portal 6, 7 and 8 provides an “instance” of a portal user interface, coupled to allow access to database 9. With architecture 5, multiple users 12-14 may access information on database 9 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 12-14 over network 16. The resources of database 9 that users 12-14 may access can be different, depending on user's 12-14 security or permission level and/or tenant association. For example, in some MTSs, tenants may be allowed to provide users 12-14 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 anyone of the tenant users may access may be the same as or different from the sub-portion that the remaining tenant users may access. User's not associated with a tenant would not be allowed access to the tenant information. For example, assume users 12 and 13 are associated with the tenant corresponding to tenant information 10 and not associated with the tenant corresponding to tenant information 11. Users 12 and 13 would not be allowed access to tenant information 11 and would be allowed access to tenant information 10 or a sub-portion thereof. In the present example user may be allowed access to a portion 15 of tenant information 10 and user 13 may be allowed access to a portion 19 of tenant information 10, which is mutually exclusive. Similarly, were user 14 associated with the tenant corresponding to tenant information 11 and not the tenant corresponding to tenant information 10, user 14 would be allowed to access tenant information 11, or a portion thereof, and not tenant information 10. It is possible, however, that one of users 12-14 are associated to the tenants corresponding to both sets of tenant information 10 and 11. As a result, a tenant may be considered a group having one or more users 12-14 associated therewith.
Data communication network 16 may be any network or combination of networks of devices that communicate with one another. For example, network 16 can be anyone 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, such as the global internetwork of networks often referred to as the “Internet” with a capital “I,” that network will be used in many of the examples herein. However, it should be understood that the networks that the present invention might use are not so limited, although TCP/IP is a frequently implemented protocol. As a result, users 12-14 may access the corresponding tenant information 10 and 11 from any location where network access is available.
To this end, virtual portals 6, 7 and 8 facilitates providing resources of database 9 that a tenant may provide to users 12-14 associated with the tenant. Each user 12-14 logs into one of virtual portals 6, 7 and 8 to access resources of database 9 through a unique uniform resource locator (URL) or other type of address. Based on the URL and other identifying information associated with users 12-14, architecture 5 may determine the resources of database 9 users 12-14 may access. For example, user 12 communicates with database through virtual portal 6, user 13 communicates with database 9 through virtual portal 7, and user 14 communicates with database through virtual portal 8. It is possible, however, that all users 12-14 may use a common portal, as well. To that end, users desiring to access resources of database 9 employ virtual portals 6, 7 and 8 to validate against the information stored on system 5, corresponding to the user 12-14 requesting access to a sub-portion of content on database 9.
An example of a tenant may be a company that employs a sales force where each salesperson uses server system 30 to manage their sales process, such as by a management representative of the tenant, e.g., Vice President of Sales, the Chief Executive Officer of the tenant and the like. In this fashion, architecture facilitates Customer Relations Management (CRM). Thus, one or more of users 12-14 may be a salesperson that maintains information that is applicable to that salesperson's sales process and is different from information related to other salespersons' sales process. An example of sales process data may include, without limitation, contact data, leads data, customer follow-up data, performance data, goals and progress data applicable to that salesperson's personal sales process. The sales process information may be stored in database 9. To facilitate management of this information, the tenant associated with the salesperson may restrict each salesperson access to specific sales process information. However, a tenant, or representative thereof based upon a contractual relation ship 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.
This is referred to as a hierarchical data structure in which users at one permission level, in this example the representative, may have access to applications, data, and database information accessible by a lower permission level user, in this example the salespersons, with the salesperson not having access to certain applications, database information, and data accessible by a user at a higher permission level, the representative. In this fashion, the representative may access all information that the tenants' user could access, in this example, salespersons; however, the tenant's user, in the present example a salesperson, is not necessarily allowed to access information of the representative. As a result, the representative is a sub-group of the tenant group. Similarly, an administrator of the architecture 5 may access and control all information available to each of the tenants, as well as the tenant users associated with each tenant. It is conceivable that other sub-groups may exist.
Referring to
Referring to
Referring to again
It should be understood that “table” and “object” may be used interchangeably herein. As a result, tenant information 10 and 11, as well as ADR 17, may 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 the present invention.
Referring to both
Referring to
Application platform 38 may be a framework that allows the applications of architecture 5 to run, such as the hardware and/or software, e.g., the operating system. In an embodiment, application platform 38 may enable creation, managing and executing one or more applications developed by the owner/provider of architecture 5, users 12-14 accessing architecture 5 via user systems 32, or third party application developers accessing architecture 5 via user systems 32.
In one embodiment, server system 30 implements a web-based customer relationship management (CRM) system. For example, in one embodiment, server system 30 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 32 and to store to, and retrieve from, database system related data, objects, and Webpage content. Architecture 5 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 30 implements applications other than, or in addition to, the CRM application discussed above. For example, server system 30 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 38, 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 30.
To facilitate web-based CRM, user systems 32 might communicate with server system 30 using TCP/IP and, at a higher network level, use other common Internet protocols to communicate, such as HTTP, FTP, AFS, WAP, etc. To that end, user systems 32 may be any computing device capable of interfacing directly or indirectly to the Internet or other network connection, such as desktop personal computer, workstation, laptop, PDA, cell phone, or any wireless access protocol (WAP) enabled device and the like running an HTTP client 49. An example of a user system 32 includes a processor system 50, a memory system 52, an input system 54, and output system 56. Processor system 50 may be any combination of one or more processors. Memory system 52 may be any combination of one or more memory devices, volatile, and/or non-volatile memory. A portion of memory system is used to run operating system 58 in which HTTP client 49 executes. Input system 54 may be any combination of input devices, such as one or more keyboards, mice, trackballs, scanners, cameras, and/or interfaces to networks. Output system 56 may be any combination of output devices, such as one or more monitors, printers, and/or interfaces to networks. HTTP client 49 allows users 12-14 of users systems 32 to access, process and view information, pages and applications available to it from server system 30 over network 16. Examples of HTTP client 49 include various browsing applications, such as Microsoft's Internet Explorer browser, Netscape's Navigator browser, Opera's browser, or a WAP-enabled browser in the case of a cell phone, PDA or other wireless device, or the like. Access is gained to requisite tenant information 10 and 11 by entering the URL (not shown) into the URL box 60 of HTTP client 49. The URL directs users 12-14 to the appropriate virtual portal for to determine authorization and permission level to access the requisite tenant information.
Data corresponding with each user 12-14 may be separate from the data corresponding to the remaining users 12-14 regardless of the tenant associated with users 12-14; however, some data might be shared or accessible by a plurality of users 12-14 or all of users 12-14 associated with a tenant. Thus, there might be some data structures managed by server system 30 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 30 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 30 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 38 includes an application setup mechanism 78 that supports application developers' creation and management of applications, which may be saved as metadata 92 by save routines 76 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 74 that provides a programming language style interface extension to API 72. 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 92 for the subscriber making the invocation and executing the metadata as an application in a virtual machine.
Each HTTP application servers 801-80N may be communicably coupled to database systems, e.g., having access to system data 34 and tenant data 32, via a different network connection. For example, one HTTP application server 801 might be coupled via the network 16 (e.g., the Internet), another HTTP application servers 801-80N might be coupled via a direct network link, and another one of HTTP application servers 801-80N 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 801-80N and database 9. 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 801-80N 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 801-80N. In one embodiment, therefore, an interface system implementing a load balancing function (e.g., an F5Big-IP load balancer) is communicably coupled between HTTP application servers 801-80N and the user systems 32 to distribute requests to HTTP application servers 801-80N. In one embodiment, the load balancer uses a least connections algorithm to route user requests to HTTP application servers 801-80N. 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 12-14 could hit three different HTTP application servers 801-80N, and three requests from different user systems 32 could hit a common HTTP application server 801-80N. In this manner, server system 30 is multi-tenant, wherein server system 30 handles storage of, and access to, different objects, data and applications across disparate users and organizations.
In certain embodiments, user systems 32 (which may be client systems) communicate with HTTP application servers 801-80N to request and update system-level and tenant-level data from server system 30 that may require sending one or more queries to tenant data storage 42 and/or system data storage 44. Server system 30 (e.g., an application server 80 in server system 30) automatically generates one or more SQL statements (e.g., one or more SQL queries) that are designed to access the desired information. System data storage 44 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.
This continuation application is related to, and claims priority to, the utility application entitled “TECHNIQUES FOR PROCESSING GROUP MEMBERSHIP DATA IN A MULTI-TENANT DATABASE SYSTEM,” filed on Jul. 3, 2008, having an application Ser. No. of 12/167,991 , now U.S. Pat. No. 8,473,518, the entire contents of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5072337 | 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 |
5787437 | Potterveld et al. | Jul 1998 | A |
5794232 | Mahlum et al. | Aug 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 |
5941947 | Brown et al. | Aug 1999 | A |
5950190 | Yeager et al. | Sep 1999 | A |
5963953 | Cram et al. | Oct 1999 | A |
5974409 | Sanu et al. | Oct 1999 | A |
5987471 | Bodine et al. | Nov 1999 | A |
6064656 | Angal et al. | May 2000 | A |
6085191 | Fisher et al. | Jul 2000 | 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 |
6189000 | Gwertzman et al. | Feb 2001 | B1 |
6189011 | Lim et al. | Feb 2001 | B1 |
6216135 | Brodersen et al. | Apr 2001 | B1 |
6219667 | Lu et al. | Apr 2001 | B1 |
6226641 | Hickson et al. | May 2001 | B1 |
6233617 | Rothwein et al. | May 2001 | B1 |
6233618 | Shannon | 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 |
6330560 | Harrison et al. | Dec 2001 | B1 |
6336137 | Lee et al. | Jan 2002 | B1 |
6341288 | Yach et al. | Jan 2002 | B1 |
6345288 | Reed et al. | Feb 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 |
6446109 | Gupta | Sep 2002 | B2 |
6453038 | McFarlane 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 |
6578037 | Wong et al. | Jun 2003 | B1 |
6601087 | Zhu et al. | Jul 2003 | B1 |
6604117 | Lim et al. | Aug 2003 | B2 |
6604128 | Diec | Aug 2003 | B2 |
6609148 | Salo et al. | Aug 2003 | B1 |
6609150 | Lee et al. | Aug 2003 | B2 |
6621834 | Scherpbier et al. | Sep 2003 | B1 |
6654032 | Zhu et al. | Nov 2003 | B1 |
6658417 | Stakutis et al. | Dec 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 |
6944133 | Wisner et al. | Sep 2005 | B2 |
6947927 | Chaudhuri et al. | Sep 2005 | B2 |
7076633 | Tormasov et al. | Jul 2006 | B2 |
7152109 | Suorsa et al. | Dec 2006 | B2 |
7185192 | Kahn | Feb 2007 | B1 |
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 |
7308704 | Vogel et al. | 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 |
7577092 | San Andres et al. | Aug 2009 | B2 |
7580975 | Cheenath | Aug 2009 | B2 |
7599953 | Galindo-Legaria et al. | Oct 2009 | B2 |
7620655 | Larsson et al. | Nov 2009 | B2 |
7693820 | Larson et al. | Apr 2010 | B2 |
7774366 | Fisher | Aug 2010 | B2 |
7814470 | Mamou et al. | Oct 2010 | B2 |
7849401 | Elza et al. | Dec 2010 | B2 |
8015019 | Smith et al. | Sep 2011 | B1 |
8146155 | Todd et al. | Mar 2012 | B1 |
8244759 | Brooks et al. | Aug 2012 | B2 |
8296321 | Durdik et al. | Oct 2012 | B2 |
8443366 | Yancey | May 2013 | B1 |
8473469 | Yancey et al. | Jun 2013 | B1 |
8776067 | Yancey | Jul 2014 | B1 |
8972431 | Press et al. | Mar 2015 | B2 |
8977675 | Tanaka | Mar 2015 | B2 |
20010023440 | Franklin et al. | Sep 2001 | A1 |
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 | Ramachadran 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 |
20040078371 | Worrall 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 |
20040205355 | Boozer 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 | Weissman et al. | Mar 2005 | A1 |
20050091098 | Brodersen et al. | Apr 2005 | A1 |
20050102154 | Dodd et al. | May 2005 | A1 |
20050125725 | Gatt | Jun 2005 | A1 |
20050223022 | Weissman et al. | Oct 2005 | A1 |
20050283478 | Choi et al. | Dec 2005 | A1 |
20060095960 | Arregoces et al. | May 2006 | A1 |
20060100912 | Kumar et al. | May 2006 | A1 |
20060112052 | Jeanblanc et al. | May 2006 | 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 |
20070226640 | Holbrook et al. | Sep 2007 | A1 |
20080010243 | Weissman et al. | Jan 2008 | A1 |
20080066185 | Lester et al. | Mar 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 | Apr 2008 | A1 |
20080086514 | Weissman et al. | Apr 2008 | A1 |
20080086567 | Langen et al. | Apr 2008 | A1 |
20080086735 | Cheenath et al. | Apr 2008 | A1 |
20080112405 | Cholas et al. | May 2008 | A1 |
20080126333 | Bezar et al. | May 2008 | A1 |
20080155310 | Langen et al. | Jun 2008 | A1 |
20080162544 | Weissman et al. | Jul 2008 | A1 |
20080201701 | Hofhansl et al. | Aug 2008 | A1 |
20080215560 | Bell et al. | Sep 2008 | A1 |
20080269167 | Ziegler et al. | Oct 2008 | A1 |
20080270354 | Weissman | Oct 2008 | A1 |
20080270987 | Weissman | Oct 2008 | A1 |
20090030906 | Doshi et al. | Jan 2009 | A1 |
20090049065 | Weissman | Feb 2009 | A1 |
20090049101 | Weissman | Feb 2009 | A1 |
20090049102 | Weissman | Feb 2009 | A1 |
20090049288 | Weissman | Feb 2009 | A1 |
20090276395 | Weissman et al. | Nov 2009 | A1 |
20090276405 | Weissman et al. | Nov 2009 | A1 |
20090282045 | Hsieh et al. | Nov 2009 | A1 |
20090319529 | Bartlett et al. | Dec 2009 | A1 |
20100017374 | Bae et al. | Jan 2010 | A1 |
20100191719 | Weissman et al. | Jul 2010 | A1 |
20100211619 | Weissman et al. | Aug 2010 | A1 |
20100235837 | Weissman et al. | Sep 2010 | A1 |
20100274779 | Weissman et al. | Oct 2010 | A1 |
20110078213 | Bezar et al. | Mar 2011 | A1 |
20110234482 | Tanaka | Sep 2011 | A1 |
20110238736 | Tanaka | Sep 2011 | A1 |
20110276535 | Pin et al. | Nov 2011 | A1 |
20110276834 | Calahan et al. | Nov 2011 | A1 |
20120047489 | Varadharajan | Feb 2012 | A1 |
20140095545 | Weissman et al. | Apr 2014 | A1 |
Number | Date | Country |
---|---|---|
WO 2004059420 | Jul 2004 | WO |
Entry |
---|
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. |
[Online];[published on Oct. 17, 2008];[retrieved on Feb. 26, 2010]; retrieved from http://en.wikipedia.orglwiki/ 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. |
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/1050021. International Filing Date: Sep. 23, 2010. |
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. |
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. |
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. |
Office Action for U.S. Appl. No. 12/167,991 dated Jan. 3, 2011, 19 pages. |
Office Action for U.S. Appl. No. 12/167,991 dated Jun. 23, 2011, 18 pages. |
Office Action for U.S. Appl. No. 12/167,991 dated May 9, 2012, 17 pages. |
Office Action for U.S. Appl. No. 12/167,991 dated Dec. 17, 2012, 20 pages. |
Notice of Allowance for U.S. Appl. No. 12/167,991 dated May 15, 2013, 9 pages. |
Number | Date | Country | |
---|---|---|---|
20130346389 A1 | Dec 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12167991 | Jul 2008 | US |
Child | 13916441 | US |