公开(公告)号：WO2017019562A1

公开(公告)日：2017-02-02

申请号：PCT/US2016/043738

申请日：2016-07-22

Applicant: ALGEBRAIX DATA CORP.

Inventor： MCDANIEL, Jason T. ,  UNDERBRINK, Joseph C.

IPC: G06F7/00

CPC classification number: G06F17/30457 ,  G06F12/0875 ,  G06F17/3048 ,  G06F2212/60

Abstract: The systems, methods, devices, and non-transitory media of the various embodiments enable query execution plan graphs to be compared to determine whether all or portions of two or more queries define data sets that are structurally equivalent. Two data sets may be structurally equivalent when each data set may be composed with a bijective relation that yields the other. In the various embodiments, when all or a portion of a first query that has been previously run defines a data set that is structurally equivalent to a data set defined by all or a portion of a second query that is to be run, the structure preserving transform may be applied to the corresponding portion of the second query to transform that portion of the second query into the corresponding portion of the first query, thereby allowing the results from previously running the first query to be reused.

Abstract translation: 各种实施例的系统，方法，设备和非暂时性介质使得能够比较查询执行计划图，以确定两个或更多个查询的全部或部分是否定义在结构上等同的数据集。 当每个数据集可以由产生另一个的双射关系组成时，两个数据集可以在结构上相当。 在各种实施例中，当先前运行的第一查询的全部或一部分定义了在结构上等同于由要运行的第二查询的全部或一部分定义的数据集的数据集时，结构保留 变换可以应用于第二查询的相应部分，以将第二查询的该部分转换成第一查询的对应部分，由此允许先前运行第一查询的结果被重用。

公开(公告)号：WO2017019883A1

公开(公告)日：2017-02-02

申请号：PCT/US2016/044526

申请日：2016-07-28

Applicant: ALGEBRAIX DATA CORP. ,  HOLLER, Wesley A.

Inventor： HOLLER, Wesley A. ,  JOHNSTON, Charles Stephen ,  EATON, Frank Joseph ,  UNDERBRINK, Joseph C. ,  ROTHER, Rory Windell

IPC: G06F17/30

CPC classification number: G06F17/3033 ,  G06F17/30477 ,  G06F17/30486

Abstract: The systems, methods, devices, and non-transitory media of the various embodiments provide query independent data identification. In various embodiments, query independent data identification may be used to facilitate data reuse. Query independent data identification may be accomplished using an algebraic expression hash (AEH) function to identify data in a graph or table for reuse based on its origin and what has been done to the data. Use of an AEH function may support a top down approach for identification of data reuse and may also facilitate faster searches using an AEH value. For example, a hash-based search of a universe of data sets may facilitate a top down approach to locate the maximal reuse first (as opposed to the last) and may be less sensitive to the size of the universe.

Abstract translation: 各种实施例的系统，方法，设备和非暂时性介质提供了查询独立的数据标识。 在各种实施例中，可以使用查询独立的数据标识来促进数据重用。 可以使用代数表达式散列（AEH）函数来实现查询独立的数据标识，以识别图形或表中的数据，以便基于其来源以及对数据进行了哪些操作。 使用AEH功能可以支持自顶向下的方法来识别数据重用，并且还可以使用AEH值更快地进行搜索。 例如，基于散列的数据集搜索可以有助于自上而下的方法来首先定位最大重用（与最后一次相反），并且可能对宇宙的大小较不敏感。

公开(公告)号：WO2017019879A1

公开(公告)日：2017-02-02

申请号：PCT/US2016/044518

申请日：2016-07-28

Applicant: ALGEBRAIX DATA CORP. ,  HOLLER, Wesley A.

Inventor： HOLLER, Wesley A. ,  ROGERS, William Arthur ,  UNDERBRINK, Joseph C. ,  MCDANIEL, Jason Tyler ,  ZIROJEVIC, Srdan

IPC: G06F17/30

CPC classification number: G06F17/30448 ,  G06F17/30477 ,  G06F17/30867 ,  G06F17/30958

Abstract: Systems and methods allow the use of algebra to optimize several queries at once by algebraically breaking them into pieces, interleaving them in the most efficient way and then computing the queries together. For instance, a user or application may have many queries to process. A computing device may handle each query sequentially. However, if the computing device handled the queries simultaneously and if they are presented at once, there are ways to algebraically optimize them together by interleaving the tasks required to execute each one and complete the entire batch more efficiently.

Abstract translation: 系统和方法允许使用代数通过代数地将其分解成多个，以最有效的方式进行交织，然后一起计算查询来一次优化几个查询。 例如，用户或应用程序可能有很多查询要处理。 计算设备可以顺序处理每个查询。 然而，如果计算设备同时处理查询并且立即显示查询，则通过交织执行每个任务所需的任务并且更有效地完成整个批处理，存在代数优化它们的方法。