Abstract: A method of accessing a dataset to fulfil a query over an intended audience is provided. A user interface comprises input means for a user to select an intended audience dataset from a plurality of datasets which the user has permission to access. The user interface is configured to receive from the user a query defining an intended operation to be performed on entries of the intended audience dataset to generate the target audience. The query is received from the user and a supporting candidate dataset is selected. It is determined whether the selected supporting candidate dataset comprises entries which enhance the entries of the audience dataset for performing the intended operation. If so, the candidate dataset and the audience dataset are selected to contribute to performance of the operation. If not, a next candidate dataset is selected, and the determining step is repeated.

Abstract: At least one social media channel includes a plurality of user messages, which are accessible via a communication network. At least some of the stored messages are retrieved from the at least one social media channel via the communication network, and a collection of frequently asked questions (FAQ) is generated or updated by analyzing the retrieved messages to form a plurality of topical issue clusters. Each topical issue cluster is associated with at least one topic parameter from among a plurality of topic parameters, each topic parameter relates to at least one of use, installation or maintenance of a product or service, and each topical issue cluster includes at least one issue identified by a community of users and at least one resolution of the issue identified by the community of users. The generated or updated FAQ is uploaded to a storage location accessible to the community of users.

Abstract: In an approach for character encoding, a processor receives a first query involving an attribute, wherein the first query utilizes a value encoded in accordance with a first encoding scheme. A processor identifies a table comprising values of the attribute in a compressed format. A processor creates at least one dictionary associated with the attribute, wherein the at least one new dictionary associated with the attribute maps a compressed value to a corresponding uncompressed value. A processor executes the first query by invoking a conversion operation in a query plan of the first query for decoding one or more queried values of the attribute. A processor fills the at least one new dictionary with one or more decoded query values to create at least one full dictionary. A processors stores the at least one full dictionary in a cache using a predefined cache management policy of the cache.

Abstract: Systems, apparatus, methods and computer program products for deleting data of an object within a multi-tenant database via an efficient delete operation are described herein. The new delete operation (or method) may be configured to identify one or more records to be deleted within a data structure such as an object. In order to ensure that the operation is efficient, the mechanism may determine characteristics of a data store and determine whether the information provided within the data structure provides an efficient identification of the data to be deleted. Upon a successful validation, an initial delete request may be translated to an appropriate delete operation for the underlying database.

Abstract: An asset inventory for a site location is conducted by providing a user with a mobile interface, collecting a site ID, collecting an equipment ID, collecting equipment asset information, associating the equipment ID and equipment asset information with the site ID, and storing the equipment asset information, equipment ID, and site ID in one or more data repositories. Site surveys are conducted based on a system comprising a server, one or more data repositories, a mobile data interface, a network, and a series of rules corresponding to service and maintenance of site equipment.

Abstract: A query requesting a count of unique data values for a specific attribute is received. The received query is used to generate and transmit a plurality of non-overlapping queries to a data store. A plurality of responses is received from the data store. Results from the plurality of responses is summed and the resulting sum is returned.

Abstract: In one implementation, a data transformation engine is employed to analyze an incoming JSON schema syntax and use a “best effort” model to convert a plurality of JSON schemas to other types of schemas such as an XML schema. The model is configured to be adaptable and dynamic in order to convert as much of the JSON as possible. In addition, the conversion tool is configured to transform schemas to other technologies and allow for conversion errors within one or more error thresholds. Further, the system may be distributed standalone with no dependencies to other implementations, such as BPM implementations.

Abstract: A system, method and computer program product for a search tool is provided. A user-input search term is received in a search tool for finding instances of the search term in a document currently presented to the user. An instance of the search term in a hidden content element of the document is identified. A content element is determined for exposing the hidden content element. The determined content element is presented to the user and highlighted, to prompt user interaction therewith so as to expose the hidden content element.

Abstract: The systems and methods include operations for: storing, by one or more processors, a plurality of content items in association with a content item generation template, each of the plurality of content items having been previously generated by a respective user of a plurality of users of a messaging application in accordance with instructions associated with the content item generation template; ranking the plurality of content items associated with the content item generation template; receiving input that selects an identifier of the content item generation template; and displaying the ranked plurality of content items to a given user of the messaging application in response to receiving the input.

Abstract: Systems and techniques for managing data in a relational database environment and a non-relational database environment. Data in the relational database environment that is static and to be maintained beyond a preselected threshold length of time is identified. The data is copied from the relational database and stored in the data the non-relational database. Access to the data is provided from the non-relational database via a user interface that accesses both the relational database and the non-relational database.

