Abstract: A processing system of a storage network operates by receiving a write request associated with a data object; identifying dispersed storage error encoding parameters; and determining a number of available storage units. When the number of available storage units is determined to exceed a first number, the processing system operates by: determining a first write threshold number in accordance with the dispersed storage error encoding parameters; dispersed error encoding the data object to produce a first write threshold number of encoded data slices; and writing, to available storage units, the first write threshold number of encoded data slices.

Abstract: A query processing system is operable to determine a set of query rules that includes a minimum result set size rule. A query is received from a requesting entity. A size of a result set of the query is determined. Compliance data is determined based on determining whether the size of the result set complies with the minimum result set size rule. When the compliance data indicates the size of the result set complies with the minimum result set size rule, a query result for the query is generated based on the result set, and the query result is generated to the requesting entity. When the compliance data indicates the size of the result set does not comply with the minimum result set size rule: transmission of the query result to the requesting entity is foregone.

Abstract: A computing device of a storage network, the computing device including memory, an interface, and at least one processing module operably coupled to the memory and the interface, where the at least one processing module is operable to error encode a data segment in accordance with error encoding parameters to produce a set of encoded data slices. The at least one processing module also sends via the interface, a first subset of encoded data slices of the set of encoded data slices via a first routing path of a plurality of routing paths to a set of storage units, where the first routing path has a performance level greater than a first performance threshold, and sends, via the interface, a second subset of encoded data slices of the set of encoded data slices via a second routing path of the plurality of routing paths to the set of storage units.

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: Methods and apparatus for identifying multiple resources of a storage network for data retrieval are disclosed. In various embodiments, a determination is made to retrieve an encoded data slice from the storage network. Based on configuration information for the storage network, one or more configurations are identified, including a current configuration. For the identified configurations, ranked scoring information relating to the encoded data slice is determined for a plurality of resources associated with the identified configurations. Based on the ranked scoring information, a resource is selected for each of the identified configurations. In addition, a retrieval likelihood level for the data slice is determined for each of the selected resources. Based on the likelihood levels for the selected resources, one or more of the selected resources are identified for encoded data slice retrieval and read slice requests are issued to the one or more selected resources.

Abstract: A user device is operable to determine a query request based on first user input to a graphical user interface displayed by the user device. Query cost data is determined based on the query request. A prompt is displayed via the graphical user interface that indicates the query cost data. Query approval data is determined based on second user input to the graphical user interface in response to the prompt. The query request is transmitted to an analytics system for execution against a database system when the query approval data indicates approval to transmit the query request.

Abstract: A method begins by identifying a plurality of encoded data slices requiring rebuilding. The method continues by determining an amount of memory required for rebuilding the plurality of encoded data slices and allocating memory in one or more storage units for the rebuilding the plurality of encoded data slices as reserve memory. The method continues by obtaining a plurality of rebuilt encoded data slices associated with the plurality of encoded data slices requiring rebuilding and storing the plurality of rebuilt encoded data slices in the reserve memory.

Abstract: A processing system is operable to encode data to produce a first set of data slices based on a value of a width parameter. The data is stored based on maintaining storage of the first set of data slices across a set of storage units of a storage pool. Storage of the first set of data slices is maintained in the set of storage units of the storage pool after addition of an additional set of storage units added to the storage pool. The value of the width parameter is increased to an increased value to produce an updated width parameter. The data is re-encoded in accordance with the updated width parameter to produce a second set of data slices. The data is re-stored based on maintaining storage of the second set of data slices across the expanded set of storage units of the storage pool.

Abstract: A processing system of a storage network operates by receiving a write request associated with a data object; identifying dispersed storage error encoding parameters; and determining a number of available storage units. When the number of available storage units is determined to exceed a first number, the processing system operates by: determining a first write threshold number in accordance with the dispersed storage error encoding parameters; dispersed error encoding the data object to produce a first write threshold number of encoded data slices; and writing, to available storage units, the first write threshold number of encoded data slices.

Abstract: A node of a database system is operable to receive a plurality of data blocks from a set of source nodes via a set of relay nodes. At least one feedback data block to be sent to at least one of the set of source nodes is generated. Feedback relay node selection data selecting at least one of a plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to the 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 feedback data block is routed from the node to the at least one of the set of source nodes via the prioritized feedback communication mechanism.

Abstract: A method for execution by one or more computing devices includes selecting a first routing path from a plurality of routing paths to a set of storage units based on routing path performance information, where the first routing path has a performance level greater than a first performance threshold. The method further includes selecting a second routing path from the plurality of routing paths based on the routing path performance information, where the second routing path has a performance level less than or equal to the first performance threshold. The method further includes sending a first subset of encoded data slices to the set of storage units via the first routing path for storage therein. The method further includes sending a second subset of encoded data slices to the set of storage units via the second routing path for storage therein.

