Abstract: Embodiments of the present disclosure relate to systems and methods for executing queries on a database platform. A processing device may execute a first operator in a query plan to process a set of data and generate an intermediate result of a query. the intermediate result of the first operator may be pushed, during execution of the query plan, to a plurality of secondary operators as the intermediate result is generated. Each of the plurality of secondary operators may be initiated to concurrently process the intermediate result to generate a plurality of second results, and a timing of processing of the intermediate result by one or more of the plurality of secondary operators is adjusted to coordinate the generation of the plurality of second results. The processor may execute the final operation on the plurality of second results to generate a final result.

Abstract: A set of conversations taking place by users within a geographic location are identified. Keywords for a conversation under analysis, in that geographic location, are identified based on a frequency with which terms are used in the conversation under analysis and in the related conversations. The keywords are automatically added as searchable terms corresponding to the conversation under analysis, and a communication system is controlled to notify client components of the keywords.

Abstract: Embodiments described herein are related to a method of scanning a B-tree. For example, a method comprises receiving a scan request to scan a B-tree having a plurality of levels, each level comprising one or more nodes, wherein for each of one or more levels of the plurality of levels, nodes are grouped into groups, where nodes of any given group are stored across sequential disk blocks. The method further comprises generating a queue for each level of the B-tree. For each queue, the method further comprises loading into memory a next group of nodes based upon determining a storage location of a node of the next group of nodes.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: A computer-implemented technique is described herein for extracting facts from unstructured text documents provided by one or more information sources. The technique uses a pipeline to perform this operation that involves, at least in part, providing a corpus of information items, extracting candidate facts from the information items, merging synonymous argument values associated with the candidate facts, organizing the candidate facts into relation clusters, and assessing the confidence level of the candidate facts within the relation clusters.

Abstract: A process is provided for independently hashing and filtering a data set, such as during preprocessing. For the data set, one or more records, separately having one or more fields, may be identified. A record hash value set, containing one or more record hash values for the respective one or more records, may be generated. Generating a given record hash value may be accomplished as follows. For a given record, a hash value set may be generated, having one or more field hash values for the respective one or more fields of the given record. The record hash value for the given record may be generated based on the hash value set. A total hash value for the data set may be generated based on the record hash value set. The records of the data set may be filtered based on classification of the query that generated the records.

Abstract: This disclosure generally relates to data delivery in distributed applications. One example method includes identifying a data source associated with a shuffle operation, the data source configured provide data from a data set associated with the shuffle operation; identifying a data sink associated with the shuffle operation, the data sink configured to receive data provided by the data source; associating a shuffler component with the shuffle operation, the shuffler component configured to receive data from the data source and provide the data to the data sink; receiving, by the shuffler component, a first data portion from the data source; providing, by the shuffler component, the first data portion to the data sink; receiving, by the shuffler component, a second data portion from the data source, the second data portion being received from the data source prior to or concurrent with providing the first data portion to the data sink.

Abstract: Provided herein are a system, apparatus, device, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for identifying attributes in unstructured data files using a machine-learning model. In an embodiment, a server can receive a request to identify an attribute associated with a set of unstructured data files. The server can extract a first and second subset of features from each unstructured data file of the set of unstructured data files. The server can identify the attribute in the set of unstructured data files request based on each of the first and second subset of features using the machine-learning model.

Abstract: A file transfer system that includes a data source, a destination device, and a transfer server. The transfer server is configured to receive a file from the data source and determine a file size of the file. The transfer server is further configured to determine an available disk space for the destination device, to compare the available disk space to the file size of the file, and to determine that the available disk space is less than the file size of the file. In response to the determination, the transfer server is further configured to determine a file type for the file based on content within the file and to identify metadata linked with the determined file type. The transfer server is further configured to extract data from the file corresponding with the identified metadata and to send the data to the destination device.

Abstract: The disclosed system links an individual dataset to a database. The system receives a target individual dataset associated with a target individual and identifies candidate individual datasets that are potentially related to the target individual dataset. The system identifies a related individual dataset that has data bits that match some data bits in the target individual dataset. The system then identifies a parent node that is a common parent node to both the target individual dataset and the related individual dataset. The system retrieves a data tree that the parent node belongs to with the data tree containing information describing inter-relationships among datasets in the data tree. A node in the data tree is identified to assign the target individual dataset based on strings of matched data bits and number of the matched strings between the target individual dataset and the datasets in the data tree.

