1. Technical Field
The invention relates to policy distribution in connection with records retention and records management. More particularly, the invention relates to records retention policy management, records management, and enterprise integration. Still more particularly, the invention concerns building a workflow layer that allows multiple forms of policy propagation between Enterprise Retention Management Systems (ERMs) and Records Management Systems (RMSs).
2. Description of the Prior Art
Corporations use Records Management Systems (RMSs) to fulfill their obligations in preservation of important company records for regulatory compliance and electronic discovery for litigation. Historically, RMSs evolved as departmental solutions, where record classification and disposition policies were set up and maintained locally, i.e. on an RMS instance level. Development of retention policies was perceived as a simple task; and RMSs were not designed to support complex workflows in this area.
However, it turned out that departmental solutions do not satisfy corporate needs for at least the following reasons:
To address these issues, corporations started implementing Enterprise Retention Management (ERM) applications, such as Atlas ERM from PSS-Systems (Mountain View, Calif.). These applications provide a centralized workflow for managing retention schedules for the entire corporation.
However, integration between ERMs and RMSs to achieve automated policy retention policy propagation from ERMs to RMSs proved to be challenging for multiple reasons, some of which are:
An embodiment of the invention provides an application layer in ERM for the propagation workflow of a managing schedule. In an embodiment, a computer apparatus and computer implemented method for policy distribution provides a Records Management System (RMS) that is configured for setting up and maintaining local record classification and disposition policies. An Enterprise Retention Management (ERM) application comprises a centralized workflow configured for managing retention policies for an entity. An application layer in the ERM comprises a propagation workflow that is configured for managing retention policy integration between the ERM and the RMS. The propagation workflow thus provides automated retention policy propagation from the ERM to the RMS.
Currently, there is no established practice of integration between ERMs and RMSs. Policy management is performed in a semi-structured fashion, such as via Excel spreadsheets. Once the policies are ready, they are uploaded either manually through the UI or through some kind of import/export utility into Records Management Systems. RMSs are historically developed as departmental solutions and they lack advanced capabilities for policy management as well as ability to consume policy information from a centralized ERM.
A few RMS vendors separated their policy management layer from records management layer, but this can hardly be called an enterprise solution because such a solutions are not designed for interoperability between multiple RMS vendors, which is a necessary requirement for large enterprises where most likely multiple types of RMSs are installed.
A presently preferred embodiment of the invention provides an application layer in ERM for the propagation workflow of a managing schedule.
Record Management Terms
In general, the entities listed below constitute the hierarchy of records and related metadata. See
Record. For the purpose of this discussion, Records are immutable documents with associated metadata, which need to be preserved for a certain period of time to meet companies' external or internal regulatory obligations.
Records Management System (RMS). An RMS is a system which is designed to store Records. Usually, this is a layer on top of an Enterprise Content Management system.
Record Category hierarchy. This is a hierarchy of record categories set up within an RMS. When a Record is created, it needs to be associated with a node in this hierarchy. A records category tree is usually (but not always) structured by a business function/sub-function, e.g. “Corporate→Finance→Accounts Payable→Vendor contracts.”
Disposition schedule (DS). A DS is a set of rules in an RMS which describes when to dispose of the Records. A disposition schedule consists of the following parts: triggering events, i.e. events that trigger the start of retention period counting, e.g. employee termination event starts a four-year retention period for employee-related records; disposition type, e.g. destroy the record automatically once the retention period is over vs. start a manual disposition review process vs. move a document to another archive etc.; and retention period. DSs are associated with Records categories directly or indirectly, e.g. by inheriting the schedules from parent record categories, or can be associated with a record or a collection of records.
Classification (Act of classifying) of a record. When a document is declared as a record, it needs to be “Classified,” i.e. associated with a node of a Record Category hierarchy. Once this is done the RMS knows which disposition schedules should be applied to a given record.
Triggering event types. Retention periods are associated with triggering event types. For example, there may be a retention rule “Destroy the record in four years after employee termination,” where “employee termination” is an event type. Or, there may be a rule “Destroy a record in five years after record declaration,” where record declaration is an event type.
Triggering Event Evaluation Rules (TEERs). Events, such as instances of Event Types, may be communicated to RMS in various ways. For example RMS may consider “Employee termination” event happened if “termination_date” metadata field associated with a given record changed from NULL value to some date value. Or RMS may expect an event to be communicated directly to it by an external application through some kind of API. These algorithms are called TEERs.
File Plan. Within the RMS, the File Plan is a combination of a retention category tree, disposition schedules, and events, which defines how records are stored and disposed of in a given RMS. Also, a File Plan can be understood as some kind of external document which guides how to set up RMS File Plans.
Enterprise Retention Management Terms
In general, the entities described below constitute the classification and metadata of retention (disposition) policies, not records. See
Enterprise Retention Management System (ERM) is a system designed to manage retention (disposition) policies. Such systems usually provide a sophisticated policy management workflow necessary for managing policies at a large enterprise. ERM serves as a source of master data for retention policies. However, the ERM does not store those actual documents to which these policies are applied. This is the business of RMS. A typical ERM is Atlas ERM from PSS-Systems (Mountain View, Calif.).
Although business domains of RMSs and ERMs overlap significantly, the terms they use are somewhat different. This is partially caused by different data models of ERMs and RMSs and partially by the need to solve different business problems.
Record class. This is a hierarchy similar to “Record Categories” in an RMS, structured by business function. However there are a few differences:
Note that this tree defines classification of retention schedules as opposed to records (in case of RMS).
Organizational hierarchy. This is the hierarchy of corporate organizational units, e.g. “Corporate→Americas→USA→California→Branch 234” or “Bank Corporation 1→Bank XYZ→California→Investment Banking.” Organizational hierarchy usually takes into account geography, corporate entity, and business function.
Organization-Specific Retention Schedule (ORS). These are rules on how to dispose certain types of documents, which are specific to a jurisdiction or internal regulations and are typically associated with an organizational unit. For example, there may be a Corporate-wide ORS for vendor contracts which is applied to all business units dealing with vendor contracts within Finance→Accounts Payable. And, there may be a California-specific ORS which requires vendor contracts to be stored for a longer period of time. The latter ORS applies to all the business units including and below California.
Usually, ORSs are defined on different levels of organization, so that an ORS on a lower level serves as exception to ORSs defined on a higher level. If there is no exception, the higher level ORS is inherited on a lower level of organization. There may be mechanisms of associating an ORS with a particular organization other than inheritance.
Retention schedule code (RSC). This is an aggregation of ORSs which guides the retention for the same type of documents in different organizations within a company. For example, all ORSs that describe vendor contracts in Corporate→Finance→Accounts Payable are united under a single RSC “FAPV-121.”
In addition to being an aggregator, an RSC may serve as a template for ORSs, e.g. defining default values. In this case, it makes sense to refer to them as Retention Schedule Templates, but from an RMS integration viewpoint template functionality is not relevant. In fact, an ERM may let the users define the hierarchy of Retention Schedule Templates that serve as templates for various organizations.
Note that in certain ERMs, an RSC and a corporate level ORS may be the same entity. See
Disposition rule. A Disposition Rule is an object describing how and when the document can be disposed of. This is a combination of rule type (“event+time based” vs. “event based” etc.), event type (e.g. employee termination), retention period (e.g. five years) and possibly disposition type (dispose automatically vs. review and dispose etc.) which define the rules of retention for a given ORS. Event type and retention period may be not required for certain rule types. For example, rule type “forever” requires neither event type nor retention period.
Disposition rules are associated with (or are a part of) ORSs. In one embodiment, the same rules may be associated with more than one ORS. Because ERM may describe retention/disposition not only for the records but for non-record documents (such as drafts, copies, etc.), a single ORS can define more than one disposition rule. See
Note that if an ERM defines only the disposition rules applicable for records (as opposed to copies and drafts), a disposition rule object and ORS may be merged into a single entity.
Business Alias. A Business Alias is a business classification of documents that allows LOB users to perform a record declaration of search without knowing the record class or RSC or ORC IDs/names. A Business Alias can operate with names recognized from their day-to-day business practice. Business Aliases are typically associated with local schedules and (depending on the design of ERM) with data source records in ERM. Data source records point to instances of an RMS.
Data Source. A Data Source is a record in the ERM database describing an instance of an application which stores data. For example an instance of RMS can be described in ERM as a data source. Other examples of data sources are: A file share in a Marketing department, an SAP instance, a SharePoint site in an R&D department in London.
Because the application describes integration between ERMs and RMSs, it would be useful for the reader to understand how record classification data stored in ERMs are translated into File Plan information used by RMSs. See U.S. patent application Ser. No. 12/645,351, filed Dec. 22, 2009, the entirety of which is incorporated herein by this reference thereto.
Roles Involved in Workflow
The following types of users are involved in workflow.
Records Management Administrator (RMA). RMA's role is to:
The first two tasks are beyond the scope of this application. The third task is discussed in detail herein.
Records Management IT person. This person's role is to make sure the information about new, updated, and deleted policies is propagated to RMSs.
Records Management and IT executives. Their role is monitor the status of policy propagation activities and resolve conflicts, if necessary.
The workflow method described below involves all of these roles.
Policy Distribution Workflow
Multiple Ways of Propagating a Policy
Different designs of RMS enable different levels of schedule propagation automation. In certain scenarios there is not enough data to achieve full schedule propagation automation. Deep integration between RMS and ERM is not always financially justified because the amount of change in records classification may be relatively small.
Therefore, an integrated solution should be able to support multiples levels of integration.
These multiple levels of integration are:
Policy distribution workflows consist of the following distinct phases:
Not all the data sources described in ERM need policy propagation to be managed. In fact, the majority of data sources do not. For example, a file system data source cannot manage its own retention policies. Therefore, a policy propagation management user interface should not be displayed for such a data source.
To declare a data source as manageable, a user who has update privileges against the data source in ERM must set a parameter (flag) on a data source record, which tells ERM that it must manage policy distribution workflow for this data source. After that, the UI needed for managing the policy distribution workflow is displayed to end-users.
An ERM records a PCE each time:
The PCE is represented as one or multiple related records in the ERM database associated with a local retention schedule and with a data source of records and with the object which changed. A goal of the workflow system is to process PCEs. If the PCE is successfully processed, a policy change is considered propagated to the data source.
As described earlier, the user can choose multiple ways to process PCEs. In an embodiment, these are:
PCEs are strongly typed, meaning that the ERM can understand the fact that one PCE is an “add” event and another PCE is an “update” event, and can provide a user interface which is proper for each kind of PCE.
Furthermore, update events may have subtypes, such as:
This allows the ERM to:
IT Performer-Side Event Queue
An IT person who is responsible for propagating policies to data sources sees the list of PCEs as a per-data source PCE queue. The queue management UI may be displayed on a Data Source related screen on the ERM.
The queue UI shows the list of PCEs which are supposed to be processed by the IT person.
The IT person performs the following operations to process PCEs:
Once the PCE is chosen, the UI allows the user to:
It may happen that a subsequent PCE fully overwrites the previous PCE. For example, the first PCE requires changing the retention period from five years to four years and a subsequent PCE requires changing the retention period from four years to three years.
In such situation there is no longer any need to propagate the previous PCE because it is always overwritten shortly thereafter with the subsequent PCE. Therefore, the workflow application detects such PCEs and cancels previous PCEs if they have not been propagated yet or if they have not been yet accepted by integration framework for execution.
In an embodiment, the logic which decides whether a subsequent PCE fully overwrites a previous PCE is as follows:
From user interface viewpoint, superseded changes may either disappear from the user queue, become disabled, or become marked as superseded (but the user can still choose to propagate them one by one).
Handling Other Dependencies Between PCEs
For data consistency reasons it is useful to make sure that subsequent PCEs are not processed until previous PCEs are processed. To achieve that:
It is useful for productivity reasons to propagate multiple PCEs at a time through a file import mechanism. To achieve that, ERM allows a user to generate an import file containing changes pertaining to multiple PCEs in the queue.
UI-wise, the ability to handle multiple updates can be implemented as a set of checkboxes next to PCEs in the queue. When the user checks multiple checkboxes, only the selected updates get included into a generated Import file. See
Initial File Plan load
To set up an instance of RMS, the user must upload a File Plan. ERM does not contain enough information to provision the file plan fully. For example, RMS knows only about the metadata related to disposition, but it does not know about the other metadata which needs to be defined for records. Therefore, it is impossible to automate fully initial provisioning or RMS through ERM integration.
To overcome this difficulty and still provide a certain level of automation, ERM provides a capability to export the entire file plan as an “import file.” This assumes that the missing data is imported to RMS either manually, through another import process, or by updating the import file provided by ERM with additional data. The file plan reflects the latest state of record classification hierarchy pertaining to a given data source. UI-wise this is achieved through a button on a data source detail page allowing user to download an import file (see
Import File Format Definition
ERM can generate multiple formats of the import file. For example, it can generate IBM Filenet P8 Import/Export tool format or similar format for EMC Documentum RMS. The format of the file to be generated can be specified during data source setup in ERM
TEER Definition
To define the disposition event fully, ERM must be aware of the mechanism which triggers the disposition event, i.e. TEER. For example, if the record is related to employment and the retention schedule is “delete the document in 4 years after employment termination,” the TEER may be:
Where “terminated_on” is a metadata field of type “date-time” associated with an employee record. The value of the field is considered a termination date.
When such a rule evaluates to “true”, RMS understands that the termination took place and starts counting four years.
Or TEER may be:
Where TERMINATED_FLAG is a Boolean metadata element. The date/time at which the change is detected is considered the time of termination.
There are many ways to define TEERs. These may be external events which do not require metadata to be altered, or they can be events which require the entire expression to be evaluated, e.g.:
Different ERM designs allow for different levels of sophistication of TEERs. The minimum level of sophistication requires knowledge of a single metadata field name and always assumes that the event occurred if this field has been modified to a non-NULL value.
In any case, ERM must provide a user interface where the user can define a TEER. This interface is expected to belong to data source editing module and to allow setting up TEERs for existing combinations of data source and retention schedules.
RMA and Management Reporting
RMAs and RMO Management must be able to view the status of PCE propagation. To achieve that, an ERM on policy search screen provides an option to filter in only the schedules which are not propagated to one or another data source. To make sure that only the problematic schedules are displayed, because if the schedule has not been propagated within a day, this is not a problem, the search criteria may define for how long the schedule has not been propagated.
For example, the criteria may be:
Then the user drills down on such a schedule and may see either all of the data sources to which the schedule has not been propagated, or only the data sources to which the schedule has not been propagate for longer than pre-defined number of days.
Users can communicate with IT employees responsible for schedule propagation by exchanging notes associated with PCEs.
IT management may need to understand which data sources have problems with schedule propagation. To achieve that, on data source search field user can restrict the search results to:
Drilling down on such a data source allows the user to see the list of schedules that have not been propagated (either all or within certain period of time) and communicate with RMAs and IT employees who are responsible for schedule propagation by exchanging notes associated with PCEs.
IT Performer Notifications
IT performers must be notified if there is a schedule propagation task on their plate. However, each data source may require a significant number of PCEs to be processed. Creating one notification message per event quickly floods the dashboard.
To resolve this issue, the following logic may be used:
If the employee dashboard has at least one notification about the PCE that needs to be propagated into a particular data source, do not create another notification. Instead, update the existing notification so it:
Once there are no more PCEs to process for a given data source, clean up the notifications from the employee dashboard related to this data source.
If there are no notifications for a given data source and a new PCE arrived, create such notification.
RMA and Management Notifications
RMAs and Managers may be notified if a certain local schedule has not been propagated for longer than a certain period. The length of the period may be an ERM level setting, or Role level setting, e.g. 30 days for managers and 10 for RMA; or a profile level setting, e.g. show me all the schedules that have not been propagated for more than ten days; or a schedule level setting, e.g. Notify me if schedule FIN-101 US has not been propagated for more than ten days; or any combination of those.
To avoid flooding the inbox or dashboard the following notification strategies may be implemented:
If a PCE has been propagated automatically, ERM changes the event status by itself, as opposed to the user changing the event status in other modes of propagation. Depending on ERM setup, the PCEs which have all the necessary data defined, may be propagated by ERM without user approval. In other setups or ERM designs, automated propagation always requires user approval to trigger the process. If the operation cannot be automated, ERM UI does not display a certain UI control. For example, in case of a deletion of a record category from P8 Data Source, ERM does not display the “Propagate” button, thus requiring user to perform manual deletion. If, for some reason, automated propagation cannot be performed, although ERM considers it possible, the user has an option to choose a different mode of propagation and to change the PCE status manually. In general, the user can always choose a less automated mode of propagation. For example, if the PCE can be propagated by import of a file, the user can always choose to propagate the PCE manually through RMS user interface.
Benefits and Improvements
Embodiments of the disclosed invention provide one or more of the following benefits compared to the status quo:
The computer system 1600 includes a processor 1602, a main memory 1604 and a static memory 1606, which communicate with each other via a bus 1608. The computer system 1600 may further include a display unit 1610, for example, a liquid crystal display (LCD) or a cathode ray tube (CRT). The computer system 1600 also includes an alphanumeric input device 1612, for example, a keyboard; a cursor control device 1614, for example, a mouse; a disk drive unit 1616, a signal generation device 1618, for example, a speaker, and a network interface device 1620.
The disk drive unit 1616 includes a machine-readable medium 1624 on which is stored a set of executable instructions, i.e. software, 1626 embodying any one, or all, of the methodologies described herein below. The software 1626 is also shown to reside, completely or at least partially, within the main memory 1604 and/or within the processor 1602. The software 1626 may further be transmitted or received over a network 1628, 1630 by means of a network interface device 1620.
In contrast to the system 1600 discussed above, a different embodiment uses logic circuitry instead of computer-executed instructions to implement processing entities. Depending upon the particular requirements of the application in the areas of speed, expense, tooling costs, and the like, this logic may be implemented by constructing an application-specific integrated circuit (ASIC) having thousands of tiny integrated transistors. Such an ASIC may be implemented with CMOS (complimentary metal oxide semiconductor), TTL (transistor-transistor logic), VLSI (very large systems integration), or another suitable construction. Other alternatives include a digital signal processing chip (DSP), discrete circuitry (such as resistors, capacitors, diodes, inductors, and transistors), field programmable gate array (FPGA), programmable logic array (PLA), programmable logic device (PLD), and the like.
It is to be understood that embodiments may be used as or to support software programs or software modules executed upon some form of processing core (such as the CPU of a computer) or otherwise implemented or realized upon or within a machine or computer readable medium. A machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine, e.g. a computer. For example, a machine readable medium includes read-only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals, for example, carrier waves, infrared signals, digital signals, etc.; or any other type of media suitable for storing or transmitting information.
Although the invention is described herein with reference to the preferred embodiment, one skilled in the art will readily appreciate that other applications may be substituted for those set forth herein without departing from the spirit and scope of the present invention. Accordingly, the invention should only be limited by the Claims included below.
This application is a continuation-in-part of U.S. patent application Ser. No. 12/645,351, filed Dec. 22, 2009 now U.S. Pat. No. 8,250,041, the entirety of which is incorporated herein by this reference thereto.
Number | Name | Date | Kind |
---|---|---|---|
5313609 | Baylor et al. | May 1994 | A |
5355497 | Cohen-Levy | Oct 1994 | A |
5608865 | Midgely et al. | Mar 1997 | A |
5701472 | Koerber et al. | Dec 1997 | A |
5875431 | Heckman et al. | Feb 1999 | A |
5903879 | Mitchell | May 1999 | A |
5963964 | Nielsen | Oct 1999 | A |
6049812 | Bertram et al. | Apr 2000 | A |
6115642 | Brown et al. | Sep 2000 | A |
6128620 | Pissanos et al. | Oct 2000 | A |
6151031 | Atkins et al. | Nov 2000 | A |
6173270 | Cristofich et al. | Jan 2001 | B1 |
6330572 | Sitka | Dec 2001 | B1 |
6332125 | Callen et al. | Dec 2001 | B1 |
6343287 | Kumar et al. | Jan 2002 | B1 |
6401079 | Kahn et al. | Jun 2002 | B1 |
6425764 | Lamson | Jul 2002 | B1 |
6460060 | Maddalozzo, Jr. et al. | Oct 2002 | B1 |
6539379 | Vora et al. | Mar 2003 | B1 |
6553365 | Summerlin et al. | Apr 2003 | B1 |
6607389 | Genevie | Aug 2003 | B2 |
6622128 | Bedell et al. | Sep 2003 | B1 |
6738760 | Krachman | May 2004 | B1 |
6805351 | Nelson | Oct 2004 | B2 |
6832205 | Aragones et al. | Dec 2004 | B1 |
6839682 | Blume et al. | Jan 2005 | B1 |
6944597 | Callen et al. | Sep 2005 | B2 |
6966053 | Paris et al. | Nov 2005 | B2 |
6976083 | Baskey et al. | Dec 2005 | B1 |
6981210 | Peters et al. | Dec 2005 | B2 |
7016919 | Cotton et al. | Mar 2006 | B2 |
7076439 | Jaggi | Jul 2006 | B1 |
7082573 | Apparao et al. | Jul 2006 | B2 |
7103602 | Black et al. | Sep 2006 | B2 |
7104416 | Gasco et al. | Sep 2006 | B2 |
7107416 | Stuart et al. | Sep 2006 | B2 |
7120914 | Manthos et al. | Oct 2006 | B1 |
7127470 | Takeya | Oct 2006 | B2 |
7146388 | Stakutis et al. | Dec 2006 | B2 |
7162427 | Myrick et al. | Jan 2007 | B1 |
7197716 | Newell | Mar 2007 | B2 |
7206789 | Hurmiz et al. | Apr 2007 | B2 |
7225249 | Barry et al. | May 2007 | B1 |
7233959 | Kanellos et al. | Jun 2007 | B2 |
7236953 | Cooper et al. | Jun 2007 | B1 |
7240296 | Matthews et al. | Jul 2007 | B1 |
7249315 | Moetteli | Jul 2007 | B2 |
7281084 | Todd et al. | Oct 2007 | B1 |
7283985 | Schauerte et al. | Oct 2007 | B2 |
7284985 | Genevie | Oct 2007 | B2 |
7292965 | Mehta et al. | Nov 2007 | B1 |
7333989 | Sameshima et al. | Feb 2008 | B1 |
7386468 | Calderaro et al. | Jun 2008 | B2 |
7433832 | Bezos et al. | Oct 2008 | B1 |
7451155 | Slackman et al. | Nov 2008 | B2 |
7478096 | Margolus et al. | Jan 2009 | B2 |
7496534 | Olsen et al. | Feb 2009 | B2 |
7502891 | Shachor | Mar 2009 | B2 |
7512636 | Verma et al. | Mar 2009 | B2 |
7558853 | Alcorn et al. | Jul 2009 | B2 |
7580961 | Todd et al. | Aug 2009 | B2 |
7594082 | Kilday et al. | Sep 2009 | B1 |
7596541 | deVries et al. | Sep 2009 | B2 |
7614004 | Milic-Frayling et al. | Nov 2009 | B2 |
7617458 | Wassom, Jr. et al. | Nov 2009 | B1 |
7636886 | Wyle et al. | Dec 2009 | B2 |
7720825 | Pelletier et al. | May 2010 | B2 |
7730148 | Mace et al. | Jun 2010 | B1 |
7742940 | Shan et al. | Jun 2010 | B1 |
7774721 | Milic-Frayling et al. | Aug 2010 | B2 |
7778976 | D'Souza et al. | Aug 2010 | B2 |
7861166 | Hendricks | Dec 2010 | B1 |
7865817 | Ryan et al. | Jan 2011 | B2 |
7895229 | Paknad | Feb 2011 | B1 |
7912804 | Talwar et al. | Mar 2011 | B1 |
7962843 | Milic-Frayling et al. | Jun 2011 | B2 |
8073729 | Kisin et al. | Dec 2011 | B2 |
20010053967 | Gordon et al. | Dec 2001 | A1 |
20020007333 | Scolnik et al. | Jan 2002 | A1 |
20020010708 | McIntosh | Jan 2002 | A1 |
20020022982 | Cooperstone et al. | Feb 2002 | A1 |
20020035480 | Gordon et al. | Mar 2002 | A1 |
20020083090 | Jeffrey et al. | Jun 2002 | A1 |
20020091553 | Callen et al. | Jul 2002 | A1 |
20020091836 | Moetteli | Jul 2002 | A1 |
20020095416 | Schwols | Jul 2002 | A1 |
20020103680 | Newman | Aug 2002 | A1 |
20020108104 | Song et al. | Aug 2002 | A1 |
20020119433 | Callender | Aug 2002 | A1 |
20020120859 | Lipkin et al. | Aug 2002 | A1 |
20020123902 | Lenore et al. | Sep 2002 | A1 |
20020143595 | Frank et al. | Oct 2002 | A1 |
20020143735 | Ayi et al. | Oct 2002 | A1 |
20020147801 | Gullotta et al. | Oct 2002 | A1 |
20020162053 | Os | Oct 2002 | A1 |
20020178138 | Ender et al. | Nov 2002 | A1 |
20020184068 | Krishnan et al. | Dec 2002 | A1 |
20020184148 | Kahn et al. | Dec 2002 | A1 |
20030004985 | Kagimasa et al. | Jan 2003 | A1 |
20030014386 | Jurado | Jan 2003 | A1 |
20030018663 | Cornette et al. | Jan 2003 | A1 |
20030018693 | Rosenfeld et al. | Jan 2003 | A1 |
20030031991 | Genevie | Feb 2003 | A1 |
20030033295 | Adler et al. | Feb 2003 | A1 |
20030036994 | Witzig et al. | Feb 2003 | A1 |
20030046287 | Joe | Mar 2003 | A1 |
20030051144 | Williams | Mar 2003 | A1 |
20030069839 | Whittington et al. | Apr 2003 | A1 |
20030074354 | Lee et al. | Apr 2003 | A1 |
20030097342 | Whittington | May 2003 | A1 |
20030110228 | Xu et al. | Jun 2003 | A1 |
20030139827 | Phelps | Jul 2003 | A1 |
20030208689 | Garza | Nov 2003 | A1 |
20030229522 | Thompson et al. | Dec 2003 | A1 |
20040002044 | Genevie | Jan 2004 | A1 |
20040003351 | Sommerer et al. | Jan 2004 | A1 |
20040019496 | Angle et al. | Jan 2004 | A1 |
20040034659 | Steger | Feb 2004 | A1 |
20040039933 | Martin et al. | Feb 2004 | A1 |
20040060063 | Russ et al. | Mar 2004 | A1 |
20040068432 | Meyerkopf et al. | Apr 2004 | A1 |
20040078368 | Excoffier et al. | Apr 2004 | A1 |
20040088283 | Lissar et al. | May 2004 | A1 |
20040088332 | Lee et al. | May 2004 | A1 |
20040088729 | Petrovic et al. | May 2004 | A1 |
20040103284 | Barker | May 2004 | A1 |
20040133573 | Miloushev et al. | Jul 2004 | A1 |
20040138903 | Zuniga | Jul 2004 | A1 |
20040143444 | Opsitnick et al. | Jul 2004 | A1 |
20040187164 | Kandasamy et al. | Sep 2004 | A1 |
20040193703 | Loewy et al. | Sep 2004 | A1 |
20040204947 | Li et al. | Oct 2004 | A1 |
20040215619 | Rabold | Oct 2004 | A1 |
20040216039 | Lane et al. | Oct 2004 | A1 |
20040260569 | Bell et al. | Dec 2004 | A1 |
20050060175 | Farber et al. | Mar 2005 | A1 |
20050071251 | Linden et al. | Mar 2005 | A1 |
20050071284 | Courson et al. | Mar 2005 | A1 |
20050074734 | Randhawa | Apr 2005 | A1 |
20050114241 | Hirsch et al. | May 2005 | A1 |
20050144114 | Ruggieri et al. | Jun 2005 | A1 |
20050149307 | Gurpinar et al. | Jul 2005 | A1 |
20050160361 | Young | Jul 2005 | A1 |
20050165734 | Vicars et al. | Jul 2005 | A1 |
20050187813 | Genevie | Aug 2005 | A1 |
20050203821 | Petersen et al. | Sep 2005 | A1 |
20050203931 | Pingree et al. | Sep 2005 | A1 |
20050240578 | Biederman, Sr. et al. | Oct 2005 | A1 |
20050246451 | Silverman et al. | Nov 2005 | A1 |
20050283346 | Elkins, II et al. | Dec 2005 | A1 |
20060036464 | Cahoy et al. | Feb 2006 | A1 |
20060036649 | Simske et al. | Feb 2006 | A1 |
20060074793 | Hibbert et al. | Apr 2006 | A1 |
20060095421 | Nagai et al. | May 2006 | A1 |
20060126657 | Beisiegel et al. | Jun 2006 | A1 |
20060136435 | Nguyen et al. | Jun 2006 | A1 |
20060143248 | Nakano et al. | Jun 2006 | A1 |
20060143464 | Ananthanarayanan et al. | Jun 2006 | A1 |
20060149407 | Markham et al. | Jul 2006 | A1 |
20060149735 | DeBie et al. | Jul 2006 | A1 |
20060156381 | Motoyama | Jul 2006 | A1 |
20060156382 | Motoyama | Jul 2006 | A1 |
20060167704 | Nicholls et al. | Jul 2006 | A1 |
20060174320 | Maru et al. | Aug 2006 | A1 |
20060178917 | Merriam et al. | Aug 2006 | A1 |
20060184718 | Sinclair | Aug 2006 | A1 |
20060195430 | Arumainayagam et al. | Aug 2006 | A1 |
20060229999 | Dodell et al. | Oct 2006 | A1 |
20060230044 | Utiger | Oct 2006 | A1 |
20060235899 | Tucker | Oct 2006 | A1 |
20060242001 | Heathfield | Oct 2006 | A1 |
20070016546 | DeVorchik et al. | Jan 2007 | A1 |
20070048720 | Billauer | Mar 2007 | A1 |
20070061156 | Fry et al. | Mar 2007 | A1 |
20070061157 | Fry et al. | Mar 2007 | A1 |
20070078900 | Donahue | Apr 2007 | A1 |
20070099162 | Sekhar | May 2007 | A1 |
20070100857 | DeGrande et al. | May 2007 | A1 |
20070112783 | McCreight et al. | May 2007 | A1 |
20070118556 | Arnold et al. | May 2007 | A1 |
20070156418 | Richter et al. | Jul 2007 | A1 |
20070162417 | Cozianu et al. | Jul 2007 | A1 |
20070179829 | Laperi et al. | Aug 2007 | A1 |
20070179939 | O'Neil et al. | Aug 2007 | A1 |
20070203810 | Grichnik | Aug 2007 | A1 |
20070208690 | Schneider et al. | Sep 2007 | A1 |
20070219844 | Santorine et al. | Sep 2007 | A1 |
20070220435 | Sriprakash et al. | Sep 2007 | A1 |
20070245013 | Saraswathy et al. | Oct 2007 | A1 |
20070271230 | Hart et al. | Nov 2007 | A1 |
20070271308 | Bentley et al. | Nov 2007 | A1 |
20070271517 | Finkelman et al. | Nov 2007 | A1 |
20070282652 | Childress et al. | Dec 2007 | A1 |
20070288659 | Zakarian et al. | Dec 2007 | A1 |
20080033904 | Ghielmetti et al. | Feb 2008 | A1 |
20080034003 | Stakutis et al. | Feb 2008 | A1 |
20080059265 | Biazetti et al. | Mar 2008 | A1 |
20080059543 | Engel | Mar 2008 | A1 |
20080070206 | Perilli | Mar 2008 | A1 |
20080071561 | Holcombe | Mar 2008 | A1 |
20080086506 | DeBie et al. | Apr 2008 | A1 |
20080091283 | Balci et al. | Apr 2008 | A1 |
20080126156 | Jain et al. | May 2008 | A1 |
20080147642 | Leffingwell et al. | Jun 2008 | A1 |
20080148193 | Moetteli | Jun 2008 | A1 |
20080148346 | Gill et al. | Jun 2008 | A1 |
20080154969 | DeBie | Jun 2008 | A1 |
20080154970 | DeBie | Jun 2008 | A1 |
20080177790 | Honwad | Jul 2008 | A1 |
20080195597 | Rosenfeld et al. | Aug 2008 | A1 |
20080209338 | Li | Aug 2008 | A1 |
20080229037 | Bunte et al. | Sep 2008 | A1 |
20080262898 | Tonchev et al. | Oct 2008 | A1 |
20080294674 | Retzlaff et al. | Nov 2008 | A1 |
20080301207 | Demarest et al. | Dec 2008 | A1 |
20080312980 | Boulineau et al. | Dec 2008 | A1 |
20080319958 | Bhattacharya et al. | Dec 2008 | A1 |
20080319984 | Proscia et al. | Dec 2008 | A1 |
20090037376 | Archer et al. | Feb 2009 | A1 |
20090043625 | Yao | Feb 2009 | A1 |
20090064184 | Chacko et al. | Mar 2009 | A1 |
20090094228 | Bondurant et al. | Apr 2009 | A1 |
20090100021 | Morris et al. | Apr 2009 | A1 |
20090106815 | Brodie et al. | Apr 2009 | A1 |
20090119677 | Stefansson et al. | May 2009 | A1 |
20090150168 | Schmidt | Jun 2009 | A1 |
20090150866 | Schmidt | Jun 2009 | A1 |
20090150906 | Schmidt et al. | Jun 2009 | A1 |
20090157465 | Heathfield | Jun 2009 | A1 |
20090193210 | Hewett et al. | Jul 2009 | A1 |
20090241054 | Hendricks | Sep 2009 | A1 |
20090249179 | Shieh et al. | Oct 2009 | A1 |
20090249446 | Jenkins et al. | Oct 2009 | A1 |
20090254572 | Redlich et al. | Oct 2009 | A1 |
20090287658 | Bennett | Nov 2009 | A1 |
20100017756 | Wassom, Jr. et al. | Jan 2010 | A1 |
20100050064 | Liu et al. | Feb 2010 | A1 |
20100057418 | Li et al. | Mar 2010 | A1 |
20100070315 | Lu et al. | Mar 2010 | A1 |
20100088583 | Schachter | Apr 2010 | A1 |
20100250625 | Olenick et al. | Sep 2010 | A1 |
20100251109 | Jin et al. | Sep 2010 | A1 |
20110106773 | Smith et al. | May 2011 | A1 |
20110191344 | Jin et al. | Aug 2011 | A1 |
Number | Date | Country |
---|---|---|
2110781 | Oct 2009 | EP |
Entry |
---|
www.pss-systems.com; retrieved from www. Archive.org any linkage dated Dec. 8, 2005, 130 pages. |
PSS Systems, Inc., Atlas LCC for Litigation, pp. 1-2, www.pss-systems.com (Feb. 2008); PSS Systems, Inc., Map Your Data Sources, www.pss-systems.com (Feb. 200*); PSS Systems, Inc., “PSS Systems Provides Legal Hold and Retention Enforcement Automation Solutions for File Shares, Documentum, and other Data Sources” (Feb. 2008). |
PSS Systems, Inc., Preservation Benchmarks for 2007 and Beyond, www.pss-systems.com, pp. 1-3 (2007). |
PSS Systems, Inc., “Industry Leader PSS Systems Launches Third Generation of Atlas Legal Hold and Retention Management Software”, pp. 1-2, www.pss-systems.com (Aug. 2007). |
PSS Systems, Inc., Litigation Communications and Collections, www.pss-systems.com (2006), retrieved online on Dec. 8, 2010 from archive.org, 1 page. |
Zhu, et al.; “Query Expansion Using Web Access Log Files”; Lecture Notes in Computer Science, 2005, vol. 3588/2005, pp. 686-695, Springer-Verlag, Berlin, Hedelberg. |
Human Capital Mangement; “mySAP ERP Human Capital Management: Maximizing Workforce Potential”; retrieved from archive.org Aug. 18, 2009 www.sap.com, 1 page. |
Cohasset Associates, “White Paper: Compliance Requirements Assessment, IBM DB2 Records Manager and Record-Enabled Solutions”, Oct. 2004, 54 pgs. |
“HEI Records Management: Guidance on Developing a File Plan”, JISC infoNet, Jan. 2007, 7 pgs. |
Lewis “Digital Mountin—Where Data Resides—Data Discovery from the Inside Out”, available at http://digitalmountain.com/fullaccess/Article3.pdf accessed Mar. 13, 2012, Digital Mountain, Inc., 2004, 5 pgs. |
Sears “E-Discovery: A Tech Tsunami Rolls in”, available at http://www.krollontrack.com/publications/ediscoverybackgroundpaper.pdf, accessed Mar. 13, 2012, National Court Reporters Association, Apr. 2006, 7 pgs. |
“Microsoft Computer Dictionary”, Microsoft Press, Fifth Edition, 2002, p. 499. |
Number | Date | Country | |
---|---|---|---|
20110153579 A1 | Jun 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12645351 | Dec 2009 | US |
Child | 12892658 | US |