Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Display of surfaces from volume data
Display of surfaces from volume data
3D geographic network displays
ACM SIGMOD Record
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Visualizing large-scale telecommunication networks and services (case study)
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Multidimensional binary search trees used for associative searching
Communications of the ACM
A performance comparison of bitmap indexes
Proceedings of the tenth international conference on Information and knowledge management
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Optical Models for Direct Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
VisDB: Database Exploration Using Multidimensional Visualization
IEEE Computer Graphics and Applications
Agile and scalable analysis of network events
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Performance Measurements of Compressed Bitmap Indices
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Interactive Exploration of Time Series Data
DS '01 Proceedings of the 4th International Conference on Discovery Science
The asymptotic decider: resolving the ambiguity in marching cubes
VIS '91 Proceedings of the 2nd conference on Visualization '91
Information Visualization: Perception for Design
Information Visualization: Perception for Design
The Spinning Cube of Potential Doom
Communications of the ACM - Wireless sensor networks
VisFlowConnect: netflow visualizations of link relationships for security situational awareness
Proceedings of the 2004 ACM workshop on Visualization and data mining for computer security
NVisionIP: netflow visualizations of system state for security situational awareness
Proceedings of the 2004 ACM workshop on Visualization and data mining for computer security
PortVis: a tool for port-based detection of security events
Proceedings of the 2004 ACM workshop on Visualization and data mining for computer security
Scout: A Hardware-Accelerated System for Quantitatively Driven Visualization and Analysis
VIS '04 Proceedings of the conference on Visualization '04
The OSU Flow-tools Package and CISCO NetFlow Logs
LISA '00 Proceedings of the 14th USENIX conference on System administration
FlowScan: A Network Traffic Flow Reporting and Visualization Tool
LISA '00 Proceedings of the 14th USENIX conference on System administration
More Netflow Tools for Performance and Security
LISA '04 Proceedings of the 18th USENIX conference on System administration
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
A User-centered Look at Glyph-based Security Visualization
VIZSEC '05 Proceedings of the IEEE Workshops on Visualization for Computer Security
Preserving the Big Picture: Visual Network Traffic Analysis with TN
VIZSEC '05 Proceedings of the IEEE Workshops on Visualization for Computer Security
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Building a time machine for efficient recording and retrieval of high-volume network traffic
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Bro: a system for detecting network intruders in real-time
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
The history of histograms (abridged)
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the performance of bitmap indices for high cardinality attributes
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Variable Interactions in Query-Driven Visualization
IEEE Transactions on Visualization and Computer Graphics
Topological Landscapes: A Terrain Metaphor for Scientific Data
IEEE Transactions on Visualization and Computer Graphics
High performance multivariate visual data exploration for extremely large data
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Investigating design choices between Bitmap index and B-tree index for a large data warehouse system
ACS'08 Proceedings of the 8th conference on Applied computer scince
Terascale data organization for discovering multivariate climatic trends
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Neural visualization of network traffic data for intrusion detection
Applied Soft Computing
Parallel index and query for large scale data analysis
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Federal market information technology in the post flash crash era: roles for supercomputing
Proceedings of the fourth workshop on High performance computational finance
Parallel I/O, analysis, and visualization of a trillion particle simulation
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Revisiting network scanning detection using sequential hypothesis testing
Security and Communication Networks
Hi-index | 0.00 |
Modern forensic analytics applications, like network traffic analysis, perform high-performance hypothesis testing, knowledge discovery and data mining on very large datasets. One essential strategy to reduce the time required for these operations is to select only the most relevant data records for a given computation. In this paper, we present a set of parallel algorithms that demonstrate how an efficient selection mechanism -- bitmap indexing -- significantly speeds up a common analysis task, namely, computing conditional histogram on very large datasets. We present a thorough study of the performance characteristics of the parallel conditional histogram algorithms. As a case study, we compute conditional histograms for detecting distributed scans hidden in a dataset consisting of approximately 2.5 billion network connection records. We show that these conditional histograms can be computed on interactive time scale (i.e., in seconds). We also show how to progressively modify the selection criteria to narrow the analysis and find the sources of the distributed scans.