摘要:
Page feed for efficient dataflow between distributed query engines is disclosed. An example method comprises storing a query result relation by a producer query as pages in a query engine buffer pool, and then sending these pages to a distributed caching platform (DCP) as the data source of another query. The example method also includes reading the result relation by a consumer query from the page stored in the DCP.
摘要:
A method includes binding a stationed operator to a database query engine, wherein the stationed operator comprises system utilities and an open executor to execute user-supplied application logic. The method further includes receiving an unbounded input stream of input tuples by the stationed operator, the stream of input tuples comprising a succession of chunks. The method also includes applying a query defined by the application logic to each successive chunk of the input stream to produce an output packet for each such chunk, and generating an unbounded output stream comprising the output packets.
摘要:
Methods, systems, and computer program products are provided for generating application-aware data partitioning to support parallel computing. A label for a user defined data partitioning (UDP) key is generated by a labeling process to configure data partitions of original data. The UDP is labeled by the labeling process to include at least one key property excluded from the original data. The data partitions are evenly distributed to co-locate and balance the data partitions and corresponding computations performed by computational servers. A data record of the data partitions is retrieved by performing an all-node parallel search of the computational servers using the UDP key.
摘要:
The present invention relates to devices and methods that coordinate an external conversation process between entities with an internal workflow of one of the entities. More particularly, it relates to devices and methods that are compliant with an inter-enterprise conversation process standard for routing electronic commerce documents between enterprises. Particular aspects of the present invention are described in the claims, specification and drawings.
摘要:
Attributes in data records are identified. Episodes corresponding to the respective attributes include respective data records. The episodes are scored, where scoring of a particular one of the episodes is based on relative time densities between successive data records of the particular episode. A visualization of at least some of the episodes to provide an alert of time-dense episodes.
摘要:
A method for generating sum maries 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.
摘要:
An open station as a stream analysis operator container is disclosed. In an example, a method is stored as instructions on computer readable media and executable by a processor. The method includes packaging graph-structured stream transformations into a topology of a top-level dataflow process including stream transformation operators (STOs) on open stations. The method also includes sending a tuple from one of the STOs to every other STO in the topology subscribed to a data stream of the tuple.
摘要:
Pixels representing attributes of data records are into discrete rings of a graphical visualization, where the discrete rings correspond to respective ones of the attributes, and where the pixels are arranged in each of the discrete rings according to time intervals of the data records. A correlation ring is provided in the graphical visualization in addition to the discrete rings, where the correlation ring has visual indicators for indicating degrees of correlation between at least two of the attributes.
摘要:
A nested chain of densest subgraphs is derived by a computer from a given graph that has multiple vertices and edges. The two ends of each edge are assigned with respective incident weights, and each vertex is given a vertex weight. A weight balancing process is carried out by the computer to iteratively go through the edges to adjust the incident weights of each edge and the vertex weights of the vertices connected by that edge to reduce a difference between the vertex weights of the two vertices. After the balancing, the vertex weights are put in an ordered sequence according to their values, and a nested chain of densest subgraphs is derived from the ordered sequence.
摘要:
There is provided a method (200) for querying a data stream. The method includes receiving a query plan based on a query specifying the data stream and a window. The method (200) further includes receiving one or more stream elements from the data stream during the window. Additionally, the method (200) includes applying the query to the one or more stream elements by passing the one or more stream elements from a scan operator at a leaf of the query plan to an upper layer of the query plan on a tuple-by-tuple basis. The method (200) also includes committing a result of the query based on the one or more stream elements.