Abstract: A method for execution, by a first intermediate node of a plurality of nodes in a database management system, includes processing a message that includes data that is being sent in accordance with a routing path from a source node to a destination node, is a first size, and indicates a next node of the routing path, wherein the first intermediate node is limited to communication with a subset of nodes of the plurality of nodes, and wherein the subset of nodes includes the next node. The method further includes maintaining a tracking table that indicates a total amount of data sent to each node of the subset of nodes during a first time period. The method further includes resetting the total amount of data sent to each of the subset of nodes to zero based one or more of a command and an initiation of a second time period.

Abstract: A computing device is operable to receive a plurality of partition allocation requests based on execution of a corresponding plurality of query operations in conjunction with execution of a corresponding query. Processing a first partition allocation request of the plurality of partition allocation requests corresponding to execution of a first operation of the corresponding plurality of query operations is based on allocating a set of partitions of a plurality of partitions. Content is loaded into the set of partitions for access in executing the first operation. Access to the content via the set of partitions is facilitated in conjunction with execution of the first operation. The set of partitions are released based on determining the first operation has completed access of the content in conjunction with the execution of the first operation.

Abstract: In one aspect, the invention relates to an immunogenic composition comprising modified O-polysaccharide molecules derived from E. coli lipopolysaccharides and conjugates thereof. Multivalent vaccines may be prepared by combining two or more monovalent immunogenic compositions for different E. coli serotypes. In one embodiment, the modified O-polysaccharide molecules are produced by a recombinant bacterium that includes a wzz gene.

Abstract: A data processing system is operable to determining a query for execution and generate a query operator execution flow for the query that includes a first at least one operator serially before a second at least one operator. The first at least one operator of the query operator execution flow is executed based on generating a request for rows in accordance with an object storage communication protocol indicating filtering parameter data parameter, sending the request to an object storage system, and receiving a response indicating a filtered row set from the object storage system. The second at least one operator of the query operator execution flow is executed based on processing the filtered row set indicated in the response in accordance with the second at least one operator to produce the query resultant.

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 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 operates by: determining a first query that indicates a first request to generate a K nearest neighbors (KNN) model; executing the first query to generate KNN model data for the KNN model, wherein the KNN model data is set as a reduced dataset for one of a plurality of training iterations; determining a second query that indicates a second request to apply the KNN model to input data; and executing the second query to generate model output of the KNN model for the input data based on, for each row in the input data, identifying a classification label for the each row from the discrete set of labels based on performing the KNN classification algorithm to classify the each row in the input data by applying the reduced data set.

Abstract: A database system is operable to determine a query for execution against at least one relational database table and executing the query. Executing the query is based on identifying a plurality of required binomial coefficient values required for generating a set of output values for the query. The plurality of required binomial coefficient values are precomputed and stored in cache memory resources. Generating each output value of the set of output values is based on identifying a subset of the plurality of required binomial coefficient values for generating the each output value, and accessing the subset of the plurality of required binomial coefficient value in the cache memory resources. Each output value is generated as a function of the subset of the plurality of required binomial coefficient values.

Abstract: A database system is operable to execute a row dispersal operator, in conjunction with execution of a query operator execution flow for a corresponding query, to disperse a plurality of input rows across the set of parallelized operations based on determining a plurality of input data blocks that collectively includes the plurality of input rows, where each input data block in the plurality of input data blocks a corresponding proper subset of the plurality of input rows. Each data block of the plurality of input data blocks is assigned to a corresponding one of the set of parallelized operations for processing in accordance with a uniform assignment scheme, and each data block is forwarded to the corresponding one of the set of parallelized operations by reference.

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 of creating an anastomosis is provided using a stapling assembly including a body extending distally along a longitudinal axis and a deck member defining a deck surface. The deck surface includes a first array of staple openings comprising a herringbone pattern, and each staple opening of the first array of staple openings has a same size. The method includes positioning an anvil within a first lumen of a patient and positioning the stapling assembly within a second lumen of the patient. The method also includes releasably coupling the anvil with the stapling assembly and compressing tissue of the first and second lumens between the anvil and the deck member. The method further includes actuating a plurality of staple drivers to drive a first plurality of staples distally and parallel to the longitudinal axis from the first array of staple openings into the tissue to define the anastomosis.

