Abstract: Presented herein are embodiments of a fast search on graph methodology for Maximum Inner Product Search (MIPS). This optimization problem is challenging since traditional Approximate Nearest Neighbor (ANN) search methods may not perform efficiently in the nonmetric similarity measure. Embodiments herein are based on the property that a Möbius/Möbius-like transformation introduces an isomorphism between a subgraph of 2-Delaunay graph and Delaunay graph for inner product. Under this observation, embodiments of a novel graph indexing and searching methodology are presented to find the optimal solution with the largest inner product with the query. Experiments show significant improvements compared to existing methods.

Abstract: Provided herein are systems and methods for replicating share objects to remote deployments. An example method includes generating, at a second deployment in a data exchange, a replica of a share object included in a first deployment of the data exchange. The share object grants privileges to a first account to access a first database of the first deployment, wherein the first database comprises a database object. The method also includes retrieving, at the first deployment, share grant metadata from the share object of the first deployment, wherein the share grant metadata includes a reference to the database object and allows the first account to use the database object. The method also includes transmitting a message comprising the share grant metadata to the replica in the second deployment. The share grant metadata in the replica allows a second account to use the database object replicated in the second deployment.

Abstract: A method for combining multiple interactions into a single record entry is disclosed. A data package can be created that represents a set of interactions, and each entity associated with an interaction can review the data package. Each entity can indicate agreement with the interactions by digitally signing the data package. Once signed by each involved entity, the data package can be stored in a record such as a blockchain.

Abstract: Embodiments of the present disclosure provide a method, system and computer program product for single view presentation of multiple query. In an embodiment of the disclosure, a method for single view presentation of multiple query includes directing a query against a database along a selected dimension of multiple different elements. In response, a primary result set is received. The result set is then organized into a tabular view of cells according to the selected dimension and values for the selected dimension. Thereafter, a set of nested queries may be directed for each of the elements in the selected dimension against the result set utilizing a different dimension. In response to each directed set of nested queries, a corresponding result set is thus received. Finally, each corresponding result set is inserted into a cell associated with a common one of the elements.

Abstract: To provide a trusted, secure, and immutable record of transactions within a process plant, techniques are described for utilizing a distributed ledger in process control systems. The distributed ledger may be maintained by nodes which receive transactions broadcasted from field devices, controllers, operator workstations, or other devices operating within the process plant. The transactions may include process plant data, such as process parameter data, product parameter data, configuration data, user interaction data, maintenance data, commissioning data, plant network data, and product tracking data. The distributed ledgers may also be utilized to execute smart contracts to allow machines such as field devices to transact by themselves without human intervention. In this manner, recorded process parameter values and product parameter values may be retrieved to verify the quality of products.

Abstract: Systems and methods of inferential user matching include inferring an interest in matching between the first user and the second user based at least in part on a first profile of a first user and a second profile of a second user. Based at least in part on the inferred interest in matching, the systems and methods match the first user and the second user for a service, and transmit (i) a first representation of the first user to a portable device of the second user, and (ii) a second representation of the second user to a portable device of the first user.

Abstract: A search query relating to a search for people and including one or more search terms is received. A search graph for the search is created from a previously created graph which is a directional graph in which people are represented by nodes and content is represented by nodes or edges. The search graph is generated by filtering out nodes or edges that represent content that is determined not to be relevant to the search terms in the search query; and, for the remaining content that is determined to be relevant to the search terms in the search query, adding to the graph a measure of the relevance of the content to the search terms. The search results are generated by operating on the search graph to identify people in the search graph who are sources of content that is relevant to the search terms.

Abstract: A computer-implemented method includes receiving information expressing a user's interest in one or more media programs, obtaining information indicative of popularity for a plurality of media programs responsive to the received information by individuals other than the user, and transmitting one or more recommendations of media programs for display to the user, from the plurality of media programs that relate to the received information.

Abstract: A constraint system enforces projection constraints on data values stored in specified columns of a shared dataset when queries are received by a database system. A projection constraint identifies that the data in a column may be restricted from being projected (e.g., presented, read, outputted) in an output to a received query, while allowing specified operations to be performed on the data and a corresponding output to be provided. For example, the projection constraint may indicate a context for a query that triggers the constraint, such as based on the user that submitted the query. Enforcing projection constraints on queries received at the database system allows for data to be shared and used anonymously by entities to perform various operations without the need to tokenize the data.

Abstract: Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) declaration, which defines a graph algorithm that takes a graph object as input and returns a logical graph object as output. A database dictionary stores the GAF declaration, which allows addition of GAFs without changing the RDBMS kernel. GAFs are used within graph queries to compute output properties of property graph objects. Output properties are accessible in the enclosing graph pattern matching query, and are live for the duration of the query cursor execution. According to various embodiments, the declaration of a GAF includes a DESCRIBE function, used for semantic analysis of the GAF, and an EXECUTE function, which defines the operations performed by the GAF. Furthermore, composition of GAFs in a graph query is done by supplying, as the input graph argument of an outer GAF, the result of an inner GAF.

