[go: up one dir, main page]

Zhao et al., 2021 - Google Patents

Dhs: Adaptive memory layout organization of sketch slots for fast and accurate data stream processing

Zhao et al., 2021

View PDF
Document ID
6511019074042762475
Author
Zhao B
Li X
Tian B
Mei Z
Wu W
Publication year
Publication venue
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining

External Links

Snippet

Data stream processing is a crucial computation task in data mining applications. The rigid and fixed data structures in existing solutions limit their accuracy, throughput, and generality in measurement tasks. We propose Dynamic Hierarchical Sketch (DHS), a sketch-based …
Continue reading at dl.acm.org (PDF) (other versions)

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/30477—Query execution
    • G06F17/30483—Query execution of query operations
    • G06F17/30486—Unary operations; data partitioning operations
    • 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/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • 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
    • 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/12—Replacement control
    • G06F12/121—Replacement control using replacement algorithms
    • G06F12/122—Replacement control using replacement algorithms of the least frequently used [LFU] type, e.g. with individual count value
    • 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/30587—Details of specialised database models
    • 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
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management

Similar Documents

Publication Publication Date Title
Zhao et al. Dhs: Adaptive memory layout organization of sketch slots for fast and accurate data stream processing
Yang et al. Heavyguardian: Separate and guard hot items in data streams
Mouratidis et al. Continuous monitoring of top-k queries over sliding windows
Aggarwal et al. A framework for on-demand classification of evolving data streams
Einziger et al. Counting with tinytable: Every bit counts!
Liu et al. Methods for mining frequent items in data streams: an overview
Shukla et al. Analysis and evaluation of outlier detection algorithms in data streams
US9280551B2 (en) De-duplication deployment planning
Hua et al. Nest: Locality-aware approximate query service for cloud computing
Gao et al. An efficient and distributed framework for real-time trajectory stream clustering
Beyer et al. Distinct-value synopses for multiset operations
Liu et al. Hypercalm sketch: One-pass mining periodic batches in data streams
Jiang et al. Auxo: A scalable and efficient graph stream summarization structure
Xu et al. MimoSketch: A framework to mine item frequency on multiple nodes with sketches
Wu et al. Novel structures for counting frequent items in time decayed streams
Mouratidis et al. Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Guo et al. Hourglasssketch: An efficient and scalable framework for graph stream summarization
Liu et al. Cafe+: Towards compact, adaptive, and fast embedding for large-scale online recommendation models
Hua et al. The design and implementations of locality-aware approximate queries in hybrid storage systems
Bera et al. Advanced bloom filter based algorithms for efficient approximate data de-duplication in streams
Almaslukh et al. Scalable Spatio-temporal Top-k Interaction Queries on Dynamic Communities
Cao et al. Modified counter: A fast and dynamic structure for locating high-frequency items in data streams
Narang et al. Real-time approximate range motif discovery & data redundancy removal algorithm
Fu et al. Jump Filter: A Dynamic Sketch for Big Data Governance.
Yang et al. Cts sketch: A sketch scheme for precise identification of top-k flows combined with sdn