◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Shixuan Sun

6 papers hereh-index 14686 citations21 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author4

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • cs.DB5
  • cs.LG1
same name
  • Shixuan Sun — 13 papers, h 4
  • Shixuan Sun — 6 papers, h 5
  • Shixuan Sun — 5 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20212023
most citedCache-Efficient Fork-Processing Patterns on Large Graphs

10 citations · 14 across the 6 of their papers we have counts for

collaborators
Showing 2021Show all

4 papers · 1 filter

cs.DB2021★ 1 cited

ThunderRW: An In-Memory Graph Random Walk Engine (Complete Version)

Shixuan Sun, Yuhang Chen, Shengliang Lu +2

As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient in-memory random walk engine named ThunderRW. Compare…

cs.DB2021★ 10 cited

Cache-Efficient Fork-Processing Patterns on Large Graphs

Shengliang Lu, Shixuan Sun, Johns Paul +2

As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many…

cs.LG2021★ 2 cited

Efficient Deep Learning Pipelines for Accurate Cost Estimations Over Large Scale Query Workload

Johan Kok Zhi Kang, Gaurav, Sien Yi Tan +3

The use of deep learning models for forecasting the resource consumption patterns of SQL queries have recently been a popular area of study. With many companies using cloud platfor…

cs.DB2021

PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration

Shixuan Sun, Yuhang Chen, Bingsheng He +1

We study the hop-constrained s-t path enumeration (HcPE) problem, which takes a graph G, two distinct vertices s,t and a hop constraint k as input, and outputs all paths from…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.