BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260730T152638Z
LOCATION:
DTSTART;TZID=America/Los_Angeles:20260728T125000
DTEND;TZID=America/Los_Angeles:20260728T125100
UID:dac_DAC 2026_sess315_RESEARCH2806@linklings.com
SUMMARY:LHGstore: An In-Memory Learned Graph Storage for Fast Updates and 
 Analytics
DESCRIPTION:Pengpeng Qiao (Institute of Science Tokyo), Zhiwei Zhang and X
 inzhou Wang (Beijing Institute of Technology), Zhetao Li (Jinan University
 ), Xiaochun Cao (Sun Yat-sen University), and Yang Cao (Institute of Scien
 ce Tokyo)\n\nVarious real-world applications rely on in-memory dynamic gra
 phs that must efficiently handle frequent updates while supporting low-lat
 ency analytics on evolving structures. Achieving both objectives remains c
 hallenging due to the trade-off between update efficiency and traversal lo
 cality, particularly under highly skewed degree distributions. This motiva
 tes the design of graph indexing schemes optimized for in-memory graph man
 agement on modern multi-core CPUs. We present LHGstore, a degree-aware Lea
 rned Hierarchical Graph storage that, for the first time, integrates learn
 ed indexing into graph management. LHGstore designs a two-level hierarchy 
 that decouples vertex and edge access and further organizes each vertex's 
 edges using data structures adaptive to its degree. Lightweight arrays are
  used for low-degree vertices to maximize traversal locality, while learne
 d indexes are applied to high-degree vertices to improve update throughput
 . Extensive experiments show that LHGstore achieves 5.9-28.2× higher throu
 ghput and significantly faster analytics than SOTA in-memory graph storage
  systems.\n\nTopics: Quantum\n\nTrack: DES6. Quantum Computing, Systems\n\
 nSession Chairs: Hokeun Kim (Arizona State University); BaekGyu Kim (Daegu
  Gyeongbuk Institute of Science and Technology); Xiang Chen (Peking Univer
 sity); Sangyeob Kim (Yonsei University); Robert M. Radway (University of P
 ennsylvania); Prashanth Mohan (University of Pittsburgh); Xiaoxuan Yang (U
 niversity of Virginia, Stanford University); Ramtin Zand (University of So
 uth Carolina); Hadi Kamali (University of Central Florida); Jiafeng Xie (V
 illanova University); Prabuddha Chakraborty (University of Maine); Junichi
 ro Kadomoto (University of Tokyo); and Yosuke Ueno (RIKEN)\n\n
END:VEVENT
END:VCALENDAR