Abstract: A global filter allows data filtering using attributes across multiple Analysis Tools (ATs), by broadcasting semantic filter context objects. Upon selecting object attribute values, the filter context object is created with attribute names and values. A processing engine resolves the filter context object to a data object, and then subsequently to target data. A lateral filter finds related entities in a relational database, without having to maintain and/or duplicate all of the data into a graph database. The processing engine resolves lateral filters using an entity graph path calculation conducted in conjunction with the generation of a bootstrapped graph structure. That graph structure is constructed (bootstrapped) utilizing available database schematic information—e.g., pre-calculated (key) relations and metadata read from the relational database. From that information, relationships in the bootstrapped graph structure are determined.

Abstract: System and methods are provided for creating a tenant of a database system, the tenant to have tenant data stored in an immutable storage of the database system associated with a tenant identifier. A request may be received at the database system to create a new tenant. A template tenant metadata of a template tenant may be selected at the database system to create the new tenant based on the received request. A new tenant identifier may be created at the database system based on the selected template tenant metadata. The new tenant may be created by associating the new tenant identifier with a snapshot of at least a portion of the template tenant metadata at a point in time when the template tenant metadata is made accessible to the new tenant. Systems and methods are also provided for removing a tenant of a database system by removing references to a tenant identifier.

Abstract: Embodiments of system and method for performing object-modifying commands in an unstructured storage service are described. Embodiments may include utilizing one or more nodes to implement an unstructured storage service including a service interface configured to service data storage requests and data retrieval requests from remote clients. The unstructured storage service is configured to isolate access to each of multiple storage domains of the service to different clients. Embodiments may also include receiving from a given remote client, a request to store a data object to a given storage domain of the service. The request further specifying a command to modify source data for the object prior to storing the object. Embodiments may also include using the unstructured storage service to perform the command without exporting the source data from the unstructured storage service to the given remote client prior to completion of the command.

Abstract: Embodiments are described for a system and method to analyze data at a plurality of data sources. A data analytic workflow may be received. The data analytic workflow may include at least one operation to be performed on a plurality of data sets stored at a plurality of data sources. Instructions may be created based on the operation to be performed and a type of platform that operates the data sources. Furthermore, the instructions may be transmitted to the data sources such that the data sources may execute the operations on the data sets stored at the data sources.

Abstract: Scaling out of a geographically diverse storage system is disclosed. A first chunk can be selected to be moved in response to scaling out of the geographically diverse storage system. In some embodiments, the first chunk can be convolved, combined, etc., with a second chunk prior to moving a representation of information comprised in the first chunk, e.g., via copy and delete operations. The moving can be in accord with a geographically diverse storage system schema and can be based on a criteria associated with the geographically diverse storage system. In an embodiment the convolved chunk can be copied to a new zone and, subsequently, the first chunk can be deleted from the old zone. In another embodiment the combined chunk can be retained at the old zone and the first chunk can be copied to the new zone prior to deleting the first chunk from the old zone.

Abstract: A computer-implemented method, system and computer program product is provided for optimizing a document change or provenance scoring system by weighting sections of a document, scoring the changes for each section, and then combining the change scores for each section to generate an overall change score. An associated report may also be generated that catalogs all of the various scoring elements. The weighted score is stored in a document management system and provides a human document reviewer a level of detail to evaluate document changes. Accordingly, the weighted score reveals whether a document's changes require a brief or detailed review before the document's changes are approved for a next document version.

Abstract: A method for historically synchronizing tag data related to a computer network is provided. A network management server compares a relations table of entities from a first database to a corresponding relations history table of entities from a second database. The network management server identifies from the comparison a pair of entities having a changed relationship. The network management server updates the relations history table of entities with the changed relationship in the second database. The network management server updates a path and level between a root of a tree of tags and each tag of the pair of tags in a historical configuration details table of tags in the second database based on updating the relations history table of entities.

Abstract: Unified management, automation and interoperability of business and device processes utilizing components of a no-code, event-driven edge computing platform on any device and/or across difference devices. In an embodiment, an event processor on a device accesses a first events dataset which may represent a two-dimensional structure. Each row in the events dataset is processed by the event processor to update the state of a runtime dataset which represents a two-dimensional structure. The updated state of the runtime dataset comprises event-defined processes. In an embodiment, the event-defined processes are executed by the event processor to process a second events dataset, wherein the execution of the event-defined processes further updates the state of the runtime dataset and may create one or more new events for processing.

Abstract: Systems, methods and articles of manufacture for modeling a joint language-visual space. A textual query to be evaluated relative to a video library is received from a requesting entity. The video library contains a plurality of instances of video content. One or more instances of video content from the video library that correspond to the textual query are determined, by analyzing the textual query using a data model that includes a soft-attention neural network module that is jointly trained with a language Long Short-term Memory (LSTM) neural network module and a video LSTM neural network module. At least an indication of the one or more instances of video content is returned to the requesting entity.

Abstract: Automatic partitioning is disclosed. A set of previously run queries is obtained. The set of previously run queries is analyzed to determine one or more query fragments from the set of previously run queries. One or more partitions are generated at least in part by using the obtained query fragments.

