Abstract: A method for execution in a storage network includes receiving a request pertaining to a data object, where the request is related to a specified contiguous data range within the data object and the data object is dispersed error encoded to produce a plurality of groups of encoded data slices. The method continues by converting the request into a plurality of partial requests, where each partial request of the plurality of partial requests includes at least one partial task and transmitting each partial request of the plurality of partial requests to a storage unit of a set of storage units. The method then continues by determining when a partial request response has been received for each partial request of the plurality of partial requests and when a partial request response has been received for each partial request of the plurality of partial requests, transmitting an indication that the request pertaining to the data object has been successfully executed.

Abstract: A node is operable to determine to send at least on data block to a destination node. A second relay node of an initial route that includes exactly a predefined number of relay nodes for relaying at least one data block from the node to a destination node is identified. A set of intermediate node options is identified by identifying nodes of the database system capable of receiving the at least one data block from the node and further capable of sending the at least one data block to the second relay node. Intermediate node selection data is generated by selecting one intermediate node from the set of intermediate node options. The at least one data block is transmitted from the node to the one intermediate node via the first direct connection to facilitate sending of the at least one data block from the node to the destination node.

Abstract: A database system is operable to generate a plurality of segment row data from a plurality of records received for storage. The plurality of segment row data is stored via a first storage mechanism corresponding to a first durability level. Storage of the plurality of segment row data via a second storage mechanism corresponding to a second durability level that is more durable than the first durability level is facilitated. Execution of a plurality of queries against the dataset is facilitated by accessing the plurality of segment row data via the first storage mechanism. A failure of storage of one of the plurality of segment row data via the first storage mechanism is detected. The one of the plurality of segment row data is recovered for storage via the first storage mechanism based on accessing at least one of the plurality of segment row data via the second storage mechanism.

Abstract: A method includes determining a query for execution against a dataset that includes a plurality of records, where values of the plurality of records corresponding to a first subset of the plurality of fields are stored via a first storage mechanism, and values of the plurality of records corresponding to a second subset of the plurality of fields are stored via a second storage mechanism. Execution of the query is facilitated by accessing, via the first storage mechanism, values of at least one first field included in the first subset of the plurality of fields and accessing, via the second storage mechanism, values of at least one second field included in the second subset of the plurality of fields. A query resultant for the query is generated based on the values of the at least one first field and the values of the at least one second field.

Abstract: A method includes retrieving an encoded data slice from memory of a storage network, where the encoded data slice is associated with a slice integrity value stored in the memory, and where a data segment of data is error encoded into a set of encoded data slices that includes the encoded data slice. The method further includes generating a second slice integrity value based on the retrieved encoded data slice. The method further includes determining whether the second slice integrity value compares favorably to the slice integrity value. When the second slice integrity value compares unfavorably to the slice integrity value, the method further includes facilitating rebuilding of the encoded data slice to produce a rebuilt encoded data slice. The method further includes storing the rebuilt encoded data slice in the memory.

Abstract: A query processing system operates by determining a set of query rules, receiving a query from a requesting entity, and generating compliance data by determining whether the query complies with the set of query rules prior to an execution of the query. When the compliance data indicates the query complies with the set of query rules: generating a query result by facilitating the execution of the query against a database system; and transmitting the query result to the requesting entity. When the compliance data indicates the query does not comply with the set of query rules: foregoing facilitation of the execution of the query.

Abstract: A method for execution by a database system includes determining physical network topology data of a plurality of nodes of the database system utilized to facilitate query executions. Initial route selection data indicating a set of initial relay nodes for each of a plurality of pairs of the plurality of nodes is based on the physical network topology data by selecting one of a plurality of possible initial route options for the each of the plurality of pairs of the plurality of nodes. The initial route selection data is sent to the plurality of nodes. A query resultant is generated by facilitating execution of a query, via the plurality of nodes, by facilitating routing of data blocks between at least one of the plurality of pairs of the plurality of nodes via a set of intermediate nodes selected based on the initial route selection data in accordance with a dynamic data block routing scheme.

Abstract: A method includes determining an information dispersal algorithm width number and determining a number of primary storage slots from a number of storage slots associated with a set of storage units deployed across multiple sites, where the number of primary storage slots is equal to or greater than the information dispersal algorithm width number. The method further includes determining a mapping of primary storage slots to storage units. The method further includes sending configuration information to the set of storage units that includes the mapping. The method further includes storing a set of encoded data slices in the primary storage slots in accordance with the configuration information, where a data segment is error encoded into the set of encoded data slices in accordance with the information dispersal algorithm width number and a decode threshold number, which is a number of encoded data slices are needed to reconstruct the data segment.

Abstract: An analytics system is operable to receive a first plurality of query requests from a plurality of requesting entities. Query pricing scheme data is automatically generated based on the first plurality of query requests. A second plurality of query requests are received from the plurality of requesting entities. Query cost data is automatically generated for each of the second plurality of query requests by utilizing the query pricing scheme data. The query cost data for each of the second plurality of query requests is transmitted to a corresponding one of the plurality of requesting entities.

