A database query comprising predicates may be received. Each predicate may operate on database columns. The database query may be determined to comprise strict operators. An upper bound neural network may be defined for calculating an adjacent upper bound and a lower bound neural network may be defined for calculating an adjacent lower bound. The upper bound neural network and the lower bound neural network may be trained using a selected value from data of a database table associated with the database query to be executed through the upper bound neural network and the lower bound neural network. The upper bound neural network and the lower bound neural network may be adjusted by passing in an expected value using an error found in expressions. The adjacent lower bound and the adjacent upper bound may be calculated in response to completion of initial training for the database columns.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A processor-implemented method for an adjacent value estimator for a cardinality estimation using an artificial neural network, comprising: receiving, by a processor, a database query comprising one or more predicates, wherein each predicate in the one or more predicates operates on one or more database columns of a database; determining the received database query comprises one or more strict operators; defining an upper bound neural network for calculating an adjacent upper bound and a lower bound neural network for calculating an adjacent lower bound based on receiving a database query; training the defined upper bound neural network and the defined lower bound neural network using a selected value from a plurality of data within a database table associated with the received database query to be executed through the defined upper bound neural network and the defined lower bound neural network; adjusting the defined upper bound neural network and the defined lower bound neural network by inputting an expected value using an error found in one or more expressions based on training the defined upper bound neural network and the defined lower bound neural network; calculating the adjacent lower bound and the adjacent upper bound for a particular database column based on adjusting the defined upper bound neural network and the defined lower bound neural network; inputting the calculated adjacent lower bound and calculated adjacent upper bound into the artificial neural network; estimating a selectivity for the one or more database columns in response to inputting the calculated adjacent lower bound and calculated adjacent upper bound into the artificial neural network; inputting the calculated adjacent lower bound and calculated adjacent upper bound in a query optimization process based on estimating the selectivity for the one or more database columns; and modifying the received database query with a plurality of equivalent non-strict operations for approximate query processing. 2. The method of claim 1, wherein cardinality denotes a number of qualified rows associated with a stream at each stage in an access plan, and wherein the artificial neural network has a plurality of layers and comprises a plurality of neurons in a hidden layer within the plurality of layers grouped by a jump activation function, and wherein each neuron within the plurality of neurons is fully connected to an input layer within the plurality of layers enabling each neuron in the hidden layer within the plurality of layers to take a plurality of input neurons as input, and wherein an output layer within the plurality of layers is connected to each neuron in the hidden layer. 3. The method of claim 2, wherein the jump activation function is defined as ϕ k  ( x ) = { 0 for   x < 0 ( 1 - e - x ) k for   x ≥ 0 , and wherein x is a value computed from one or more inputs to each neuron in the hidden layer and k is a positive integer. 4. The method of claim 1, wherein the database query is modified according to an expression i<col<ui+≦col≦u−, wherein i+ denotes a smallest value greater than i in a respective column of the database, and wherein u− denotes a largest value smaller than u in the respective column of the database. 5. The method of claim 1, wherein the adjacent lower bound and the adjacent upper bound are inputted to a non-strict range predicate selectivity artificial neural network to estimate a selectivity estimation of a range predicate. 6. The method of claim 1, wherein the database is a relational database including one or more rows and the one or more database columns. 7. The method of claim 1, wherein the database is inputted into a processor by a client computing device, and wherein the estimated selectivity is received by the client computing device. 8. A computer system for an adjacent value estimator for cardinality estimation using an artificial neural network, comprising: one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage medium, and program instructions stored on at least one of the one or more tangible storage medium for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising: receiving a database query comprising one or more predicates, wherein each predicate in the one or more predicates operates on one or more database columns of a database; determining the received database query comprises one or more strict operators; defining an upper bound neural network for calculating an adjacent upper bound and a lower bound neural network for calculating an adjacent lower bound based on receiving a database query; training the defined upper bound neural network and the defined lower bound neural network using a selected value from a plurality of data within a database table associated with the received database query to be executed through the defined upper bound neural network and the defined lower bound neural network; adjusting the defined upper bound neural network and the defined lower bound neural network by inputting an expected value using an error found in one or more expressions based on training the defined upper bound neural network and the defined lower bound neural network; calculating the adjacent lower bound and the adjacent upper bound for a particular database column based on adjusting the defined upper bound neural network and the defined lower bound neural network; inputting the calculated adjacent lower bound and calculated adjacent upper bound into the artificial neural network; estimating a selectivity for the one or more database columns in response to inputting the calculated adjacent lower bound and calculated adjacent upper bound into the artificial neural network; inputting the calculated adjacent lower bound and calculated adjacent upper bound in a query optimization process based on estimating the selectivity for the one or more database columns; and modifying the received database query with a plurality of equivalent non-strict operations for approximate query processing. 9. The computer system of claim 8, wherein cardinality denotes a number of qualified rows associated with a stream at each stage in an access plan, and wherein the artificial neural network has a plurality of layers and comprises a plurality of neurons in a hidden layer within the plurality of layers grouped by a jump activation function, and wherein each neuron within the plurality of neurons is fully connected to an input layer within the plurality of layers enabling each neuron in the hidden layer within the plurality of layers to take a plurality of input neurons as input, and wherein an output layer within the plurality of layers is connected to each neuron in the hidden layer. 10. The computer system of claim 9, wherein the jump activation function is defined as ϕ k  ( x ) = { 0 for   x < 0 ( 1 - e - x ) k for   x ≥ 0 , and wherein x is a value computed from one or more inputs to each neuron in the hidden layer and k is a positive integer. 11. The computer system of claim 8, wherein the database query is modified according to an expression i<col<i+≦col≦u−, wherein i+ denotes a smallest value greater than i in a respective column of the database, and wherein u− denotes a largest value smaller than u in the respective column of the database. 12. The computer system of claim 8, wherein the adjacent lower bound and the adjacent upper bound are inputted to a non-strict range predicate selectivity artificial neural network to estimate a selectivity estimation of a range predicate. 13. The computer system of claim 8, wherein the database is a relational database including one or more rows and the one or more database columns. 14. The computer system of claim 8, wherein the database is inputted into a processor by a client computing device, and wherein the estimated selectivity is received by the client computing device. 15. A computer program product for an adjacent value estimator for cardinality estimation using an artificial neural network, comprising: one or more computer-readable storage medium and program instructions stored on at least one of the one or more tangible storage medium, the program instructions executable by a processor, the program instructions comprising: program instructions to receive a database query comprising one or more predicates, wherein each predicate in the one or more predicates operates on one or more database columns of a database; program instructions to determine the received database query comprises one or more strict operators; program instructions to define an upper bound neural network for calculating an adjacent upper bound and a lower bound neural network for calculating an adjacent lower bound based on receiving a database query; program instructions to train the defined upper bound neural network and the defined lower bound neural network using a selected value from a plurality of data within a database table associated with the received database query to be executed through the defined upper bound neural network and the defined lower bound neural network; program instructions to adjust the defined upper bound neural network and the defined lower bound neural network by inputting an expected value using an error found in one or more expressions based on training the defined upper bound neural network and the defined lower bound neural network; program instructions to calculate the adjacent lower bound and the adjacent upper bound for a particular database column based on adjusting the defined upper bound neural network and the defined lower bound neural network; program instructions to input the calculated adjacent lower bound and calculated adjacent upper bound into the artificial neural network; program instructions to estimate a selectivity for the one or more database columns in response to inputting the calculated adjacent lower bound and calculated adjacent upper bound into the artificial neural network; program instructions to input the calculated adjacent lower bound and calculated adjacent upper bound in a query optimization process based on estimating the selectivity for the one or more database columns; and program instructions to modify the received database query with a plurality of equivalent non-strict operations for approximate query processing. 16. The computer program product of claim 15, wherein cardinality denotes a number of qualified rows associated with a stream at each stage in an access plan, and wherein the artificial neural network has a plurality of layers and comprises a plurality of neurons in a hidden layer within the plurality of layers grouped by a jump activation function, and wherein each neuron within the plurality of neurons is fully connected to an input layer within the plurality of layers enabling each neuron in the hidden layer within the plurality of layers to take a plurality of input neurons as input, and wherein an output layer within the plurality of layers is connected to each neuron in the hidden layer. 17. The computer program product of claim 16, wherein the jump activation function is defined as ϕ k  ( x ) = { 0 for   x < 0 ( 1 - e - x ) k for   x ≥ 0 , and wherein x is a value computed from one or more inputs to each neuron in the hidden layer and k is a positive integer. 18. The computer program product of claim 15, wherein the database query is modified according to an expression i<col<ui+≦col≦u−, wherein u+ denotes a smallest value greater than i in a respective column of the database, and wherein u− denotes a largest value smaller than u in the respective column of the database. 19. The computer program product of claim 15, wherein the adjacent lower bound and the adjacent upper bound are inputted to a non-strict range predicate selectivity artificial neural network to estimate a selectivity estimation of a range predicate. 20. The computer program product of claim 15, wherein the database is a relational database including one or more rows and the one or more database columns.