Abstract: Provided are systems and methods for managing asynchronous replication in a distributed database environment, wherein a cluster of nodes are assigned roles for processing database requests. In one embodiment, the system provides a node with a primary role to process write operations against its database, generate an operation log reflecting the processed operations, and permit asynchronous replication of the operations to at least one secondary node. In another embodiment, the primary node is the only node configured to accept write operations. Both primary and secondary nodes can process read operations. Although in some settings read requests can be restricted to secondary nodes or the primary node. In one embodiment, the systems and methods provide for automatic failover of the primary node role, can include a consensus election protocol for identifying the next primary node. Further, the systems and methods can be configured to automatically reintegrate a failed primary node.

Abstract: Provided are a data discard method for a file system and a memory management apparatus thereof. Specifically, the data discard method for a file system includes: unlinking an inode and a data block corresponding to a file stored in a storage from among inodes and data blocks in a file system when a kernel event of deleting the file occurs; updating state values for the unlinked inode and data block, respectively, to a bitmap block of the file system; checking bit values of all of inodes in an inode block including the updated inode from among inode blocks of the file system; and transmitting discard commands with respect to the inode block including the updated inode and the data block, respectively, to the storage if all of the inodes of the inode block are clean bits as a result of the check.

Abstract: A method for cleaning data stored in a database, the method comprising providing a set of fixing rules. Each fixing rule incorporates a set of attribute values that capture an error in a plurality of semantically related attribute values, and a deterministic correction which is operable to replace one of the set of attribute values with a correct attribute value to correct the error. The method further comprises comparing at least two of the fixing rules with one another to check that the error correction carried out by one fixing rule is consistent with the error correction carried out by another fixing rule.

Abstract: A method for generating a query of a genomic data store includes receiving, by a query generator executing on a computing device, from a graphical user interface, an identification of a first entity of a first entity class for inclusion in a resource description framework (RDF) query. The method includes receiving from the graphical user interface, an identification of a second entity of the first entity class, the second entity having a bi-directional relationship with the first entity. The method includes automatically generating an RDF query based upon the received identification of the first entity and the received identification of the second entity. The method includes executing the RDF query to select, from a plurality of genomic data sets, at least one genomic data set for at least one patient cohort. The method includes providing a listing of genomic data sets resulting from executing the RDF query.

Abstract: A time code to byte conversion system is provided herein that maps time codes to byte ranges such that a user device can retrieve a portion of, but not all of, a media file by specifying a time range. For example, the time code to byte conversion system can play a media file and identify the byte at which each time code begins. The time code to byte conversion system can then store the byte to time code mapping in an index accessible by a media retrieval server. A user device can then provide a time range to the media retrieval server, the media retrieval server can query the index to identify the range of bytes that corresponds to the provided time range, and then the media retrieval server can retrieve the identified range of bytes from a media database for transmission to the user device.

Abstract: The Database, Data Structure and Framework Transformer Apparatuses, Methods and Systems (“DDSFT”) transforms variable list request, population selection, base table transform extract data inputs via DDSFT components into transformed, merged data outputs. The DDSFT includes a database structure that stores data used in the framework operations. A macro-tool includes one or more macros that control a sequence of database queries that extract the data from the database structure and then perform transformations on the extracted data. The macro-tool includes a series of binary flags indicative of whether or not statements are executed.

Abstract: A collaboration system for information sharing in an enterprise is disclosed. The collaboration system includes a monitoring module configured to monitor a communication for one or more parameters. The collaboration system further includes an information management module configured to select one or more data items from one or more databases based on the one or more parameters, wherein each of the data items includes an associated score. The collaboration system further includes a ranking module configured to score the one or more selected data items. The collaboration system further includes a database management module configured to update the one or more databases with the score of the one or more selected data items.

Abstract: A distributed storage system may store data object instances in persistent storage and may cache keymap information for those data object instances. The system may cache a latest symbolic key entry for some user keys of the data object instances. When a request is made for the latest version of stored data object instances having a specified user key, the latest version may be determined dependent on whether a latest symbolic key entry exists for the specified user key, and keymap information for the latest version may be returned. When storing keymap information, a flag may be set to indicate that a corresponding latest symbolic key entry should be updated. The system may delete a latest symbolic key entry for a particular user key from the cache in response to determining that no other requests involving the keymap information for data object instances having the particular user key are pending.

Abstract: Described herein are methods and systems allowing a company to market and advertise its brands, products and/or services in a mobile platform by use of an application converting a user input into a corresponding branded icon, logo or image and displaying the same. The user input is in the form of a text entry from the device keyboard, e.g., a brand name or a generic search word, or a voice or sound input or audio demand from the device speaker. By providing various menu functions associated with the displayed icons, logos or images, the application combines mobile texting with online search or browsing to provide for a much simpler and more convenient mobile experience.

Abstract: From a directional acyclic graph (DAG) corresponding to a data volume, a matrix of relationships of a first node and a second node is computed. The DAG includes a set of nodes and a set of directional edges, the set of nodes including the first node and the second node. An inverted matrix is computed from the matrix, which retains values in only those column positions where a value in a first row corresponding to the first node is opposite of a value in a second row corresponding to the second node. From the first row, a first cluster of nodes related to the first node is constructed by selecting nodes corresponding to those columns where the first row has a value indicating an affirmative relationship. Information representing the first cluster of nodes a second cluster of nodes are output.

