-
公开(公告)号:US10394813B2
公开(公告)日:2019-08-27
申请号:US15237200
申请日:2016-08-15
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk , Oliver Spatscheck
IPC: G06F16/20 , G06F16/2453
Abstract: 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.
-
公开(公告)号:US10389764B2
公开(公告)日:2019-08-20
申请号:US15296742
申请日:2016-10-18
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk
IPC: G06F15/16 , H04L29/06 , H04L12/931 , H04L12/713
Abstract: A method, computer-readable medium, and device for processing a stream of records are disclosed. A method may receive a registration request from a data source to join in providing a plurality of records to the stream, synchronize a timing system with the data source, receive an initial timestamp from the data source, and post the initial timestamp to a plurality of operators or a plurality of subscribers before the data source is allowed to send records into the stream.
-
公开(公告)号:US10223475B2
公开(公告)日:2019-03-05
申请号:US15253591
申请日:2016-08-31
Applicant: AT&T Intellectual Property, I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk , Yaron Kanza
IPC: G06F17/30
Abstract: A method includes parsing a regular pathway expression into fragments including an anchored fragment and at least one other fragment. A number of the fragments is based on at least a length limitation of the regular pathway expression. The method includes generating an operator directed acyclic graph (DAG) including non-operator nodes, operator nodes, and a root based on at least the anchored fragment. The method includes removing, from the operator DAG, at least one of the non-operator nodes and connecting a first operator node to a second operator node of the operator nodes. The first operator node includes an edge into the at least one removed non-operator node, and the second operator node includes an edge from the at least one removed node. The method includes executing the operator DAG on a graph database to return a pathway set comprising at least one pathway that satisfies the regular pathway expression.
-
公开(公告)号:US20180139118A1
公开(公告)日:2018-05-17
申请号:US15352028
申请日:2016-11-15
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk
CPC classification number: H04L43/106 , H04L41/0663 , H04L41/5009 , H04L43/022 , H04L43/0847
Abstract: A device, method and computer-readable medium for recovering a replica in an operator in a data streaming processing system are disclosed. A method may obtain a checkpoint in an input data stream, determine a maximum-timestamp at the checkpoint in the input data stream, calculate a completeness point that is greater than the maximum-timestamp for an output data stream and process data records from the checkpoint onwards that have a respective timestamp that is greater than or equal to the completeness point that was calculated to generate a new replica to replace a failed replica.
-
公开(公告)号:US20180006897A1
公开(公告)日:2018-01-04
申请号:US15198448
申请日:2016-06-30
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Yaron Kanza , Theodore Johnson , Vladislav Shkapenyuk , Laks V.S. Lakshmanan
CPC classification number: H04L41/145 , G06F16/2455 , G06F16/9024 , H04L41/142 , H04W24/04
Abstract: A system may include a processor and an input adapted to communicate with a network. The system may also include memory storing instructions that cause the processor to effectuate operations. The operations may include detecting a plurality of nodes in the network based on data received at the input and for each of a plurality of nodes, instantiating a node data structure. The operations may also include, for each respective node of the plurality of nodes, identifying an edge indicative of a connection between the respective node and a second node of the plurality of nodes, and instantiating a plurality of edge data structures based on the edges. The operations may also include creating a graph database comprising a layered graph based on data structures, the data structures comprising the plurality of node data structures and the plurality of edge data structures.
-
公开(公告)号:US09674728B2
公开(公告)日:2017-06-06
申请号:US14225092
申请日:2014-03-25
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Alexandre Gerber , Theodore Johnson , Vladislav Shkapenyuk , Oliver Spatscheck , Frederick True
IPC: H04L12/28 , H04W28/02 , H04L12/24 , H04W24/08 , H04J1/16 , H04L12/26 , H04L12/927 , H04L12/911
CPC classification number: H04W28/0231 , H04L41/0896 , H04L43/028 , H04L43/0817 , H04L47/805 , H04L47/808 , H04L47/822 , H04L47/824 , H04W24/08
Abstract: 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.
-
公开(公告)号:US20160042029A1
公开(公告)日:2016-02-11
申请号:US14886435
申请日:2015-10-19
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Marios Hadjieleftheriou , Theodore Johnson , Vladislav Shkapenyuk
IPC: G06F17/30
CPC classification number: G06F17/30377 , G06F17/30283 , G06F17/30477
Abstract: 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.
Abstract translation: 这里公开了用于管理分布式数据库的概念和技术。 数据管理应用程序可以获取查询。 数据管理应用程序可以分析查询以确定与查询相关的多个数据结构。 数据管理应用程序还可以分析存储数据结构的数据存储,并将数据结构移动或分配给分布式数据库中的其他数据存储。 数据结构在分布式数据库中的移动可以基于用于移动数据和/或执行查询的贪心算法。
-
公开(公告)号:US20140156642A1
公开(公告)日:2014-06-05
申请号:US13693597
申请日:2012-12-04
Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.
Inventor: Theodore Johnson , Marios Hadjieleftheriou , Vladislav Shkapenyuk
IPC: G06F17/30
CPC classification number: G06F17/30525 , G06F17/30091 , G06F17/30424 , G06F17/30445 , G06F17/30486 , G06F17/30551 , G06F17/30864
Abstract: 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.
Abstract translation: 这里公开了用于生成和使用时间元数据分区的概念和技术。 元数据可以基于元数据中包含的时间范围存储在时间元数据分区中。 此外,元数据可以存储在元数据相关的多个时间元数据分区中。 因此,可以以允许在时间准确和/或相关元数据的上下文中理解事件数据的方式存储元数据。 还公开了用于执行事件数据的查询并且提供元数据的结果以及多个时间元数据分区的合并的功能。
-
公开(公告)号:US20130238547A1
公开(公告)日:2013-09-12
申请号:US13872549
申请日:2013-04-29
Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk , Lukasz Golab
IPC: G06F17/30
CPC classification number: G06F17/30589 , G06F9/50 , G06F9/5027 , G06F17/30563 , G06F2209/501 , G06F2209/5017
Abstract: Methods, systems, and products schedule updates to stream warehouses. A plurality of execution tracks are allocated in memory, with each execution track assigned a portion of utilization of a processor and a proportionate portion of the memory. A home track is also defined in the plurality of execution tracks. When the home track is unavailable, then a different track in the plurality of execution tracks is selected, and a database update job is dispatched to the different track.
Abstract translation: 方法,系统和产品计划更新流存储仓库。 在存储器中分配多个执行轨道,每个执行轨道分配处理器的一部分利用率和存储器的比例部分。 还在多个执行轨道中定义归属轨迹。 当主轨道不可用时,选择多个执行轨道中的不同轨道,并且将数据库更新作业调度到不同的轨道。
-
-
-
-
-
-
-
-