Abstract: Systems and methods are provided for creating and utilizing search indexes with different properties to provide efficient and flexible means for retrieving and ranking high-dimensional content. A first index and a second index are generated with a different sets of properties, which may include a permutation prefix length and a vector quantization scheme, and are each associated with a computational workload. Further, at least one index structure may be created with a posting list associated with a permutation prefix and a set of references, rather than only a permutation prefix, to balance out posting lists of variable lengths within the index. Another embodiment of the disclosure provides for expansion of search results at search time, rather than during indexing, by retrieving posting lists associated with shorter permutation prefix after an initial list is determined to have insufficient recall.

Abstract: A method and system are provided for data synchronization. The method includes registering, in a database accessible by nodes in a cloud cluster system, node information for each node during an initialization of an application context for an application having at least one instance running on each node. The method further includes storing an update for data in (i) a local storage of a given one of the nodes and (ii) the database, responsive to a request to update the data received by the given one of the nodes. The method also includes generating a modified request that includes details for the updated data. The method additionally includes calling an application programming interface to update a state of respective local storages for the other nodes with the update responsive to the modified request, such that the update is synchronized across the at least one instance running on each node.

Abstract: Some embodiments enable intelligent searching data based on structure and content of models defining structure domains of interest. Embodiments are also capable of simultaneously providing context sensitive reasoning across the domains to find other relationships within the data that are not apparent using traditional search. For a respective domain-specific model, a method or system reasons relationships within the respective domain-specific model. Each relationship is between a keyword of a search query inputted by a user and a field of the domain-specific model. The method reasons the relationships by traversing the domain-specific model using domain-specific rules selected by the keyword. The method maps a first field of a first reasoned relationship to a second field of a second reasoned relationship. The first and second fields are in respective first and second domain-specific models. The method executes the search query based on the mapping, which generates search results presented to the user.

Abstract: A method of implementing sub-table replication starts with the processor detecting an update to an entitlements table. The processor performs filtering of a data table based on the update to the entitlements table. The data table including an entitlements column. The processor detects an update to the entitlements column and performs incremental replication of the data table by causing a version-based replication to be executed. Other embodiments are also described herein.

Abstract: Aspects of the technology described herein provide a personalized computing experience for a user based on a user-visit-characterized venue profile. In particular, user visits to a venue are determined. For those visits, user characteristics and/or visit characteristics are determined. User similarities and visit features similarities may be determined and associated with the venue to form the user-visit-characterized venue profile. The user-visit-characterized venue profile may be provided to an application or service such as a personal assistant service associated with the user, or may be provided as an API to facilitate consumption of the user-visit-characterized venue profile by an application or service.

Abstract: Computer-implemented methods, systems and products for character string frequency analysis. The method includes a set of operations or steps, including parsing a plurality of character strings into one or more tokens, categorizing the one or more tokens into one or more token frequency categories, and generating a first similarity score between one or more pairs of character strings of the plurality of character strings. The method further includes calculating one or more degrees of commonality or rarity of the plurality of character strings based on the categorizing, generating one or more penalties for token pairs of the one or more pairs of character strings associated with the first similarity score based on the one or more degrees of commonality or rarity and the categorizing, and generating a second similarity score based the first similarity score and the one or more penalties.

Abstract: The various embodiments describe multi-site cluster-based data intake and query systems, including cloud-based data intake and query systems. Using a hybrid search system that includes cloud-based data intake and query systems working in concert with so-called “on-premises” data intake and query systems can promote the scalability of search functionality. In addition, the hybrid search system can enable data isolation in a manner in which sensitive data is maintained “on premises” and information or data that is not sensitive can be moved to the cloud-based system. Further, the cloud-based system can enable efficient leveraging of data that may already exist in the cloud. In addition, various embodiments enable configuration data associated with search functionality to be shared amongst clusters in a manner that promotes cluster security.

Abstract: A group of nodes corresponding to respective pieces of data included in a second data-set are identified from nodes in a first data-set described based on ontologies each defining a link referencing a node in the first data-set. A determination is made, on a path following links in the first data-set from each of the group of nodes, whether there is an association between a first ontology of a first link referencing a source node and a second ontology of a second link referencing a destination node. A common node, at which a first path from a first node and a second path from a second node intersect, is searched for by tracing links between the source node and the destination node based on a result of the determination, and a search result representing the common node, the first node, and the second node is output.

Abstract: Systems and methods initialize distributed client device membership for new client devices joining a group-based communication channel established for content exchange among a plurality of distributed client device members. The systems and methods comprise aspects for executing a content analysis over the content of the one or more group-based communication channels to identify characterizing terms associated with each group-based communication channel. After the content analysis is performed, systems receive search parameters from a potential new member client device for a group-based communication server. Various systems and methods provide selected search results generated based at least in part on a determination that characterizing terms match one or more of the search parameters to the client device. Those selected results comprise a target that is executable by the client device to join the associated group-based communication channel.

