text:
A system and method of creating archive copies of data sets is described. In some examples, the system creates an archive copy from an original data set. In some examples, the system creates an archive copy when creating a recovery copy for a data set. In some examples, the system creates a copy without redundant data, and then encrypts the data set.
1. A system for rebuilding at least a portion of a signature database that reflects contents of an archive copy of a data set, comprising:
a signature component, wherein the signature component generates a substantially unique identifier for all data objects within the data set and stores the substantially unique identifiers in a signature database, wherein the substantially unique identifier for a data object reflects contents of the data object;
an encryption component, wherein the encryption component encrypts at least some of the data objects of the data set;
a copy component, wherein the copy component:
uses the generated substantially unique identifiers to identify redundant data objects in the data set and deduplicate the redundant data objects in order to create a deduplicated archive copy of the data set that comprises the encrypted data objects;
wherein the archive copy is physically stored on sequential media; and
stores the archive copy as one or more data chunks stored on the sequential media,
wherein each chunk is stored with header information that includes at least one substantially unique identifier; and
stores information related to locations of the encrypted data objects on the sequential media in a location database separate from the signature database; and
a database rebuilding component, wherein the database rebuilding component:
receives an indication that the signature database is unrecoverable or unavailable;
accesses header information of at least one chunk in order to determine at least one substantially unique identifier within the header information; and
uses the determined at least one substantially unique identifier from the header information in order to rebuild at least part of the signature database.
2. The system of
3. The system of
4. The system of
5. The system of
6. The system of
7. A non-transitory computer-readable medium whose contents cause a data storage system to perform a method of rebuilding a deduplication index that reflects contents of an archive of data objects, the method comprising:
identifying a data object to be stored in an archive of data objects that form a data set;
creating a hash value for the data object, wherein creating the hash value includes calculating a hash value that represents contents of the data object;
deduplicating the data set by:
comparing the hash value with other hash values for data objects already stored in the archive of data objects;
when the comparison determines that the hash value for the data object is different than the other hash values:
encrypting a copy of the data object, and transferring the encrypted copy of the data object and the hash value to the archive of data objects, and
storing in a file on sequential media, the transferred encrypted copy of the data object and the transferred hash value, wherein a header region of the file stores the hash value; or
when the comparison determines that the hash value for the data object is identical to one or more of the other hash values:
transferring the hash value that represents contents of the data object to the archive of data objects; and
storing in a file on sequential media, the transferred hash value, wherein a header region of the file stores the hash value;
updating an entry in a deduplication index to reflect the identification of the data object, wherein the entry is updated using the hash value;
upon receiving an indication that the deduplication index is unavailable or unrecoverable, accessing the hash value from the header region of a data file stored on sequential media; and
using the accessed hash value to rebuild a portion of a new, rebuilt version of the deduplication index.
8. The computer-readable medium of
9. The computer-readable medium of
10. The computer-readable medium of
11. A method for rebuilding at least a portion of a single instancing index containing hash values that represent contents of a single instanced data set, comprising:
single instancing a data set in order to create a single instanced data set organized as an archive file and physically stored on one or more magnetic tapes, wherein the single instancing further comprises:
calculating substantially unique hash values that represent the data set,
storing at least some of the calculated hash values that represent the data set in a single instancing index, and
storing the calculated hash values within headers of one or more data files that form part of the archive file,
wherein the one or more data files are separate from the single instancing index and also store at least a subset of the data set, and
wherein the one or more data files are stored on the one or more tapes;
receiving an indication that at least part of the single instancing index storing hash values that represent the data set is unrecoverable or unavailable;
in response to receiving the indication, identifying at least one data file that forms part of the archive file on the one or more tapes;
extracting stored hash value information from a header of the identified at least one data file that forms part of the archive file; and,
adding the extracted hash value information to a new, rebuilt version of the single instancing index.
12. The method of
encrypting the one or more data files that form part of the archive file;
decrypting the identified at least one data file to gain access to the stored hash value information from the header of the identified at least one data file; and
re-encrypting the decrypted at least one data file.
13. The method of
receiving a request to restore a data object; and
using the new, rebuilt version of the single instancing index to locate the data object within the archive file.
This application claims priority to the following patent applications, all of which are incorporated by reference in their entirety: U.S. Provisional Patent Application No. 60/882,884, filed on Dec. 29, 2006, entitled SYSTEMS AND METHOD FOR CREATING COPIES OF DATA, SUCH AS REFERENCE ARCHIVE COPIES, U.S. Provisional Patent Application No. 60/871,737, filed on Dec. 22, 2006, entitled SYSTEM AND METHOD FOR STORING REDUNDANT INFORMATION, U.S. Provisional Patent Application No. 60/882,883, filed on Dec. 29, 2006, entitled SYSTEM AND METHOD FOR ENCRYPTING DATA TO BE ARCHIVED, U.S. Provisional Patent Application No. 61/001,485, filed on Oct. 31, 2007, entitled SYSTEM AND METHOD FOR ENCRYPTING DATA TO BE ARCHIVED, and U.S. Provisional Application No. 60/868,518, filed on Dec. 4, 2006, entitled METHOD AND SYSTEM FOR RETENTION OF DOCUMENTS.
This application incorporates the following applications by reference: U.S. patent application Ser. No. 11/694,869, filed on Mar. 30, 2007, entitled METHOD AND SYSTEM FOR OFFLINE INDEXING OF CONTENT AND CLASSIFYING STORED DATA, and U.S. patent application Ser. No. 11/564,119, filed on Nov. 28, 2006, entitled SYSTEMS AND METHODS FOR CLASSIFYING AND TRANSFERRING INFORMATION IN A STORAGE NETWORK.
Corporations and other organizations routinely copy data produced and/or stored by their computer systems in order to retain an archive of the data. For example, a company might retain data from computing systems related to e-commerce, such as databases, file servers, web servers, and so on. The company may also retain data from computing systems used by employees, such as those used by an accounting department, marketing department, engineering, and so on.
Often, such retention and/or archiving amasses large amounts of data. There may be data copied or retained by way of periodic or one-time backups, continuous data protection (CDP) backups, snapshot backups, and so on. The data may include personal data, such as financial data, customer/client/patient contact data, audio/visual data, and other types of data. Organizations may also retain data related to the correct operation of their computer systems, such as operating system files, application files, user settings, and so on.
Once the stored data has aged a certain amount of time, the data storage systems may send the data to a data archive that stores the data for as long as is required. Typical data storage systems create a first storage copy for short term data recovery and after a certain time send the copies to an archive for long term storage. Thus, organizations are storing large amounts of data in their data archives at great expense.
Organizations increasingly rely on computer systems to produce and store critical information and the retention and recovery of data may cause problems in their operation and overall effectiveness. For example, a data storage system may receive an identification of a file location to store and create one or more storage files containing the contents of the stored file and/or location. The data storage system can then restore data from these storage files (such as backup files) should anything happen to the original data.
At times, organizations may want to quickly access data stored in their data archives. For example, an organization may receive a discovery request for a small amount of email data. Although the amount of requested data may be small, the data storage system may need to search many archive files (such as backup tapes) to find the requested data.
Companies are often required to retain documents in archive files in order to comply with various regulations. For example, when a company is in litigation, the company may be required to retain documents related to the litigation. Employees are often asked not to delete any correspondence, emails, or other documents related to the litigation. Recently enacted amendments to Federal Rules of Civil Procedure (FRCP) place additional document retention burdens on a company. According to Gartner, "Several legal commentators believe that the heart of the proposed changes to FRCP is the formal codification of "electronically stored information" (ESI) and the recognition that the traditional discovery framework dealing with paper-based documents is no longer adequate." Legal discovery of electronic information has emerged as a key requirement for today's enterprise in recent years, and the new federal rules both strengthen and expand those requirements.
Complying with all of the regulations related to document retention can be difficult, particularly when many employees may have relevant documents stored under their control that are relevant to the issue at hand. Penalties for violation of regulations related to document retention can be steep, and executives and business managers want confidence that employees are taking appropriate steps to comply with the regulations. Employees may forget about requests to retain documents, or may not think that a particular document is relevant when others would disagree.
Companies also need provisions for finding retained documents. Traditional search engines accept a search query from a user, and generate a list of search results. The user typically views one or two of the results and then discards the results. However, some queries are part of a longer-term, collaborative process. For example, when a company receives a legal discovery request, the company is often required to mine all of the company's data for documents responsive to the discovery request. This typically involves queries of different bodies of documents lasting days or even years. Many people are often part of the query, such as company employees, law firm associates, and law firm partners. The search results must often be viewed by more than one of these people in a well-defined set of steps (i.e., a workflow). For example, company employees may provide documents to a law firm, and associates at the law firm may perform an initial reading of the documents to determine if the documents contain relevant information. The associates may flag documents with descriptive classifications such as "relevant" or "privileged." Then, the flagged documents may go to a law firm partner that will review each of the results and ultimately respond to the discovery request with the set of documents that satisfies the request.
Collaborative document management systems exist for allowing multiple users to participate in the creation and revision of content, such as documents. Many collaborative document management systems provide an intuitive user interface that acts as a gathering place for collaborative participants. For example, Microsoft Sharepoint Server provides a web portal front end that allows collaborative participants to find shared content and to participate in the creation of new content and the revision of content created by others. In addition to directly modifying the content of a document, collaborative participants can add supplemental information, such as comments to the document. Many collaborative document management systems also provide workflows for defining sets of steps to be completed by one or more collaborative participants. For example, a collaborative document management system may provide a set of templates for performing common tasks, and a collaborative participant may be guided through a wizard-like interface that asks interview-style questions for completing a particular workflow.
The foregoing examples of some existing problems with data storage, archiving, and restoration are intended to be illustrative and not exclusive. Other limitations will become apparent to those of skill in the art upon a reading of the Detailed Description below.
A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosures, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
Examples of the technology provided below describe systems and methods of creating an archive copy or copies of a data set. Although described in connection with certain examples, the systems described herein are applicable to and may employ any wireless or hard-wired network or data storage system that stores and conveys data and information from one point to another, including communication networks, enterprise networks, storage networks, and so on.
Examples of the technology describe a method and system of creating an archive copy from one or more secondary copies that are created from an original data set, or primary or production copy, such as data from a file system. For example, instead of using certain types of secondary copies, such as recovery copies, snapshot volumes, and so on, to archive data (e.g., waiting until a recovery copy has aged a certain time period and then storing some or all of the recovery copy as an archive copy), the system creates an archive copy of the data during or soon after creating other secondary copies. That is, the system may create a certain type of secondary copy that may be used for long term archival purposes from any data under management by the system. For example, this copy may be single instanced and then encrypted, unlike other secondary copies under management by the system.
Alternatively, examples of the technology describe a method and system of creating the archive copy directly from the primary copy (i.e., the original data set), such as the primary copy of a file system, an exchange server, a SQL database, and so on. For example, the system may create an archive copy of data without first making creating other secondary copies.
Furthermore, examples of the technology describe a method and system of creating an archive copy from a previously archived data set, such as a data set archived using a different system. For example, the system may receive an archived data set, extract the data, and create an archive copy of the data using the methods described herein.
In some cases, the system may reduce, remove, or erase redundant data when creating the archive copy. For example, the system may remove data objects already under management by the system, such as files, emails, attachments, application data, and so on. Thus, the system may only transfer data objects not previously stored to the archive copy, reducing the time to create the archive copy by only transferring new or modified data objects and reducing the cost to create the archive copy by using fewer resources in creating the archive copy.
In some cases, the system may index the content of the data when creating the archive copy. Instead of indexing data at a data source (such as at the file system), the system may index the data as it transfers the data to the archive copy. Such indexing may allow users of the system to search for and retrieve data from an archive copy via search user interfaces. Thus, the system may create a data archive that is easily searchable by users, reducing the cost of resources and time for data retrieval requests, such as discovery requests.
In some cases, the system may encrypt or otherwise add security to the data or a portion of the data when creating the archive copy. For example, instead of encrypting a recovery copy (or other copies of an original data set that may not require secure storage), the system optionally encrypts the archive copy during or after creating that copy, in order to provide a secure but restorable data set for deployment to offsite locations.
In some cases, the system first single instances (that is, removes any redundant data) when creating the archive copy and then encrypts the archive copy. For example, the system may receive data to be archived, single instance the data by comparing the data to other data under management by the system, and then encrypt the data not found in the comparison. The system may create two separate databases when creating the archive copy, one that stores information related to the data (such as unique hashes computed for all data within a data set) and one that stores information identifying locations where archived copies of the data set are stored.
Examples of the technology employ the archive copies described herein to assist in complying with document retention regulations and to leverage a collaborative document management system to improve searches for multiple users. The system may look to the archive copies along with a data classification and content indexing system when searching a company's documents, email, and other content.
In some cases, the search may be based on keywords within a document or supplemental information, such as data classification tags associated with the document and other metadata. Searches may be performed on live data within the company as well as on archive copies, other secondary copies, and across all data under management by the system. The system may also maintain an index of all of the content available anywhere under management.
In some cases, the system may secure search results based on a company's data using a security system. For example, some users may not have access to documents containing certain keywords or related to sensitive company information such as trade secrets or business strategy.
In some cases, the system employs a media management system to manage and control the movement of data to and from media and media storage libraries. Thus, a document retention system that interoperates with a content indexing system, a security system, a media management system, and a collaborative document management system can provide an integrated document retention and collaborative search experience to a user.
Various examples of the technology will now be described. The following description provides specific details for a thorough understanding and enabling description of these examples. One skilled in the art will understand, however, that the system may be practiced without many of these details. Additionally, some well-known structures or functions may not be shown or described in detail, so as to avoid unnecessarily obscuring the relevant description of the various examples.
The terminology used in the description presented below is intended to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific examples of the system. Certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this Detailed Description section.
Suitable System
Referring to
The system 100 may include a file system 110 that creates, modifies and/or updates originally created data 115 (that is, data is first created by file system 110). The created data may be called a primary copy or production copy of the data. Alternatively, data may be a primary copy from within an exchange server, a SQL database, and so on. The system 100 may perform various data storage operations and data transfers in order to make a secondary copy 120 of the original data 115, such as a recovery copy, using a media agent 117. For example, the system 100 may copy data on a daily or weekly basis. In the example of
Additionally, the system 100 creates an archive copy 130 of the original data 115 using an archive copy component 132, such as a media agent used to create archive copies. The archive copy component 132 may communicate and interact with the media agent 117 that creates the index 140, allowing archived data to be indexed by the media agent 117 and later searched by one of the searched components 150 and/or 155. The archive component 132 may also utilize a data redundancy component 135, or single instancing system, that reduces or removes some or all of the redundant data under management by the system, e.g. data within the secondary copies 122, 124, 126 when creating the archive copy 130 via the archive component 132. The system may also encrypt the data via an encryption system 137, either during or after the data is single instanced.
In some cases the system 100 enables organizations to create an archive copy of their data without using primary system resources (via the data from the secondary copies 122, 124, 126), such as resources near or located with the file system 110, without relying on the originally generated secondary copies themselves as being suitable for archival purposes Furthermore, the system 100 may index the data and create a content index 140, and may eliminate or reduce any unnecessary copying of data to the data archive via the single instancing component 135.
In some cases, the system may create archive copies of data from an original data set, or primary copy. Referring to
Upon receiving the request, the system instructs the media agent 132 to create an archive copy of the selected files. As described herein, the system may single instance the files using the single instancing component 135, encrypt any non-redundant files using the encryption component 137, and/or index the content of the files using the media agent 117 when creating an archive copy of the files.
In some cases, the system may create archive copies from previously stored or archived copies of data sets. Referring to
Examples of a Data Storage System
The system described herein may collaborate with and utilize some or all data storage components of a data storage system, such as a data storage system used to create secondary copies of data such as backup copies of data, recovery copies, archive copies, and so on. Referring to
Referring to
For example, the data storage system 205 contains a storage manager 210, one or more clients 202, one or more media agents 203, and one or more storage devices 204. The storage manager 210 controls the media agents 203, which may be responsible for transferring data to storage devices 204. The storage manager 210 includes a jobs agent 211, a management agent 212, a database 213, and/or an interface module 214. The storage manager 210 communicates with client(s) 202. One or more clients 202 may access data to be stored by the system from database 222 via a data agent 221. The system uses media agents 203, which contain databases 231, to transfer and store data into storage devices 204 to create secondary copies of data.
The data storage system may include software and/or hardware components and modules used in data storage operations. For example, the components may be backup resources that function to backup data during backup operations or may be archiving resources employed by the system to create archive copies. Of course, the components may perform other storage operations (or storage management operations) other that operations used in data backups and/or data archiving. For example, some resources may create, store, retrieve, and/or migrate primary or secondary data copies. The secondary data copies may include snapshot copies, backup copies, HSM copies, archive copies, and so on. The resources may also perform storage management functions that may push information to higher level components, such as global management resources.
In some examples, the system performs storage operations based on storage policies, as mentioned above. For example, a storage policy is a data structure that includes a set of preferences or other criteria to be considered during storage operations. The storage policy may determine or define a storage location, a relationship between components, network pathways, accessible data pipes, retention schemes, compression or encryption requirements, preferred components, preferred storage devices or media, and so on. Storage policies may be stored in storage manager 210, or may be stored in other resources, such as a global manager, a media agent, and so on. Further details regarding storage management and resources for storage management will now be discussed.
Referring to
Format of Archive Copies
In some examples, the system creates an archive file when creating an archive copy or other secondary copies of a data set, such as a data set originating in a file system. The creation of an archive file enables the system, when storing or restoring data, to have both a logical view and a physical view of stored data. The logical view, represented by the archive file, enables the system to store data having a format that is neutral (or, independent) with respect to data type. The physical view, represented by an index of locations on stored physical media, enables the system to locate the data stored on the physical media as chunks of the archive file.
Referring to
Referring to
In other words, when a data set is stored using a pipeline based data storage system (such as those described herein) portions of the data set are stored in pipeline buffers, or portions of memory. The archive file, therefore, relates to the data set, and the payloads each relate to a pipeline buffer. Further details regarding pipeline based data storage systems may be found in U.S. Pat. No. 6,418,478, issued Jul. 9, 2002, entitled PIPELINED HIGH SPEED DATA TRANSFER MECHANISM, which is hereby incorporated by reference in its entirety.
Referring back to
As mentioned above, the archive file is a logical view of a data set that may include offsets within the archive file that relate to locations on physical media, such as magnetic tape) where data is stored. Referring to
File markers 510 are placed within the media to represent the beginning of a chunk and to relate back to logical offsets within the archive file 310. For example, a logical offset may identify that chunk3 of af1 is 16 GB or a certain tape counter into media 1. This can be useful when attempting to restore data. For example, when data is stored on tape, the ability to seek data to a specific byte is inefficient. However, seeking to a file marker is a quicker and easier process.
In some examples, the system may dynamically or logically determine the size and/or contents of the data chunks. For example, during single instancing a media agent may determine unique data and store all the unique data in the first chunk or first chunks of an archive file. Furthermore, the system may encapsulate the data within a chunk with header information that indicates the identification information related to the instance of the data. For example, a file within the data chunk may be encapsulated with a header or other information that includes a signature for the file based on an algorithm used to determine the uniqueness of the file within the system. This information may later enable the system to reconstruct some or all of a single instance database should the need arise. The information may include the unique signature (e.g., the hash identifier) of the data, what signature creation algorithm was used, which client transferred the data, the size of the data file, the metadata associated with the file, and so on.
The system may create two different containers of an archive file, spread across two or more data chunks. Each container may include the header information described above. The first container may include data unique to the system, such as data determined to be unique during single instancing, and may include a header that indicates the container includes unique data. The second container may include information related to the redundant data, such as pointers that represent the redundant data and point to where the first copy of the redundant data is stored.
For example, referring back to
Thus, creating archive copies in an archive file format enables the system to establish a logical view of archived data. The logical view is neutral to file types, and can therefore be used to restore data using any components within a system, not just components that rely on file types to restore data. In effect, using the archive file format, the system may be implemented using any different types of hardware components because the media agents that store the data maintain the data in the archive file format.
For example, because the format is type and hardware component independent, the system can single instance data sets across heterogeneous storage media. For example, the system can single instance data across different storage media (tapes, disks, and so on) or file systems (windows, UNIX, and so on). The system can then create archive copies of data without data redundancies using heterogeneous media. Additionally, the system can then restore and provide data to users across heterogeneous systems, because the system does not depend on the applications or file systems that created the data. For example, data originally created in a UNIX environment may be stored as an archive file that is independent of typical UNIX data types. Years later, the system may receive a request to recover this data from a device operating a Windows based device. Being data type independent, the systems is able to retrieve the file (in the archive file format), and recreate the file as a Windows based file for recovery within the Windows environment. Similarly, the system can also recover files created by different environment versions (such as recovering a Windows 95 file for a Window 2003 system).
Creating Archive Copies of Data
Referring to
In step 610, the system, such as system 100, receives a request to create an archive copy of a data set. For example, the system may receive the request to create a copy from an original data set, or primary copy (step 612) or from a recovery copy or other secondary copy (step 614). In some cases, the system may receive a request to create an archive copy from data both types of copies. In step 620, the system creates an archive copy, such as by using the data storage components described herein. In some cases when the data of the recovery copy is in the same form and state as the original data (or in a similar form), the system may not need to copy the data directly from the file system. Instead, the system may utilize the recovery copy to build and create an authentic and reliable archive copy of the original data. Additionally, the system may modify, reduce or remove data, may encrypt data, may index data, or may perform other processes to the data in creating the archive copy, as described herein. In some cases, the system performs some or all of these processes in order to create an archive copy that is different than other secondary copies (e.g., the recovery copy), because the archive copy may serve other needs for the system. For example, the system may single instance and encrypt all collected data under management when creating an archive copy. In step 630, the system stores the archive copy to a storage component. That is, the system generally performs additional or different storage techniques (such as single instancing, encrypting, and so on) when creating an archive copy of data than when creating other secondary copies, unlike other systems that merely transfer secondary copies, such as recovery copies, to long term storage resources when building an archive of data.
For example, the system receives a request from a user to create an archive copy of all emails sent on Nov. 14, 2007. The system, in step 610, receives the request via a user interface that allows the user to quickly select data to be copied as an archive copy. The system generates an archive file for the data to be archived, and stores a number of chunks to a magnetic tape that relate to the archive file. Additionally, the system may perform a number of processing techniques in creating the archive copy that the system may not perform when creating a recovery copy, a backup copy, and so on.
Referring to
In step 720, the system may only transfer a single instance of any redundant data instances. For example, the system may reduce the data set to be transferred by removing duplicate instances of data files and other information. Referring to
The system may utilize a tiered system when single instancing data sets to be stored as an archive copy. For example, the system may access data that is more readily available for copying (such as data stored on hard disks or within the file system) and begin single instancing using that data.
Referring back to
Referring back to
Referring to
In some cases, the system may hash the data or otherwise single instance the data and then encrypt the data, as discussed herein. For example, the system may calculate a hash value for all data of a data set to be archived. The system may then create a table, index or database of the calculated hash values that represents the native data of the data set. The system may then encrypt the native data and create a database that includes information related to the locations of the encrypted data. Thus, the system creates two databases for an archive copy of data, a first database that contains information regarding the location of the archived data and a second database that contains the hash values for the data. This enables the system to restore the data even when the database identifying the locations of the data is lost or corrupted. Additionally, the format of the archive file may enable the system to restore the single instancing database, should the need arise. For example, data objects within chunks are encapsulated with tag headers that include single instancing information, such as a hash value. For additional security, the system may scramble the hash database or encrypt the hash database to prevent unwanted users from easily retrieving its contents.
The system may employ a number of hashing techniques when calculating hash values for a set of data. For example, the system may employ SHA (secure hash algorithms) functions, such as the SHA-1, the SHA-2 (which includes SHA-512), and contemplates uses of the recently announced SHA-3 function. The system may use other hashing functions, such as MD5.
Referring back to
Using a Tiered Storage Policy to Create an Archive Copy
Referring to
The storage policy 1110 may also define any processes the system is to perform on the data before or after creating the archive copy 1140. For example, the storage policy 1110 may indicate to the system to perform indexing of the content of the data, to perform the removal of redundant data, to encrypt the data, to erase data not needed for retention, and so on.
Using a tiered storage policy, the system creates the archive copy 1140 while it creates other secondary copies 1120. In some cases, creating both types of copies using one storage policy may utilize more or additional data storage system resources than needed in only creating a recovery copy. However, because the system performs some, if not all, copying outside of the file system, the system generally does not impact the source (or its resources) of the original data set. Thus, the system is able to create the archive copy 1140 and recovery copy 1120 without applying additional resource constraints on a source. Furthermore, creating an archive data set when creating the recovery copy allows the system to compress the archive data, to reduce gaps in data, and supports data retrieval and discovery by providing a searchable index of the content of the archived data. Additionally, the system eliminates some or all redundant data files, reducing the amounts of data to be stored and possibly recovered at a later time.
Archiving Existing Archived Data Sets
In some cases, the system may be applied to existing archived data sets. For example, some archived data sets are nothing more than many boxes of magnetic tapes storing data. These tapes often contain redundant data that may take up more than half of the entire archive. Thus, in some cases, it may be beneficial to apply the archiving methods and system described herein to existing archives in order to provide the existing archives with indexing and data reduction (and other benefits), reducing storage costs and providing acceptable recovery times. As described herein, the system can create a copy of data (such as an archive copy) that is independent of the system that created the data, applications that created the data, and so on. The system can therefore receive data from various heterogeneous sources and create a single independent copy of data that may be used as a long term copy of the data.
Referring to
Referring to
In some cases, the system may reduce data gaps that can occur in typical data storage systems. These systems may archive data by sending recovery copies to a data archive on, for example, a monthly basis. However, often, data will undergo many changes and modifications within a month. Thus, the data storage system may only store the modifications present at the monthly increments, causing gaps in the archived data set.
The system reduces such data gaps by creating the archive copy when the system creates the recovery copy. For example, the system using single instancing and other redundancy techniques may periodically or constantly create an archive copy of an original data set, storing original data and any incremental changes to the data. Thus, the system is able to catch and archive the incremental changes and continually build an archive copy for data under management of an organization.
The system provides an indexed, continuous archive copy of data under management containing little or no redundancy without taxing the systems at the data source, among other benefits.
Collaborative Search System
Additionally, the system provides many benefits in data retrieval, collaborative search, and discovery. For example, in a discovery request certain emails are to be found. Typical archived systems, storing data in boxes of tapes and other media, may need to check each and every tape in order to discover the required email. Using the archive copy techniques described herein, the system may quickly and easily satisfy the request. For example, in creating the archive copy, the system reduces redundant files and indexes the content of the files. Thus, when a user of the system provides search information for the certain emails (such as a sender's name or keywords in the body of the email), the system may easily search the content of the archive using the index. Furthermore, because the system may eliminate all multiple instances of data, users may feel a high level of comfort in knowing that the search of content will find each and every file requested. Further details will now be discussed.
The system described herein provides a unified approach to data management that enables legal and IT groups to focus management and discovery efforts on a single data repository, eliminating the need to search and preserve information in both backup and archiving applications. This capability provides IT with the tools to initiate an effective legal hold—the ability to lock down electronically stored information—in response to anticipated litigation. The system may support legal hold on a wide range of compliance media including NetApp SnapLock, HDS DRI and HCAP, Archivas, EMC Centera, Pillar Data, and Permabit, as well as a host of WORM media—tape, UDO Magneto/Optical and PPD. The system enables users to archive, backup, and replicate data within a common infrastructure, creating a single repository for the majority of an organization's discoverable data, including e-mail, files, backups, archives, SharePoint documents, and databases. The system benefits users with support for FRCP preparedness, including:
In some examples, the system provides integration with NetApp SnapLock and other storage management applications. The system's ability to place relevant information on Legal Hold in conjunction with NetApp SnapLock on any NetApp storage system provides a high level of data protection and flexibility to suit e-discovery initiatives. The system's unified approach to data management differentiates its e-discovery options by providing users with consistent search and discovery capability across data under management by the system, such as secondary copies of data. Through certification programs and partnerships with leading OEMs, enterprises can respond quickly and effectively to recently-announced FRCP amendments, preparing their IT operations to properly support discovery and legal hold requests.
Referring to
The content indexing system 1430 provides fast access to content from various computer systems within an enterprise, including both online and offline data. The security system 1440 provides users and groups that are meaningful to a particular enterprise to facilitate searching. The security system 1440 also enforces access rights to collaborative content. The document retention system 1450 places a legal hold on documents related to a document retention request. Further details regarding the legal hold of documents will be discussed herein.
In some examples, the collaborative search system receives criteria for a search through a collaborative process. For example, one collaborative participant may create a new query for responding to a discovery request regarding a product made by the company that employs the collaborative participant. The first collaborative participant may add search criteria including the product name and then may submit the search criteria to the collaborative document management system as a collaborative document. Another collaborative participant may open the collaborative document and add additional search criteria, such as narrowing the list of departments from which documents should be searched. For example, the second participant may include the engineering, marketing, and sales teams that worked on the product. The collaborative search system may also add additional criteria inferred from the criteria added by the collaborative participants. For example, based on the company's indexed data the collaborative search system may determine that two employees, one in a department already within the search criteria and another outside of the current search criteria, frequently send email about projects. Based on this information the collaborative search system may add the user that is outside of the current search criteria to the search criteria, or may prompt one of the collaborative participants to consider adding the user to the search criteria.
Additionally, the system may add additional search criteria inferred from dynamically changing search criteria. For example, different users may commonly search for emails, such as emails that occurred at a certain time and date. The system may look at the current searching of the users and add criteria that relates to the current actions or use of the system. Additionally, the system may use heuristics type information when determining search criteria. For example, the system may identify two users are searching emails from a similar time period, and add search criteria that was added when emails from the time period were earlier searched.
In some examples, the collaborative search system defines workflows that define the set of steps that are part of completing a task. For example, a discovery request task may have the steps of determining search criteria, finding matching documents, obtaining a primary review of the documents, and obtaining a secondary review of the documents. One collaborative participant may begin the workflow by submitting criteria for a search responsive to the discovery request. As noted above, each step of the task may also be a collaborative process, such that, for example, multiple collaborative participants may contribute to determining the search criteria or performing a review of the found documents. Another collaborative participant may view and join the workflow at its current stage of completion. For example, a collaborative participant that is tasked with performing a primary review of the documents may open a collaborative document that contains the set of search results found during the search step, as described in more detail below.
In some examples, the collaborative search system creates a collaborative document based on a set of search results. The collaborative document provides a mechanism for multiple collaborative participants to contribute to steps within a workflow subsequent to the search process. In the example of a discovery request, the steps of performing various levels of review of found documents can consume the majority of the time spent responding to the discovery request. Many collaborative participants may be employed to perform the review, and each may be asked to add supplemental information to the search results that capture the results of each participant's review. For example, a collaborative participant may have the task of reviewing each document and flagging the document if it contains privileged content. The collaborative document may allow each reviewer to directly add comments to documents with the search results. Collaborative documents based on search results may contain a variety of information, such as comments related to the work flow just described, notes made by a collaborative participant to himself (such as where the review of a document was stopped before taking a break), or comments from the content's author that clarifies what the content means.
In some examples, the collaborative search system provides a user interface through which a collaborative participant may select from a set of templates that define common search tasks. For example, a collaborative participant may select a Sarbanes-Oxley template that initiates a search for materials required to be disclosed under the Sarbanes-Oxley Act. Another template may provide a discovery request workflow as described above. Other templates may allow an engineer to mine data about previous products to assist in the development of a current product. Many different templates can be created to guide collaborative participants through the steps of a search or other task. The system may also update or change the set of templates based on dynamically changing information. For example, if the system has presented the Sarbanes-Oxley template to many users and received search requests via the templates, the system may use the received request to alter the template to provide a more efficient search system. In this example, if all users search for materials using two fields (such as a company name field and a shareholder name field), and these users have had success, the system may alter the template to only initially include these two fields or to prioritize these fields. The system may perform other template adjustments in order to meet and facilitate the search of data within the system.
The user interface of the collaborative search system may include custom-developed web components to assist with the integration with the collaborative document management system. For example, Microsoft Sharepoint Server provides an object model and API for accessing collaborative features such as workflows and a search front-end that can be invoked from custom web pages using the Active Server Page Framework (ASPX). Using ASPX or other methods, custom components can be built containing scripts that dynamically build web pages for display to a collaborative participant. These web pages are dynamically produced for each collaborative participant and may list workflows to which the collaborative participant has access, collaborative documents created by the collaborative participant, templates available to the collaborative participant, and so on.
In some examples, the collaborative search system provides a user interface that does not require specialized software to be installed on the searching client system. For example, the collaborative search system may receive search criteria and display search results through a web portal that is accessible using a standard Internet web browser or graphical user interface. The collaborative search system may also provide a set of parsers for viewing content from many different sources, such as received in a list of search results, as web content. For example, the collaborative search system may provide a parser for converting a word processing document into a Hypertext Markup Language (HTML) web page. Other parsers may convert spreadsheet content, database tables, instant messaging conversation logs, email, or other structured or unstructured content into a web page format accessible via a collaborative participant's browser. In this way, heterogeneous data from many different applications is available through a unified search user interface.
In some examples, the collaborative search system integrates components for making additional types of data available for searching. For example, a component may be used to provide access to an email server, such as Microsoft Exchange or Lotus Domino. Another component may provide access to database content. Third party products may be integrated with the system to provide access to some types of content. For example, FaceTime Communications, Inc. of Foster City, Calif., provides a third party product that collects instant messaging data and forwards the data to a Microsoft Exchange mailbox. Once the instant messaging is in the Exchange mailbox, the component for providing access to Microsoft Exchange data can be used to include the instant messaging content in searches.
The collaborative search system may integrate components for searching data from multiple operating systems and multiple data formats. For example, file system data on a Microsoft Windows computer system may be stored differently from file system data on a Linux computer system, but the collaborative search system may make both types of file system data available for searching. Data may be gathered from each of these types of disparate data sources and forwarded to a uniform database where the data can be collected, tagged with various classifications, and indexed for searching. The system may then display the data on differently formatted browsers.
In some examples, the collaborative search system integrates information from a security system. For example, the collaborative search system may use Microsoft Windows Active Directory to determine users whose content should be searched as part of a discovery request. Active Directory contains all of the users in an organization and organizes the users into groups. For example, a finance group may contain all of the users in the Finance Department of a company. A discovery or other search request may include a request for information most likely held by a particular group, such as sales data managed by a sales department. The security system may also provide restrictions on access to content retrieved in response to a search. For example, a temporary worker hired to find documents for a sales pitch might not have access to documents associated with executives or documents that contain confidential company information. The collaborative search system can manage a workflow that contains steps performed by collaborative participants with varying levels of access to content. For example, a company officer may be the only collaborative participant allowed to search a particular set of documents as part of a search request, while other collaborative participants search less restricted documents.
Document Retention (LegalHold)
In some examples, the system effectively sets an "undelete" flag to put a legal hold on electronic data to prohibit it or inhibit it from being deleted. This may interoperate with the system's ability to search with data classification, especially content searching, to find documents for which the "undelete" flag should be set. The system can also search for patterns of activity, such as identifying the next ten actions performed by a given computer once previously set criteria are met (e.g., an email sent by the CEO to a particular party or regarding a given subject). The patterns of activity may be pre-determined or may be dynamically determined. For example, these patterns may include actions related to the user of the data, actions related to a computer of the user, actions related to a user's group, actions related to a project associated with the data, and so on. Thus, after a triggering event, the system tracks all communications, or even all activities, for a given user or on a given machine.
In some examples, the system handles all electronic data, and covers production volumes, backup volumes, single instancing, and other versions of data. In its simplest form, a storage manager and data agents help identify data that satisfy a given criteria from various locations, and via indexes generated based on all data in a network. With a single user interface, a user can request a unified search over the network to identify all data satisfying predetermined criteria. This includes identifying data satisfying the criteria on multiple levels or tiers of storage, multiple types of media, and heterogeneous platforms.
In some examples, the system can employ Bayesian file matching techniques to identify similar files. For example, the system can identify data on a primary storage device identified from a storage manager index. The system can then identify where on the secondary tier of storage the similar data is located.
In some examples, the system locks down the data using a litigation hold field or undelete field that permits that data to be written once and read many times (WORM). The system works with data that is not regularly "WORM-able." In other words, the data can be tagged to be prohibited from being deleted, but then afterwards deleted when the flag is removed.
In some examples, the system permits indexing on each client, and the ability to trap data at a client level. For example, agent software on individual computers, coupled to the network, can monitor behavior on that computer, and when certain criteria are satisfied, write out everything elsewhere to a server on the network or other storage location. Alternatively, the data can be stored in cache, and then written out later, such as when the agent recognizes that the machine has been in a quiescent state for longer than a predetermined period of time, or at a predetermined time of day. Indeed, under this alternative, the agent can copy everything new that may have occurred on the computer and stored elsewhere.
Under another alternative that stops copies from being deleted, a filter on a primary storage device traps any delete commands associated with data matching certain criteria. Secondary storage may have a litigation hold field that is effectively an undelete flag or a "preventative action field." This field is more than a simple flag, but can identify or distinguish between different "matters" such as different litigations or other events. Further, such a preventive action field can selectively enable or disable delete commands, encryption commands, move commands, and so on. For example, certain data may be flagged as being kept encrypted permanently, unless certain special criteria are met. Alternatively, certain data may be flagged as prohibited from being encrypted. Further, data may be flagged whereby it may be moved only within a given data storage tier, and not between tiers. Any job agent running on the system, such as a journaling agent, can check for whether certain criteria are met, and take appropriate actions in response.
In some examples, the system has a reporting capability where indexes at the storage manager are analyzed to identify documents matching certain terms and reports generated therefrom. In other words, the system identifies data objects that meet search criteria. The system can then cross-reference back to other search criteria, without having to associate related items based on preset classifications or certain criteria. For example, documents assigned different matter numbers may be, in fact, related, and thus identified as related under the system.
In some examples, the system identifies not only documents, but also creates a log, and thus a log report, of keystrokes by given machines, applications opened, files stored, and so on. Differential reports may be generated through a differential search among multiple reports. Such a differential report can provide a rating based on a commonality between search results among different reports. The system may rate certain reports higher than other reports. For example, the system may rate activity from a computer that created the document higher that activity from the user that created the data. Also, the system may then use the differential report when performing dynamic processing, such as those described herein.
In some examples, once data identifying certain criteria is flagged, it can be sent to a WORM device or otherwise "WORMed." Under the present system, once data has been WORM-ed, it can be unWORMed later, which is not possible with some hardware-based storage systems.
Under another alternative, the system can trap a copy and store that copy elsewhere, such as on a completely separate machine. Thus, the system can create a storage manager index associated with a separately identified machine or platform to store all documents and other electronic data meeting an electronic discovery request or other present criteria. Thus, data can quickly be moved off a user's computer and onto a separate machine coupled to the network, where that machine may be dedicated to a certain job, such as legal discovery.
In some examples, using Vault Tracker or a similar archive storage management component, the system can perform a data classification search meeting the certain criteria, identify an offsite location storing the data, automatically request the offsite media, and restore it to a particular server. Thus, the system can automatically, or semi-automatically, obtain data meeting the certain criteria, and have it restored back at a set location to respond to a legal discovery request. For example, the system may identify documents using the search criteria and retrieve secondary storage devices that include the document and other documents related to the documents or its metadata.
In some examples, the system generates an audit-ready report that identifies what electronic data the system could and could not find. For example, the report may identify all of the documents responsive to a legal discovery request as well as the current availability of those documents within the system. The documents can then be accessed if they are immediately available or retrieved from a storage library and accessed if they are stored elsewhere (e.g., in an off-site data vault). The report may be useful in cases where an organization prepares for a discovery request but does not want to devote the resources in preparing the data for discovery. Additionally, the system may use the report to identify problems with a data retention system should the report indicate that some data was not found. For example, the system may identify that all data from a certain time period was not found, and review various processes that stored data in that time period for errors and/or malfunctions. Also, the system may then proactively check other similar cases in lieu of the unfound data. Thus, the system may proactively prepare for requests using aspects of the system.
Systems and modules described herein may comprise software, firmware, hardware, or any combination(s) of software, firmware, or hardware suitable for the purposes described herein. Software and other modules may reside on servers, workstations, personal computers, computerized tablets, PDAs, and other devices suitable for the purposes described herein. In other words, the software and other modules described herein may be executed by a general-purpose computer, e.g., a server computer, wireless device or personal computer. Those skilled in the relevant art will appreciate that aspects of the system can be practiced with other communications, data processing, or computer system configurations, including: Internet appliances, hand-held devices (including personal digital assistants (PDAs)), wearable computers, all manner of cellular or mobile phones, multi-processor systems, microprocessor-based or programmable consumer electronics, set-top boxes, network PCs, mini-computers, mainframe computers, and the like. Indeed, the terms "computer," "server," "host," "host system," and the like are generally used interchangeably herein, and refer to any of the above devices and systems, as well as any data processor. Furthermore, aspects of the system can be embodied in a special purpose computer or data processor that is specifically programmed, configured, or constructed to perform one or more of the computer-executable instructions explained in detail herein.
Software and other modules may be accessible via local memory, via a network, via a browser or other application in an ASP context, or via other means suitable for the purposes described herein. Examples of the technology can also be practiced in distributed computing environments where tasks or modules are performed by remote processing devices, which are linked through a communications network, such as a Local Area Network (LAN), Wide Area Network (WAN), or the Internet. In a distributed computing environment, program modules may be located in both local and remote memory storage devices. Data structures described herein may comprise computer files, variables, programming arrays, programming structures, or any electronic information storage schemes or methods, or any combinations thereof, suitable for the purposes described herein. User interface elements described herein may comprise elements from graphical user interfaces, command line interfaces, and other interfaces suitable for the purposes described herein. Screenshots presented and described herein can be displayed differently as known in the art to input, access, change, manipulate, modify, alter, and work with information.
Examples of the technology may be stored or distributed on computer-readable media, including magnetically or optically readable computer discs, hard-wired or preprogrammed chips (e.g., EEPROM semiconductor chips), nanotechnology memory, biological memory, or other data storage media. Indeed, computer implemented instructions, data structures, screen displays, and other data under aspects of the system may be distributed over the Internet or over other networks (including wireless networks), on a propagated signal on a propagation medium (e.g., an electromagnetic wave(s), a sound wave, etc.) over a period of time, or they may be provided on any analog or digital network (packet switched, circuit switched, or other scheme).
Unless the context clearly requires otherwise, throughout the description and the claims, the words "comprise," "comprising," and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of "including, but not limited to." As used herein, the terms "connected," "coupled," or any variant thereof, means any connection or coupling, either direct or indirect, between two or more elements; the coupling of connection between the elements can be physical, logical, or a combination thereof. Additionally, the words "herein," "above," "below," and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description using the singular or plural number may also include the plural or singular number respectively. The word "or," in reference to a list of two or more items, covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
The above detailed description of examples of the technology is not intended to be exhaustive or to limit the system to the precise form disclosed above. While specific examples of, and examples for, the system are described above for illustrative purposes, various equivalent modifications are possible within the scope of the system, as those skilled in the relevant art will recognize. For example, while processes or blocks are presented in a given order, alternative examples may perform routines having steps, or employ systems having blocks, in a different order, and some processes or blocks may be deleted, moved, added, subdivided, combined, and/or modified to provide alternative or subcombinations. Each of these processes or blocks may be implemented in a variety of different ways. Also, while processes or blocks are at times shown as being performed in series, these processes or blocks may instead be performed in parallel, or may be performed at different times.
The teachings of the technology provided herein can be applied to other systems, not necessarily the system described above. The elements and acts of the various examples described above can be combined to provide further examples. Any patents and applications and other references noted above, including any that may be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the system can be modified, if necessary, to employ the systems, functions, and concepts of the various references described above to provide yet further examples of the technology.
These and other changes can be made to the system in light of the above Detailed Description. While the above description describes certain examples of the system, and describes the best mode contemplated, no matter how detailed the above appears in text, the system can be practiced in many ways. Details of the system and method for classifying and transferring information may vary considerably in its implementation details, while still being encompassed by the system disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the system should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the system with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the system to the specific examples disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the system encompasses not only the disclosed examples, but also all equivalent ways of practicing or implementing the technology under the claims.
While certain aspects of the technology are presented below in certain claim forms, the inventors contemplate the various aspects of the technology in any number of claim forms. For example, while only one aspect of the technology is recited as embodied in a computer-readable medium, other aspects may likewise be embodied in a computer-readable medium. Accordingly, the inventors reserve the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the technology.
From the foregoing, it will be appreciated that specific examples of the system have been described herein for purposes of illustration, but that various modifications may be made without deviating from the spirit and scope of the system. Accordingly, the system is not limited except as by the appended claims.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
by Tony Maygarden
Douglas P. Clark passed away on September 16, 2002, at the age of 66. With his passing, the music world lost the leader and founder of one of North Carolina's most popular, long-lived, and notorious party bands, Doug Clark and the Hot Nuts.
A native of Chapel Hill, NC, Doug Clark formed his first band, The Tops, while in high school. By the early '60s, he had formed the Hot Nuts. The band toured up and down the east coast, with college fraternities (which at that time were pretty much all white) providing most of their gigs. They also played all black clubs, such as The Square Club and The Goodwill Club in Durham, NC. Clark stated in an interview with The Chapel Hill News shortly before his death that "we didn't make any money, but we had a million dollars worth of fun."
The band, which featured Doug's brother John on saxophone, specialized in danceable R&B mixed with a heavy dose of risqué musical numbers, jokes and skits.
Nuts to You (Gross 101), released 1962.
Doug Clark and the Hot Nuts released nine albums on their own Gross label. Recorded live, the albums have a definite party atmosphere. The first release, Nuts to You features a front cover picture of Doug flipping the bird to the audience.
The band's repertoire included period dance songs like Phil Upchurch's "You Can't Sit Down," ribald R&B like Dave Bartholomew's "My Ding-a-ling" (to which they liberally added their own verses), re-workings of popular songs (such as turning Jimmy Dean's "Big Bad John" into "Big Jugs"), and original songs like "Panty Raid." The band's signature pieces, which furnished vehicles for their endless bawdy word play, were "Gay Caballero," "Two Old Maids" and "Hot Nuts."
Doug Clark and the Hot Nuts were playing regularly until shortly before Doug's death. A one-of-kind band, their music, and the laughter they created so easily, will be truly missed. (Note: A recent article in The Chapel Hill News stated that the band, with Doug's son as a member, will carry on performing as Doug Clark's Hot Nuts.)
Panty Raid (Gross 105)
Summer Session (Gross 106)
"Baby Let Me Bang Your Box" single released on Jubilee in 1966. They had another single on Jubilee, "Go, Doug Go," and one on the the Port label, "Peanuts."
They also released two 7" EPs on the Gross label.
Freak Out (Gross 108)
Other albums by Doug Clark and The Hot Nuts:
DISCLAIMER: The Endless Groove does not endorse or guarantee any of the products
services offered by the individual sellers on our affiliate's web site.
Please inspect each seller's feedback rating, grading details, shipping charges and return policies before placing an order.

