Abstract: A computer performs a search and generates a context-aware search result. The computer crawls a plurality of servers to fetch a plurality of knowledge documents, parses the plurality of knowledge documents, and indexes the plurality of parsed knowledge documents in a search index. Parsing can include annotating at least one of the plurality of knowledge documents, and indexing can include building a term index and an annotation index. The computer receives from a requestor a search request including a search term, and requests and receives a context of an asset environment associated with the requestor. The computer determines a context-aware search result based, at least in part, on the search term, on the context, and on information stored in the search index, and transmits the context-aware search result to the requestor.

Abstract: Systems and methods are described for backing up files and directories using a common backup format. The files and directories may be represented by objects within a data stream constructed using the common backup format. The data streams may be traversed and updated using a size tree such that modifications are made to individual objects within the data streams without complete traversal. This process results in efficient management of storage systems as read and write operations are not dependent on exhaustive traversal of data streams.

Abstract: A computer performs a search and generates a context-aware search result. The computer crawls a plurality of servers to fetch a plurality of knowledge documents, parses the plurality of knowledge documents, and indexes the plurality of parsed knowledge documents in a search index. Parsing can include annotating at least one of the plurality of knowledge documents, and indexing can include building a term index and an annotation index. The computer receives from a requestor a search request including a search term, and requests and receives a context of an asset environment associated with the requestor. The computer determines a context-aware search result based, at least in part, on the search term, on the context, and on information stored in the search index, and transmits the context-aware search result to the requestor.

Abstract: A system, method, and computer program product are provided for migrating interdependent data objects from a first device to a second device. In use, at least one first data object to be migrated from a first device to a second device associated with a target code is received. Further, it is determined that the second device associated with the target code requires at least one second data object to be present at least one of before the at least one first data object or at a same time as the at least one first data object. Additionally, the at least one first data object to be migrated from the first device to the second device associated with the target code is stored in a cache. Furthermore, an interdependency event associated with the at least one first data object and the at least one second data object is detected. In response to detecting the interdependency event, the at least one second data object to be migrated from the first device to the second device associated with the target code is received.

Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, a hash table probe phase involves executing vectorized instructions to determine where in a bucket a particular key is located. This determination may be preceded by one or more vectorized instructions that are used to determine whether the bucket contains the particular key.

Abstract: A system and method for the dynamic categorization of heterogeneous, regulated enterprise information assets. In one embodiment of the invention a system includes a computer network controlled by an enterprise and a database including a plurality of enterprise data entities. A user interface, through which a plurality of enterprise users may access the enterprise data entities, is also used by the plurality of users to assign user-defined categories to the enterprise data entities. The user interface is configured to enable a plurality of the users to access and assign additional user-defined categories to enterprise data entities having user-defined categories previously assigned by other users.

Abstract: Techniques for adjusting the frequency of data backups and initiating event-driven backups in a storage system are disclosed herein. In one embodiment, a self-adjusting backup frequency, known as a “Change Rate Objective,” is defined to conduct or delay backups for one or more volumes in the storage system on the basis of an associated policy value. The Change Rate Objective may be tied to one or more business or data activity events, such as the amount and type of data changes since a last backup. The storage system may also be tailored to conduct or delay full or incremental backups on the basis of a Change Rate Objective that measures whether a full or incremental or differential backup is more appropriate. Various data or system failures, or data or business events may also be used to adjust the retention periods of continuous data protection (CDP) data and delay a rollup of CDP data.

Abstract: The present invention provides for quick and efficient searching. One embodiment includes a first instruction configured to read at least a first search string and a second search string entered into a same first search field, and a second instruction configured to incrementally filter search results to locate at least a first document that has a least a first word that begins with the first string and a second word that begins with the second string.

Abstract: A system and method for performing automatic detection, storage, correlation and retrieval of specific electronic communications data from heterogeneous computer systems and storage with non-normalized representation of this data on a computer system running specialized software are provided.

Abstract: A list of elements in a set of elements is matched by means of regular expressions that define respective groups of elements in the set by approximately matching by means of the regular expressions the list of elements by locating recurrences of the regular expressions in the list of elements with a maximum number of matching errors. The matching errors correspond to insertions deriving from the superposition of groups of elements related to different regular expressions. Each time the recurrence of one regular expression is located in the list, the group of elements defined by the regular expression thus located is removed from the list, while leaving in the list those elements corresponding to errors. The approximate matching can be performed by representing each regular expression in terms of Glushkov automata. The method is applicable, e.g.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for updating data stored within the database. In some implementations, actions include determining a cut-off date, defining a first group of data within a first table based on the cut-off date, defining a second group of data within the first table based on the cut-off date, providing the second group of data in a second table, converting the first group of data from a first data structure to a second data structure to provide converted first data within the first table, making the converted first data available for access over a network, converting the second group of data from the first data structure to the second data structure to provide converted second data in the second table, and making the converted second data available for access over the network.

