We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
In this paper, we explore a new paradigm for data management in which a third party service provider hosts "database as a service" providing its customers seamless mecha...
An increasing number of database applications require online access to massive amounts of data. Since large-scale storage systems implemented entirely on magnetic disk can be impr...
Bruce Hillyer, Rajeev Rastogi, Abraham Silberschat...
Data warehouses collect copies of information from remote sources into a single database. Since the remote data is cached at the warehouse, it appears as local relations to the us...