Abstract: A system includes a processor and a memory. When executed by the processor, the processor is caused to receive a first file including one or more components, parse the first file into a metadata portion and one or more non-metadata portions, generate a manifest for each of the one or more non-metadata portions, generate an output data stream including component manifest and data pairs for each of the one or more non-metadata portions, normalize the output data stream, generate a first hash code corresponding to the normalized output data stream and compare the first hash code to a plurality of hash codes. If the first hash code matches any hash code of the plurality of hash codes, the processor is caused to prevent the first file from being stored in the database or automatically remove the corresponding file associated with the hash code matched with the first hash code.

Abstract: A shard of a selected document is identified. A hierarchy of documents including the selected document are to be tagged with metadata in a data store of a search engine so that the related documents are queryable by the metadata using the search engine. The shard specifies a location of the related documents within the data store of the search engine. For each related document, a tagging operation is generated within a script, the tagging operation specifying the metadata, the shard, an identifier of the related document, and an identifier of the selected document. The script including the generated tagging operation for each related document is transmitted to the search engine to execute to tag the related documents in the data store with the metadata and with the selected document as a source of the metadata.

Abstract: A shard of a selected document is identified. A hierarchy of documents including the selected document are to be tagged with metadata in a data store of a search engine so that the related documents are queryable by the metadata using the search engine. The shard specifies a location of the related documents within the data store of the search engine. For each related document, a tagging operation is generated within a script, the tagging operation specifying the metadata, the shard, an identifier of the related document, and an identifier of the selected document. The script including the generated tagging operation for each related document is transmitted to the search engine to execute to tag the related documents in the data store with the metadata and with the selected document as a source of the metadata.

Abstract: Examples described herein include receiving text of an email, determining a header of an email message in the email, and determining a body of the email message. Examples also include modifying the text of the email to indicate a beginning boundary and an ending boundary of the header, modifying the text of the email to indicate a beginning boundary and an ending boundary of the body, generating a hash of the header, generating a hash of the body, and tracing the email based on the hash of the header.

Abstract: Examples described herein include receiving text of an email, determining a header of an email message in the email, and determining a body of the email message. Examples also include modifying the text of the email to indicate a beginning boundary and an ending boundary of the header, modifying the text of the email to indicate a beginning boundary and an ending boundary of the body, generating a hash of the header, generating a hash of the body, and tracing the email based on the hash of the header.

Abstract: According to an example, data analysis control may include receiving a predetermined number of search results for a query, and organizing the predetermined number of search results by checksum values of content of the search results in an ascending or a descending order. A generally final or a generally initial checksum value may be respectively used from the ascending or the descending order of the organized search results to determine a total content number representing an approximate total content of a search related to the query, where the total content number is greater than the predetermined number of search results. Further, the determined total content number may be used to determine a number of sub-tasks needed to complete a full search of the approximate total content.

Abstract: According to an example, data analysis control may include receiving a predetermined number of search results for a query, and organizing the predetermined number of search results by checksum values of content of the search results in an ascending or a descending order. A generally final or a generally initial checksum value may be respectively used from the ascending or the descending order of the organized search results to determine a total content number representing an approximate total content of a search related to the query, where the total content number is greater than the predetermined number of search results. Further, the determined total content number may be used to determine a number of sub-tasks needed to complete a full search of the approximate total content.