This application is related to the following patent applications, which are each hereby incorporated by reference in their entirety:
U.S. patent application Ser. No. 12/780,183, entitled COMPLEX ACCESS CONTROL, by Vladimir Svetov et al., filed May 14, 2010;
U.S. patent application Ser. No. 12/780,340, entitled INTEGRATING EXTERNAL DATA IN HUMAN WORKFLOW TASK, by Ravi Rangaswamy et al., filed May 14, 2010;
U.S. patent application Ser. No. 12/780,661, entitled FLEXIBLE CHAINING OF DISPARATE HUMAN WORKFLOW TASKS IN A BUSINESS PROCESS, by Ravi Rangaswamy et al., filed May 14, 2010;
U.S. patent application Ser. No. 12/780,348, entitled WORKFLOW TASK ROUTING BASED ON CARDINALITY OF TASK DATA, by Ravi Rangaswamy et al., filed May 14, 2010;
U.S. patent application Ser. No. 12/780,356, entitled DYNAMIC HUMAN WORKFLOW TASK ASSIGNMENT USING BUSINESS RULES, by Ravi Rangaswamy et al., filed May 14, 2010;
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 invention is generally related to users and user groups in business processes, and particularly to a system and method for logical people groups.
Business processes, which may also be referred to as business flows or workflows, provide a level of abstraction above programming languages such as Java or C++, making them easier for non-programmers to use to describe desired processing within a particular business process. Example languages used to define business processes include, for example, the Business Process Execution Language (BPEL), which is an XML-based executable language for specifying orchestration between web services that comprise a business process; Business Process Modeling Notation (BPMN), and/or BPM.
Business processes are comprised of activities. Each activity defines actions and logic to be executed. Activities can contain other activities, and such activities are referred to herein as container activities. Each container activity includes one or more contained activities which can either be primitive activities (i.e., activities which do not contain any additional activities) or another container activity.
Activities within the business processes can assign tasks to be completed by a user or a group of users before execution of the business process can continue. These groups of users may be defined by a variety of attributes including job, location, expertise, etc.
However, current systems cannot search across multiple sources. Instead, current systems search only in user directories. Although some business attributes can be pushed to user directories, this can result in duplicate information and can require changes to an enterprise's user directory structure, which is often impractical.
A system is provided for managing a logical people group. The system comprises a computer, including a computer readable medium and processor operating thereon. The system also comprises a query module, executing on the computer, operable to receive a complex query and return a logical group of users. The query module is operable to search, based on the complex query, across a plurality of information sources. The sources can include a user directory which maps a plurality of users to a plurality of groups, a plurality of roles, wherein each role is associated with an application and includes one or more users from the plurality of users, and an attribute directory which includes plurality of attributes for each of the plurality of users. The system also comprises a query cache which stores, for a user-definable period, a reverse lookup table of users and the logical groups to which the users belong based on previously received complex queries.
A system is provided for managing a logical people group. The system comprises a computer, including a computer readable medium and processor operating thereon. The system also comprises a query module, executing on the computer, operable to receive a complex query and return a logical group of users. The query module is operable to search, based on the complex query, across a plurality of information sources. The sources can include a user directory which maps a plurality of users to a plurality of groups, a plurality of roles, wherein each role is associated with an application and includes one or more users from the plurality of users, and an attribute directory which includes plurality of attributes for each of the plurality of users. The system also comprises a query cache which stores, for a user-definable period, a reverse lookup table of users and the logical groups to which the users belong based on previously received complex queries.
In accordance with an embodiment, business processes can include tasks to be completed or managed by particular users, or by particular groups of users. According to the requirements of a given task, an appropriate user or group may need to be defined according to specific skills or status. These user details can be stored in an enterprise's identity store, such as a Lightweight Directory Access Protocol (LDAP) directory but can also be stored in other locations such as a business or user attribute directory, or a role directory. In order to assign a task to a user or group that can complete the task, participants in some automated business processes are defined by complex queries which define the skills and status users need to complete the task. At execution, the complex query is evaluated to return the users or groups assigned to the task.
A complex query can define a group based on a variety of relevant user details which can be stored in multiple, disparate directories and databases. Therefore, for a given complex query, information can be requested related to users and groups defined in user directories like LDAP, roles as defined in applications or a security layer, and business attributes of users and groups that are stored outside of LDAP. For example, participants can be all users in role “InsuranceAgents” who live in “California” (location found in the user directory) and whose expertise is “Home Insurance” (a user attribute stored outside the user directory). However, previously no unified query languages were operable to search across multiple sources.
Although some user attributes can be added or pushed to a user directory, this can result in duplicate information (stored in a user attribute database and the user directory) and in most cases it is impractical to change the user directory structure.
In accordance with an embodiment, each query can include multiple statements joined by logical operands. For example, each statement can be specific to a particular data source (e.g., user directory, RDBMS, etc). During execution of the query, each statement is executed on its respective data source, and the results are aggregated based on the logical operand to yield the eventual result of the query itself. The physical location of the database or the user directory to execute the query is not in the query itself, but it is in the application.
Task assignees can be made using logical people groups (LPGs). In accordance with an embodiment, an LPG is a named list that represents users or groups defined in an identity service, such as an LDAP directory, that is available at runtime. Rather than naming the particular users or groups to manage processes and/or tasks, these users or groups can be referred to indirectly. Each LPG can be defined in terms of a query. The query can define the LPG statically or include parameters that are evaluated at runtime. Such parameters can include “customer service representative from region one” or “department name”.
In accordance with an embodiment, queries can be constructed differently for different LPGs. For example, an LPG that includes users can be defined using a people query while an LPG that includes groups of users can be defined using a group query. People queries and group queries can be constructed using different query-specific functions, as further described below.
A unified query language can be used to search across multiple sources including a user directory, roles in applications and business attributes. This enables LPGs to be carefully defined using user attributes that are stored in different directories or databases. Business process architects and designers can define participants using this query language as custom, fine-grain groups. This can enable customers to define workflow task participants with particularity, according to the specific needs of a given task.
In accordance with an embodiment, queries can include searches, e.g. for: users by attribute or filter; members of a group or role; reportees; managers of users; management chains; managers of groups; owners of groups; and all users, based on properties defined in the query. Other types of queries can include additional searches based on other user or group features.
The results of a particular query can be a set of users or groups of users. This set of users of groups of users make up the LPG defined by the particular query.
In accordance with an embodiment, a query can be received which searches users on the basis of an attribute. In the query, the attribute may be specified by name. At runtime, the attribute's name can be dynamically replaced by the attribute value associated with that name using a context map. This query can be applied to an identity store, such as an LDAP directory, and return a set of users. This set of users can be further searched based on other user attributes that may not be included in an LDAP directory but can be stored in another data store. This can be done using user predicates which further filter the set of users based on additional attributes. The user predicates can also include arguments that are specified by name in the query and dynamically replaced by a value at runtime using a context map.
As further shown in
In accordance with an embodiment, each people query and group query can be constructed using several functions. People queries can include functions specific to users such as a function to determine a user's manager or the users who are members of a specified group or role. Similarly, group queries can include functions specific to groups such as identifying grantees and granted roles to a particular group.
As described above, LPGs can also be mapped to one or more users. In accordance with an embodiment, these mappings can also be a statically defined group of users or defined by a people query that is evaluated at runtime. People queries include two parameters user attributes and user properties. User attributes are part of the user's schema or repository (such as LDAP or RDBMS). These attributes are expressed as name-value pairs and can be used in a logical expression in query predicates. User properties are defined in a business process schema but are not defined in the user's schema or repository. The user properties provide an extension to the user attributes without requiring any modifications to an enterprise's existing user schema or repository. When a people query or a group query is defined, the user can name the query and choose whether to make the query visible.
In accordance with an embodiment, in addition to assigning tasks to logical people groups, a client can request to which logical people groups a user belongs. This can be determined using a reverse lookup directory. However, populating a reverse lookup directory can require executing all current queries, which is time and processor intensive. Accordingly, in accordance with an embodiment, a query cache can be used to store the results of statically defined logical people groups. The query cache can be a persistent cache which can be configured to persist for a user-definable time period. Because both statically defined and parameterized queries can be modified at any time, the cache can also be configured to regularly update its contents by executing current queries at user-definable intervals.
In accordance with an embodiment, a query cache can be maintained which stores previous people queries in a reverse lookup directory. If a query is conducted to determine to which LPGs a user belongs, a complete answer can require executing all currently defined queries. This can cause performance issues, as running a large number of queries across several data repositories can require significant processing resources and time. However, a query cache can be used to store the results of previously conducted queries. In accordance with an embodiment, the cache can store the results as a reverse lookup directory, thus a search of the cache by user can result in a list of LPGS to which that user belongs.
In accordance with an embodiment, the query cache can be configured to populate itself by running currently defined queries in the background at scheduled intervals. Each query can be associated with an expiration time. When the query expires, the system can execute the query and update the query cache accordingly, for example by adding new users and removing old users from being associated with that query.
In accordance with an embodiment, an administrator can schedule query execution and set expiration times for the queries. As a query expires, the cache executes the query. However, each query does not have to be executed immediately after expiration. The previously stored results of the query can be kept accessible for a set time period, or the results can be kept accessible indefinitely with the expiration time, or time of last execution, noted.
The present invention can be conveniently implemented using one or more conventional general purpose or specialized digital computer, computing device, machine, or microprocessor, including one or more processors, memory and/or computer readable storage media programmed according to the teachings of the present disclosure. Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those skilled in the software art.
In some embodiments, the present invention includes a computer program product which is a computer 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 present invention. The computer readable storage medium can include, but is not limited to, any type of disk including floppy disks, optical discs, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
The foregoing description of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations will be apparent to the practitioner skilled in the art. In particular, although several of the embodiments described above illustrate the use of the Oracle Human Workflow system, and the use of BPEL, it will be evident that other human workflow or workflow systems, and other flow languages can be used. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention for various embodiments and with various modifications that are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalence.
Number | Name | Date | Kind |
---|---|---|---|
5721913 | Ackroff et al. | Feb 1998 | A |
5799297 | Goodridge et al. | Aug 1998 | A |
5978836 | Ouchi | Nov 1999 | A |
6003011 | Sarin et al. | Dec 1999 | A |
6026365 | Hayashi | Feb 2000 | A |
6161113 | Mora et al. | Dec 2000 | A |
6170002 | Ouchi | Jan 2001 | B1 |
6308224 | Leymann et al. | Oct 2001 | B1 |
6397182 | Cruickshank et al. | May 2002 | B1 |
6397191 | Notani et al. | May 2002 | B1 |
6470227 | Rangachari et al. | Oct 2002 | B1 |
6507845 | Cohen et al. | Jan 2003 | B1 |
6519642 | Olsen et al. | Feb 2003 | B1 |
6567783 | Notani et al. | May 2003 | B1 |
6574675 | Swenson | Jun 2003 | B1 |
6574736 | Andrews | Jun 2003 | B1 |
6584487 | Saboff | Jun 2003 | B1 |
6606740 | Lynn et al. | Aug 2003 | B1 |
6742015 | Bowman-Amuah | May 2004 | B1 |
6889231 | Souder et al. | May 2005 | B1 |
6895573 | Norgaard et al. | May 2005 | B2 |
6970844 | Bierenbaum | Nov 2005 | B1 |
7020697 | Goodman et al. | Mar 2006 | B1 |
7062749 | Cyr et al. | Jun 2006 | B2 |
7236939 | Chen et al. | Jun 2007 | B2 |
7272816 | Schulz et al. | Sep 2007 | B2 |
7289966 | Ouchi | Oct 2007 | B2 |
7370335 | White et al. | May 2008 | B1 |
7403989 | Beringer et al. | Jul 2008 | B2 |
7406432 | Motoyama | Jul 2008 | B1 |
7418475 | Stewart et al. | Aug 2008 | B2 |
7428495 | Dhar et al. | Sep 2008 | B2 |
7448046 | Navani et al. | Nov 2008 | B2 |
7464366 | Shukla et al. | Dec 2008 | B2 |
7493593 | Koehler | Feb 2009 | B2 |
7498866 | Choi | Mar 2009 | B2 |
7519711 | Mohindra et al. | Apr 2009 | B2 |
7543292 | Haller et al. | Jun 2009 | B2 |
7603674 | Cyr et al. | Oct 2009 | B2 |
7631291 | Shukla et al. | Dec 2009 | B2 |
7676483 | Klug | Mar 2010 | B2 |
7680683 | Hilerio et al. | Mar 2010 | B2 |
7685604 | Baartman et al. | Mar 2010 | B2 |
7702736 | Ouchi | Apr 2010 | B2 |
7814142 | Mamou et al. | Oct 2010 | B2 |
7925527 | Flam | Apr 2011 | B1 |
8146083 | Aggarwal et al. | Mar 2012 | B2 |
8170897 | Cohen et al. | May 2012 | B1 |
20020140731 | Subramaniam et al. | Oct 2002 | A1 |
20020178119 | Griffin et al. | Nov 2002 | A1 |
20020189070 | Noel et al. | Dec 2002 | A1 |
20030046576 | High et al. | Mar 2003 | A1 |
20030105974 | Griffin et al. | Jun 2003 | A1 |
20030135384 | Nguyen | Jul 2003 | A1 |
20030158832 | Sijacic et al. | Aug 2003 | A1 |
20040230466 | Davis et al. | Nov 2004 | A1 |
20050027585 | Wodtke et al. | Feb 2005 | A1 |
20050049924 | DeBettencourt et al. | Mar 2005 | A1 |
20050071347 | Chau et al. | Mar 2005 | A1 |
20050097166 | Patrick et al. | May 2005 | A1 |
20060069995 | Thompson et al. | Mar 2006 | A1 |
20060074703 | Bhandarkar et al. | Apr 2006 | A1 |
20060074734 | Shukla et al. | Apr 2006 | A1 |
20060074915 | Bhandarkar et al. | Apr 2006 | A1 |
20060150156 | Cyr et al. | Jul 2006 | A1 |
20060173869 | Byrne et al. | Aug 2006 | A1 |
20060218394 | Yang | Sep 2006 | A1 |
20060229925 | Chalasani et al. | Oct 2006 | A1 |
20070016465 | Schaad | Jan 2007 | A1 |
20070061382 | Davis et al. | Mar 2007 | A1 |
20070156486 | Sanabria et al. | Jul 2007 | A1 |
20070203589 | Flinn et al. | Aug 2007 | A1 |
20070203881 | Schaad et al. | Aug 2007 | A1 |
20070239499 | Shukla et al. | Oct 2007 | A1 |
20070240112 | Haselden et al. | Oct 2007 | A1 |
20070276715 | Beringer et al. | Nov 2007 | A1 |
20080065656 | Theeten et al. | Mar 2008 | A1 |
20080114627 | Baeuerle et al. | May 2008 | A1 |
20080301684 | Barros et al. | Dec 2008 | A1 |
20080306806 | Van Wyk et al. | Dec 2008 | A1 |
20090125366 | Chakraborty et al. | May 2009 | A1 |
20090164985 | Balko et al. | Jun 2009 | A1 |
20090199293 | Song et al. | Aug 2009 | A1 |
20090260021 | Haenel et al. | Oct 2009 | A1 |
20090281855 | Shuler et al. | Nov 2009 | A1 |
20090307162 | Bui et al. | Dec 2009 | A1 |
20100049574 | Paul et al. | Feb 2010 | A1 |
20100100427 | McKeown et al. | Apr 2010 | A1 |
20100106546 | Sproule | Apr 2010 | A1 |
20100205013 | Guyan et al. | Aug 2010 | A1 |
20100235213 | Channabasavalah et al. | Sep 2010 | A1 |
20100251242 | Sivasubramanian et al. | Sep 2010 | A1 |
20110078499 | Fong et al. | Mar 2011 | A1 |
Entry |
---|
Kuleshov, I., Human Tasks Allocation Manager, 2009, Exadel Inc., http://exadelfs.com/knowledgebase/whitepapers/ExadelFS-Human-Tasks-Allocation-Manager-3-0.pdf, 5 pages. |
Bradshaw, D. et al., Oracle BPEL Process Manager Developer's Guide lOg (10.1.3.1.0), Jan. 2007, 295 pages. |
Beecher, V. et al., Oracle Fusion Middleware Developer's Guide for Oracle SOA Suite, 11g, Dec. 2009, 374 pages. |
Oracle Database Administrator's Guide 11g, Oracle, 2009, 40 pages. |
Oracle BPEL Process Manager—Data Sheet, Oracle, 2009, 4 pages. |
Rittman, M., Oracle Purchases Collaxa, Launches Oracle BPEL Process Manager, RittmanMead.com, Jun. 30, 2004, 7 pages. |
Clugage, K. et al., The Oracle BPEL Process Manager: BPEL + Human Workflow, Oracle, Mar. 14, 2006. |
BPEL4People—Wikipedia definition, Wikipedia.org, Apr. 10, 2012, 3 pages. |
Kloppman, M. et al., WS-BPEL Extension for People—BPEL4People, IBM, SAP, White paper, Jul. 2005, 18 pages. |
Collaxa WSOS 2.0: An Introduction, Colaxa, Sep. 6, 2002, 23 pages. |
Kennedy, M., Oracle BPEL Process Manager Quick Start Guide, 10g, Oracle, Sep. 2006, 60 pages. |
Liu, S., Business Process Automation and Web Service Choreography, Technische Universitat Hamburn-Harburg, Jun. 29, 2004, 43 pages. |
Collaxa—Orchestration Server Developer's Guide Version 2.0 Beta 2, Collaxa, 2002, 242 pages. |
Kloppman, M. et al., WS-BPEL Extension for Sub-Processes—BPEL SPE, IBM, SAP, Sep. 2005, 17 pages. |
Agrawal, A. et al., Web Service Human Task (WS-Human Task), Version 1.0, Active Endpoints, Inc., 2007, 133 pages. |
Agrawal, A. et al., WS-BPEL Extension for People (BPEL4People), Version 1.0, Active Endpoints, Inc., 2007, 52 pages. |
Workflow Management Coalition—Workflow Standard—Interoperabilitity Abstract Specification Copyright 1999 The Workflow Management Coalition, Version 2.0b, Nov. 30, 1999. |
Number | Date | Country | |
---|---|---|---|
20110282895 A1 | Nov 2011 | US |