Abstract: A security system and method for use on a global computer network, such as the Internet, allows for the creation, development, maintenance and sharing of information to enable verified and authenticated (accredited) members to interact in a highly secure environment. Accredited members are represented by a three dimensional graphical cube and are classified under one of four categories/groups, namely: People; Products; Places; or Services. Each cube is assigned a unique global serial number, barcode or QR code. The six sides of each cube correspond to the six generic questions, who, what, where, when, why and how, and the data information applicable to each generic question is stored on the respective one of the six sides of the cube. The cubes are all linked to one another, thereby enabling accredited members to communicate and interact efficiently on all socio and economic levels with a high degree of trust.

Abstract: Some embodiments provide a program that receives a set of clusters generated from a set of geo-enriched data. The program further identifies a subset of the set of clusters that intersect a map extent of a map. Upon determining that a number of geo-enriched data represented by the subset of the set of clusters is greater than a threshold number, the program renders the map extent of the map to include the subset of the set of clusters. Upon determining that the number of geo-enriched data represented by the subset of the set of clusters is not greater than the threshold number, the program further sends a query for a subset of the set of geo-enriched data that is within the map extent, receives the subset of the set of geo-enriched data and renders the map extent of the map to include the subset of the set of geo-enriched data.

Abstract: Described processes include: obtaining a first amount of cryptographic tokens transferred to burn addresses by members of a first set of entities; determining a second amount of instances of the first type of cryptographic token to be minted; determining portions of the second amount of instances of the first type of cryptographic token to be allocated to members of a second set of entities, wherein: the portions are determined based on effects determined to be caused by members of the second set of entities on performance of a computer-implemented network in which both the first set of entities and the second set of entities participate, and the effects on network performance are quantified by metrics reported by members of the first set of entities; appending to the first distributed ledger, records indicating the respective portions are transferred to respective accounts of corresponding members of the second set of entities.

Abstract: Provided are techniques for finding content on computer networks. A search request having search terms is received. The search request is executed against an index to identify first search results, wherein the index comprises mappings of search terms to web sites and mappings of search terms to patterns. In response to determining that the search request failed based on first search results, an unknown search term in the search terms that does not exist in the index is found. The unknown search term is matched to a pattern of a similar search term using the mappings of search terms to patterns. A candidate web site is identified based on the matching. Additional content is requested from the candidate web site for the unknown search term to identify second search results comprising previously hidden content. The additional content is indexed.

Abstract: Provided are techniques for finding content on computer networks. A search request having search terms is received. The search request is executed against an index to identify first search results, wherein the index comprises mappings of search terms to web sites and mappings of search terms to patterns. In response to determining that the search request failed based on first search results, an unknown search term in the search terms that does not exist in the index is found. The unknown search term is matched to a pattern of a similar search term using the mappings of search terms to patterns. A candidate web site is identified based on the matching. Additional content is requested from the candidate web site for the unknown search term to identify second search results comprising previously hidden content. The additional content is indexed.

Abstract: A method and system for selecting documents for inclusion into a search engine search index executed by a machine learning algorithm (MLA) comprising: acquiring a plurality of digital documents, each respective document having a respective size, determining a respective value parameter based on user interactions, ranking the digital documents to obtain a ranked list of documents based on: a respective quality value parameter based on the respective value parameter and the respective size, the ranking being performed such that a cumulative quality value parameter is maximized based on: the quality value parameter of a given digital document is weighted by a sum of the sizes of a given subset of documents, wherein the given subset consists of documents having a respective value parameter below the value parameter of the given digital document, selecting a subset from the ranked list and storing the subset in the search index.

Abstract: Data objects are sampled from data sources and stored in a tree data structure that is employed to compute histogram information. Each node in the tree includes sufficient statistics and a particular value corresponding to one or more sampled data objects. The nodes of the tree can be two or more types, such as exponential nodes and regular nodes. Also, each histogram tree may be precalculated to start with an empty exponential node, and a defined number of regular nested nodes that correlate to a precision value for the histogram, i.e., a number of significant figures for sampled data values that can be stored in the tree.

Abstract: A method for identifying client states, receives a set of paths representative of a document object model (DOM) associated with a web page of a rich internet application and for each path in the set of paths received, extracts a subtree, as subtree X, for a current path. The method traverses all known sub-paths under the current path and delete corresponding subtrees from subtree X and reads contents of and determines states of subtree X to form a state X. The state X is added to a set of current states and responsive to a determination no more paths exist, returns the set of current states of the rich internet application.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for maintaining dashboard state are disclosed. In one aspect, a method includes the actions of accessing data identifying modifications that the user has previously applied to the dashboard. The actions further include applying, to the dashboard, the modifications that the user has previously applied to the dashboard. The actions further include providing, to the client device, the modified dashboard. The actions further include receiving, from the client device, additional modifications applied by the user to the modified dashboard. The actions further include updating the modifications that the user previously applied to the dashboard without updating the dashboard by adding data identifying the additional modifications to the data identifying the modifications.

Abstract: Systems and methods for managing an image repository for pathology. In an embodiment, a search request is received. One or more digital slide images are identified from an image repository based on the search request. A user is provided access to the identified digital slide images. In addition, each of a plurality of collections of digital slide images are associated with a search rating, and a value for each of the plurality of collections is computed based on the associated search rating and a size of the collection.