Abstract: A method for execution on a storage network begins with receipt of a data object for storage by a plurality of users and continues with a storage network processing unit determining whether the data object is associated with a replica storage node of a plurality of replica storage nodes associated with the storage network. When the data object is associated with a replica storage node, the method continues by facilitating storing the data object in each replica storage node of the plurality of replica storage nodes and receiving a plurality of access responses from at least some replica storage nodes of the plurality of replica storage nodes. The method then continues by determining whether an access response threshold number of access responses have been received and finally, in response to a determination that an access response threshold number of access responses have been received, transmitting an acknowledgement to the plurality of users.

Abstract: A database system is operable to receive a plurality of records of a dataset for storage. A plurality of segment row data is generated from the plurality of records and a plurality of parity data corresponding to the plurality of segment row data is generated. The plurality of segment row data is stored via a first storage mechanism. The plurality of parity data is stored via a second storage mechanism. 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 storage failure 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 parity data via the second storage mechanism.

Abstract: A method begins with a processing module of a distributed storage network (DSN), receiving a request to access a data object stored in the DSN and identifying a first data descriptor associated with the data object, identifying a second data descriptor associated with the data object, identifying a first data index key and a first index structure for the first data descriptor and identifying a second data index key and a second index structure for the second data descriptor. The method continues with the processing module accessing the first index structure for the first data descriptor , based on the first and second data index keys, to retrieve a first and second set of data identifiers, respectively and based on one or more data identifiers being common to the first set of data identifiers and the second set of data identifiers, creating a superset of data identifiers.

Abstract: A query processing system is operable to determine a set of query rules that includes a minimum result set size rule. A query is received from a requesting entity. A size of a result set of the query is determined. Compliance data is determined based on determining whether the size of the result set complies with the minimum result set size rule and based on power utilization. When the compliance data indicates the size of the result set complies with the minimum result set size rule, a query result for the query is generated based on the result set, and the query result is generated to the requesting entity. When the compliance data indicates the size of the result set does not comply with the minimum result set size rule: transmission of the query result to the requesting entity is foregone.

Abstract: A node of a database system is operable to receive a plurality of data blocks from a set of source nodes via a set of relay nodes. At least one feedback data block to be sent to at least one of the set of source nodes is generated. Feedback relay node selection data selecting at least one of a plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to the at least one of the set of source nodes based on a prioritized feedback communication mechanism and power utilization. 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 feedback data block is routed from the node to the at least one of the set of source nodes via the prioritized feedback communication mechanism.

Abstract: A database system operates by: determining a query request corresponding to a requesting entity; generating potential query cost data based on query cost data for the query request including power consumption and further based on running query cost data for at least one previous query request corresponding to the requesting entity; generating minimum query cost compliance data for the query request based on determining whether the potential query cost data complies with a minimum query cost rule; when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule: determining a query result for the query request based on execution of the query request against a database system.

Abstract: A user device is operable to determine a query request based on first user input to a graphical user interface displayed by the user device. Query cost data is determined based on the query request and power consumption. A prompt is displayed via the graphical user interface that indicates the query cost data. Query approval data is determined based on second user input to the graphical user interface in response to the prompt. The query request is transmitted to an analytics system for execution against a database system when the query approval data indicates approval to transmit the query request.

Abstract: A database system operates by: receiving a query request from a requesting entity; determining the maximum query cost ruleset for the requesting entity by identifying one of the plurality of maximum query cost rulesets that corresponds to one of the corresponding plurality of end users associated with the requesting entity, wherein the maximum query cost ruleset for the requesting entity indicates a set of query function-based query cost rules corresponding to each of a set of query function types; generating query cost data by utilizing the query pricing scheme based on the query request and a power consumption; and generating maximum query cost compliance data based on determining whether the query cost data complies with the maximum query cost ruleset.

Abstract: A database system operates by: receiving a first query request that indicates a first query for execution by the database system; determining a first plurality of query execution mode options for execution of the first query via the database system; generating first role reassignment restriction data for the first query based on a first plurality of query operators of the first query; selecting a first selected query execution mode from the first plurality of query execution mode options based on power consumption and role reassignment modality corresponding to the first selected query execution mode comparing favorably to the first role reassignment restriction data; and generating a resultant for the first query by facilitating execution of the first query in accordance with the first selected query execution mode.