Abstract: A system, method, and computer-readable medium, including authoring and consolidating a semantic layer universe and at least one semantic layer extension (e.g., a collection of semantic layer entities) created on top of the objects of the semantic layer universe, the semantic layer universe and the one or more semantic layer extensions being linked via a repository relationship; and dynamically presenting a consolidated view of relevant objects from the semantic layer universe and possibly entities of the at least one semantic layer extension to provide a user with additional querying metadata.

Abstract: The present disclosure provides solutions for determining the divergence (delta) between the current and previous reference data structures for mutable data in a search head. A method is provided that includes updating a pre-existing lookup table in a search head, generating a delta file that identifies the divergence between the updated and previous lookup table, and distributing the delta file to other components in the search environment. The compatibility of the delta file is checked with the local instance of the lookup table in each search component, and the lookup table is applied if compatibility is determined. However, if the delta file is determined to not be compatible with the current version of a local lookup table in an indexer, the entire lookup table sent to the requesting indexer instead.

Abstract: Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.

Abstract: A data management system that is enabled such that the user can select a data source node, a repository and a data path, choose policies for each and distribute the policies to be managed by the management system.

Abstract: Embodiments of the present specification disclose random walking and a cluster-based random walking method, apparatus and device. A solution includes: obtaining information about each node included in graph data, generating, according to the information about each node, an index vector reflecting a degree value of a respective node, then generating an element vector reflecting an identifier of an adjacent node of the node, and generating a random sequence according to the index vector and the element vector, to implement random walks in the graph data. The solution is applicable to clusters and individual machines.

Abstract: Case management systems and techniques are disclosed. In various embodiments, searching case instances is facilitated. An indication to create a composite index across hierarchical case nodes comprising a case model is received. Case instance data associated with the case model is used to generate the composite index. The composite index is made available to be used to optimize searches of a plurality of case instances with which the case instance data is associated.

Abstract: A method of adding informative content to an electronic knowledge base includes generating a plurality of database tables from a plurality of websites, each database table based on a corresponding website, and individually processing each database table to identify potentially informative content from each database table. The method further includes identifying as informative content, the potentially informative content that is included in a first predetermined number of the database tables of the plurality of database tables, the first predetermined number being greater than one, and adding the informative content to the electronic knowledge base.

Abstract: A system for providing sensor data analysis to a plurality of users is disclosed. The system includes comprising an interface for receiving sensor data from a plurality of sensors distributed over a plurality of localities, a locality being associated with one or more sensors; a data storage configured to store said sensor data in association with a plurality of nodes, one node being associated to one locality, and sensor data from one specific sensor being associated to the corresponding node, and to store for each node a relationship to itself and to all its sub-nodes as part of a hierarchical structure of said nodes; and a processing entity configured to run one or more instances for each of a plurality of users, each instance accessing said data storage for analyzing the sensor data in response to a user request.

Abstract: The present invention discloses a system for identifying, associating, searching and presenting documents based on relation combination, which builds a computer system-based knowledge management system in a professional field and improves the learning efficiency and utilization of professional knowledge. The technical solution includes finding a series of documents having an inter-document logical relationship with a group of specific keywords from massive documents in a keyword search manner, and naming a relation graph among the specific series of documents with a group of keywords strongly correlated therewith; combining, into one set, a plurality of inter-document relation graphs of which the names have a group of like term keywords and which have specific logical relationships among one another, and naming the same with the group of like term keywords in a certain logic order.

Abstract: The present invention discloses a system for identifying, associating, searching and presenting documents based on time sequentialization, which builds a computer-based knowledge management system for a professional field and improves the learning efficiency and utilization of professional field knowledge. The technical solution of the present invention includes finding a series of documents having an inter-document logical relationship with a group of specific keywords from massive documents in a keyword search manner, and naming a relation graph among the specific series of documents with a group of keywords strongly correlated therewith, and presenting the inter-document relation graph in time sequence in accordance with evolved versions; combining into one set a plurality of inter-document relation graphs of which the names have a group of like term keywords and which have specific logical relationships among one another, and naming the same with the group of like term keywords in a certain logic order.

Abstract: Data stream quality management for analytic environments includes an ingress quality specification (IQS) module with a data stream analytic module. The analytic module has a data quality expectation for data of the data stream and receives the data stream from the IQS module. A selector module receives the data stream from an object and selects a subset of the received data stream. A predicate module applies a predicate to the subset to determine if the subset meets the quality expectation of the analytic module. The predicate module modifies the subset of data by annotating the subset to indicate a quality status based on whether the subset meets the quality expectation. The IQS module outputs the data stream with the annotated subset of data to the analytic module. The analytic module outputs an analysis of the object based on whether the annotated subset of data met the quality expectation.

Abstract: Example embodiments of the present invention relate to a method, a system, and a computer program product for verifying the integrity of replicated virtual machine data. The method includes reading data from a production volume at a production site. A representation of the data may be stored at a replica site with the integrity of the data stored in the replica volume being verified according to the representation of the data.

Abstract: Example embodiments of the present invention relate to a method, a system, and a computer program product for data protection. The method includes creating a snapshot of a volume and maintaining the snapshot as a logical point in time copy of the volume for data protection of the volume.

Abstract: An electronic content delivery system is disclosed where electronic content is delivered to accounts based on a destination physical address or a destination electronic address, wherein the electronic addresses correspond to the physical addresses. Thus, as people change physical addresses, the electronic address will remain with the physical address rather than stay with the user at the new physical address. Instead, if a user moves to a new physical address, the user will become associated with a new electronic address (where the new electronic address for the user will be the electronic address corresponding to the user's new physical address).

Abstract: Example embodiments of the present invention relate to a method, a system, and a computer program product for copy data management. The method includes creating a snapshot of a volume and exposing the snapshot of the volume as a writable copy of the volume.

Abstract: In one embodiment, a router operating in a hierarchically routed computer network may receive collected data from one or more hierarchically lower devices in the network (e.g., hierarchically lower sensors or routers). The collected data may then be converted to aggregated metadata according to a dynamic schema, and the aggregated metadata is stored at the router. The aggregated metadata may also be transmitted to one or more hierarchically higher routers in the network. Queries may then be served by the router based on the aggregated metadata, accordingly.

Abstract: A system and method for migrating data objects based on portions of the data objects is described. The system may transfer portions of files, folders, and other data objects from primary storage to secondary storage based on certain criteria, such as time-based criteria, age-based criteria, and so on. An increment may be one or more blocks of a data object, or one or more chunks of a data object, or other segments that combine to form or store a data object. For example, the system identifies one or more blocks of a data object that satisfy a certain criteria, and migrates the identified blocks. The system may determine that a certain number of blocks of a file have not been modified or called by a file system in a certain time period, and migrate these blocks to secondary storage.

Abstract: Described are a method, network system, and computer program product for deduplication of storage objects in a network. A hash of a window of data of a storage object is determined and a determination is made as to whether the window of data of the storage object corresponds to a chunk boundary. A determination is made as to whether the hash of the object matches one pseudo fingerprints in a list of at least one pseudo fingerprint. A storage object chunk boundary based on the window of data is stored in response to the window of data corresponding to the chunk boundary or in response to determining that the hash of the object matches one of the pseudo fingerprints. A determination is made of a new window of data in the storage object following the window of data when the window of data is not an end of data of the storage object.

Abstract: Method of retrieving event information is presented. Memento objects can be recognized by an archive engine. Based on the recognition, the archive engine obtains information related to the memento object, possibly one or more recognizable features, and uses the information to search for events associated with a timeline that have corresponding tags. The archive engine can then return the event information as a result set to a user.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.