Abstract: Systems and methods for protecting and identifying virtual machines that have the same name in a multi-tenant distributed environment are provided. When backing up a virtual machine, a unique identifier of the virtual machine is incorporated into the name of the virtual machine's save set. This allows a backup administrator to distinguish between virtual machines that have the same name. This improves the ability to perform restore operations by enabling virtual machines that have the same name to be distinguished.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to analyze graph information. An example apparatus includes a graph computational processor. The example graph computational processor is configured to analyze a first graph with respect to a second graph to identify a third graph within the first graph by: matching a first triplet from the first graph to a second triplet from the second graph by comparing each node and connecting edge included in each triplet; and generating the third graph by adding, when the first triplet matches the second triplet, the first triplet to a subgraph output set forming the third graph. The example graph computational processor of is configured to identify an additional node in the first graph based on the third graph and generate an output based on the additional node.

Abstract: A data management system includes: a tree-structure-holding means for storing a transformed tree structure into which an original tree structure has been transformed by a rotation operation, the original tree structure being a tree structure indicating hierarchical inclusion relations among data sets associated with nodes; an inter-data-relation-holding means for storing a reverse link, the reverse link being a link between nodes the levels of which have been reversed by the rotation operation; and an inter-link-relation-holding means for storing a temporarily placed link in association with the reverse link, the temporarily placed link being a link to a node that has been transferred from immediately below an ex-lower-level node to immediately below an ex-upper-level node, the ex-lower-level node and the ex-upper-level node being nodes the levels of which have been reversed.

Abstract: Systems and methods include detection of deletion of a record of a database table due to a database transaction, creation of a log entry including one or more key field values of the record of the database table, an identifier of a user associated with the database transaction, and an indicator of a delete operation, determination of whether the identifier identifies an archiving user, and, in a case that the identifier identifies an archiving user, change the indicator to an indicator of an archive operation to create a changed log entry.

Abstract: A system, method, and machine readable medium are described for providing improved search functionality on a client device.

Abstract: A method performed by a computer system including: accessing a specification that specifies a plurality of modules to be implemented by the computer program for processing the one or more values of the one or more fields in the structured data item; transforming the specification into the computer program that implements the plurality of modules, wherein the transforming includes: for each of one or more first modules of the plurality of modules: identifying one or more second modules of the plurality of modules that each receive input that is at least partly based on an output of the first module; and formatting an output data format of the first module such that the first module outputs only one or more values of one or more fields of the structured data item.

Abstract: A method of efficiently extracting large data sets from a database includes receiving a query to be executed on a first view of one or more data sources, where previous result sets resulting from previous queries are stored separately from the one or more data sources. The method also includes receiving a current result set from the one or more data sources that is responsive to the query, where the query is reformatted before it is executed such that the result set does not overlap with the previous result sets. The method additionally includes generating a second view that combines the current result set and the one or more previous result sets, where the second view resolves changes in a schema of the one or data sources between when the previous result sets were received and when the current result set is received.

Abstract: A storage tier manager efficiently creates different representations of a dataset backup for different retention periods. Each of the representations of the dataset backup is distinctly identifiable despite initially representing a same dataset backup. The representations are structured metadata corresponding to the dataset backup. One representation is a cached backup version of the dataset backup (“cached backup” or “cached representation”) provided for low latency access while residing at a storage tier of the backup appliance for a relatively short retention period according to a lifecycle management policy. The other representation is a cloud backup version of the dataset backup (“cloud backup” or “cloud representation”) provided for persisting into cloud storage for a longer retention period according to the lifecycle management policy.

Abstract: Techniques are described herein for building a framework for declarative query compilation using both rule-based and cost-based approaches for database management. The framework involves constructing and using: a set of rule-based properties tables that contain optimization parameters for both logical and physical optimization, a recursive algorithm to form candidate physical query plans that is based on the rule based tables, and a cost model for estimating the cost of a generated physical query plan that is used with the rule based properties tables to prune inferior query plans.

Abstract: Accordingly, embodiment herein disclose a method for handling block chain operation in a block chain system. The method includes parallelizing, by the block chain system, a block creation along with a consensus mechanism. The block creation along with the consensus mechanism includes parallelly combining a pre-computed state of a succeeding block (at height “k” greater than the current block, where “k” is a positive integer parameter chosen by the system designer) with transactions in a current block to obtain state to be stored in a next succeeding block (at height “k+1” greater than the current block) along with running a consensus protocol to finalize transactions to include in an immediate next block (at height one greater than the current block). Further, the method includes handling, by the block chain system, the block chain operation based on parallelizing. The method can be used for scaling up computation in blockchains.

Abstract: A system is disclosed to evaluate data quality in a big data environment. An example method performed by the system includes retrieving one or more rules from an asset catalog. The method further includes retrieving, based on the one or more rules, counter information from a data set, and generating, by a processor, one or more metrics based on the one or more rules and the counter information. In addition, the method includes evaluating, by the processor, the one or more metrics based on the one or more rules. In an instance in which evaluation of a particular metric of the one or more metrics identifies an attribute value that exceeds a predetermined threshold, the method includes causing a notification message regarding the particular metric to be output. A corresponding apparatus and computer program product are also provided.