[go: up one dir, main page]

Rogora et al., 2017 - Google Patents

High-throughput subset matching on commodity GPU-based systems

Rogora et al., 2017

View PDF
Document ID
16431195749084275216
Author
Rogora D
Papalini M
Khazaei K
Margara A
Carzaniga A
Cugola G
Publication year
Publication venue
Proceedings of the Twelfth European Conference on Computer Systems

External Links

Snippet

Large-scale information processing often relies on subset matching for data classification and routing. Examples are publish/subscribe and stream processing systems, database systems, social media, and information-centric networking. For instance, an advanced …
Continue reading at margara.faculty.polimi.it (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
    • 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
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogramme communication; Intertask communication
    • 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
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • 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/30861—Retrieval from the Internet, e.g. browsers
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H04L67/1002—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers, e.g. load balancing
    • H04L67/1004—Server selection in load balancing
    • H04L67/1014—Server selection in load balancing based on the content of a request
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity

Similar Documents

Publication Publication Date Title
Sriraman et al. μ suite: a benchmark suite for microservices
KR101245994B1 (en) Parallel distributed processing system and method
Yu et al. GPU acceleration of regular expression matching for large datasets: exploring the implementation space
Brenna et al. Distributed event stream processing with non-deterministic finite automata
Halim et al. A MapReduce-based maximum-flow algorithm for large small-world network graphs
Zhang et al. Accelerating frequent itemset mining on graphics processing units
Plagemann et al. A model for dynamic configuration of light-weight protocols
Kolb et al. Learning-based entity resolution with MapReduce
Mohamed et al. MRO-MPI: MapReduce overlapping using MPI and an optimized data exchange policy
Chen et al. Distributed and scalable sequential pattern mining through stream processing
Cui et al. On efficient external-memory triangle listing
Nolé et al. Regular path queries on massive graphs
Tseng et al. Accelerating open vSwitch with integrated GPU
Sanders et al. Engineering a distributed-memory triangle counting algorithm
Huang et al. A distributed method for fast mining frequent patterns from big data
Ye et al. Large-scale graph label propagation on GPUs
Essam et al. Towards enhancing the performance of parallel FP-growth on Spark
Rogora et al. High-throughput subset matching on commodity GPU-based systems
Nguyen-Van et al. Minimizing data transfers for regular reachability queries on distributed graphs
Li et al. Utilizing the column imprints to accelerate no‐partitioning hash joins in large‐scale edge systems
De Francisci et al. Scaling out all pairs similarity search with mapreduce
Meena et al. Handling data-skewness in character based string similarity join using Hadoop
Krause et al. Partitioning strategy selection for in-memory graph pattern matching on multiprocessor systems
Velusamy et al. Inverted indexing in big data using hadoop multiple node cluster
Li et al. Multiset synchronization with counting cuckoo filters