subset: commoncrawl


text:
August 3, 2015
WASHINGTON (AP) - "American Idol" winner Phillip Phillips is joining the lineup for this year's July Fourth celebration on the National Mall in his first performance following kidney surgery and his "Idol" victory.
In an exclusive interview with The Associated Press ahead of Monday's announcement, Phillips says he's excited about his first visit to the nation's capital. The bluesy guitar man from Georgia says he's been focused on recovering from medical procedures since "Idol." Now he's eager to get back in front of an audience.
Concert organizers are announcing Monday that the 21-year-old will perform his single "Home" for an audience of more than 300,000 from the lawn of the Capitol before the annual fireworks. The show is broadcast live on PBS and NPR.
Phillips joins Matthew Broderick, country star Josh Turner, composer John Williams and others.
To comment, the following rules must be followed:
Comments may be monitored for inappropriate content, but the station is under no legal obligation to do so.
If you believe a comment violates the above rules, please use the Flagging Tool to alert a Moderator.
Flagging does not guarantee removal.
Multiple violations may result in account suspension.
Decisions to suspend or unsuspend accounts are made by Station Moderators.
Questions may be sent to email@example.com. Please provide detailed information.
Click Here to access the online Public Inspection File
Viewers with disabilities can get assistance accessing this station's FCC Public Inspection File by contacting the station with the information listed below. Questions or concerns relating to the accessibility of the FCC's online public file system should be directed to the FCC at 888-225-5322, 888-835-5322 (TTY), or email@example.com.