Abstract: A method for execution by a processing system includes determining to retrieve index data for a set of objects stored by an object storage system. An index type is selected from a plurality of index. A request message indicating a request for the index data of one of a plurality of indices stored by the object storage system corresponding to the index type is generated, and the request message is transmitted to the object storage system. The index data for the set of objects is received in a response message from the object storage system. The index data includes a plurality of pairs that each include a key and a value, where the keys correspond to the index type, and where the value of each pair includes metadata of one of the set of objects. The index data is stored in local memory in response to receiving the index data.

Abstract: A method for execution by a distributed storage network begins by receiving a request to transfer a copy of a set of encoded data slices from at least some associated virtual storage vaults to a destination virtual storage vault and continues by determining whether the destination storage unit supports a source virtual storage vault of the at least some source virtual storage vaults. When the destination storage unit supports the source virtual storage vault the method continues by determining a sub-set of encoded data slices of the set of encoded data slices for transfer and finally, by facilitating sending the sub-set of encoded data slices to the destination storage unit.

Abstract: A method includes determining a query request corresponding to a requesting entity. Query cost data is generated for the query request. Minimum query cost compliance data is generated for the query request based on the query cost data. A query result is for the query request is determined based on execution of the query request against a database system and the query result is transmitted to the requesting entity when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule.

Abstract: A query processing system is operable to determining a query pricing scheme and receive a query request from a requesting entity that indicates at least one query function for execution against a database system. Query cost data is generated based on the at least one query function by utilizing the query pricing scheme. The query cost data is transmitted to the requesting entity.

Abstract: A method includes identifying a number of encoded data slices that need rebuilding for a memory device of a storage unit of the storage network, where data is dispersed storage error encoded in accordance with error encoding parameters into pluralities of sets of encoded data slices, and the pluralities of sets of encoded data slices include the number of encoded data slices. The method further includes identifying a second memory device of the storage network. The method further includes facilitating rebuilding, by the second memory device, a first group of encoded data slices of the number of encoded data slices. The method further includes facilitating storing a first subset of the first group of encoded data slices in the second memory device. The method further includes facilitating transferring a second subset of the first group of encoded data slices for storage in the memory device.

Abstract: A node of a database system is operable to receive a plurality of data blocks. Based on backlog detection data, at least one feedback data block is generated to be sent to the set of source nodes. Feedback relay node selection data selecting at least one of the plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to at least one of the set of source nodes via a prioritized feedback communication mechanism is generated. The at least one feedback data block is sent to the at least one of the plurality of nodes selected in the feedback relay node selection data. The at least one of the plurality of nodes facilitates routing of the at least one feedback data block from the node via the prioritized feedback communication mechanism.

Abstract: A database system is operable to determine a request to implement a K Nearest Neighbors (KNN) algorithm to generate classification data for a set of new records. A query operator execution flow is determined for the request that includes a KNN-join operator. A query resultant that indicates classification data for the set of new records is generated by performing a plurality of operator executions in accordance with the query operator execution flow based on, for each record of the set of new records, generating a plurality of similarity measures by performing a similarity function on the each record and each of a set of previously-classified records; identifying a proper subset of the set of previously-classified records that includes exactly a predefined number of records; and joining the each record with the proper subset of the set of previously-classified records.

Abstract: A database system is operable to determine a query for execution that requires access to a set of records stored by the database system. A first proper subset of the set of records are accessed in conjunction with executing the query by reading exactly one of a set of multiple replicas of each record of the first proper subset of the set of records from the replication-based storage system. A second proper subset of the set of records are accessed in conjunction with executing the query by reading at least one redundancy-coded segment from the redundancy-coding based storage system. A final resultant for the query is generated by performing at least one query operation on the first proper subset of the set of records and the second proper subset of the set of records in conjunction with executing the query.

Abstract: A method includes, determining, for a batch rebuild process regarding a first batch threshold number of encoded data slices of a set of encoded data slices that need rebuilding, a target storage unit of target storage units of a set of storage units of the storage network is unavailable, where a data segment of data is dispersed storage error encoded into the set of encoded data slices, the set of encoded data slices is stored in the set of storage units, and the first batch threshold number of encoded data slices is to be stored in the target storage units. When the target storage unit becomes available before a second batch rebuild threshold number of encoded data slices of the set of encoded data slices is met, the method includes executing the batch rebuild process for the first batch threshold number of encoded data slices.

Abstract: A computing device includes processing circuitry configured to determine whether to modify the dispersed error encoding parameters of a set of encoded data slices (EDSs) stored in a distributed storage network to produce a set of modified EDSs, wherein a data object is segmented into a plurality of data segments and in response to a determination to modify the dispersed error encoding parameters of the set of EDSs, identify a plurality of storage units to store the modified EDSs and determine modified dispersed error encoding parameters for the modified EDSs. The computing device is further configured to assign each storage unit of the plurality of storage units to execute one or more storage modification tasks associated with producing the modified EDSs; and transmit one or more EDS of the set of EDSs to each storage unit of the plurality of storage units for modification and storage.

Abstract: A query processing system operates by determining a query pricing scheme; receiving a query request from a requesting entity that indicates access to a subset of a plurality of records in a database system; generating query cost data based on the subset of the plurality of records by utilizing the query pricing scheme; and transmitting the query cost data to the requesting entity.