Generating a compliance framework. The compliance framework facilitates an organization's compliance with multiple authority documents by providing efficient methodologies and refinements to existing technologies, such as providing hierarchical fidelity to the original authority document; separating auditable citations from their context (e.g., prepositions and or informational citations); asset focused citations; SNED and Live values, among others.

Provided are systems and methods for causing display of an index management graphical user interface (GUI). In one embodiment, a method can be provided. The method can include causing display of an index management GUI including one or more user editable fields for specifying one or more index settings; receiving, via the one or more user editable fields of the index management GUI, one or more user specified index settings; generating an index definition corresponding to the one or more user specified index settings; and distributing the index definition to one or more indexers of a data processing system. The one or more indexers are able to manage storage of data in one or more indexes based at least in part on the index definition.

Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together.

A method, system and computer program product for building a data query engine. Initial taxonomies that describe and categorize data are built by expert users (e.g., data scientists) employing machine learning algorithms. The data is also indexed and stored in an index. Queries are then received from non-expert users to query the data based on data categorization from built taxonomies and the indexing. After the queries are executed using the machine learning algorithms in an environment (e.g., Hadoop), the results of the queries are rated for relevance, precision and accuracy. The machine learning algorithms are also rated based on the number of successful queries. Those machine learning algorithms with a rating above a threshold are identified to be utilized to scan new data to be stored in the index to provide a new environment that replaces the initial environment.

Systems and methods which provide secure queries with respect to encrypted datasets are described. Embodiments provide privacy-assured similarity join techniques operable with large-scale encrypted datasets. A privacy-assured similarity join technique of embodiments enables a storage system to answer similarity join queries without learning the content of the query dataset and the target dataset. One or more secure query schemes may be implemented in accordance with a privacy-assured similarity join technique herein. For example, embodiments may utilize an individual similarity query scheme, a frequency hiding query scheme, and/or a result sharing query scheme. A particular secure query scheme of the foregoing secure query schemes may be utilized to address different considerations with respect to security, efficiency, and deployability with respect to various applications and scenarios with different requirements.

A method for searching encrypted data includes identifying, with a client, a plurality of values within a predetermined search range in a search index stored within a memory of the client, each value in the plurality of values being present in a plaintext representation of at least one encrypted file in a plurality of encrypted files stored in a server. The method further includes generating and transmitting at least one search query to the server through a data network, and receiving, with the client, at least one response from the server through the data network, the response including the encrypted keyword corresponding to the value in the plurality of values and an identifier of at least one file in the plurality of encrypted files stored on the server that includes the value.

A system to organize, search and display unstructured data comprising a token retrieval module, a document indexing engine, a subspace search module and a user interface module has been devised. The system retrieves a plurality of tokens and associates them with coordinates in subspace. It also retrieves documents and creates a multidimensional matrix of documents and tokens where each cell contains the number of times the token occurs in each document. That matrix is employed in a search using user specified search terms. The search results are displayed such that the search tokens occupy specific spatial coordinates and documents spatial coordinates are dictated by the relative preponderance of each search term in each document.

A non-transitory computer-readable recording medium stores a compressing program that causes a computer to execute a process including: extracting words from a file serving as a processing target; counting how many times each of the extracted words appears; registering bit strings each expressing, in multiple bits, the number of times of appearance into an index so as to be kept in correspondence with the words and the file; among the plurality of bit strings registered in the index while being kept in correspondence with the words and the file, each rearranging, within the bit string, bits included in a first bit string and bits included in a second bit string, so as to be in a different order; and compressing the index in which the bits have been rearranged, by using mutually-different mathematical functions.

One embodiment provides a method that includes obtaining information including profile information and current event information. A processor generates a topic graph by converting the information to topic nodes in the topic graph. The processor determines a weight assignment for each topic node based on ratios of sums of weights of edges from topic nodes. Bridges are provided from a given topic node to a neighbor based on the weight assignment.

A non-transitory computer-readable recording medium stores a data search program that causes a computer to execute a process including: receiving a search character string for target text data; and searching for the search character string by a logical operation between index information associated with appearance positions in the target text data of each of characters or words appearing in the target text data as bitmap data and search bitmap data generated to be associated with an appearance order in the search character string of respective characters or respective words constituting the search character string.