公开(公告)号：US11354298B2

公开(公告)日：2022-06-07

申请号：US16576869

申请日：2019-09-20

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Theodore Johnson ,  Lukasz Golab

IPC: G10L15/22 ,  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.

公开(公告)号：US11347807B2

公开(公告)日：2022-05-31

申请号：US16813372

申请日：2020-03-09

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Theodore Johnson ,  Vladislav Shkapenyuk

IPC: G06F16/903 ,  G06F16/901 ,  G06F9/455

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.

公开(公告)号：US11341140B2

公开(公告)日：2022-05-24

申请号：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.

公开(公告)号：US10439917B2

公开(公告)日：2019-10-08

申请号：US15352028

申请日：2016-11-15

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Theodore Johnson ,  Vladislav Shkapenyuk

IPC: H04L12/26 ,  H04L12/24

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.

公开(公告)号：US09703824B2

公开(公告)日：2017-07-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.

公开(公告)号：US09633079B2

公开(公告)日：2017-04-25

申请号：US14969435

申请日：2015-12-15

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.

公开(公告)号：US20160357814A1

公开(公告)日：2016-12-08

申请号：US15237200

申请日：2016-08-15

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Theodore Johnson ,  Vladislav Shkapenyuk ,  Oliver Spatscheck

IPC: G06F17/30

CPC classification number: G06F16/24542 ,  G06F16/24539 ,  G06F16/2454

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.

Abstract translation: 公开了一种用于提供查询感知分区的方法和系统。 例如，该方法接收包括多个查询的查询计划，并对多个查询中的每一个进行分类。 该方法针对多个查询中的每个查询计算最佳分区集，并且将多个查询中的每一个的最优分区集合与多个查询中的至少一个查询子集进行协调。 该方法选择要由多个查询的每个查询使用的至少一个协调的最优分组集，并将所选择的至少一个已调度的最优分区集合存储在计算机可读介质中。

公开(公告)号：US20160098457A1

公开(公告)日：2016-04-07

申请号：US14969435

申请日：2015-12-15

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: 这里公开了用于生成和使用时间元数据分区的概念和技术。 元数据可以基于元数据中包含的时间范围存储在时间元数据分区中。 此外，元数据可以存储在元数据相关的多个时间元数据分区中。 因此，可以以允许在时间准确和/或相关元数据的上下文中理解事件数据的方式存储元数据。 还公开了用于执行事件数据的查询并且提供元数据的结果以及多个时间元数据分区的合并的功能。

公开(公告)号：US20140164430A1

公开(公告)日：2014-06-12

申请号：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: 这里公开了用于管理分布式数据库的概念和技术。 数据管理应用程序可以获取查询。 数据管理应用程序可以分析查询以确定与查询相关的多个数据结构。 数据管理应用程序还可以分析存储数据结构的数据存储，并将数据结构移动或分配给分布式数据库中的其他数据存储。 数据结构在分布式数据库中的移动可以基于用于移动数据和/或执行查询的贪心算法。

公开(公告)号：US10936660B2

公开(公告)日：2021-03-02

申请号：US16257539

申请日：2019-01-25

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Theodore Johnson ,  Vladislav Shkapenyuk ,  Yaron Kanza

IPC: G06F16/901

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.