Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
We present an update on the status of the Cougar Sensor Database Project, in which we are investigating a database approach to sensor networks: Clients "program" the sen...
Alan J. Demers, Johannes Gehrke, Rajmohan Rajarama...
In this paper we propose a method for on-line max auditing of dynamic statistical databases. The method extends the Bayesian approach presented in [2], [3] and [4] for static data...
When two or more databases are combined into a global one, integrity may be violated even when each database is consistent with its own local integrity constraints. Efficient metho...