Shixuan Sun

Orcid: 0000-0003-4060-9438

According to our database1, Shixuan Sun authored at least 26 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
gSWORD: GPU-accelerated Sampling for Subgraph Counting.
Proc. ACM Manag. Data, February, 2024

Temperature prediction of FSW medium thickness 2219 aluminium alloy based on intelligent algorithm.
Int. J. Manuf. Res., 2024

FaaSGraph: Enabling Scalable, Efficient, and Cost-Effective Graph Processing with Serverless Computing.
Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2024

2023
Async-fork: Mitigating Query Latency Spikes Incurred by the Fork-based Snapshot Mechanism from the OS Level.
Proc. VLDB Endow., 2023

Prediction of the tensile strength of friction stir welded joints based on one-dimensional convolutional neural network.
J. Intell. Fuzzy Syst., 2023

Cache Placement and Power Allocation in Offshore Maritime Wireless Networks.
Proceedings of the 98th IEEE Vehicular Technology Conference, 2023

High-Throughput GPU Random Walk with Fine-Tuned Concurrent Query Processing.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

2022
Subgraph Matching With Effective Matching Order and Indexing.
IEEE Trans. Knowl. Data Eng., 2022

An In-Depth Study of Continuous Subgraph Matching.
Proc. VLDB Endow., 2022

RapidFlow: An Efficient Approach to Continuous Subgraph Matching.
Proc. VLDB Endow., 2022

An In-Depth Study of Continuous Subgraph Matching (Complete Version).
CoRR, 2022

2021
ThunderRW: An In-Memory Graph Random Walk Engine.
Proc. VLDB Endow., 2021

ThunderRW: An In-Memory Graph Random Walk Engine (Complete Version).
CoRR, 2021

PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Cache-Efficient Fork-Processing Patterns on Large Graphs.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Efficient Deep Learning Pipelines for Accurate Cost Estimations Over Large Scale Query Workload.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

2020
RapidMatch: A Holistic Approach to Subgraph Query Processing.
Proc. VLDB Endow., 2020

Accelerating Truss Decomposition on Heterogeneous Processors.
Proc. VLDB Endow., 2020

In-Memory Subgraph Matching: An In-depth Study.
Proceedings of the 2020 International Conference on Management of Data, 2020

2019
Accelerating All-Edge Common Neighbor Counting on Three Processors.
Proceedings of the 48th International Conference on Parallel Processing, 2019

Efficient Parallel Subgraph Enumeration on a Single Machine.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Scaling Up Subgraph Query Processing with Efficient Subgraph Matching.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018
Parallelizing Pruning-based Graph Structural Clustering.
Proceedings of the 47th International Conference on Parallel Processing, 2018

Parallelizing Recursive Backtracking Based Subgraph Matching on a Single Machine.
Proceedings of the 24th IEEE International Conference on Parallel and Distributed Systems, 2018

2013
An Efficient Hierarchical Graph Clustering Algorithm Based on Shared Neighbors and Links.
Proceedings of the Knowledge Science, Engineering and Management, 2013

2012
An Entity Relationship Extraction Model Based on Chameleon Clustering Algorithm.
Proceedings of the Radio Frequency Identification System Security, 2012


  Loading...