Demo Data from EDBT 2026 / reviewers in the wild / expert
Nagender Bandi
dblp:10/2626
· DBLP profile ↗
8ranked-venue papers
7as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 7 · 6 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
3 papers |
Data stream processing · 94% Spatial and temporal data management · 6% | |
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Hardware accelerators and domain-specific architectures · 68% Memory systems · 32% | |
| Computer networks
1 paper |
Network measurement and analytics · 100% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data stream processing › frequency estimation
heavy hitter detection |
0.1 | 1 | 2007 | Fast data stream algorithms using associative memories · SIGMOD Conference 2007 |
Data stream processing
stream summarization |
0.1 | 1 | 2007 | Fast data stream algorithms using associative memories · SIGMOD Conference 2007 |
Hardware accelerators and domain-specific architectures
database accelerator |
0.0 | 1 | 2004 | Hardware Acceleration in Commercial Databases: A Case Study of Spatial Operations · VLDB 2004 |
Network measurement and analytics › traffic analysis
traffic summarization |
0.0 | 1 | 2007 | Fast data stream algorithms using associative memories · SIGMOD Conference 2007 |
Memory systems
content-addressable memory |
0.0 | 1 | 2007 | TCAM-conscious Algorithms for Data Streams · ICDE 2007 |
Memory systems › content-addressable memory
TCAM |
0.0 | 1 | 2007 | TCAM-conscious Algorithms for Data Streams · ICDE 2007 |
Spatial and temporal data management › spatial data processing
spatial operations |
0.0 | 1 | 2004 | Hardware Acceleration in Commercial Databases: A Case Study of Spatial Operations · VLDB 2004 |
Methods — techniques the papers use, named apart from their topics
associative memory algorithms · 0.2ternary content addressable memory · 0.1TCAM-conscious algorithms · 0.1ternary content-addressable memory · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Fast Algorithms for Heavy Distinct Hitters using Associative MemoriesabstractReal-time detection of worm attacks, port scans and Distributed Denial of Service (DDoS) attacks, as network packets belonging to these security attacks flow through a network router, is of paramount importance. In a typical worm attack, a worm infected host tries to spread the worm by scanning a number of other hosts thus resulting in significant number of network connections at an intermediate router. Detecting such attacks amounts to finding all hosts that are associated with unusually high number of other hosts, which is equivalent to solving the classic heavy distinct hitter problem over data streams. While several heavy distinct hitter solutions have been proposed and evaluated in a standard CPU setting, most of the above applications typically execute on special networking architectures called Network Processing Units (NPUs). These NPUs interface with special associative memories known as the Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. In this paper, we describe how the integrated architecture of NPU and TCAMs can be exploited to develop high-speed solutions for heavy distinct hitters. Nagender Bandi, Divyakant Agrawal, Amr El Abbadi |
ICDCS | 1 |
| 2007 | TCAM-conscious Algorithms for Data StreamsabstractRecently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techniques are evaluated in a standard CPU setting, many of their applications such as click-fraud detection, and network-traffic summarization typically execute on special networking architectures called Network Processing Units (NPUs). These NPUs interface with special kind of associative memories known as the Ternary Content Addressable Memories (TCAMs). In this paper, we describe how the integrated architecture of NPU and TCAMs can be exploited towards achieving the goal of developing high-speed stream summarization solutions. We analyze popular solutions for the frequent elements problem in data stream, discuss the bottleneck issues and motivate how TCAMs can help alleviate these bottlenecks. A preliminary evaluation on an NPU platform reveals the performance gains of the TCAM-conscious techniques over software implementations. Nagender Bandi, Ahmed Metwally 0001, Divyakant Agrawal, Amr El Abbadi |
ICDE | 1 |
| 2007 | Fast data stream algorithms using associative memoriesabstractThe primary goal of data stream research is to develop space and time efficient solutions for answering continuous on-line summarization queries. Research efforts over the last decade have resulted in a number of efficient algorithms with varying degrees of space and time complexities. While these techniques are developed in a standard CPU setting, many of their applications such as click-fraud detection and network-traffic summarization typically execute on special networking architectures called Network Processing Units (NPUs). These NPUs interface with special associative memories known as Ternary Content Addressable Memories (TCAMs) to provide gigabit rate forwarding at network routers. In this paper, we describe how the integrated architecture of NPU and TCAMs can be exploited towards achieving the goal of developing high-speed stream summarization solutions. We propose two TCAM-conscious solutions for the frequent elements problem in data streams and present a comprehensive evaluation of these techniques on a state-of-the-art networking platform. Nagender Bandi, Ahmed Metwally 0001, Divyakant Agrawal, Amr El Abbadi |
SIGMOD Conference | 1 |
| 2007 | Fast computation of spatial selections and joins using graphics hardware
Nagender Bandi, Divyakant Agrawal, Amr El Abbadi |
Inf. Syst. | 1 |
| 2006 | Fast Computation of Database Operations Using Content-Addressable Memories
Nagender Bandi, Divyakant Agrawal, Amr El Abbadi |
DEXA | 1 |
| 2006 | Exploring spatial datasets with histograms
Nagender Bandi, Divyakant Agrawal, Amr El Abbadi |
Distributed Parallel Databases | 2 |
| 2005 | Hardware Acceleration of Database Operations Using Content-Addressable Memories
Nagender Bandi, Sam Schnieder, Divyakant Agrawal, Amr El Abbadi |
DaMoN | 1 |
| 2004 | Hardware Acceleration in Commercial Databases: A Case Study of Spatial Operations
Nagender Bandi, Amr El Abbadi, Divyakant Agrawal |
VLDB | 1 |