Abstract: System and methods for processing data queries in hybrid data mesh architectures are disclosed. A method for processing data queries in hybrid data mesh architectures may include an in-memory query engine: (1) receiving, from a requestor, a data query to retrieve data; (2) parsing the data query into a parse tree; (3) converting the parse tree into a relational tree, wherein the relational tree is a tree representation of relational operators used to execute the data query; and (4) executing a data retrieval method selected from the group consisting of tree partitioning by cost and pruning using subtree replacement using a plurality of retrieval services to retrieve data from data stores identified by the data retrieval method.

Abstract: A method for writing data to a cloud-based database for optimized cloud-based database query execution may include a table writer computer program executed by a local electronic device: (1) receiving table data comprising rows and columns, a schema for the table, and a primary-key for the table; (2) creating a footer for the table, the footer comprising the schema and the primary-key; (3) sorting the rows of the table data using the primary-key; (4) dividing the sorted columns of the table data into a plurality of datapages based on a datapage size; (5) identifying sparse indices for each datapage, wherein the sparse indices comprising a minimum value, a maximum value, a starting row index, an ending row index for each datapage; (6) writing each datapage to cloud storage; (7) inserting the sparse indices into the footer for the table data; and (8) writing the footer to cloud storage.

Abstract: A method for writing data to a cloud-based database for optimized cloud-based database query execution may include a table writer computer program executed by a local electronic device: (1) receiving table data comprising rows and columns, a schema for the table, and a primary-key for the table; (2) creating a footer for the table, the footer comprising the schema and the primary-key; (3) sorting the rows of the table data using the primary-key; (4) dividing the sorted columns of the table data into a plurality of datapages based on a datapage size; (5) identifying sparse indices for each datapage, wherein the sparse indices comprising a minimum value, a maximum value, a starting row index, an ending row index for each datapage; (6) writing each datapage to cloud storage; (7) inserting the sparse indices into the footer for the table data; and (8) writing the footer to cloud storage.

Abstract: A technique for permitting multiple virtual file system having the same VFS identifier to be served by a single storage system. A data frame descriptor data structure is modified to include a storage pool index value that indexes into a storage pool array to identify a storage pool descriptor. The storage pool (SP) descriptor includes a SP ID, which is used in conjunction with a VFS ID to uniquely identify the VFS to which dirtied data is to be written.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for managing decision models. In one aspect, a method includes providing data that cause presentation of a model development user interface receiving first model rule data through the user interface. The first model rule data specify a first characteristic of a violating resource and a threshold score for the first characteristic. Additional model rule data are received through the user interface. The additional model rule data specify one or more additional model rules. Relationship data are received through the user interface for each of the additional model rules. The relationship data specify sets of the additional model rules that violating resources satisfy. Data that cause a hierarchical presentation of the first model rule and the additional model rules are provided.

Abstract: A technique for accelerating the creation of a hyperclone of a virtual file system. Specifically, each data block and indirect block directly referenced by a base inode are only copied. The hyperclone may then reference the original data blocks and original indirect blocks. Further, an indication may be provided for at least one of the copied data blocks and indirect blocks that indicates that the at least one of the copied data blocks and indirect blocks is in use.

Abstract: A system and method manages data versions in a file system. A data version field associated with a direct block pointer in each level 1 indirect block stores a data version associated with the data contained in the direct block. When data is modified subsequent to the creation of a persistent consistency point image, the data version is incremented to a next data version value to signify that the data has been modified. Replication is aided by the ease of identifying modified data blocks by examining the data version field associated with each block.

Abstract: A technique for accelerating the creation of a hyperclone of a virtual file system. A hyperclone inode is copied from the base inode. Each indirect and direct block referenced by the base inode is also copied and the block pointers within the base inode are set to reference the copied direct data blocks. A CTW bit is set within each copied block that alerts the file system that the reference indirect or direct block is not to be deallocated.