-
公开(公告)号:US20200210487A1
公开(公告)日:2020-07-02
申请号:US16813372
申请日:2020-03-09
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk
IPC: G06F16/903 , G06F16/901
Abstract: A system may include a processor, a user input, and memory comprising a graph and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations include receiving, via the user input, a query comprising a class generalization and pathway variables. The operations include identifying a query class based on at least the class generalization and determining an anchor set based on at least one of the pathway variables. The operations also include translating the pathway variables into a pathway algebraic expression based on the anchor set and the query class and executing the pathway algebraic expression on the graph to return a pathway set.
-
公开(公告)号:US20200057768A1
公开(公告)日:2020-02-20
申请号:US16664888
申请日:2019-10-27
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk
IPC: G06F16/2455 , H04L9/06
Abstract: A device, method and computer-readable medium for generating unique identification for records in a data streaming processing system are disclosed. A method may collect an identification of a source of a data record, a timestamp of the data record and a count of a number of records a data source has added to the stream with that timestamp, generate a unique identification with the identification of the source of the data record, the timestamp of the data record and the count of the number of records the data source has added to the stream with that timestamp, apply the unique identification to the data record and transmit the data record with the unique identification to a downstream operator within a data stream processing system.
-
公开(公告)号:US10346272B2
公开(公告)日:2019-07-09
申请号:US15340478
申请日:2016-11-01
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk
Abstract: A device, method and computer-readable medium for providing failure management of a data streaming processing system are disclosed. A method may detect a first replica of a shard has failed during processing of the stream of data records between a first operator and a second operator, notify the first operator and the second operator that the first replica of the shard has failed, perform a rewind procedure to identify data records that have been processed in the first replica and resume processing of the stream of data records between the first operator and the second operator via a second replica of the shard without processing the data records that have already been processed from the first replica.
-
14.
公开(公告)号:US20180048689A1
公开(公告)日:2018-02-15
申请号:US15232847
申请日:2016-08-10
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk
Abstract: A method, computer-readable medium, and device for processing a stream of records with a guarantee that each record is accounted for exactly once are disclosed. A method may receive, via a first operator, a data stream having a plurality of records, the plurality of records provided by a plurality of first data sources; allocate the data stream to a plurality of shards of the first operator; process the plurality of records by each shard of the plurality of shards to generate a first output stream, where each shard being implemented with at least two replicas; and output the first output stream to a third operator or a subscriber.
-
公开(公告)号:US09165018B2
公开(公告)日:2015-10-20
申请号:US13706869
申请日:2012-12-06
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: 这里公开了用于管理分布式数据库的概念和技术。 数据管理应用程序可以获取查询。 数据管理应用程序可以分析查询以确定与查询相关的多个数据结构。 数据管理应用程序还可以分析存储数据结构的数据存储,并将数据结构移动或分配给分布式数据库中的其他数据存储。 数据结构在分布式数据库中的移动可以基于用于移动数据和/或执行查询的贪心算法。
-
公开(公告)号:US08898673B2
公开(公告)日:2014-11-25
申请号:US13872549
申请日:2013-04-29
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk , Lukasz Golab
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: 方法,系统和产品计划更新流存储仓库。 在存储器中分配多个执行轨道,每个执行轨道分配处理器的一部分利用率和存储器的比例部分。 还在多个执行轨道中定义归属轨迹。 当主轨道不可用时,选择多个执行轨道中的不同轨道,并且将数据库更新作业调度到不同的轨道。
-
公开(公告)号:US20240045858A1
公开(公告)日:2024-02-08
申请号:US17815966
申请日:2022-07-29
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk , Divesh Srivastava
CPC classification number: G06F16/2393 , G06F16/2282 , G06F16/2322 , G06F16/2358
Abstract: Architectures and techniques are presented that can more efficiently update derived data products in response to updated source data. Source data is typically stored in source tables, whereas a materialized view of a query can generate a derived table based on the state of the source tables at the time the query is executed. When source data changes (e.g., in response to late-arriving input data), rather than recomputing the entire derived table (e.g., by again executing the original query, which can be expensive), an invertible relationship between timestamps can be leveraged to identify only those portions of the derived table that are affected by the update. Therefore, a new defining query can be generated to update only those portions of the derived table that are affected by the source data update.
-
公开(公告)号:US10685063B2
公开(公告)日:2020-06-16
申请号:US15268288
申请日:2016-09-16
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk , Pramod A. Jamkhedkar , Yaron Kanza
IPC: G06F16/00 , G06F16/901 , G06F16/2458
Abstract: A method includes receiving, via a processor, a query comprising pathway variables and at least one evaluation time and determining an anchor set based on at least one of the pathway variables. The method also includes translating the pathway variables into a pathway algebraic expression based on the anchor set and the at least one evaluation time, and executing the pathway algebraic expression on a graph database to return a pathway set.
-
19.
公开(公告)号:US20200012635A1
公开(公告)日:2020-01-09
申请号:US16576869
申请日:2019-09-20
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Lukasz Golab
IPC: G06F16/23 , G06F16/25 , G06F16/28 , G06F16/2455
Abstract: 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.
-
20.
公开(公告)号:US10530823B2
公开(公告)日:2020-01-07
申请号:US15232847
申请日:2016-08-10
Applicant: AT&T Intellectual Property I, L.P.
Inventor: Theodore Johnson , Vladislav Shkapenyuk
IPC: H04L29/06 , G06F16/2455 , H04M15/00 , H04L12/713 , H04L12/931 , G06F9/52 , G06F16/16 , G06F9/38
Abstract: A method, computer-readable medium, and device for processing a stream of records with a guarantee that each record is accounted for exactly once are disclosed. A method may receive, via a first operator, a data stream having a plurality of records, the plurality of records provided by a plurality of first data sources; allocate the data stream to a plurality of shards of the first operator; process the plurality of records by each shard of the plurality of shards to generate a first output stream, where each shard being implemented with at least two replicas; and output the first output stream to a third operator or a subscriber.
-
-
-
-
-
-
-
-
-