Abstract: Vertex/edge table rows are mapped to unique integer identifiers, to enable construction of in-memory representation of a graph from existing, unmodified RDBMS tables. The unique integer identifiers are based on an encoding of primary key values of the table rows. The unique integer identifiers are used as graph indexes of the in-memory representation.

Abstract: A subgraph storage memory stores subgraphs populated with data classified into features based on data title; each of the subgraphs has a plurality of elements; each of the elements has a features with different values. For each subfeature of a plurality of subfeatures, the different values assigned to a combination of one of the elements and one or more features are used to create a method to evaluate the subgraphs on the one or more features, as a subfeature which provides scoring information on a subgraph. For each metafeature, plural subfeatures among the plurality of subfeatures are selected to be composited into the metafeature; and for each subgraph, the plural subfeatures of each metafeature are composited to provide metafeature scores. Selected subgraphs in a universe of subgraphs with metafeature scores are presented as context for comparing the selected subgraphs; each of the selected subgraphs has different selections of elements.

Abstract: A DBMS training subsystem trains a DBMS workload-manager model with training data identifying resources used to execute previous DBMS data-access requests. The subsystem integrates each request's high-level features and compile-time operations into a vector and clusters similar vectors into templates. The requests are divided into workloads each represented by a training histogram that describes the distribution of templates associated with the workload and identifies the total amounts and types of resources consumed when executing the entire workload.

Abstract: In various embodiments, a data storage system maintains a data store for a plurality of groups of users, where the data store includes a first section that is accessible by a first group of users, but not a second group of users, via the data storage system. In response to receiving, from a first user of the first group of users, a request to share data with the second group of users, the data storage system sends a request to a second user of the second group of users. Subsequent to receiving an acceptance from the second user, the data is stored in a second object in a second section of the data store that is accessible by the second group of users, but not the first group of users, via the data storage system.

Abstract: A computer-implemented method of operating a user-searchable database system of curated, themed digital content data, which method includes operating a Connects function to process and store heterogeneous digital content comprising topic data as curated topic data and identified connections between each topic and other topics, and operating a user interface to enable users to search the curated topics and present a search results page in a way that invites further investigation of topics searched, including a list or compilation of topics matching terms defining the search. The method also includes displaying topic elements corresponding to the list or compilation of matching topics in prioritized order based on each topic's relatedness to the search.

Abstract: A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises a leaf node with a hash value based at least in part on the entry, and a hierarchy of interior nodes based at least in part upon the leaf node. In response to a request to delete the entry, the entry is deleted but the hash value is retained. A cryptographic proof of a second entry stored in the journal is based at least in part on the retained hash value.

Abstract: A compliance server receives change data associated with a change captured on a target host wherein the target host may have provided the change data in response to detecting the change, and the change data may include one or more rules, settings, and/or parameters. Also, in various embodiments, the compliance server may determine whether the one or more rules, settings, and/or parameters meet one or more compliance policies and generate one or more test results based at least on the results of the determining. Further, in some embodiments, the target host may detect a change to a rule, setting, and/or parameter based on a collection policy defining what change data is to be collected by the target host and provide data associated with the rule, setting, and/or parameter as change data to the compliance server.

Abstract: A computer server may receive an indication of a selected potential relationship and retrieve, from a use case configuration data store, an electronic record for that relationship. The first entity may then construct computer system configurations in accordance with use case parameters. The computer server may be used to evaluate the constructed computer system configurations, and an entity score result for the first entity may be stored into the use case configuration data store. The computer server may also retrieve, from a quality function deployment data store, an electronic record associated with the first entity and update a uniform scoring matrix by assigning weighted score values for the first entity in connection with a set of platform capabilities. An entity selection tool may be executed to automatically select a recommended entity based on the score results and scoring matrixes, and an indication of the recommended entity may be transmitted.

Abstract: A system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data is communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module receives a prediction query and, in response, supplies an event prediction based on the prediction model.

Abstract: During operation, the system obtains a first embedding produced by an embedding model from an input string representing an entity and a hierarchy of clusters of embeddings generated by the embedding model from a set of standardized entities. Next, the system searches the hierarchy of clusters for a subset of the embeddings that are within a threshold proximity to the first embedding in a vector space. The system then calculates embedding match scores between the input string and a first subset of the standardized entities represented by the subset of the embeddings based on distances between the subset of the embeddings and the first embedding in the vector space. Finally, the system modifies, based on the embedding match scores, content outputted in response to the input string within a user interface of an online system.