Abstract: A file management system that provide a record file rapidly to a terminal, request source, by saving a record file to a storage device set at the local area, and to make it possible to refer it. A first device creates the record file and attribute information indicating the attribute about the record file, stores the record file in a first storage unit, and transmits the attribute information to the second device through the network. A second device receives the attribute information and the record file transmitted from the first device and stores them in a second storage unit. The terminal requests to acquire the record file based on the acquired attribute information to the first device or the second device. The first device or the second device transmits the record file requested to the terminal.

Abstract: Sub-block partitioning for hash-based deduplication is performed by defining a minimal size and maximum size of the sub-block. If one of a plurality of search criteria is satisfied by one of a plurality of hash values, declaring a position of the hash value as a boundary end position of the sub-block. If the maximum size of the sub-block is reached prior to satisfying one of the multiple search criteria, declaring a position of an alternative one of the hash values that is selected based upon another one of the multiple search criteria as the boundary end position of the sub-block. One of the plurality of search criteria is satisfied if n bits at predefined positions of a value calculated by applying an XOR operation on last calculated k hash values are equal to one of an mth predefined different patterns of bits.

Abstract: Methods, systems and programming for providing a search result based on user selection of query suggestions. In one example, a query is received from a user. A plurality of query suggestions generated based on the query is obtained and provided to the user. A selection of one or more query suggestions from the plurality of query suggestions is received from the user. A first search result generated based on at least one of the one or more query suggestions is obtained and provided to the user.

Abstract: A method is used in recovering file mapping information in file systems. Metadata of a file of a file system is evaluated. Mapping information associating the file to a file system hierarchy of the file system is missing a reference to an inode of the file. Based on the evaluation, the mapping information is updated for including the file to the file system hierarchy of the file system.

Abstract: Techniques described herein relate to generating new assessment items and updating existing assessment items. Input data may be received corresponding to the addition, removal, or modification of assessment components within assessment items, and may cause immediate generation and validation of corresponding markup language data blocks, thereby allowing for interactive construction and automated encoding of assessment items. Additional techniques described herein relate to determining compatible scoring types for assessment items and generating and embedding markup language data blocks corresponding to assessment item scoring data.

Abstract: Systems and methods are described for obtaining, for insertion into a schema-less database, a data object that comprises a plurality of key and value pairs. The method also includes hashing the keys associated with the plurality of key and value pairs. The hashing includes executing a hash function to generate a hashed data object. The method also includes comparing the hashed data object to a plurality of first hashed data objects and determining that the hashed data object does not match any of the first hashed data objects. Based on the determining, the method includes associating the hashed data object with the first hashed data objects to generate second hashed data objects and generating a schema for the database. The schema includes a hierarchy of keys that represent the second hashed data objects.

Abstract: Example apparatus and methods concern dynamically expiring crowd-sourced content (CSC) in a crowd-sourced database. An example apparatus may include logic for acquiring the CSC, where the CSC is data produced by a mobile device concerning a point of interest. The example apparatus also includes logic for producing an evaluation of the CSC and logic for determining an expiration criteria based on the CSC, the evaluation, and the user. The CSC may be data about a point of interest. The evaluation may be based on the completeness, timeliness, or contents of the CSC. The expiration criteria may be established based on the evaluation of the CSC and a user profile. The expiration criteria or user profile may be manipulated based on confirmation or repudiation of the CSC by a different user or by curation of the CSC.

Abstract: Systems, methods, and media for managing an in-memory NoSQL database are provided. In some embodiments, systems for managing an in-memory NoSQL database are provided, the systems comprising a hardware processor that is configured to: identify a group of keys capable of being included in a complex multi-key database command, the group including a first key and a second key, the first key being associated with a first value and the second key being associated with a second value, the first value and the second value being stored on different servers that are part of the database; and cause the first value and the second value to be both stored on a given server.

Abstract: Embodiments relate to data processing. A method includes analyzing a plurality of data items in a relational database, where different portions of the data items are stored in a plurality of servers. The method also includes determining a maximum size of a subset of the data items stored in each of at least two servers among the plurality of servers, calculating a logarithm function based on the maximum size of the subset of the data items in each of the two servers, and calculating a highest number of sequences of communications between the two servers such that when the logarithmic function is iteratively applied, a value of the logarithmic function remains smaller than one. A protocol is then generated between the two servers for performing an intersection operation using the highest number of sequences calculated.

Abstract: Embodiments relate to data processing. A method includes analyzing a plurality of data items in a relational database, where different portions of the data items are stored in a plurality of servers. The method also includes determining a maximum size of a subset of the data items stored in each of at least two servers among the plurality of servers, calculating a logarithm function based on the maximum size of the subset of the data items in each of the two servers, and calculating a highest number of sequences of communications between the two servers such that when the logarithmic function is iteratively applied, a value of the logarithmic function remains smaller than one. A protocol is then generated between the two servers for performing an intersection operation using the highest number of sequences calculated.

