Abstract: Various embodiments relating to synchronizing changes to a shared list of items between different devices are provided. In one embodiment, a first set of change operations for a first version of a shared list may be received from a first device. The first set of change operations may be performed on the first version of the shared list to produce a second version of the shared list. A second set of change operations for the first version of the shared list may be received from a second device. The second set of change operations may be performed on the second version of the shared list to produce a third version of the shared list that maintains changes that are made by the first set of change operations but that are not made by the second set of change operations.

Abstract: Computer-readable media, systems, and methods for hierarchical index based compression are described. In embodiments, a hierarchical data log or key-value pair based data log, such as a JSON log, is received and a tree-structured index (index tree) is recursively constructed. In one embodiment, the log comprises search-engine user interaction information. Structural information of the log is preserved by the index tree structure; for example, each node of the log has a corresponding index-tree node. Frequently repeating keys, values, and correlated key-value pairs may be stored in the index-tree node, which may be indexed using multiple levels of detail including a raw-string level for raw string representations of the node, a first level for indexing keys and common values, and a second level for indexing correlated key-value pairs. The index tree may be used to compress rows of the data log and also used to decompress and restore the log.

Abstract: Mechanisms for generating an answer to an input question are provided. The mechanisms receive an input question and route the input question to a plurality of Question and Answer (QA) system pipelines. The mechanisms receive results of processing the input question from each QA system pipeline in the plurality of QA system pipelines. The results comprise one or more candidate answers to the input question and associated confidence scores. The mechanisms adjust, for each QA system pipeline, the confidence scores of the one or more candidate answers associated with the QA system pipeline based on one or more weighting factors. In addition, the mechanisms generate the answer to the input question based on the adjusted confidence scores of the one or more candidate answers for each QA system pipeline.

Abstract: In one aspect, a computer-implemented method of associating tags with online content may generally include receiving, by one or more computing devices, a tag request from a user to associate a tag with a content object, classifying the tag as a controlled tag, accessing an access control list associated with the controlled tag, determining whether the user is permitted access to the controlled tag based on the access control list, associating the tag with the content object when the access control list permits access to the controlled tag, identifying a moderator for a tag group associated with the controlled tag and providing a moderator feed to the moderator of the content object associated with the controlled tag for approval or rejection of the controlled tag.

Abstract: A method routes data to an appliance in a high-availability active/active appliance cluster. Messages received by appliances are assigned by a self-balancing module to balance a load of appliances in the appliance cluster, which includes a persistent storing standby group and a transaction processing standby group. Persistent storing data, which is generated by processing the messages, are stored in a virtual persistent storage, which provides an interface between a persistent storage of a primary database appliance and an application for processing the messages. The virtual persistent storage is linked to the persistent storage of the primary database appliance in response to an appliance that receives the messages not being the primary database appliance, thereby sending persistent storing data to the persistent storage of the primary database appliance.

Abstract: Technology is disclosed for managing data in a distributed file system (“the technology”). The technology can gather metadata information associated with the data stored within the distributed file system, create a secondary namespace within a local file system of a local host using the gathered metadata information and store the gathered metadata information as files within the secondary namespace. Further, when a request to create a PPI of the distributed file system is received, the technology can create a PPI of the secondary namespace using a PPI creation feature of the local file system.

Abstract: Described herein are methods and systems for selectively synchronizing locally stored data with data stored in a cloud storage repository. A client application can synchronize a portion of the locally or remotely stored content by choosing to synchronize data that is frequently used, data that is marked as priority data or data that was modified or otherwise accessed during a predetermined period of time. Other selective synchronization optimizations include predictively synchronizing data or content associated with frequently use or priority data and synchronizing data according to a priority score.

Abstract: A method of performing a search of heterogeneous data based on an input query includes: generating an index including at least two hash tables, where each hash table corresponds to a different data domain of the heterogeneous data and includes hash code sets, where at least one of the hash code sets is mapped to a hash code set of another one of the tables. The method further includes performing a hash on the input query to generate a hash code, by referring to the index, determining a first hash code set that the generated hash code belongs to, and determining a second hash code set that the determined first hash code set is mapped to, and providing at least one result based on the determined second hash code set.

Abstract: File management machines, computer readable media, and methods of file management, are provided. An exemplary file management machine includes a file management server configured to receive or retrieve user files through an electronic communication/computer network to provide categorical organization and establishment of albums. The file management server can also function to create member user and visitor accounts. The visitor accounts can be provided individual custom access by the member user to provide individualized tailored access to a subset of the files uploaded by the member user. The visitor accounts can be used as to gather information about the file unknown to the member user.