Abstract: A method includes determining a query expression indicating a query for execution against a plurality of rows. A superset-guaranteeing expression is generated in conjunctive normal form (CNF) based on the query expression. A query operator execution flow is generated to include a plurality of index-based IO operators based on the superset-guaranteeing expression and to further include at least one additional operator. Execution of the query is facilitated by applying the plurality of index-based IO operators to identify a first subset of rows as a proper subset of the plurality of rows based on index data stored of the plurality of rows, and by applying the at least one additional operator to the first subset of rows to identify a second subset of rows as a subset of the first subset of rows.

Abstract: A computing system is operable to generating a set of segments of a segment group. Each segment of the set of segments includes a data and parity section that includes a corresponding set of sorted data slabs, a manifest section that includes metadata regarding the corresponding set of sorted data slabs, at least one index section that includes index data for the corresponding set of sorted data slabs, and a statistics section storing statistical information regarding the each segments. The set of segments of the segment group are stored across a plurality of computing devices of a storage cluster of the computing system.

Abstract: A database system is operable to assign a first node as a task monitoring node for a task and assign a second node as a task execution node for the task. The task is executed via the first node and the second node based on the first node sending a plurality of polls to the second node, the second node initiating execution of the task based on one of the plurality of polls, the second node sending a plurality of task status data to the first node, the first node maintaining current task status data for the task a shared metadata state based on the plurality of task status data, the second node completing execution of the task and caching task results in memory resources, the first node receiving the task results from the second node; and the second node removing the task results from the memory resources.

Abstract: A node of a computing system includes a main memory and a plurality of processing core resources that each can adjust a power level. The main memory includes a computing device section and a database section. The computing device section includes a computing device operating system area and a computing device general area. The database section includes a database section that includes a database operating system area, a disk area, a network area, and a database general area. The database operating system area allocates at least one portion of the main memory for database operations that is locked from access by the computing device operating system area.

Abstract: A database system operates by: determining a first query that indicates a first request to generate a K means model; executing the first query to generate K means model data for the K means model; determining a second query that indicates a second request to apply the K means model to input data; and executing the second query to generate model output of the K means model for the input data based on, for each row in the input data: determining a plurality of distances to the final set of centroids; and identifying a classification label for an identified one of the final set of centroids having a smallest one of the plurality of distances as the model output.

Abstract: A database system includes a plurality of computing devices. Each computing device includes a plurality of processing modules, a computing device operating system, and an application specific operating system. The computing device operating system includes a computing device operating system file system management instruction set. The application specific operating system includes at least one custom file system management instruction set operable to configure operation of a configurable set of processing modules of the plurality of processing modules based on generating a corresponding file system management configuration signal for each processing module of the configurable set of processing modules indicating a selected file system management instruction set of the computing device operating system or the application specific operating system.

Abstract: In one aspect, the invention relates to an immunogenic composition that includes a mutant Clostridium difficile toxin A and/or a mutant Clostridium difficile toxin B. The mutant toxin may include a glucosyltransferase domain having at least one mutation and a cysteine protease domain having at least one mutation, relative to the corresponding wild-type C. difficile toxin. The mutant toxins may include at least one amino acid that is chemically crosslinked. In another aspect, the invention relates to methods and compositions for use in culturing Clostridium difficile and in producing C. difficile toxins.

Abstract: A method for execution, by a first intermediate node of a plurality of nodes in a database management system, includes receiving a message, where the first intermediate node is limited to communication with a subset of nodes of the plurality of nodes, where the message: includes data that is being sent in accordance with a routing path, is a first size, and indicates a next node of the routing path, and where the subset of nodes includes the next node. The method continues by generating a revised message, wherein the revised message includes the data and has a second size. The method continues by determining whether there is at least one additional intermediate node after the next node in the routing path. When yes, determining an optimal route for forwarding the revised message via a node of the subset of nodes, and sending the revised message to the node.

Abstract: A node of a database system is operable to determine, at a first time, to prepare for a shutdown. The shutdown of the node is performed at a second time that is a period of time after the first time based on the node delaying the shutdown until a plurality of currently running processes being run by the node that initiated prior to the first time are determined to be complete. During the period of time after the first time and prior to performing the shutdown, a set of new processing requests are rejected by the node.