Repairing and Querying Databases under Aggregate Constraints

Name: Repairing and Querying Databases under Aggregate Constraints
Brand: Springer Nature
SKU: 9781461416418
Availability: InStock

Best Price:
Buy Repairing and Querying Databases under Aggregate Constraints for $29.99 at @ Link.springer.com
No coupon is required — this is the standard retail price.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $29.99 - $29.99

BEST PRICE

Single Product Purchase

$29.99

@ Link.springer.com BUY Now

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$29.99	$29.99			$29.99		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9781461416418

Condition

New

Product Description

Research has deeply investigated several issues related to the use of integrity constraints on relational databases. In particular, a great deal of attention has been devoted to the problem of extracting "reliable" information from databases containing pieces of information inconsistent with regard to some integrity constraints. In this manuscript, the problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. Aggregate constraints defined as linear inequalities on aggregate-sum queries on input data are considered. The notion of repair as consistent set of updates at attribute-value level is exploited, and the characterization of several data-complexity issues related to repairing data and computing consistent query answers is provided. Moreover, a method for computing reasonable repairs of inconsistent numerical databases is introduced, for a restricted but expressive class of aggregate constraints. An extension of this method for dealing with the data repairing problem in the presence of weak aggregate constraints which are expected to be satisfied, but not required to, is presented. Furthermore, a technique for computing consistent answers of aggregate queries in the presence of a wide form of aggregate constraints is provided. Finally, extensions of the framework as well as several open problems are discussed.

Available Colors

N/A

Available Sizes

N/A