Abstract: There is described a device and method for assigning a tag to a media file associated with metadata describing features of the media file. The metadata is converted into a query feature vector associated with the media file. A weighted distance is calculated between the query vector and each of a plurality of tag feature vectors, where each tag feature vector is included in a tag instance stored in a database, each tag instance further comprising a tag and a weight vector. The weighted distance is determined by comparing each feature of the query vector with the corresponding feature in the tag feature vector to obtain an initial distance value for that feature, modifying the initial distance value by a weight for that feature obtained from the weight vector in the tag instance to obtain a comparison value for that feature, and combining the comparison values of all of the features to obtain the weighted distance.

Abstract: In a compression processing storage system, using a pool of compression cores, the compression cores are assigned to process either compression operations, decompression operations, or decompression and compression operations, which are scheduled for processing. A minimal number of the compression cores are allocated for processing the compression operations, thereby increasing compression latency. Upon reaching a throughput limit for the compression operations that causes the minimal number of the plurality of compression cores to reach a busy status, the minimal number of the plurality of compression cores for processing the compression operations is increased.

Abstract: A file management system that transmits a record file of voice data or image data created by a local device to a center device over a network and manages the record file in the center device. A first device creates the record file and attribute information indicating the attribute about the record file, stores the record file in a first storage unit, and transmits the attribute information to the second device through the network. A second device receives the attribute information transmitted from the first device and stores it in a second storage unit. The second device receives the record file transmitted from the first device according to transfer condition that is beforehand determined and store it in the second storage unit. A terminal may acquire the record file by using the attribute information.

Abstract: A system comprises a processor and a memory. The processor is configured to decompress a precompressed file; recompress the decompressed file; and determine a difference file. The memory is coupled to the processor and configured to provide the processor with instructions.

Abstract: A technique is described that simplifies the process for applying predictive analysis to a dataset. The technique can recommend multiple templates to a user. Each recommend template contains algorithms which can be applied to the dataset. When a template is selected, the technique can rank the available algorithms of the selected template based on factors such as values in the dataset, characteristics of the dataset, and the usage history of the dataset or the algorithms in prior instances. The technique can automatically select the highest ranked algorithm and apply it to the dataset. In some examples, input parameters used to configure the algorithm can also be automatically selected.

Abstract: A method and apparatus for identifying relationships among entity instances of a plurality of entities in a database. A plurality of entity reference relationship structures is accessed. Each entity reference relationship structure includes at least a pair of entity instance identifiers that identifies a relationship between entity instances of a pair of entity structures of a plurality of entity structures. All complete graphs among all subsets of the plurality of entity structures are identified. Each complete graph includes at least one edge corresponding to an entity reference relationship structure, and two vertices connected by the at least one edge that correspond to entity structures between which the entity reference relationship structure establishes a relationship. For each complete graph, all matched sets of pairs of entity instance identifiers are determined. The entity instance identifiers in each matched set are stored in association with each other in an entity relationship structure.

Abstract: Disclosed is a virtual file system integrating and managing multiple cloud storages. A virtual file system may comprise an API database storing information on open API of the cloud storages, a storage state database storing state information of the cloud storages, a metadata database storing metadata of the cloud storages, a cloud storage allocation part receiving an user request and selecting a cloud storage appropriate for the user request among the cloud storages by referring to the storage state database and the metadata database, and an API mapping part reading out open API information of the cloud storage selected by the cloud storage allocation part from the API database, converting the user request to an open API of the selected cloud storage, and transferring the converted open API to the selected cloud storage.

Abstract: A computer system extracts contender values as positively associated with a pre-defined value from a compilation of one or more electronically stored semi-structured document(s) and/or one or more electronically stored unstructured document(s). The computer system performs a multi-dimensional analysis to narrow the universe of contender values from all words on a page of the compilation to the contender value(s) with the highest likelihood of being associated with the pre-defined value. The system's platform allows every user of the system to customize the system according to the user's needs. Various aspects can enable users to mine document stores for information that can be charted, graphed, studied, and compared to help make better decisions.

Abstract: The invention relates to a method and a system for managing data and a corresponding computer program and a corresponding computer-readable storage medium, which can be used, in particular, to simplify the data management on a remote storage system when accessing the storage system from a terminal. For this purpose, a method for managing data is proposed, wherein the data on a remote storage device are managed from a terminal, and wherein by an application installed on the terminal, when the data stored at a storage location on the remote storage device are accessed by the terminal, at least an identifier of the data and information about the storage location of the data are stored by the application and made available to a user when storing the optionally modified data, particularly when writing back the optionally modified data on the remote storage.

Abstract: Enhanced search system and method based on entity ranking that accepts votes for online and offline users and calculates rankings for user attributes that are used to provide highly valued search results. An input is received from a user indicating an opinion of another user or plurality of other users. In one embodiment, reputation scores are weighted by the reputation scores of voters. In another embodiment, weights are derived from voter reputation scores in the domain in which the voting took place. In another embodiment, reputation scores are adjusted according to a plurality of factors, including, but not limited to, user demographics or user behavior.