Let High-Level Graph Queries Be Parallel Efficient: An Approach Over Structural Recursion on Pregel

Journal of Information Processing
doi 10.2197/ipsjjip.24.928
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Information Processing Society of Japan

Related search

Parallel Structural Graph Clustering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

An Efficient Indexing Approach for Continuous Spatial Approximate Keyword Queries Over Geo-Textual Streaming Data

ISPRS International Journal of Geo-Information
DevelopmentPlanetary SciencesComputers in Earth SciencesPlanningEarthGeography
2019English

Efficient Parallel Graph Exploration on Multi-Core CPU and GPU

2011English

Efficient Location Updates for Continuous Queries Over Moving Objects

Journal of Computer Science and Technology
HardwareComputer Science ApplicationsArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2010English

Efficient Maximal Clique Enumeration Over Graph Data

Data Science and Engineering
Computational MechanicsComputer Science Applications
2016English

Expressive Path Queries on Graph With Data

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2015English

An Approach Based on Edge Coloring of Tripartite Graph for Designing Parallel LDPC Interleaver Architecture

2011English

An Efficient Structural Approach to Board Interconnect Diagnosis

1999English

ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy