Patent application number | Description | Published |
20090106417 | Method and apparatus for packet analysis in a network - A method and system for monitoring traffic in a data communication network and for extracting useful statistics and information is disclosed. | 04-23-2009 |
20090171890 | Efficient predicate prefilter for high speed data analysis - A method and system are disclosed for operating a high speed data stream management system which runs a query plan including a set of queries on a data feed in the form of a stream of tuples. A predicate prefilter is placed outside the query plan upstream of the set of queries, and includes predicates selected from those used by the queries. Predicates are selected for inclusion in the prefilter based on a cost heuristic, and predicates are combined into composites using a rectangle mapping heuristic. The prefilter evaluates the presence of individual and composite predicates in the tuples and returns a bit vector for each tuple with bits representing the presence or absence of predicates in the tuple. A bit signature is assigned to each query to represent the predicates related to that query, and a query is invoked when the tuple bit vector and the query bit signature are compatible. | 07-02-2009 |
20090187584 | Query-aware sampling of data streams - A system, method and computer-readable medium provide for assigning sampling methods to each input stream for arbitrary query sets in a data stream management system. The method embodiment comprises splitting all query nodes in a query directed acyclic graph (DAG) having multiple parent nodes into sets of independent nodes having a single parent, computing a grouping set for every node in each set of independent nodes, reconciling each parent node with each child node in each set of independent node, reconciling between multiple child nodes that share a parent node and generating a final grouping set for at least one node describing how to sample an input stream for that node. | 07-23-2009 |
20100030741 | METHOD AND APPARATUS FOR PERFORMING QUERY AWARE PARTITIONING - A method and system for providing query aware partitioning are disclosed. For example, the method receives a query plan comprising a plurality of queries, and classifies each one of the plurality of queries. The method computes an optimal partition set for each one of the plurality of queries, and reconciles the optimal partition set of each one of the plurality of queries with at least one subset of queries of the plurality of queries. The method selects at least one reconciled optimal partition set to be used by each query of the plurality of queries, and stores the selected at least one reconciled optimal partition set in a computer readable medium. | 02-04-2010 |
20110060818 | Method and Apparatus for Packet Analysis in a Network - A method and system for monitoring traffic in a data communication network and for extracting useful statistics and information is disclosed. | 03-10-2011 |
20110131198 | METHOD AND APPARATUS FOR PROVIDING A FILTER JOIN ON DATA STREAMS - A method and apparatus for processing at least one data stream are disclosed. For example, the method receives at least a join query for the at least one data stream, wherein the join query specifies a lifetime for keeping a tuple as a marker for a beginning of a sequence of interest, and receives a tuple from the at least one data stream. The method marks the tuple as a beginning of a sequence of interest and stores the tuple, if the tuple is the beginning of the sequence of interest. The method applies one or more initial predicates to the tuple, and determines if the tuple matched a marked tuple, if the tuple meets the one or more initial predicates. The method determines if the tuple meets one or more conditions to be outputted, if the tuple meets the one or more initial predicates conditions. | 06-02-2011 |
20120131589 | METHOD FOR SCHEDULING UPDATES IN A STREAMING DATA WAREHOUSE - A method for scheduling atomic update jobs to a streaming data warehouse includes allocating execution tracks for executing the update jobs. The tracks may be assigned a portion of available processor utilization and memory. A database table may be associated with a given track. An update job directed to the database table may be dispatched to the given track for the database table, when the track is available. When the track is not available, the update job may be executed on a different track. Furthermore, pending update jobs directed to common database tables may be combined and separated in certain transient conditions. | 05-24-2012 |
20120155255 | METHOD AND APPARATUS FOR MANAGING A DEGREE OF PARALLELISM OF STREAMS - A method, computer readable medium and apparatus for managing a degree of parallelism of streams are disclosed. For example, the method analyzes wireless traffic to determine a profile of the wireless traffic, determines an amount of available processing resources, and manages the degree of parallelism of streams based on the profile and the amount of available processing resources in a probe server. | 06-21-2012 |
20120209817 | Methods, Systems, and Products for Maintaining Data Consistency in a Stream Warehouse - Methods, systems, and products characterize consistency of data in a stream warehouse. A warehouse table is derived from a continuously received a stream of data. The warehouse table is stored in memory as a plurality of temporal partitions, with each temporal partition storing data within a contiguous range of time. A level of consistency is assigned to each temporal partition in the warehouse table. | 08-16-2012 |
20130054769 | Data Feed Management - The present disclosure is directed to systems, methods, and computer-readable storage media for data feed management. Data feeds can be received at one or more landing directories associated with a feed management system. The feed management system can be configured to map the data feeds in the landing directories to one or more subscribers, and the data feeds can be moved to one or more staging directories associated with the subscribers. The data feeds can be delivered to the one or more subscribers from the staging directories. Receipts indicating delivery of the data feeds can be stored by the feed management system. The feed management system can be configured to manage data feeds, landing directories, and staging directories. | 02-28-2013 |
20140156642 | Generating And Using Temporal Metadata Partitions - Concepts and technologies are disclosed herein for generating and using temporal metadata partitions. Metadata can be stored in temporal metadata partitions based upon a time range included in the metadata. Furthermore, metadata can be stored in multiple temporal metadata partitions to which the metadata is relevant. As such, metadata can be stored in manner that allows event data to be understood in the context of temporally accurate and/or relevant metadata. Functionality for executing queries of event data and providing results in view of metadata, as well as the merging of multiple temporal metadata partitions also are disclosed. | 06-05-2014 |
20140164409 | Generating And Using Temporal Data Partition Revisions - Concepts and technologies are disclosed herein for generating and using temporal data partition revisions. In some embodiments, a server computer can execute a data management application. The server computer can obtain a data partition associated with a data stream. The data partition can include a data point and a timestamp. The server computer can analyze the timestamp to determine if the data partition corresponds to an update of a base data record. If the server computer determines that the data corresponds to an update, the server computer can compute a revision comprising a delta and a timestamp and store the revision. | 06-12-2014 |
20140164430 | Managing A Distributed Database - Concepts and technologies are disclosed herein for managing a distributed database. A data management application can obtain a query. The data management application can analyze the query to determine a number of data structures relevant to the query. The data management application also can analyze data stores storing the data structures and move or assign data structures to other data stores within a distributed database. The movement of the data structures within the distributed database can be based upon greedy algorithms for moving data and/or executing queries. | 06-12-2014 |
20140204789 | METHOD AND APPARATUS FOR MANAGING A DEGREE OF PARALLELISM OF STREAMS - A method, computer readable medium and apparatus for managing a degree of parallelism of streams are disclosed. For example, the method analyzes wireless traffic to determine a profile of the wireless traffic, determines an amount of available processing resources, and manages the degree of parallelism of streams based on the profile and the amount of available processing resources in a probe server. | 07-24-2014 |