text:
Board of Reviewers
A. Rashad Abdel-khalik
University of Illinois, Urbana-Champaign, USA
Saverio Bozzolan, University of Padova, Italy
Paul K. Chaney, Vanderbilt University, Nashville, Tennessee, USA
Andreas Charitou, University of Cyprus, Nicosia
William Cready, The University of Texas at Dallas, USA
Yuan Ding, China Europe International Business School, P.R.C.
Ehsan Feroz, University of Washington, Tacoma, USA
In-Mu Haw, Texas Christian University, Fort Worth, USA
Thomas Omer, University of Nebraska – Lincoln, USA
Suresh Radhakrishnan, The University of Texas at Dallas, USA
Theodore Sougiannis, University of Illinois, Urbana-Champaign, USA
Nasser Spear, University of Melbourne Victoria, Australia
Anne d'Arcy, Vienna University of Economics and Business, Austria
Sean Robb, University of Central Florida, Orlando, USA
Anwer Ahmed, Texas A & M University, College Station, USA
Kamran Ahmed, La Trobe University, Melbourne, Victoria, Australia
Fatima Alali, Cal State – Fullerton, USA
Seraina Anagnostopoulou, Athens University of Economics and Business, Greece
Steven Balsam, Temple University, Philadelphia, USA
Francesco Bova, University of Toronto, Canada
Dennis Chambers, University of Kentucky, Lexington, USA
Clara Chen, University of Illinois, Urbana-Champaign, USA
Shimin Chen, China Europe International Business School, P.R.C
Daniel Cohen, University of Texas at Dallas, Richardson, USA,
William Cready, University of Texas at Dallas, Richardson, USA
Elizabeth Demers, INSEAD, France
Minyue Dong, HEC University of Lausanne, Switzerland
J??rgen Ernstberger, Ruhr University Bochum, Germany
Neil Fargher, Macquarie University, Australia
Peter Fiechter, University of Zurich, Switzerland
Ann Gaeremynck, Katholieke Universiteit Leuven, Belgium
Giorgio Gotti, The University of Texas at El Paso, USA
Michael Gruening, University of Technology Ilmenau, Germany
Yuyan Guan, City University of Hong Kong, Hong Kong
David Hay, The University of Auckland Business School, New Zealand
Dimosthenis Hevas, Athens University of Economics & Business, Greece
Mahmud Hossain, Nanyang Technological University, Singapore
Adel Nematallah Naguib Ibrahim, Alexandria University, Egypt
Thomas JeanJean, ESSEC Business School, France
Guohua Jiang, Peking University, China
Inder Khurana, University of Missouri, USA
Emre Kilic, University of Houston, Texas, USA
Oksana Kim, Minnesota State University, Mankato, USA
Kentaro Koga, Hitotshubashi University, Japan
Wei-Chern Koh, Nanyang Technological University, Singapore
Neophytos Lambertides, Cyprus University of Technology, Cyprus
Juan Manuel Garc??a Lara, Universidad Carlos III de Madrid, Spain
Sidney Leung, City University of Hong Kong, Hong Kong
Laura Li, University of Illinois, Urbana-Champaign, USA
Scott Liao, University of Toronto, Canada
Hai Lu, University of Toronto, Canada
Wei Luo, Peking University, China
Krishnagopal Menon, Boston University, Massachusetts, USA
Stacy Mastrolia, Bucknell University, Pennslvania, USA
Franck Missonier, University of Geneva, Switzerland
Mark Peecher, University of Illinois, Urbana-Champaign, USA
Jenice Prather-Kinsey, The University of Alabama at Birmingham, USA
Jiaping Qiu, McMaster University, Canada
Suresh Radhakrishnan, University of Texas at Dallas, USA
Asheq Rahman, Massey University, New Zealand
Davide Rizzotti, University of Catania, Italy
Oliver Rui, CEIBS, China
Feras Salama, American University of Sharjah, UAE
Heibatollah Sami, Lehigh University, Pennsylvania, USA
Divesh Sharma, Auckland University of Technology, New Zealand
Jenny Stewart, Griffith School of Business, Australia
Herv?? Stolowy, HEC School of Management, France
Fumiko Takeda, University of Tokyo, Japan
Hun-Tong Tan, Nanyang Technological University, Singapore
Stephen Taylor, University of Technology – Sydney
Siew Hong Teoh, University of California, Irvine, USA
Jennifer Wu Tucker, University of Florida, Gainesville, USA
Nikos Vafeas, University of Cyprus, Nicosia
Tzachi Zach, Ohio State University, USA
Stephen A. Zeff, Rice University, Houston, Texas, USA