Abstract: A method receives ratings for videos from a first user that is using a video delivery service. A first model includes connection networks where each connection network corresponds to a rating. The method inputs each rating into a connection network in an order. Also, parameters for the ratings and ratings other than the rating received from the first user are modeled in a respective connection network. Values for the set of parameters are trained such that the plurality of connection networks predict conditional probabilities that the first user would provide the rating corresponding to the each connection network in the order. The conditional probabilities are based on the first user providing ratings that are previously located in the order. The parameters are then used to generate a list of videos to recommend to the first user using the first model.

Abstract: A computerized system (e.g. implementing a database management system, abbreviated as DBMS) and a method of operating the system is disclosed for allowing predictive execution of instructions and/or queries. As disclosed herein, in predictive execution mode (also referred to herein as “predictive mode”), instructions and/or queries are executed by the computerized system (e.g. a DBMS) before a request to execute the instructions and/or queries is received from an external entity (e.g. host).

Abstract: Roughly described, a system for user identification of a desired document. A database is provided which identifies a catalog of documents in an embedding space, the database identifying a distance in the embedding space between each pair of documents corresponding to a predetermined measure of dissimilarity between the pair of documents. The system presents an initial collection of the documents toward the user, from an initial candidate space which is part of the embedding space. The system then iteratively refines the candidate space using geometric constraints on the embedding space determined in response to relative feedback by the user. At each iteration the system identifies to the user a subset of documents from the then-current candidate space, based on which the user provides the relative feedback. In an embodiment, these subsets of documents are more discriminative than the average discriminativeness of similar sets of documents in the then-current candidate space.

Abstract: Embodiments relate to a system, program product, and method for use with an intelligent computer platform to decipher analogical phrases. An analogy list is obtained, each analogy within the analogy list having a known meaning, and receiving an analogy phrase. A verb is identified within the phrase and a verb definition list is generated. A subject is identified within the phrase and a subject definition list is generated. An adjective is identified within the phrase and an adjective definition list is generated, including filtering adjectives to accept adjective definitions associated with the identified subject. A set of outcomes is identified, incorporating the verb definition, subject definition, and adjective definition, and a corpus is searched for evidentiary use. The outcomes are ranked in accordance to evidentiary use found in the corpus the highest ranked outcome is outputted.

Abstract: Disclosed herein are system, method, and computer program product embodiments for synchronizing an unsynchronized distributed database system. An embodiment operates by locking, by a second node, partitions in the second node based on first information received from, a first node responsive to execution of partition utility based on a first query received by the first node. Blocking, by the second node, a second query to a data portion of the partitions in the second node based on the first information. Locking, by the second node, second node object metadata based on second information received from the first node. Receiving, by the second node, changes to first node object metadata and applying the changes to the second node object metadata. Unlocking, by the second node, the partitions in the second node and the second node object metadata while unblocking the second query.

Abstract: Methods and systems are provided for migrating data between systems without downtime. Data migration may be performed by selecting one or more data records for migration from a first record system to a second record system, and copying the one or more data records from the first record system to the second record system in manner where the data record remains accessible and available during the migration. The migrating may comprise verifying each copied data record, and when the data record is successfully verified, marking it as available on the second record system, and updating user interaction related functions to use a copy of the data record in the second record system when handling interactions by a user associated with the data record. User interactions may be handled adaptively during data migration by verifying the availability of data records in the first record system and the second record system.

Abstract: Techniques described herein provide a service and associated interface that are capable of serving online queries for learners' states with respect to various types of learning content. For example, the described techniques may serve a query to determine items that have been completed by a particular user, or courses with which a user has recently interacted. More particularly, the described techniques provide a uniform interface for all such learner progress, which facilitates fast and efficient capabilities of users, administrators, and developers with respect to finding, using, and modifying learner progress.

Abstract: Implementations provide an improved system for presenting search results based on entity associations of the search items. An example method includes generating first-level clusters of items responsive to a query, each cluster representing an entity in a knowledge base and including items mapped to the entity, merging the first-level clusters based on entity ontology relationships, applying hierarchical clustering to the merged clusters, producing final clusters, and initiating display of the items according to the final clusters. Another example method includes generating first-level clusters from items responsive to a query, each cluster representing an entity in a knowledge base and including items mapped to the entity, producing final clusters by merging the first-level clusters based on an entity ontology and an embedding space that is generated from an embedding model that uses the mapping, and initiating display of the items responsive to the query according to the final clusters.

Abstract: Data replication in a data grid can be managed. For example, a computing device usable in the data grid can determine a version number for a key-value pair. The computing device can determine the version number by increasing a counter corresponding to the key-value pair to a new value and using the new value as the version number for the key-value pair. The computing device can store the key-value pair and the version number for the key-value pair in a memory device that is included in the computing device. The computing device can then transmit an electronic communication to a remote computing device that is located remotely from the computing device in the data grid. The electronic communication can cause the remote computing device to store the key-value pair and the version number for the key-value pair in another memory device that is included in the remote computing device.

Abstract: A content arranging method and apparatus in a media equipment and recording medium that stores a program source associated with the method are provided. The content arranging method includes extracting time information associated with stored contents from meta data of each of the stored contents, classifying the stored contents based on the extracted time information and a time interval for arranging the stored contents, determining at least one time item corresponding to the time interval, and arranging each of the classified contents under a corresponding time item. The method arranges the stored contents in the media equipment based on a time so that a user readily retrieves a desired content.