Abstract: Systems and methods are provided for master-to-master OT-based artifact peering. A “master-to-master” architecture for artifacts is implemented in a network comprising a plurality of nodes and clients, where no node is designated a “master” or “primary” for a given artifact. A first node receives a subset of remote proposed operations from a second node and determines if a conflict exists between the received subset of remote proposed operations and at least one of a plurality of locally-proposed operations. The first node resolves the conflict based on a total-ordering agreed upon between the first node and the second node. The first node transforms at least one operation, either received or locally-proposed, based on the resolved conflict. The first node than updates a local log to include the transformed operation.

Abstract: A method is performed at a server system having one or more processors and memory storing instructions for execution by the one or more processors. The server system provides a content service. The method includes providing a first media item for playback based on a request from an application executing on an electronic device. The method includes receiving data associated with a behavior of a first user of the content service. The data associated with the behavior of the first user includes an indication of at least a first user input for controlling the playback of the first media item. The method includes using the received data to provide a media recommendation to the electronic device.

Abstract: Automatic finding of online profiles of an entity location is disclosed. Reference location data for location attributes of an entity location are obtained. A search for a profile of the entity location on a source is performed using at least some of the obtained reference location data. One or more search results are obtained. A search result includes a Uniform Resource Locator (URL) and corresponding search result location data. The search result is evaluated. Evaluating the search result includes normalizing the search result location data included with the search result and comparing the normalized search result location data against the reference location data. Based at least in part on the evaluation, it is determined whether the search result matches to a profile of the entity location on the source. In the event that the search result matches to a profile of the entity location on the source, the search result is provided as output.

Abstract: Data migration of an application from source to target information system is a critical step for a successful modernization project. There are few commercial tools available to address the data migration challenge, creation of a data transformation specification is largely a manual, knowledge intensive, and expert driven process. A system and method for learning based synthesis of data transformation rules have been provided. The system is focused on automating important aspects of automatic inference of the transformation specification. The key principles behind the system and method are derived from the observations on how experts use domain, system, and historical mapping knowledge while creating data transformation specifications. The system contains two major components, schema matching and transformation rule program generation. The system uses machine learning, knowledge representation for schema matching and developed rule generator using a deductive synthesizer.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed for efficient media indexing. An example method disclosed herein includes means for initiating a list of hash seeds, the list of hash seeds including at least a first hash seed value and a second hash seed value among other hash seed values, means for generating to generate a first bucket distribution based on the first hash seed value and a first hash function and generate a second bucket distribution based on the second hash seed value used in combination with the first hash seed value, means for determining to determine a first entropy value of the first bucket distribution, wherein data associated with the first bucket distribution is stored in a first hash table and determine a second entropy value of the second bucket distribution.

Abstract: A graph comprising nodes and edges is stored by a distributed system as a collection of nodes and half-edges stored with their respective nodes. A message processor is associated with a node as needed to process messages passed between nodes, such that a given node has zero or one message processor assigned to it at a given time. Queries of the graph are resolved by processing a first portion of the query at a first node, and forwarding the results with the remaining portions of the query to a node linked by an edge to the present node.

Abstract: State of art techniques that utilize spatial association based Table structure Recognition (TSR) have limitation in selecting minimal but most informative word pairs to generate digital table representation. Embodiments herein provide a method and system for TSR from an table image via deep spatial association of words using optimal number of word pairs, analyzed by a single classifier to determine word association. The optimal number of word pairs are identified by utilizing immediate left neighbors and immediate top neighbors approach followed redundant word pair elimination, thus enabling accurate capture of structural feature of even complex table images via minimal word pairs.

Abstract: The increased use of graph algorithms in diverse fields has highlighted their inefficiencies in current chip-multiprocessor (CMP) architectures, primarily due to their seemingly random-access patterns to off-chip memory. Here, a novel computer memory architecture is proposed that processes operations on vertex data in on-chip memory and off-chip memory. The hybrid computer memory architecture utilizes a vertex's degree as a proxy to determine whether to process related operations in on-memory or off-chip memory. The proposed computer memory architecture manages to provide up to 4.0× improvement in performance and 3.8× in energy benefits, compared to a baseline CMP, and up to a 2.0× performance boost over state-of-the-art specialized solutions.

Abstract: An object is to provide a technique capable of appropriately storing data. An information collection device includes a similarity degree determination unit configured to obtain a degree of similarity between acquired-data and saved-data and generate a link that associates the acquired-data and the saved-data based on the degree of similarity, a request estimation unit configured to generate a link that associates the saved-data when the saved-data is read, and estimate a future request for the saved-data, and a data life determination unit configured to determine a storage time limit of the saved-data on a link-by-link basis.

Abstract: Methods, systems, and computer storage media for providing a multi-tenant system that executes graph language requests using graph operations of a graph language. A graph language request—that configures tenant data for tenants in a multi-tenant system—is executed using a graph operations engine. The graph operations engine receives and parses a graph language request that includes a list of tenants and a definition of data operations. The set of data operations of the definition are executed on a tree of data operation nodes comprising a plurality of leaf nodes and a root node. Executing the data operations is based on graph language actions (e.g., composition, transformation, and aggregation) that support asynchronously returning results data associated with configuring the Tenant data. Executing the data operations of the definition causes generation of results data (e.g., root node results or leaf node results) configuration of the tenant data in the multi-tenant system.