Abstract: Systems and methods for storing and accessing data. Example embodiments may perform optimization based on patterns of requests received by the system and relations between data sets identified by the system. Example embodiments may identify restrictions on a data set based on a different data set. Conditions for automatically algebraically partitioning the data set based on a constituent of a different data set may be evaluated, including evaluation of the relationship between the data sets and identification of a pattern of statements restricting the data set using the same logical structure. If the conditions are met, component data sets and a partition data set may be algebraically defined based on ranges applied to constituent(s) of the other data set. The component data sets may also be realized in storage to physically partition the data set.

Abstract: Systems and methods for storing and accessing data. Example embodiments may perform optimization based on patterns of requests received by the system and relations between data sets identified by the system. Example embodiments may identify restrictions on a data set based on a different data set. Conditions for automatically algebraically partitioning the data set based on a constituent of a different data set may be evaluated, including evaluation of the relationship between the data sets and identification of a pattern of statements restricting the data set using the same logical structure. If the conditions are met, component data sets and a partition data set may be algebraically defined based on ranges applied to constituent(s) of the other data set. The component data sets may also be realized in storage to physically partition the data set.

Abstract: Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage.

Abstract: Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage.

Abstract: Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage.

Abstract: Systems and methods for storing and accessing data using virtual data sets. Data sets may be removed from a data store and defined by algebraic relations between other data sets that are realized in the data store. A flag may be set to indicate that the data set is virtual. Criteria may be established for determining when a data set should be virtualized. For example, the criteria may be based on the size of the data set, the number of times it has been referenced and/or the frequency with which the data set has been accessed in the data store. A data set may also be optimized by partitioning the data set into subsets. The original data set may then be removed from the data store. An algebraic relation may be composed that defines the data set based on the subsets realized in the data store. The algebraic relation for the virtual data set may be used for optimizing access to other data sets even though the virtual data set is not realized.

Abstract: Systems and methods for data storage and retrieval using data model mapping. Statements may be presented to the system based on different schema and data models. Algebraic relations between data sets may be composed from the statements. Mappings are provided between the different schema and data models to allow algebraic relations based on one schema and data model to be used in providing a requested data set based on a different schema and data model. Algebraic optimization may also be performed to select among algebraic relations to be used for providing the requested data set, including algebraic relations based on different schemas and data models. As a result, optimization may be performed across a broader set of possible algebraic relations to provide the requested data set.

Abstract: Systems and methods for storing and accessing data. A relation store may be used to store algebraic relations between data sets. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. Optimization criteria may be based on an estimate of the amount of data required to be transferred and/or the amount of time required to transfer data sets from storage in order to calculate the collection of algebraic relations. The optimization criteria may distinguish among equivalent data sets containing the same logical data in different physical formats or in different locations. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved.

Abstract: Systems and methods for storing and accessing data. Algebraic relations may be composed that each define a result equal to a requested data set. The algebraic relations may reference other data sets in storage. Some of the data sets may contain the same logical data stored in different physical formats and/or in different locations in the data store. One of the algebraic relations may be selected for use in providing the requested data set based, at least in part, on the physical format and/or locations of the data sets referenced in the algebraic relations. In other examples, algebraic relations may be selected based, at least in part, on the speed and available bandwidth of the channel(s) used to retrieve data sets referenced in the algebraic relation. Functions may be used to calculate the algebraic relation using the data sets retrieved from storage. The functions may be format specific based on the physical formats of the data sets provided as operands to the functions.