Abstract: Prioritization and quality of service control operations for any PiT replication operations. When replicating data from a production site to a replica site, the transmission of data is prioritized based on the perspective of a splitter and based on the perspective of an appliance, which may coordinate with multiple splitters. Quality is controlled by prioritizing which data is sent. The transmission may also perform compression when transmitting the data and may handle situations where available resources are scarce or unavailable.

Abstract: A computer-implemented method for adaptive search refinement is provided. The method may include obtaining an indication of user engagement with an online marketplace and in response to obtaining the indication, providing visually guided search refinement to construct a search query for searching the online marketplace. Providing the visually guided search refinement may include providing search refinement options, obtaining an indication of the approval or disapproval of one or more of the search refinement options, and repeating providing the search refinement options and receiving the indication. For each iteration of providing the plurality of search refinement options, at least some of the search refinement options may be different and determined based on previously received indications of both approval and disapproval. The method for adaptive search refinement may further include providing search results based on the search query.

Abstract: A computing entity storing a user profile data store and an informational content data store receives new event information corresponding to a user. The new event information is associated with a user identifier and is provided via user interaction with an interactive user interface (IUI). Using the user identifier, the computing entity identifies and accesses a user profile from the user profile data store that comprises profile information corresponding to the user. Based on the new event information and/or the profile information stored in the user profile, the computing entity prioritizes a plurality of informational content items stored in the informational content data store. Based on the prioritization of the plurality of informational content items, the computing entity selects one or more informational content items that are of high priority for the user and provides a selected informational content item for presentation to the user via the IUI.

Abstract: Techniques for executing show commands are described herein. A plurality of navigation steps is utilized, each navigation step corresponding to a different layer in a database structure and each navigation step including an operator to fetch items from a metadata database up to respective bounded limits. Dependency information is also fetched for objects of the specified object type in the show command. After a set of objects from the last layer are processed, memory for the navigation steps is flushed and the next set of objects are processed.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: Systems and methods are described for extracting data from digital documents, indexing the data, and providing a user interface for filtering the data and generating a document based on the filtered data. In one implementation, a method includes extracting data from one or more digital documents, the extracted data including elements of a first type, the elements of the first type including key-value pairs; indexing the extracted data; hosting a web-based application instance, the web-based application instance including a user interface for searching the indexed data and filtering elements of the first type based on rules defined by a user of the user interface; receiving rules for filtering the elements of the first type; and filtering the elements of the first type based on the received rules.

Abstract: The technology described herein builds an optimal refresh schedule by minimizing a cost function constrained by an available refresh bandwidth. The cost function receives an importance score for a content item and a change rate for the content item as input in order to optimize the schedule. The cost function is considered optimized when a refresh schedule is found that minimizes the cost while using the available bandwidth and no more. The technology can build an optimized schedule to refresh content with incomplete change data, content with complete change data, or a mixture of content with and without complete change data. It can also re-learn content item change rates from its own schedule execution history and re-compute the refresh schedule, ensuring that this schedule takes into account the latest trends in content item updates.

Abstract: Apparatus and methods may include a method for using a single script framework to generate a plurality of JIL files. Each of the plurality of JIL files may be for use in one of a plurality of multiple environments. The methods may include providing, based on the jobs information, the jobs attribute values and the SQL content, parameters to create a job, update a job and/or delete a job. The providing may use an AutoSys™ jobs table. The AutoSys™ jobs table may include jobs information, jobs attribute values, and Sequel (SQL) content to be run.

Abstract: Disclosed herein are various embodiments for a data transfer and resource management system. An embodiment operates by retrieving both data and a schema from a table. A first offset corresponding to the retrieved data indicating a retrieval time of the retrieved data and a number of records is identified. It is determined that the retrieved data corresponds to the schema. The data is stored on a messaging platform and made available to be pulled by one or more end users prior to a transfer to one or more cloud servers. A second offset corresponding to a number of records of the data retrieved by the one or more end users from the messaging platform is determined. It is validate that the second offset corresponds to the first offset. The records and the schema retrieved from the intermediary messaging platform are transferred to the one or more cloud servers.

Abstract: Techniques are disclosed for anomaly detection based on a predicted value. A search query can be executed over a period of time to produce values for a key performance indicator (KPI), the search query defining the KPI and deriving a value indicative of the performance of a service at a point in time or during a period of time, the value derived from machine data pertaining to one or more entities that provide the service. A graphical user interface (GUI) enabling a user to indicate a sensitivity setting can be displayed. A user input indicating the sensitivity setting can be received via the GUI. Zero or more of the values as anomalies can be identified in consideration of the sensitivity setting indicated by the user input.