Abstract: In response to an I/O request, a processor reconstructs a file system request by laying out a disk image, performing type-specific introspection on the disk image including determining disk image type and using a file system specific process for a particular type of file system located in the disk image for analyzing the disk image structure.

Abstract: A system serializing and deserializing models configured to (i) store a first model, wherein the first model includes a plurality of functionalities; (ii) generate a human-readable document based on the first model, wherein the human-readable document describes the first model; (iii) generate a second model based on the human-readable document, wherein the second model includes the plurality of functionalities; (iv) train the second model; (v) generate a new human-readable document based on the trained second model; and (vi) generate an updated second model based on the new human-readable document.

Abstract: In one embodiment, a computer-implemented method for server migration includes the step of, with an agent running inside a server, capturing a server image of the server, wherein the server image is independent of a source-compute infrastructure. The method includes the step of transferring the server image to a dedupe store. The method includes the step of transforming the dedupe stream of the server image into a bootable server image on a target compute infrastructure. The method includes the step of generating a recovery set of disks on the target compute infrastructure. The method includes the step of creating a recover-process server on the target compute infrastructure using a recovery set of disks.

Abstract: The present disclosure provides a method, a terminal device and a storage medium for mining an entity description tag. The method includes: acquiring a group of one or more core words corresponding to each field and a first syntax dependent template corresponding to each core word; performing a matching on each data in a first data source by using the first syntax dependent template to determine a first description tag set in each field; performing a recognition on each data in a second data source to determine an entity set; determining a second description tag set based on a matching degree between each description tag in the description tag set of each field and each data in the second data source; and determining an entity description tag set based on a correlation between each entity in the entity set and each description tag in the second descriptive tag set.

Abstract: A method includes obtaining a query containing at least one field from which data is being queried, obtaining a dataset having a schema-free data exchange format having multiple fields of data at different physical positions in the dataset, and parsing the dataset by obtaining a structural index that maps logical locations of fields to physical locations of the fields of the dataset, accessing the structural index with logical locations of the fields that index to the physical locations, and providing data from the fields based on the physical locations responsive to the query.

Abstract: The current document is directed a resource-exchange system that facilitates resource exchange and sharing among computing facilities. The currently disclosed methods and systems employ efficient, distributed-search methods and subsystems within distributed computer systems that include large numbers of geographically distributed data centers to locate resource-provider computing facilities that match the resource needs of resource-consumer computing-facilities based on attribute values associated with the needed resources, the resource providers, and the resource consumers. The resource-exchange system monitors and controls resource exchanges on behalf of participants in the resource-exchange system in order to optimize resource usage within participant data centers and computing facilities.

Abstract: Techniques herein are for fast processing of path-finding queries in large graph databases. A computer system receives a graph search request to find a set of result paths between one or more source vertices of a graph and one or more target vertices of the graph. The graph comprises vertices connected by edges. During a first pass, the computer system performs one or more breadth-first searches to identify a subset of edges of the graph. The one or more breadth-first searches originate at the one or more source vertices. After the first pass and during a second pass, the computer system performs one or more depth-first searches to identify the set of result paths. The one or more depth-first searches originate at the one or more target vertices. The one or more depth-first searches traverse at most the subset of edges of the graph.

Abstract: The present disclosure relates to systems and methods for enhanced mapping of transaction data to a target document, and for classifying line items of the mapped transaction data, using classification algorithms. Embodiments provide a system including a column mapping module to receive a target scheme specifying a target structure for the target document, receive transaction data having a source structure, and map at least one source column to at least one target column of the target columns based on application of classification algorithms to features identified from the source transaction data. The system also includes a row classification module to classify the rows of the mapped transaction data into classification categories. The system also includes a validation handler to receive validation input from a user, validating the column mapping and/or the row classification. The validating including accepting the recommendation or rejecting the recommendation and selecting a correct choice.

Abstract: Cardinality values can be derived from an approximate quantile summary. An approximate quantile summary can be generated for a column of a database table at data ingestion, data update, upon request, in response to a query, and in various other scenarios. When a query is received that includes a predicate directed to the column of the approximate quantile summary, a cardinality value may be derived from the boundary values of one or more quantiles that include the predicate. The cardinality value may then be used to select a query plan. The query may be performed according to the selected query plan.

