If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
Help
If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.
Customer service
All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com
Sale & Press
If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com
View selection is important in many dataintensive systems e.g., commercial database and data warehousing systems to improve query performance. The view selection problem is one of the most complex problem solving: a NPhard problem. In a distributed environment, the problem becomes more challenging. Indeed, it includes another issue which is to decide on which computer nodes the selected views should be materialized. The principal objective of this manuscript is to provide a novel and efficient approach to address the view selection problem. For this purpose, we designed a solution using constraint programming which is known to be efficient for the resolution of NPhard problems and a powerful method for modeling and solving combinatorial optimization problems. Constraint programming is a general framework which relies on a combination of techniques that deal with reasoning. To solve a given problem by means of constraint programming, the problem must be represented as a constraint satisfaction problem. This part of the problem solving is called modeling. Then, the resolution of the modeled problem is performed automatically by the constraint solver in the solving stage.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer,
birth defects, or other reproductive harm.
For MAP (Minimum Advertised Price) violations and Intellectual Property (IP) or Trademark concerns, please contact:
support@ergodebooks.com
⚠️ California Proposition 65 Warning: Some products sold on this website may expose you to chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm. For more information, visit www.P65Warnings.ca.gov.
