A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely match directly. Thus, to complete the task of schema mapping, we must also ...
The MurMur project: modeling and querying multi-representation spatio-temporal databases
Successful information management implies the ability to design accurate representations of the real world of interest, in spite of the diversity of perceptions from the applications sharing the same database. Current database management systems do not ...
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an aggregation tree, in which parent nodes aggregate the values received from ...
Spatio-temporal join selectivity
Given two sets S1, S2 of moving objects, a future timestamp tq, and a distance threshold d, a spatio-temporal join retrieves all pairs of objects that are within distance d at tq. The selectivity of a join equals the number of retrieved pairs divided by ...
Evaluating chi-squared automatic interaction detection
We propose a method to compute confidence bounds around the predictions from chi-squared automatic interaction detection (CHAID). These bounds are useful for ex ante target selection as some clusters may or may not overlap. They are also useful for ex ...
Adaptive cycle management in soft real-time disk retrieval
The objective of this study is to determine the right cycle management policy to service periodic soft real-time disk retrieval. Cycle-based disk scheduling provides an effective way of exploiting the disk bandwidth and meeting the soft real-time ...
Finding recently frequent itemsets adaptively over online transactional data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be changed as time goes by. Identifying the recent change of a data stream, ...
Broadcasting and querying multi-dimensional index trees in a multi-channel environment
The continuous broadcast of data together with an index structure is an effective way of disseminating data in a wireless, mobile environment. The availability of an index allows a reduction in the tuning time and thus leads to lower power consumption ...