Issue Downloads
On Directed Densest Subgraph Discovery
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is fundamental to a wide range of applications, such as fraud ...
Timely Reporting of Heavy Hitters Using External Memory
- Shikha Singh,
- Prashant Pandey,
- Michael A. Bender,
- Jonathan W. Berry,
- Martín Farach-Colton,
- Rob Johnson,
- Thomas M. Kroeger,
- Cynthia A. Phillips
Given an input stream S of size N, a ɸ-heavy hitter is an item that occurs at least ɸN times in S. The problem of finding heavy-hitters is extensively studied in the database literature.
We study a real-time heavy-hitters variant in which an element must ...
Balancing Expressiveness and Inexpressiveness in View Design
We study the design of data publishing mechanisms that allow a collection of autonomous distributed data sources to collaborate to support queries. A common mechanism for data publishing is via views: functions that expose derived data to users, usually ...
A Formal Framework for Complex Event Recognition
Complex event recognition (CER) has emerged as the unifying field for technologies that require processing and correlating distributed data sources in real time. CER finds applications in diverse domains, which has resulted in a large number of proposals ...