Abstract: Query generation for searchable content is provided. In some embodiments, query generation for searchable content includes receiving searchable content (e.g., the searchable content can include a unique identifier for the searchable content, such as a Uniform Resource Locator (URL) for a web site, and the web site can include one or more web pages); and generating a set of queries, the set of queries including one or more queries (e.g., the set of queries can include ranked queries) that are relevant to the searchable content.

Abstract: The application relates to a method for the electronic archiving of data objects by means of a data processing device, wherein the method comprises the following steps: receipt of a hash value tuple comprising one or a plurality of hash values, wherein each hash value is assigned to a data object, receipt of time information on the hash value tuple indicating a time period within which the hash values of the hash value tuple should be electronically archived and comparison of the time information with a predetermined time specification, wherein archiving steps are carried out if the time information specifies a time period for electronic archiving that is shorter than the predetermined time specification. The application furthermore relates to a computer program product.

Abstract: The replication of an asset from a source cluster in a source data center to multiple target clusters in multiple destination data centers. The replication occurs by first estimating or determining a cost parameter associated with copying of the asset from the source cluster to each of at least some of the target clusters. As an example, the cost parameter might be a geographical parameter, but might also be any cost parameter such as a channel bandwidth, channel cost, utilization ratio or the like. Based on the cost parameters, an order of replication priority is determined. Then, the replication is initiated in accordance with the prioritization. The replication may occur in multiple phases, and replication prioritization may occur on a per phase basis.

Abstract: In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold.

Abstract: Systems and methods are disclosed for news events detection and visualization. In accordance with one implementation, a method is provided for news events detection and visualization. The method includes, for example, obtaining one or more user inputs, determining, based on the user inputs, an entity and a date range, obtaining one or more documents associated with the entity and with dates within the date range, the one or more documents being grouped into one or more clusters, and the clusters being grouped into one or more megaclusters, and presenting the one or more documents on one or more timelines, wherein the one or more documents are grouped into different megaclusters being presented in a visually distinct way. The method further allows for filtering of the one or more clusters based on a value associated with the one or more clusters.

Abstract: In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold.

Abstract: In one implementation, a query is received that is related to data stored in a database that is implemented in computer memory. Based on the received query, attributes of data stored in the database that are relevant to generating a response to the received query are identified. Information that is indicative of attributes for which values are recorded in different tables included in the database is accessed. Based on having accessed this information, tables included in the database that record values for the attributes identified as being relevant to generating a response to the received query are identified. These tables then are joined to create, within computer memory, a new table that reflects relationships between values of attributes identified as being relevant to generating a response to the received query.

Abstract: A method of indexing a database column is disclosed. A permutation function f is determined. A shortcut that connects two non-adjacent elements of a permutation cycle based on f is created. A traversal of the permutation cycle without the shortcut comprises starting at a first element of the permutation cycle by updating a candidate row number to an initial value, wherein the initial value comprises a value stored in the database column. Traversing through one element of the permutation cycle comprises reading a row value in the database column using the candidate row number and then updating the candidate row number with function f of the most recently read row value. The step of traversing through one element of the permutation cycle is repeated until the most recently read row value is equal to the initial value. Creating the shortcut comprises storing a relation between the two non-adjacent elements.

Abstract: A method of database indexing is disclosed. Two functions (f and g) from row values to row number values are set. The functions are utilized to determine a row number in a database column containing a target search value, wherein the target search value comprises a search value being sought in the database column. A candidate row number variable is set initially to the function g of the target search value by a processor. Iteratively the following is performed: a current value of the candidate row number variable is used as an address to read a value in a corresponding row in the database column, and the current value of the candidate row number variable is updated to the function f of the most recently read value in a corresponding row in the database column.

Abstract: A method of providing a search service and a display device applying the same are provided. According to the method of providing a search service, a web page that is searched by a specified keyword is accessed, at least one keyword is extracted from text included in the web page being accessed, and the at least one extracted keyword is displayed.

Abstract: A system, method and computer program product capable of determining data completeness associated with an analysis based on a data model at the same time that the data in the data model is being analyzed. A root node may be determined, and all paths from the root node discovered. Each path is decomposed into steps, and a ratio is calculated for each step. The ratios may be multiplied for each path, and the aggregate of the paths may determine a measure of the data completeness corresponding to the analysis and return the results of the analysis and the measure of data completeness at the same time.