Zhong et al., 2021 - Google Patents
Burstsketch: Finding bursts in data streamsZhong et al., 2021
View PDF- Document ID
- 15814614673116092429
- Author
- Zhong Z
- Yan S
- Li Z
- Tan D
- Yang T
- Cui B
- Publication year
- Publication venue
- Proceedings of the 2021 International Conference on Management of Data
External Links
Snippet
Burst is a common pattern in data streams which is characterized by a sudden increase in terms of arrival rate followed by a sudden decrease. Burst detection has attracted extensive attention from the research community. In this paper, we propose a novel sketch, namely …
- 238000001514 detection method 0 abstract description 26
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30477—Query execution
- G06F17/30516—Data stream processing; continuous queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3409—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30705—Clustering or classification
- G06F17/3071—Clustering or classification including class or cluster creation or modification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/86—Event-based monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
- H04L63/1425—Traffic logging, e.g. anomaly detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
- H04L63/1416—Event detection, e.g. attack signature detection
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Zhong et al. | Burstsketch: Finding bursts in data streams | |
Li et al. | Wavingsketch: An unbiased and generic sketch for finding top-k items in data streams | |
Song et al. | Fcm-sketch: generic network measurements with data plane support | |
Zhang et al. | On-off sketch: A fast and accurate sketch on persistence | |
Dutta et al. | Streaming quotient filter: A near optimal approximate duplicate detection approach for data streams | |
Gou et al. | Sliding sketches: A framework using time zones for data stream processing in sliding windows | |
Chen et al. | Out of many we are one: Measuring item batch with clock-sketch | |
Li et al. | Stingy sketch: a sketch framework for accurate and fast frequency estimation | |
Xiao et al. | Universal online sketch for tracking heavy hitters and estimating moments of data streams | |
CN101834763B (en) | Multiple-category large-flow parallel measuring method under high speed network environment | |
Zhao et al. | Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items | |
Liu et al. | DUET: A generic framework for finding special quadratic elements in data streams | |
Li et al. | Ladderfilter: Filtering infrequent items with small memory and time overhead | |
Fu et al. | Clustering-preserving network flow sketching | |
Slo et al. | State-aware load shedding from input event streams in complex event processing | |
Li et al. | Local differentially private heavy hitter detection in data streams with bounded memory | |
Wang et al. | Fast and accurate traffic measurement with hierarchical filtering | |
Zhang et al. | Pontus: Finding waves in data streams | |
Liu et al. | Hypercalm sketch: One-pass mining periodic batches in data streams | |
Dutta et al. | Towards" intelligent compression" in streams: a biased reservoir sampling based bloom filter approach | |
Chen et al. | Persistent items tracking in large data streams based on adaptive sampling | |
Zhao et al. | The Stair Sketch: Bringing more Clarity to Memorize Recent Events | |
Fan et al. | Onesketch: A generic and accurate sketch for data streams | |
Wei et al. | Detecting duplicates over sliding windows with ram-efficient detached counting bloom filter arrays | |
Turkovic et al. | Detecting heavy hitters in the data-plane |