Patent application number | Description | Published |
20100191716 | STRUCTURED PARALLEL DATA INTENSIVE COMPUTING - Methods, systems, and computer program products are provided for performing structured parallel data intensive computations. A SQL-FCF framework that defines a SQL construct based interface for performing the computations is provided. The computations within an application are coded as table valued functions (TVFs). Data for the application is partitioned into data partitions to co-locate and load balance the data partitions and corresponding computations. The TVFs are invoked and applied to corresponding ones of the data partitions in a structured order defined by function control forms (FCF). | 07-29-2010 |
20100192148 | USER DEFINED DATA PARTITIONING (UDP) - GROUPING OF DATA BASED ON COMPUTATION MODEL - 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. | 07-29-2010 |
20100228760 | CORRELATED QUERY PROCESS (CQP) AND PEER-TO-PEER (P2P) EXECUTION - Methods, systems, and computer program products are provided for processing correlated queries in a collaborative, role-based, peer-to-peer (P2P) execution system. A correlated query is configured in accordance to a collaborative correlated query process (CQP) template. The collaborative CQP template defines roles and steps, each step being executable by one of the roles. A role is assigned to each peer node of the P2P system. A peer node having a designated role executes a step that is executable by the designated role. A message is communicated to other P2P nodes to indicate completion of the step. Another peer node having a matching role to a next step in the correlated query executes the next step in response to the message. | 09-09-2010 |
20100250572 | DATA CONTINUOUS SQL PROCESS - One embodiment is a method that repeatedly triggers a User Defined Function (UDF) that generates a data stream. A data continuous Structured Query Language (SQL) query is applied to the data stream to construct a data continuous SQL process (DCSP) which executes in a database. | 09-30-2010 |
20110029551 | SYSTEM AND METHOD FOR GENERATING A USER-DEFINED FUNCTION USING A SHELL - A method is provided for generating a user-defined function (UDF) on a database engine of a database server. A user-function is sent to the database engine. The user-function includes a relational declaration with application and query logic. When the database engine receives the user-function, the database engine generates a function shell. The UDF processes the relational declaration of the user-defined function. The UDF includes the user-function and the function shell. The function shell returns a final data result of the user-defined function through the shell from the database engine. | 02-03-2011 |
20110029975 | COORDINATION OF TASKS EXECUTED BY A PLURALITY OF THREADS - To coordinate tasks executed by a plurality of threads that each includes plural task sections, a call of a mark primitive to mark a first point after a first of the plural task sections is provided. Also, a call of a second primitive is provided to indicate that a second of the plural task sections is not allowed to begin until after the plurality of threads have each reached the first point. | 02-03-2011 |
20110029982 | NETWORK BALANCING PROCEDURE THAT INCLUDES REDISTRIBUTING FLOWS ON ARCS INCIDENT ON A BATCH OF VERTICES - A representation of a flow network having vertices connected by arcs is provided. The vertices include a first set of vertices that provide flow to a second set of vertices over arcs connecting the first set and second set of vertices. A balancing procedure in the network is performed that includes redistributing flows on arcs incident on the second set of vertices. The balancing procedure includes selecting a batch of the vertices in the second set, and redistributing flows on arcs incident on the selected batch of vertices. The selecting and redistributing are repeated for other batches of vertices in the second set. | 02-03-2011 |
20110047172 | MAP-REDUCE AND PARALLEL PROCESSING IN DATABASES - One embodiment is a method that uses MapReduce and Relation Valued Functions (RVFs) with parallel processing to search a database and obtain search results. | 02-24-2011 |
20110055492 | MULTIPLE PROCESSING CORE DATA SORTING - Sorting data using a multi-core processing system is disclosed. An unsorted data set is copied from a global memory device to a shared memory device. The global memory device can store data sets for the multi-core processing system. The shared memory device can store unsorted data sets for sorting. The unsorted data set can include a plurality of data elements. The unsorted data set can be sorted into sorted data in parallel on the shared memory device using a cluster of processors of the multi-core processing system. The cluster of processors may include at least as many processors as a number of the data elements in the unsorted data set. The sorted data can be copied from the shared memory device to the global memory device. | 03-03-2011 |
20110057937 | METHOD AND SYSTEM FOR BLOCKING DATA ON A GPU - A method is provided for optimizing computer processes executing on a graphics processing unit (GPU) and a central processing unit (CPU). Process data is subdivided into sequentially processed data and parallel processed data. The parallel processed data is subdivided into a plurality of data blocks assigned to a plurality of processing cores of the GPU. The data blocks on the GPU are processed with other data blocks in parallel on the plurality of processing cores. Sequentially processed data is processed on the CPU. Result data processed on the CPU is returned. | 03-10-2011 |
20110066617 | SPATIAL QUERYING IN A DATA WAREHOUSE - A data warehouse that operates to receive a spatial query and return a spatial result for the spatial query, the data warehouse comprises a regular database operating to receive and process a regular query and return a query result in response to the regular query. The data warehouse also comprises an interface layer implemented external to the regular database and operating to intercept the spatial query and translate the spatial query into the regular query for processing by the regular database. The regular database includes at least one spatial index that is accessed by the interface layer to translate the spatial query into the regular query for processing by the regular database. | 03-17-2011 |
20110196856 | PROCESSING A DATA STREAM - Methods, database management systems (“DBMS”) and computer-readable media are provided for processing unbounded stream data using a traditional DBMS. Execution of a query that includes a data stream as a data source may be initiated. Tuples may be processed in accordance with the query as the tuples are received through the data stream until an indication is received that execution of the query should cease. | 08-11-2011 |
20110202550 | Functional-form queries - Middleware is integrated within a database engine. The middleware is to execute a functional-form query representing a dataflow graph comprising queries and relation valued functions. The middleware is to interact with the database engine to cause the database engine to execute the queries. Each relation valued function receives a plurality of first relations as input and generates a second relation as output. | 08-18-2011 |
20120078868 | Stream Processing by a Query Engine - A database system executes a method that receives, at a query engine in the database system, a continuous stream of data. The query engine continuously analyzes the continuous stream of data with window functions in a single long-standing query. | 03-29-2012 |
20120078939 | Query Rewind Mechanism for Processing a Continuous Stream of Data - A query engine receives a continuous stream of data and applies a Structured Query Language (SQL) query to the data. The data is processed on a chunk-by-chunk basis with a query rewind mechanism that sustains the SQL query as a single long-standing query that allows a state of the SQL query to be maintained. | 03-29-2012 |
20120185439 | DATA STAGING FOR RESULTS OF ANALYTICS - Systems and methods of data staging for results of analytics are disclosed. An example of a method includes maintaining current results from the analytics in a first data structure, the first data structure having a label identifying first data structure as a target for queries. The method also includes maintaining prior results from the analytics in at least one other data structure. The method also includes changing the label of the first data structure after a predetermined time. The method also includes assigning the label to one of the other data structures, wherein the label identifies the one of the other data structures as the target for queries. | 07-19-2012 |
20120185460 | SYSTEMS AND METHODS OF BLOCK COMPUTATION - Systems and methods of block computation are disclosed. An example of a method includes buffering a plurality of tuples in a build phase. The method also includes, after buffering a last of the plurality of tuples, applying a computation to all of the buffered tuples in a compute phase. The method also includes returning results of the computation one tuple at a time to a query processing pipeline in a stream-out phase. | 07-19-2012 |
20120197950 | SENTIMENT CUBE - A sentiment cube system is disclosed. In one example, the system discloses a sentiment storage, including a sentiment cube data structure having a set of cells arranged by a set of dimensions. The system includes a computer programmed with executable instructions which operate a set of modules, wherein the modules comprise: a sentiment storage module which receives sentiment values associated with a set of entity features, and then populates a hierarchy of the cells in the sentiment cube with the sentiment values. A sentiment analysis module effecting a set of operations on the sentiment cube. | 08-02-2012 |
20120296861 | STORING EVENTS FROM A DATASTREAM - A data stream is stored in a database. An event pipe stores a sliding window of events from the data stream. A query is responded to by utilizing the sliding window of events stored in the event pipe. | 11-22-2012 |
20120303901 | Distributed caching and analysis system and method - Distributed caching and analysis system and method are disclosed. In an example, a method for distributed caching and analyzing includes processing a local data partition on a distributed caching platform (DCP) by a query engine at each node in the DCP. The method also includes aggregating query results for a client from multiple nodes in the DCP for real-time, parallel analytics. | 11-29-2012 |
20120317049 | SELECTING SENTIMENT ATTRIBUTES FOR VISUALIZATION - Data records containing user feedback regarding at least one offering are received. From among candidate attributes in the received data records, a subset of attributes that relate to user sentiment regarding the at least one offering is selected, where the selecting is according to selection criteria including frequency of occurrence of the candidate attributes, relative amounts of negative and positive feedback associated with the candidate attributes, and time density of feedback associated with the candidate attributes. A visualization of at least one sentiment characteristic of the selected subset of attributes that relate to user sentiment is presented for display. | 12-13-2012 |
20130006596 | GENERATING DISCRETE EVENT SIMULATION DATA - A method of generating discrete event simulation data using a query is provided herein. The method includes retrieving a trajectory specifying a service access event for a customer accessing a service in a simulation. The method also includes processing, in a relational database query, one or more pending events corresponding to one or more customers accessing the service before the customer. Additionally, the method includes processing, in the relational database query, the service access event. Processing the service access event occurs after processing the one or more pending events. The method also includes providing a result for the relational database query. The result comprises the trajectory, and the one or more trajectories. | 01-03-2013 |
20130031137 | DATA MANAGEMENT SYSTEM FOR EFFICIENT STORAGE AND RETRIEVAL OF MULTI-LEVEL/MULTI-DIMENSIONAL DATA - The present application is directed to a data management system. The data management system is implemented within a computer system that includes one or more processors, one or more electronic memories, and a memory-mapped file facility that electronically stores data. The data management system, implemented by data management system control routines that are executed by the one or more processors, retrieves a particular projection of a multi-level, multi-dimension data set stored within the ONP-tree data structure that contains the multi-level, multi-dimension data set. | 01-31-2013 |
20130031139 | MULTI-INPUT, MULTI-OUTPUT-PER-INPUT USER-DEFINED-FUNCTION-BASED DATABASE OPERATIONS - The current application discloses a database management system that provides multiple-input, multiple-output-per-input user-defined-function-based operations. The database management system comprises at least one processor and electronic memory, a database-query processor, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that makes multiple calls to a multiple-input, multiple-output-per-input user-defined-function, in each call transmitting a next input to the multiple-input, multiple-output-per-input user-defined-function, and the multiple-input, multiple-output-per-input user-defined-function, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that uses three different memory buffers, the contents of which are maintained for three different time periods, to compute and return to the database-query processor multiple outputs in response to at least one of the multiple inputs. | 01-31-2013 |
20130061023 | COMBINING DATA VALUES THROUGH ASSOCIATIVE OPERATIONS - A method for combining data values through associative operations. The method includes, with a processor, arranging any number of data values into a plurality of columns according to natural parallelism of the associative operations and reading each column to a register of an individual processor. The processors are directed to combine the data values in the columns in parallel using a first associative operation. The results of the first associative operation for each column are stored in a register of each processor. | 03-07-2013 |
20130080413 | MULTI-STREAMS ANALYTICS - Multi-stream analytics is disclosed. An example method of multi-stream analytics with a query engine includes punctuating unbounded streaming data into data chunks, each of the data chunks representing a bounded data set in the unbounded streaming data. The method also includes processing one of the data chunks. The method also includes rewinding a query instance for processing another of the data chunks. | 03-28-2013 |
20130080474 | ACCELERATING RECURSIVE QUERIES - A computer apparatus and related method to accelerate recursive queries is provided. In one aspect, a node located within a data structure may be accessed. The data structure may emulate a hierarchy of interlinked nodes. In another aspect, a series of bits may be generated that indicate a level of the node within the hierarchy and that outline a unique path of interlinked nodes toward the node. | 03-28-2013 |
20130091123 | QUERY TO STREAMING DATA - A client computer buffers a continuous flow of streaming data during a sliding window that is defined by a time boundary. The client computer processes a query on a portion of the streaming data buffered during the time boundary of the sliding window and a portion of the streaming data stored in a data warehouse. | 04-11-2013 |
20130110862 | MAINTAINING A BUFFER STATE IN A DATABASE QUERY ENGINE | 05-02-2013 |
20130191370 | System and Method for Querying a Data Stream - There is provided a method ( | 07-25-2013 |
20130191413 | Continuous Querying of a Data Stream - In continuous querying of a data stream, a query including query cycles can be initialized ( | 07-25-2013 |
20130194272 | PLACING PIXELS ACCORDING TO ATTRIBUTE VALUES IN POSITIONS IN A GRAPHICAL VISUALIZATION THAT CORRESPOND TO GEOGRAPHIC LOCATIONS - Data records representing user feedback are received, where the data records are associated with geometric coordinates. Pixels representing the corresponding data records are placed in positions in a graphical visualization according to the geometric coordinates of the data records, where the positions correspond to geographic locations. A subset of the pixels sharing a particular set of geometric coordinates is placed in a subregion of nearby positions in the graphical representation, where the pixels in the subset are placed in an order in the subregion according to values of an attribute of the data records corresponding to the pixels in the subset. | 08-01-2013 |
20130215137 | GENERATING A CALENDAR GRAPHICAL VISUALIZATION INCLUDING PIXELS REPRESENTING DATA RECORDS CONTAINING USER FEEDBACK - A calendar graphical visualization is generated that includes an arrangement of blocks including pixels representing data records containing user feedback, wherein plural groups of the blocks represent different attributes of the data records, and wherein the blocks correspond to respective time intervals. A size of the blocks is determined based on identifying a union of time positions corresponding to data records received for the different attributes in a particular time interval of the time intervals. Pixels in a first of the blocks corresponding to a first of the attributes are aligned with pixels in a second of the blocks corresponding to a second of the attributes by placing gaps in the first and second blocks at respective time positions that are missing values for corresponding ones of the attributes. | 08-22-2013 |
20130226840 | Deriving a Nested Chain of Densest Subgraphs from a Graph - 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. | 08-29-2013 |
20130238656 | PAGE FEED FOR EFFICIENT DATAFLOW BETWEEN DISTRIBUTED QUERY ENGINES - 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. | 09-12-2013 |
20130257903 | OVERLAYING TRANSPARENCY IMAGES INCLUDING PIXELS CORRESPONDING TO DIFFERENT HEIRARCHICAL LEVELS OVER A GEOGRAPHIC MAP - Data records contain corresponding values of an attribute and are associated with location information. Hierarchical levels of transparency images are generated, where each of the transparency images includes corresponding pixels that represent the respective data records, and where the transparency images at different ones of the hierarchical levels correspond to different zoom levels of a geographic map. At least one of the transparency images at a dynamically-selected one of the hierarchical levels is overlaid over the geographic map according to which of the zoom levels is selected by a user in zooming of the geographic map, where the at least one transparency image is automatically selected without user input. | 10-03-2013 |
20130259362 | ATTRIBUTE CLOUD - 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. | 10-03-2013 |
20130263019 | ANALYZING SOCIAL MEDIA - A system, method and a non-transitory computer readable medium comprising instructions for automated analysis of for analyzing social media, the method comprising a processor to acquire data as a snapshot or a continuous stream from one or more online sites via adapters. Storing data in a database, the database configured for rapid acquisition of data and rapid responses to queries from one or a plurality of users. Analyzing the data using one or a plurality of algorithms, the algorithms configured to distill insight at an attribute level, and presenting one or a plurality of graphical user interfaces on a user-configurable, and temporal-view adjustable dashboard, the dashboard configured to present one or more results of said one or a plurality of algorithms, said one or more results depicted through one or a plurality of paradigms of data visualization. | 10-03-2013 |
20130278623 | PROVIDING A CORRELATION RING FOR INDICATING CORRELATION BETWEEN ATTRIBUTES - 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. | 10-24-2013 |
20130282654 | QUERY ENGINE COMMUNICATION - There is provided a computer-implemented method of performing inter-query engine communication. The method includes receiving a message from a first query engine agent over a signal communication network. The first query engine agent is associated with a first query engine. The method also includes determining, by a second query engine agent associated with a second query engine, a data exchange to perform based on the message. Additionally, the method includes performing the data exchange over a data communication network. | 10-24-2013 |
20130290232 | IDENTIFYING NEWS EVENTS THAT CAUSE A SHIFT IN SENTIMENT - A method identifies news events that cause shifts in sentiments. The method includes compiling a sentiment time series, the sentiment time series expressing a shift in sentiment; compiling a news events time series; correlating the sentiment and news events time series; identifying from the correlation news events that caused a shift in sentiment and predicting if a selected news event may cause a shift in sentiment in the future. | 10-31-2013 |
20130290300 | IN-DATABASE PARALLEL ANALYTICS - In-database parallel analytics is disclosed. An example method includes receiving a function in a functional programming environment. The example method includes pushing operations for the function to a database layer for executing the operations. The example method also includes returning results of the operations to the functional programming environment. | 10-31-2013 |
20130290352 | CONCATENATION FOR RELATIONS - Methods for generating a query input string include sorting a first input relation and a second input relation in order from the first relation to the second relation. The second input relation is concatenated to the first input relation, and the concatenated input relations are stored in a single string. | 10-31-2013 |
20130290368 | BAYESIAN NETWORKS OF CONTINUOUS QUERIES - Nodes of a Bayesian network can be respectively associated with continuous queries. In response to a result of one of the continuous query changing, the continuous queries that are associated with nodes in the Bayesian network that are descendant of a node associated with the changed continuous query are evaluated. | 10-31-2013 |
20130290554 | OPEN STATION AS A STREAM ANALYSIS OPERATOR CONTAINER - 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. | 10-31-2013 |
20130290636 | MANAGING MEMORY - Methods, and apparatus to cause performance of such methods, for managing memory. The methods include requesting a particular unit of data from a first level of memory. If the particular unit of data is not available from the first level of memory, the methods further include determining whether a free unit of data exists in the first level of memory, evicting a unit of data from the first level of memory if a free unit of data does not exist in the first level of memory, and requesting the particular unit of data from a second level of memory. If the particular unit of data is not available from the second level of memory, the methods further include reading the particular unit of data from a third level of memory. The methods still further include writing the particular unit of data to the first level of memory. | 10-31-2013 |
20130325440 | GENERATION OF EXPLANATORY SUMMARIES - 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. | 12-05-2013 |
20140037227 | Hierarchical cluster determination based on subgraph density - Densest subgraphs of a graph are determined. The graph includes vertices and edges interconnecting the vertices. Each edge connects two of the vertices and has a weight. The vertices and the edges form subgraphs from which the densest subgraphs are determined as those subgraphs having densities greater than a threshold. Clusters at levels of a hierarchy are determined based on the densest subgraphs. Each cluster includes a set of the vertices and a set of the edges of the graph. Each level corresponds to a different density of the clusters. The hierarchy is ordered from a most-dense level of the clusters to a least-dense level of the clusters. | 02-06-2014 |
20140039875 | VISUAL ANALYSIS OF PHRASE EXTRACTION FROM A CONTENT STREAM - A system may include an extraction engine to extract candidate phrases from a content stream, and an analysis engine to assign the candidate phrases visual cues and display the visual cues to an operator. | 02-06-2014 |
20140040237 | DATABASE RETRIEVAL IN ELASTIC STREAMING ANALYTICS PLATFORM - Managing retrieval of data from a data streaming process, such that a query required by multiple operator instances is not executed more than once. A Data Access Station (DAS) facilitates data retrieval for an operator(s) O and its multiple operator instances, and mitigates (or avoids) repetition of queries by the multiple operator instances. | 02-06-2014 |
20140040247 | VISUALIZING TIME-DENSE EPISODES - 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. | 02-06-2014 |
20140040903 | Queue and operator instance threads to losslessly process online input streams events - A queue enqueues an online input stream of events arriving at the queue in real-time. An operator instance has one or more threads to losslessly dequeue and process the events from the queue, and to output processing results of the events in a common output stream. The one or more threads are dynamically instantiated and destantiated to maintain an optimal number of the one or more threads while ensuring that none of the events of the online input stream are dropped. | 02-06-2014 |
20140040915 | OPEN STATION CANONICAL OPERATOR FOR DATA STREAM PROCESSING - Customizing functions performed by data flow operators when processing data streams. An open-executor(s) is provided as part of the data stream analytics platform, wherein such open-executor allows for both of: 1) customizing user plug-ins for the operators, to accommodate changes in user requirements; and 2) predefining templates that are based on specific meta-properties of various operators and that are common therebetween. | 02-06-2014 |
20140108455 | Capturing Intentions Within Online Text - A method of capturing intentions within online text comprises with a data mining device ( | 04-17-2014 |
20140156707 | STREAMING SYSTEM PERFORMANCE OPTIMIZATION - 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. | 06-05-2014 |
20140172861 | VISUALIZING A RELATIONSHIP OF ATTRIBUTES USING A RELEVANCE DETERMINATION PROCESS TO SELECT FROM CANDIDATE ATTRIBUTE VALUES - For plural categorical values of a first attribute, more relevant categorical values of a second attribute are selected from among candidate categorical values of the second attribute, where the selecting uses a relevance determination process that considers frequencies of occurrence of respective pairs of the categorical values of the first and second attributes. A visualization that includes groups of cells corresponding to the respective pairs of categorical values of the first and second attributes is generated. At least one of the groups includes cells assigned visual indicators based on values of a third attribute. | 06-19-2014 |
20140204090 | VISUALIZATION THAT INDICATES EVENT SIGNIFICANCE REPRESENTED BY A DISCRIMINATIVE METRIC COMPUTED USING A CONTINGENCY CALCULATION - Using a contingency calculation based on a number of events sharing a collection of values of plural attributes, a discriminative metric is computed representing a statistical significance of the events that share the collection of values of the plural attributes. A visualization is generated that includes cells representing respective events, the visualization including a region containing a subset of the cells corresponding to the collection of values of the plural attributes, and the visualization including a significance visual indicator associated with the region to indicate the statistical significance of the events sharing the collection of values of the plural attributes. | 07-24-2014 |
20140267290 | Visual Analytics of Multivariate Session Data Using Concentric Rings with Overlapping Periods - Visual analytics for multivariate session data using concentric rings with overlapping periods includes displaying an interactive graph in a display. The interactive graph includes at least a portion of multiple concentric rings where each one of at least some of the multiple concentric rings represents periodic time units. At least some of the multiple concentric rings are divided into cells where the cells represent smaller time periods than the time units. A color of each of the cells represents a value of a metric. Also, an overlapping period ring displayed with the multiple concentric rings where the overlapping period ring comprises segments that represent overlapping metrics from the cells of the concentric rings that correspond with the segments. | 09-18-2014 |
20140320539 | SEMANTIC ZOOM-IN OR DRILL-DOWN IN A VISUALIZATION HAVING CELLS WITH SCALE ENLARGEMENT AND CELL POSITION ADJUSTMENT - A region is selected in a visualization that displays cells representing respective events, the cells being depicted in the visualization according to a first group of attributes of the events, where the region corresponds to a subset of the events. In response to detecting a first type of input provided with respect to the region, a semantic zoom-in visualization of the region is generated, the semantic zoom-in visualization depicting the cells representing the events of the subset at an enlarged scale and according to the first group of attributes and at a higher resolution to show further information relating to the events of the subset. In response to detecting a second type of input provided with respect to the region, a semantic drill-down visualization of the region is generated, the semantic drill-down visualization visualizing the events of the subset at an enlarged scale and according to a second group of attributes having at least one attribute that differs from the attributes of the first group. Generating the semantic zoom-in visualization or the semantic drill-down visualization includes adjusting positions of cells sharing common attribute values. | 10-30-2014 |
20140325329 | Visual Analytics of Multivariate Data Using a Cell Based Calendar Matrix having a Visual Folding Mechanism - Visual analytics of multivariate data using a cell based calendar matrix having a visual folding mechanism can include forming a time based layout that is divided into cells where the cells represent measurement intervals and a color of the cells represents a measurement value, folding the time based layout into a cell based calendar matrix with other time based layouts that include other cells that represent corresponding measurement intervals in different calendar units of the cell based calendar matrix, and displaying the cell based calendar matrix in a display such that the cells of the time based layout align by time with the other cells of the other time based layouts. | 10-30-2014 |
20140325417 | Visual Analytics Using Multivariate Concentric Rings with a Visual Start Time Mechanism - Visual analytics using multivariate concentric rings with a visual start time mechanism includes displaying an interactive graph where the interactive graph has multiple concentric rings that have multiple cells that represent sequential time periods. The concentric rings form a time unit that starts at an origin and ends at a time unit end and also has a pre-nonorigin starting section and a post-nonorigin starting section. A color is displayed in the cells to represent measurements associated with time stamps corresponding to cells in the post-nonorigin starting section. Further, a background color is displayed in cells of the pre-nonorigin starting section. The cells in the pre-nonorigin starting section are reused by displaying a color to represent metrics associated with time stamps belonging to a subsequent time unit. | 10-30-2014 |
20140325476 | MANAGING A CATALOG OF SCRIPTS - According to an example, a catalog of scripts may be managed. Management of the catalog of scripts may include the addition of a script description into the catalog of scripts. In one example, the script description may be directly added to the catalog of scripts. In another example, the script description may be added through generation of a merged query of scripts. | 10-30-2014 |
20140365149 | Visual Analytics of Spatial Time Series Data Using a Pixel Calendar Tree - Example embodiments relate to providing visual analytics of spatial time series data. In example embodiments, sensors may be located at regions within a building for collecting sensor data at regular time intervals. A sensor hierarchy can be generated including sensor nodes that are hierarchically arranged according to a physical infrastructure of the building, where each of the sensor nodes corresponds to a sensor. Sensor data can be obtained from the sensors, and a pixel calendar tree can be generated based on the sensor data and the sensor hierarchy, where the pixel calendar tree is recursively subdivided into tree portions according to a proportion of the sensor data attributable to each of the sensors. The pixel calendar tree can be displayed, where each of the tree portions includes time series sensor data of a corresponding region that is generated based on the sensor data. | 12-11-2014 |
20150035833 | Visual Analytics of Temporal-spatial Relationships Using a Hierarchical Pixel Calendar Tree - Example embodiments relate to providing visual analytics of temporal-spatial relationships. In example embodiments, power meters may be located at regions within a building for collecting power consumption data at regular intervals. The power consumption data can be recursively processed to generate a pixel calendar tree by using a power meter hierarchy to subdivide the pixel calendar tree into tree portions according to a proportion of the power consumption data attributed to each of power meter nodes, where the tree portions are arranged in the pixel calendar tree according to an importance of the proportion; generating pixel cells in the pixel calendar tree that each represent a day in the power consumption data; and generating cell borders that each surround one of the pixel cells. At this stage, a pixel calendar display of a physical infrastructure of the building that includes the pixel cells and the cell borders can be generated. | 02-05-2015 |