We study the demand function of a group of S members facing a global budget constraint. Any vector belonging to the budget set can be consumed within the group, with no restriction on the form of individual preferences, the nature of individual consumptions or the form of the decision process beyond efficiency. Moreover, only the group aggregate behavior, summarized by its demand function, is o...

Range-aggregate queries are to apply a certain aggregate function on all tuples within given query ranges. Existing approaches to range-aggregate queries are insufficient to quickly provide accurate results in big data environments. In this paper, we propose FastRAQ a fast approach to range-aggregate queries in big data environments. FastRAQ approach on the Linux platform, and evaluate its perf...

Before sharing to support ad hoc aggregate analyses, microdata often need to be anonymized to protect the privacy of individuals. A variety of privacy models have been proposed for microdata anonymization. Many of these models (e.g., -closeness) essentially require that, after anonymization, groups of sensitive attribute values follow specified distributions. To support such models, in this pap...

In-network data aggregation allows energy-efficient communication within a sensor network. However, such data aggregation introduces new security challenges. As sensor nodes are prone to node-compromise, a fraction of nodes might act maliciously and forge aggregated data. For arbitrary aggregation functions, the verification of authenticity of aggregated data, i.e., its correctness, integrity, ...

The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, 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 attributevalue level is exploited, and the characterization of several complexity ...

A classical problem in database theory is to verify whether there exists a relation (or database) instance satisfying a number of given dependency constraints but the issue of handling constraints on aggregate data has not been much investigated so far. This paper introduces a new type of data dependency, called count constraint, that requires the results of given count operations on a relation...

We define aggregate productivity growth as the change in aggregate final demand minus the change in the aggregate cost of primary inputs. We show how to aggregate plant-level data to this measure and how to use plant-level data to decompose our measure into technical efficiency and reallocation components. This requires us to confront the “non-neoclassical” features that impact plant-level data...