text:
Cuba wonââ¬â¢t be allowed to send a team to next yearââ¬â¢s inaugural World Baseball Classic, the U.S. government told event organizers Wednesday.
The decision by the Treasury Departmentââ¬â¢s Office of Foreign Assets Control was conveyed to Major League Baseball on Wednesday, according to Pat Courtney, a spokesman for the commissionerââ¬â¢s office.
A permit from OFAC is necessary because of U.S. laws governing certain commercial transactions with Fidel Castroââ¬â¢s communist island nation.


text:
"We used this design for our daughter's 16th movie/dinner birthday party invite. Pink, bright colors aren't her style so this card suited her perfectly. The pearl finish gave the card a nice sheen that added a feeling of girly, glamour. Thanks Tiny!"
"The card was fun to design, shipping was fast, and the final product was exactly what I wanted. My expectations were met with quality. Super cute card for a boy's birthday party at a baseball game!"
"This card was perfect for my mother in laws surprise party! Customer service at tiny prints is outstanding.... can't say enough about their friendly super accomodating service. I needed last minute changes and called twice on two different Sundays. Prompt, friendly service both times. My only complaint is that this particular vendor requires a minimum of 25 on reorders, which was a bummer because I only needed 15. The card quality was great and colors really popped."
"Used these for my husband's 50th birthday party poker bash. They are on high quality stock and the colors are vibrant. Very striking to receive in the mail."
"I actually found this item in the corporate section for a company casino night but personalized it in a way to use for my sister's bachelorette party! I actually work at a design firm but just didnt have time to think of something new and this was so quick and easy and the paper quality was great as well as the print. For the price, you can not beat this product! Everyone just loved the invites and it sets a great precedent for what will be a great weekend!"