Abstract: Capacity management is provided for a plurality of search trees under multi-version concurrency control. A non-volatile memory includes a plurality of chunks that are fixed-sized blocks of the non-volatile memory, each chunk including at least one page. The non-volatile memory stores the plurality of search trees, each search tree having elements including a tree root, a tree node and a tree leaf. Each element of the tree is at a different level of the search tree: a first level including the tree root, a second level including the tree node, and a third level including the tree leaf. The plurality of chunks includes a number of chunk types, each chunk type for storing the element from a different level of the search tree, such that elements from different levels are stored in separate chunks.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for managing data deliver for data constrained user devices. In one aspect, a method includes the actions of receiving, from a user device, requests for resources. For each of the requests, determining whether the user device is currently subject to a data constraint for receiving data responsive to the request. For each request for which the user device is determined to be subject to the data constraint, provide data that causes the user device to display a prompt to choose whether a resource responsive to the request is to be provided in the unrestricted data form or a restricted data form. A resource can be provided in an unrestricted data form has a first data size and provided in a restricted data form has a second data size that is less than the first data size.

Abstract: A database management system for processing large volumes of data in a key-value store database is provided. The system may be configured to receive a plurality of filled fillable request forms where each request form may include a request including a plurality of field labels and a plurality of fillable text fields corresponding to each of the plurality of the field labels. The system may be configured to extract each set of inputted data from each fillable text field. The system may be configured to store, in the key-value store database, for each request form, each of the plurality of field labels and the corresponding set of inputted data as a combination key-value pair. The combination key may be equal to a WIP ID number, form ID number and field ID number. The corresponding value may be equal to the set of data of the corresponding field ID number.

Abstract: Described herein are methods and system for electronic file management having a central server that periodically scans files accessible to multiple computers to identify every file stored onto multiple electronic data repositories. The central server then executes a predetermined protocol to generate a unique identifier for each identified file. The central server then generates an interconnected nodal data structure computer model where each node represents an identified file and where the nodes are linked based on their respective files having similar unique identifiers. The central server periodically scans the electronic data repositories to identify related data. When a related file is identified, the central server modifies the nodal data structure accordingly. When a user requests access to a file, the central server displays all related data to the requested file.

Abstract: An affinity calculation apparatus for calculating a degree of affinity between a first element and a second element that are not directly relevant among three or more elements includes: an extraction section configured to extract, from a document, relevance of each of pairs of two directly relevant elements of the three or more elements; and a calculation section configured to calculate the degree, of the pairs, based on the relevance of each of pairs of two elements of the first element, the second element, and one or more intermediate elements that lie between the first element and the second element.

Abstract: A method of providing a user with information related to one or more activities is provided. The method comprises identifying one or more activities; calculating a locality for the user for each activity; identifying a subset of the activities based on the respective locality for each activity; and providing information related to at least one of the subset of the activities to the user.

Abstract: The disclosed embodiments relate to a system that preprocesses sensor data to facilitate prognostic-surveillance operations. During operation, the system obtains training data from sensors in a monitored system during operation of the monitored system, wherein the training data comprises time-series data sampled from signals produced by the sensors. The system also obtains functional requirements for the prognostic-surveillance operations. Next, the system performs the prognostic-surveillance operations on the training data and determines whether the prognostic-surveillance operations meet the functional requirements when tested on non-training data. If the prognostic-surveillance operations do not meet the functional requirements, the system iteratively applies one or more preprocessing operations to the training data in order of increasing computational cost until the functional requirements are met.

Abstract: Aspects generating a container structure wherein processors are configured to compare attributes of a new container to attributes of each of plurality of existing containers within a container model as a function of a weighted Jaccard co-efficient distance matrix. The aspects identify a neighbor subset of the model containers that each have attributes that are nearest to the new container attributes, relative to remaining others of the model containers; select, as a nearest container, a container of the neighbor subset that has closest matching statistical properties to statistical properties calculated for the new container attributes; and generate a sizing recommendation for the new container to meet future utilization needs predicted as a function of usage pattern data of the nearest container.

Abstract: Data is collected from a set of devices according to a data collection policy. The data is associated with device configuration, device state, or device behavior. A norm is established using the collected data. A different data collection policy is established based on the norm. Data is collected from a particular device according to the different data collection policy. The norm is compared to the data collected from the particular device. If there is a deviation outside of a threshold deviation between the norm and the data collected from the particular device, a message is transmitted to an administrator.

Abstract: An online system stores documents for access by users. The online system also stores query independent information about the documents. Query independent features include data that can be used to score or rank a document independent of any terms entered as a search query. The online system periodically determines whether the values of query independent features have changed, such as by checking activity logs. The online system updates records of query independent features accordingly, and sends information about the updated records to an enterprise search platform for re-indexing. When a user sends a search query to the online system, the enterprise search platform determines whether documents are relevant to the query based on the document contents and the query independent features associated with the documents.

Abstract: A KVS tree and operations thereon are described herein. A key-value set (kvset) is received to store in a key-value data structure on at least one machine readable medium. The kvset includes a mapping of unique keys to values with the keys and the values of the kvset being immutable. The key-value data structure is organized as a tree with nodes of the tree including a temporally ordered sequence of kvsets. The kvset, once received, is written to a sequence of kvsets of a root-node of the tree.