Abstract: Example embodiments relate to parallelizing structured query language (SQL) user defined transformation functions. In example embodiments, a subquery of a query is received from a query engine, where each of the subqueries is associated with a distinct magic number in a magic table. A user defined transformation function that includes local, role-based functionality may then be executed, where the magic number triggers parallel execution of the user defined transformation function. At this stage, the results of the user defined transformation function are sent to the query engine, where the query engine unions the results with other results that are obtained from the other database nodes.

Abstract: Optimizing window joins over data streams can include receiving an input topology and calculating costs of computing a join of data streams based on a number of model topologies, and determining an optimal topology based on the calculated costs and the input topology, wherein the input topology, the model topologies, and the optimal topology each include a number of interconnected operators.

Abstract: Example embodiments relate to parallelizing structured query language (SQL) on distributed file systems. In example embodiments, a subquery of a distributed file system is received from a query engine, where the subquery is one of multiple subqueries that are scheduled to execute on a cluster of server nodes. At this stage, a user defined function that comprises local, role-based functionality is executed, where the partitioned magic table triggers parallel execution of the user defined function. The execution of the UDF determines a sequence number based on a quantity of the cluster of server nodes and retrieve nonconsecutive chunks from a file of the distributed file system, where each of the nonconsecutive chunks is offset by the sequence number.

Abstract: Example embodiments relate to parallelizing structured query language (SQL) on distributed file systems. In example embodiments, a subquery of a distributed file system is received from a query engine, where the subquery is one of multiple subqueries that are scheduled to execute on a cluster of server nodes. At this stage, a user defined function that comprises local, role-based functionality is executed, where the partitioned magic table triggers parallel execution of the user defined function. The execution of the UDF determines a sequence number based on a quantity of the cluster of server nodes and retrieve nonconsecutive chunks from a file of the distributed file system, where each of the nonconsecutive chunks is offset by the sequence number.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to manage a cache. An example method includes in response to receiving a request to retrieve received data, retrieving first data from a cache, the first data received during a first time period, and retrieving, second data from a storage device, the second data received during a second time period prior to the first time period; and providing the first data and second data as combined data the, combined data being combined based on the first time period and the second period.

Abstract: Example embodiments relate to parallelizing structured query language (SQL) user defined transformation functions. In example embodiments, a subquery of a query is received from a query engine, where each of the subqueries is associated with a distinct magic number in a magic table. A user defined transformation function that includes local, role-based functionality may then be executed, where the magic number triggers parallel execution of the user defined transformation function. At this stage, the results of the user defined transformation function are sent to the query engine, where the query engine unions the results with other results that are obtained from the other database nodes.

Abstract: Optimizing window joins over data streams can include receiving an input topology and calculating costs of computing a join of data streams based on a number of model topologies, and determining an optimal topology based on the calculated costs and the input topology, wherein the input topology, the model topologies, and the optimal topology each include a number of interconnected operators.

Abstract: A system includes a distributed file system to control storage of data across storage nodes and a database query engine to receive a database query for access of data, the database query engine to process the database query using an index, and using a buffer pool to cache data retrieved in response to the database query and to store updated data. An abstraction layer is provided between the database query engine and the distributed file system, the abstraction layer to read and write data of the distributed file system in response to the database query.

Abstract: In one implementation, a system for processing a data stream can comprise a station engine, an execution engine, and a synchronize engine. A station engine can provide a stream operator to receive application logic, punctuate the data stream, and determine a number of input channels for parallel processing. The execution engine can perform a behavior of the application logic during a process operation. The synchronize engine can hold data of the data stream associated with a window until each input channel has reached a data boundary based on a boundary parameter.

Abstract: A method of capturing intentions within online text comprises with a data mining device (105), identifying (block 305) a number of statements of intention within an online forum (110), and with the data mining device (105), extracting (block 310) a number of attributes (240, 245, 250, 255, 260) from the statements of intention. A system (100) for extracting intentions expressed within an online forum comprises a data mining device (105), a forum server (115) comprising a number of online forums (110) communicatively coupled to the data mining device (105), in which the data mining device identifies a number of statements of intention within the online forums (110) and extracts a number of attributes (240, 245, 250, 255, 260) from the statements of intention.

Abstract: Described herein are techniques for failure recovery of a task state in batch-based stream processing. A message including a batch of tuples can be unpacked into component tuples. The component tuples can be processed at a task node. A failure-recovery checkpoint of a state of the task node can be generated before all of the component tuples have been processed.

Abstract: An example system includes an extraction module, an intention processing module, and an intention visualization module. The extraction module is configured to ingest textual data from a text source. The intention processing module is configured to process the textual data and identify one or more intention statements within the textual data. The intention visualization module is configured to provide an interactive interface that facilitates filtering and visualization of aspects of the one or more intention statements.

Abstract: A method for generating summaries of text is described. The method includes the step of extracting features from text of text lists from summaries. The explanatoriness of the text is then evaluated, wherein evaluating the explanatoriness of text includes evaluating the features of the text, including at least the step of evaluating the discriminativeness of the features of the text by comparing the text to a first text data set, wherein the first text data set is derived from a topic label. The evaluated text is then ranked based on the explanatoriness evaluation.

Abstract: Described herein are techniques enabling a query engine to process a query comprising a user defined function. The user defined function can include a request for analytics to be performed by an external analytic engine. The query engine can retrieve data from a database in accordance with the query and send the data and instructions to perform the analytics to the external analytic engine. The query engine can then receive analytic results from the external analytic engine.

Abstract: According to an example, a dataflow directed acyclic graph including nodes and edges connecting the nodes. Parameters for the nodes are calculated, and the parameters may include batch size and a degree of parallelism.

Abstract: An example system includes at least one memory and at least one processing device. The at least one memory comprises instructions that when executed by the at least one processing device cause the system to receive a text corpus, filter the text corpus to obtain a plurality of attributes, determine the semantic cohesion between the plurality of attributes, and create an attribute cloud including the plurality of attributes, where the placement of the plurality of attributes within the attribute cloud is based at least in part on the determined semantic cohesion between the plurality of attributes.

Abstract: A system and article are disclosed for objective-function based sentiment. In one example, the system includes a set of domain information, and a computer programmed with executable instructions which operate a set of modules. The modules include a sentiment polarization module for identifying a domain-aspect opinion-word pair within a set of domain data, and assigning a sentiment polarity score to the domain-aspect opinion-word pair based on an objective function which includes sentiment data from the domain information.

Abstract: A method and device may accept a first database query plan including a plurality of rows and a second database query plan including a plurality of rows, compare each row in the first database query plan with a corresponding row in the second database query plan, and based on each comparison, calculate a difference between the compared rows. Each difference may be recorded in an output file.

Abstract: Systems and methods are provided for determining an impact of a planned event. Traffic flow velocity is measured at each of a plurality of traffic sensors over a period of time before the planned event, with each traffic sensor having an associated geographical location. A plurality of measured traffic flow velocities for each traffic sensor are stored on a non-transitory computer readable medium. A traffic flow velocity at each traffic sensor is measured at each of a plurality of representative times within a defined time period including a known start time and an expected end time of the event. A threshold velocity is calculated from the stored traffic flow velocities for each traffic sensor corresponding to each representative time. For each representative time, a set of traffic sensors is determined at which the measured traffic flow velocity during the defined time period is less than the threshold velocity.

Abstract: A technique of recovering a failure in a data processing system comprises recording a number of input channels and sequence numbers for a number of input tuples transferred to a recipient task, recording a number of output channels and sequence numbers for a number of output tuples, and if a failure occurs, resolving the input and output channels.