Abstract: The present invention provides a metadata storage system and a management method for a cluster file system. The metadata of the cluster file system is stored by using a DRAM+SSD+HDD three-tier architecture, and the metadata is written sequentially into a metadata buffer in the DRAM based on write-in time. When a metadata buffer fully written, it is written back into the SSD sequentially to form a new metadata storage unit, and corresponding metadata index information in a header structure thereof is stored into the DRAM in a form of a metadata index unit.

Abstract: A method includes providing a source report for display that includes a first plurality of data values each associated with a first context, the first context comprising an intersection of dimensions of a multidimensional database. The method includes receiving a selection of a first data value of the first plurality, and providing a drill-through report for display generated based at least in part on the selected data value. The drill-through report includes a second plurality of data values each associated with a second context comprising an intersection of at least one dimension of the first context and at least one other dimension not in the first context. The method includes receiving an indication of a relationship between the selected data value and the drill-through report, updating the source report to include a graphical representation of the relationship, and providing the updated source report having the graphical representation for display.

Abstract: A multi-function search box on a word page is provided to enable a user to enter a word. The multi-function search box includes a text input control to provide text input functionality. The text input control is capable of suggesting a complete word based on a partially entered word. A dropdown display area is provided in the multi-function search box to display a list of words, every word therein contextually related to the fully entered or partially entered word. Another dropdown display area is provided to display contextually related options for a selected word in the list of contextually related words.

Abstract: In one embodiment the present invention includes a system for transaction recovery in a distributed computing environment. The system includes a transaction log server, application servers, and resource servers. The transaction log server stores a shared transaction log. The application servers implement a distributed transaction application and accesses the shared transaction log when performing a transaction using the distributed transaction application. The resource servers store data and that operate with the application servers to access the data according to the transaction. If one of the application servers fails, another application server assumes responsibility for a portion of the shared transaction log that was previously accessed by the failed application server.

Abstract: An in-memory aggregation (IMA) system having a massive parallel hardware (HW) accelerated aggregation engine uses the IMA for providing maximal utilization of HW resources of any processing unit (PU), such as a central processing unit (CPU), general purpose GPU, special coprocessors, and like subsystems. The PU accelerates business intelligence (BI) application performance by massive parallel execution of compute-intensive tasks of in-memory data aggregation processes.

Abstract: Methods and systems for providing dynamic and category specific search suggestions are provided. According to one embodiment, a partial search query entered by a user can be used to determine a set of relevant search queries, which can be displayed as search suggestions within a search query suggestion window. Each query in the list can be associated with at least one specific category. According to various embodiments, the set of relevant queries and associated categories are dynamically updated as the user modifies the partial search query. Furthermore, each category is selectable by the user such that a detailed list of items associated only with the selected category can be displayed to the user.

Abstract: A regular expression matching method and system, and a searching device are provided. First, the searching device performs string filtering on a data stream to be matched, in which if keywords in the data stream and preset character words have at least one same character, the searching device indicates that the data stream passes through the string filtering. Then the searching device performs regular expression filtering on the data stream passing through the string filtering. In a string filtering process through the method, system, and device, when Hash mapping positions of the keywords of the data stream are a subset of the Hash mapping positions of the character words, it indicates that the data stream passes through the string filtering, and it is not required to store the keywords and further compare the keywords with the character words, thereby saving the storage space and improving performance.

Abstract: A method includes providing a source report for display that includes a first plurality of data values each associated with a first context, the first context comprising an intersection of dimensions of a multidimensional database. The method includes receiving a selection of a first data value of the first plurality, and providing a drill-through report for display generated based at least in part on the selected data value. The drill-through report includes a second plurality of data values each associated with a second context comprising an intersection of at least one dimension of the first context and at least one other dimension not in the first context. The method includes receiving an indication of a relationship between the selected data value and the drill-through report, updating the source report to include a graphical representation of the relationship, and providing the updated source report having the graphical representation for display.

Abstract: A policy language for an information management system allows specifying or more policies using policy abstractions. The policies and policy abstractions are decoupled from one another, so policies and policy abstractions may be specified and altered separately from each other. A policy may refer to any number of policy abstractions. Multiple policies may reference a single policy abstraction, and a change to that policy abstraction will result in multiple policies being changed. Further, policy abstractions may be nested, so one policy abstraction may reference another policy abstraction, and so forth.