text:
Here is what I wore on Labor Day.
Monday, September 14, 2009
Bikes and hats and the city.
Posted by m e l i g r o s a at 9/14/2009
Labels: from the bike lane, fun, las neighborhoods in SF, north beach
5 comments:
I love big, floppy hats.ReplyDelete
The outfit is adorable. And the bike is classy. Refreshing next to all the spandex/lycra. It's nice to appreciate all aspects of cycling, isn't it?ReplyDelete
Jon/ :) sun friendly!ReplyDelete
Kaitlin/ thank you kindly <3
&yes, all bikes, all the time! regardless of outfits, we roll with the same momentum-forward
- AnonymousTuesday, September 15, 2009
Huichol textures.. (:ReplyDelete
I read every comment, frequently with coffee in hand.
/ Sincere thanks for your readership. - - - - - - - -
Subscribe to: Post Comments (Atom)


text:
SingTel inSing Business Search API
SingTel is a mobile telephony company based in Singapore. SingTel exposes a set of web services that offer a mixture of telecom and marketplace capabilities. This API lets users access inSing.com's more than 150,000 Singapore business listing (all geocoded) in real time. At this point in time, individual developers without any company representation are not granted access to the APIs.
Followers (4)
Developers (0)
Sorry, no developers found for this API.
API Mashups (0)
Sorry, no mashups for this API.
Source Code
Sorry, no source code for this API.
Sorry, no resources found for this API.
Developers (0)
Comments (0)
Followers (4)
Sorry, no mashups for this API.


text:
The Connecticut higher education system's new leader says the nearly 95,000 students whose colleges are coming under new management need not worry that the reorganization will directly affect them this fall.
Michael Meotti says work to consolidate the university and college governing boards will continue over the next several months as a 19-member Board of Regents is appointed.
Meotti was recently named interim president of that board. It will govern Connecticut's 12 community colleges and Central, Southern, Eastern and Western Connecticut state universities.
Meotti says in the long run, the consolidation will help Connecticut respond more quickly and efficiently to the schools' needs and provide a better education for all students.


text:
- Customer Login
- Display Lot Location (DLL)
Facility Hours and Directions
Loading Guidelines
Obtain generic loading diagrams for some of the more commonly shipped products. Our team is also available to develop a customized loading diagram to meet your needs.
What's New
What's New
BNSF Announces 2014 Economic Development Results
BNSF customers invested close to $1.5 billion in rail projects expected to generate 1,200 jobs. Read More
BNSF introduces new intermodal service schedules
in its Northern Region
Capital investments on Northern Corridor route allow expanded service offerings. Read More
BNSF honors 2014 Employees of the Year
BNSF recognized a special group of more than 100 employees for their outstanding achievements in 2014 at an awards ceremony on April 13 in Fort Worth, Texas. Read More
Toyota Logistics Services recognizes BNSF for logistics excellence
BNSF Railway was named the 2014 recipient of the President's Award for Logistics Excellence by Toyota Logistics Services. Read More
BNSF Railway is a transportation industry leader and forward-thinking company with a rich heritage in American history. We offer long term careers with a variety of experiences.
We are a Military Friendly Employer. Are you ready to continue serving your nation in a whole new way? Your knowledge and experience is highly valued at BNSF.
Consider BNSF a potential employer. We employ nearly 38,000 individuals who play a vital role in building and sustaining our nation's economy.
To view the jobs we have available, you must visit bnsf.com/careers/apply using Internet Explorer.
- Employee Homemail
About BNSF
BNSF Railway Company operates one of the largest railroad networks in North America, with 32,500 route miles in 28 states and three Canadian provinces.
Contact Us
To report a railroad emergency, call 800-832-5452
Telephone operator/Directory assistance: 800-795-2673
Headquarters Address
BNSF Railway
2650 Lou Menk Drive
Fort Worth, Texas 76131-2830
- Video Gallery


text:
- First day of 1L classes
- September 6, 2013 8:30am - 3:30pm
- Intro. to American Law and Ethics begin for Advanced Degree Students
- September 6, 2013 9:00am - 5:00pm
- BAA/BLSA 1L Welcome BBQ
- September 6, 2013 5:00pm - 8:00pm
Academic Calendars
Add an Event to This Calendar
- Are you a Stanford Law School faculty, staff member, or student org officer? Request an Event Manager and/or Content Manager Account.
- Already have your Event Manager account? Login and add your event.
Feature Your Event on the SLS Home Page
- Submit your event and it may be selected as a home page highlight.


text:
Bright glitter holiday sparkly zebra stripes on white 7/8" grosgrain ribbon- Christmas
Product Info
Adorable sparkly zebra stripes printed on one side of solid grosgrain ribbon. Great for dog leashes or collars, belts, DIY bows or clips, Crafts, gift wrapping, pacifier clips, scrapbooking & much much more. Listing is for 1 yard (3 feet) of 7/8" grosgrain ribbon.
Please message me if you would like a larger quantity, I will list it for you. Thanks. Smoke free home.
100% polyester. Non-shrink, washable, colorfast & dry-cleanable.


text: Results New Search PLUSCARDEN, ABBEY, MONASTIC BUILDINGS AND PRECINCT WALLS (Ref:8441) This building is in the Moray Council and the Elgin Parish. It is a category A building and was listed on 26/01/1971. Group Items: N/A, Group Cat: N/A, Map Ref: NJ 1420 5761. DescriptionFounded 1230. Abbey Church originally planned as cruciform church but it is unlikely that the nave ever existed above the surviving footings. Serious fire circa 1390 and subsequent rebuilding in 15th century. Built in squared rubble and ashlar. NORTH TRANSEPT: most visible survival of 13th century work; lancet windows with large rose window in each gable, clerestory passage in N wall thickness. Glass by Sadie McLellan (Glasgow). 2 chapels Originally opened from N wall, arches now filled and chapels with 13th century detail and stone vaulted roof now form transepts to the chancel. CROSSING: remains of massive shafted columns now mainly encased in later masonry, possibly applied after the fire, supporting solid squat tower with blind cusped panels below parapet. Original rood screen gone but traces of small stair survive; across the chancel arch is a gallery with arms of the 8 secular families who owned the Abbey between 1560 and 1943. S TRANSEPT: probably 14th century with elaborate and progressive detailing to the clerestory and passage, the latter spanning the 3-light windows and with subsiduary pointed arches flanking the shafts on the intervening wall space. 2 original vaulted side chapels more elaborate but re-oriented as at N. Night stair leads from S transept, stepped, 5-light window in S gable head. CHANCEL: some traces of Romanesque detail but this old fashioned style superseded (after the fire?) by a daring arrangement of windows, the mouldings of the reveals, show the vast planned size of the windows now filled with later masonry and smaller intersecting traceried windows on S wall (possibly for stability). E window now 4 lancets with large 3-light traceried window above, vesica and apex opening. Finely carved sacrament house and 3 sedilia. Modern timber panelled ceiling. Considerable remains of 15th century wall painting can be found around the chancel arch, the chancel transepts and the Lady Chapel. LADY CHAPEL: to S of S transept, a squint opens from the chancel transept, groin vaulted roof. DUNBAR SACRISTY: later (?) 16th century addition at NE with vaulted roof. Monastic range (E side of original cloister). 2 storeys, now with attic rooms. LADY CHAPEL: (a) S of Chapter House with paired doors deeply recessed and flanked by elaborate arrangement of nook shafts; central trumeau, (b) the Slype, (c) the Calefactory. Remains of cloister garth and Prior's House to SW of Abbey Church. PRECINCT WALLS: massive rubble walls with original gates at N (main) and E, some beeboles with gothic lintels in S face of N wall. Later, circa 1820 entrance at SE. NotesHouse of Valliscaulian Monks founded 1230 by Alexander II. United 1454 with Urquhart Priory (also Moray, now demolished) of Benedictines. After 1560 monks continued in decreasing numbers to inhabit Priory until circa 1590. 1594 sold to Kenneth Mackenzie of Kintail. 1662 to Brodies of Lethen. By 1710 Pluscarden property of Duff of Dipple who became earl of Fife; purchased by 3rd Marquis of Bute in 1889 and gifted to Benedictines of Prinknash by his heirs in 1943. Re-roofing and restoration followed, by late Ian Lindsay and W Murray Jack (still in progress 1987). Scheduled Monument. ReferencesMacGibbon and Ross THE ECCLESIASTICAL ARCHITECTURE OF SCOTLAND, ii (1896) pp. 146-160. Robert Young, ANNALS OF THE PARISH AND BURGH OF ELGIN, (1879) pp. 28-39. P F Anson, MONASTERY IN MORAY, (1959). Guide book: Basil Skinner and George Hay, 1981. © Crown copyright, Historic Scotland. All rights reserved. Mapping information derived from Ordnance Survey digital mapping products under Licence No. 100017509 2012 . Data extracted from Scottish Ministers' Statutory List on . Listing applies equally to the whole building or structure at the address set out in bold at the top of the list entry. This includes both the exterior and the interior, whether or not they are mentioned in the 'Information Supplementary to the Statutory List'. Listed building consent is required for all internal and external works affecting the character of the building. The local planning authority is responsible for determining where listed building consent will be required and can also advise on issues of extent or "curtilage" of the listing, which may cover items remote from the main subject of the listing such as boundary walls, gates, gatepiers, ancillary buildings etc. or interior fixtures. All category C(S) listings were revised to category C on 3rd September 2012. This was a non-statutory change. All enquiries relating to proposed works to a listed building or its setting should be addressed to the local planning authority in the first instance. All other enquiries should be addressed to: Listing & Designed Landscapes Team, Historic Scotland, Room G.51, Longmore House, Salisbury Place, EDINBURGH, EH9 1SH. Tel: +44 (0)131 668 8701 / 8705. Fax: +44 (0)131 668 8765. e-mail: email@example.com. Web: http://www.historic-scotland.gov.uk/historicandlistedbuildings. Results New Search


text:
cynthia martinez
No Photo
out team purpose id to really cooperate with each other and also to help us out in all the type of questions that everybody has and also for everybody to do their part in the process of doing this team project. and also i think that we ll have to cooperate and really help each other out and also be really happy because we are trying to really fiugure out our purpose for this anas also being vr=ery excited because we are finally gong to define what we really want to become in later on in future c
Judi McAskill
Home Base:
Bell Gardens High School
All Rights Reserved
iam eally excited because w are goiing to discover what we really want to do when we grow up and also i am excited that we are goung to have to interviw aalot of people even though that we all know that its not going to be very easy in discovering this and also how we really have to do this and so yeah i am really looking forward to this and i hope that i finally defie my own road ans also discover hat i realyy want to do later on in life.
Written on November 30, -0001 at 12:00am
Total Views: 162
Inspiring (0)
Helpful (0)
Entertaining (0)


text:
Clint Bowyer doesn't believe recent changes to Bristol Motor Speedway will really affect the way he races at the half-mile track.
However, he does believe it will make a major change to the overall action at Saturday's IRWIN Tools Night Race.
"I didn't really run in the top groove a lot, but it's going to shake things up because a lot of guys did," said the driver of the No. 15 Toyota for Michael Waltrip Racing. "I think into the runs when guys would run way up high, I don't think you'll see that anymore. When I was there for the tire test, I think it's a lot better tire package to put on a good show for the fans."
Bowyer, an Emporia, Kans. native who now lives in Clemmons, N.C., explained why he sees the tires being such a factor in the upcoming race.
"I think the tire is going to allow much better racing with a little more fall-off than we had," he said. "Taking away that preferred groove deep in a run, it's going to bunch us up together a lot more. I hope there's a lot of excitement and we see the sparks fly."
It could mean a shake-up in the point standings, although it appears Bowyer is a sure bet to make the 10-race 'Chase to the Championship.' Don't tell that to the 34-year-old driver, who doesn't want to talk about clinching a playoff spot until it becomes official.
"Anything can happen at a track like Bristol," he said. "We need a couple more solid weekends before I can breathe really well. To get to the Chase, we need more of those solid, single-digit finishes."
He should have a good shot at one of those finishes at Bristol.
Twice, he's raced to third-place finishes and also has a Bristol victory in the Nationwide Series. He even has an ace in the hole, since he, Tony Stewart and Jeff Burton were the only drivers chosen for the tire test to try out the new racing surface.
"Anytime you get to do one of those tire tests, it gets you ahead of the curve," he said. "Everybody catches up through practice sessions, but it definitely helps with your mapping, simulations and all the other stuff in the engineering world."
The engineering has worked in Bowyer's favor this season. He made a change from Richard Childress Racing to Michael Waltrip Racing at the end of last season. While some questioned the move, it proved to be a good fit. It was also a case of good timing as MWR entered into a working agreement with Joe Gibbs Racing.
"It's been good to see this play through," said Bowyer, who won the 2008 Nationwide Series championship with RCR. "Anytime you move from a place you've been your whole career, it's very scary. There were so many unknowns, but I couldn't be happier with where we're at. Everybody at MWR, my teammates have welcomed me. It's been a lot of fun."
As one of the sport's most sought after free agents, Bowyer had the opportunity to visit many of the other race shops. The decision to go with the Waltrip team ultimately came down to the right feel.
"I went around to all the shops and talked to everybody," he said. "It seemed like wherever I went, everything led to MWR. I just liked what I saw, the direction of where the engineering department, the whole company was headed. I just went for it, felt it was a good home for me. Thank God, I was right."
In addition to himself, it's worked out for teammate Martin Truex Jr. as the MWR team appears on the verge of getting two teams in the Chase for a first time ever.
Part of the success has been the pairing of Bowyer with crew chief Brian Pattie. The teaming really paid off at the road courses where Bowyer scored his sixth career Cup Series victory earlier this season at Sonoma, and followed it up with a fourth-place finish at Watkins Glen.
"It's just (crew chief) Brian Pattie and everybody on our team," he said. "I just had really good race cars. I had been improving, getting better every year, but he certainly gave me a car capable of running well. So, it was a good road course year for me."
Bowyer began racing motocross at five years old and racked up more than 200 wins before progressing to dirt-track racing. It's still a passion of his with Bowyer winning Tony Stewart's 'Prelude to the Dream' charity race in 2011. In addition, Bowyer owns dirt-track cars driven by Jonathan Davenport and Jared Landers on the Lucas Oil Late Model Series. He's definitely a hands-on owner, even working alongside them in the shop at times.
Bowyer said he is thankful for all the good fortune and those who helped him along the way.
"It's unbelievable to have all the people who helped me get where I am at," he said. "I don't take it for granted. This is what I love to do and what I wanted to do my whole life. To be able to make a living doing this, it's unreal."


text:
Students to get 500 free tickets to Duke football in the Belk Bowl
Duke students have not had a chance to see the Blue Devils in a bowl game since the 1995 Hall of Fame Bowl. Thanks to an unnamed donor, some will get to attend Duke's appearance in Dec. 27th's Belk Bowl against Cincinnati for free.
Students received an email Sunday night stating that the athletic department will hold a lottery Tuesday Dec. 4 for students to get free tickets just by presenting their Duke Card, made possible "through the generosity of a donor."
In a video message accompanying the email, Duke defensive back Ross Cockrell said 500 students will have the chance to win tickets for the game in Charlotte.
"A great student showing in Charlotte not only supports the program but also makes a statement for future bowl invitations as Duke looks to consistently compete and play in postseason games going forward," the email states.
Cockrell led Duke's defense this year with five interceptions, earning first-team All-ACC honors.
"On behalf of my teammates, we would like to thank all Duke students who have supported us throughout this season," Cockrell said in the video message. "We are excited that Duke will be headed to Charlotte, North Carolina for the Belk Bowl on Thursday Dec. 27, and we want you to join us."