Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Fuente:
arXiv
Guardado en:
| Autores principales: | Mang, Qiuyang, Chen, Jingbang, Zhou, Hangrui, Gao, Yu, Zhou, Yingli, Shi, Qingyu, Peng, Richard, Fang, Yixiang, Ma, Chenhao |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Scalable Approximate Biclique Counting over Large Bipartite Graphs
por: Chen, Jingbang, et al.
Publicado: (2025)
por: Chen, Jingbang, et al.
Publicado: (2025)
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
por: Chen, Jingbang, et al.
Publicado: (2024)
por: Chen, Jingbang, et al.
Publicado: (2024)
Accelerating Historical K-Core Search in Temporal Graphs
por: Ma, Zhuo, et al.
Publicado: (2025)
por: Ma, Zhuo, et al.
Publicado: (2025)
PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans
por: Mang, Qiuyang, et al.
Publicado: (2026)
por: Mang, Qiuyang, et al.
Publicado: (2026)
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2024)
por: Zhou, Yingli, et al.
Publicado: (2024)
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
por: Wu, Yanping, et al.
Publicado: (2024)
por: Wu, Yanping, et al.
Publicado: (2024)
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
por: Cai, Xinwei, et al.
Publicado: (2023)
por: Cai, Xinwei, et al.
Publicado: (2023)
BookRAG: A Hierarchical Structure-aware Index-based Approach for Retrieval-Augmented Generation on Complex Documents
por: Wang, Shu, et al.
Publicado: (2025)
por: Wang, Shu, et al.
Publicado: (2025)
Nearly Optimal Internal Dictionary Matching
por: Chen, Jingbang, et al.
Publicado: (2023)
por: Chen, Jingbang, et al.
Publicado: (2023)
Topology-Aware LLM-Driven Social Simulation: A Unified Framework for Efficient and Realistic Agent Dynamics
por: Xu, Yuwei, et al.
Publicado: (2026)
por: Xu, Yuwei, et al.
Publicado: (2026)
Approximate Butterfly Counting in Sublinear Time
por: Luo, Chi, et al.
Publicado: (2026)
por: Luo, Chi, et al.
Publicado: (2026)
Finding Logic Bugs in Spatial Database Engines via Affine Equivalent Inputs
por: Deng, Wenjing, et al.
Publicado: (2024)
por: Deng, Wenjing, et al.
Publicado: (2024)
Accelerating Graph Indexing for ANNS on Modern CPUs
por: Wang, Mengzhao, et al.
Publicado: (2025)
por: Wang, Mengzhao, et al.
Publicado: (2025)
Memory in the LLM Era: Modular Architectures and Strategies in a Unified Framework
por: Wu, Yanchen, et al.
Publicado: (2026)
por: Wu, Yanchen, et al.
Publicado: (2026)
In-depth Analysis of Graph-based RAG in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2025)
por: Zhou, Yingli, et al.
Publicado: (2025)
Scalable Algorithm for Dynamic Quasi-clique Detection
por: Chen, Jingbang, et al.
Publicado: (2026)
por: Chen, Jingbang, et al.
Publicado: (2026)
Optimal $(α,β)$-Dense Subgraph Search in Bipartite Graphs
por: Zhang, Yalong, et al.
Publicado: (2025)
por: Zhang, Yalong, et al.
Publicado: (2025)
Automated Discovery of Test Oracles for Database Management Systems Using LLMs
por: Mang, Qiuyang, et al.
Publicado: (2025)
por: Mang, Qiuyang, et al.
Publicado: (2025)
A Computationally Efficient Framework for Overlapping Community Detection in Large Bipartite Graphs
por: Zeng, Yue, et al.
Publicado: (2025)
por: Zeng, Yue, et al.
Publicado: (2025)
LLM+Graph@VLDB'2025 Workshop Summary
por: Fang, Yixiang, et al.
Publicado: (2026)
por: Fang, Yixiang, et al.
Publicado: (2026)
Efficient Temporal Simple Path Graph Generation
por: Tang, Zhiyang, et al.
Publicado: (2025)
por: Tang, Zhiyang, et al.
Publicado: (2025)
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
por: He, Yizhang, et al.
Publicado: (2025)
por: He, Yizhang, et al.
Publicado: (2025)
Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search
por: Yang, Shuo, et al.
Publicado: (2024)
por: Yang, Shuo, et al.
Publicado: (2024)
RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search
por: Chen, Meng, et al.
Publicado: (2024)
por: Chen, Meng, et al.
Publicado: (2024)
AeonG: An Efficient Built-in Temporal Support in Graph Databases
por: Hou, Jiamin, et al.
Publicado: (2023)
por: Hou, Jiamin, et al.
Publicado: (2023)
Fast Tuning the Index Construction Parameters of Proximity Graphs in Vector Databases
por: Zhou, Wenyang, et al.
Publicado: (2026)
por: Zhou, Wenyang, et al.
Publicado: (2026)
Esc: An Early-stopping Checker for Budget-aware Index Tuning
por: Wang, Xiaoying, et al.
Publicado: (2025)
por: Wang, Xiaoying, et al.
Publicado: (2025)
All-in-one Graph-based Indexing for Hybrid Search on GPUs
por: Li, Zhonggen, et al.
Publicado: (2025)
por: Li, Zhonggen, et al.
Publicado: (2025)
A Topology-Aware Localized Update Strategy for Graph-Based ANN Index
por: Yu, Song, et al.
Publicado: (2025)
por: Yu, Song, et al.
Publicado: (2025)
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment
por: Wang, Mengzhao, et al.
Publicado: (2024)
por: Wang, Mengzhao, et al.
Publicado: (2024)
Birdie: Natural Language-Driven Table Discovery Using Differentiable Search Index
por: Guo, Yuxiang, et al.
Publicado: (2025)
por: Guo, Yuxiang, et al.
Publicado: (2025)
Maintaining Leiden Communities in Large Dynamic Graphs
por: Lin, Chunxu, et al.
Publicado: (2026)
por: Lin, Chunxu, et al.
Publicado: (2026)
Towards Pattern-aware Data Augmentation for Temporal Knowledge Graph Completion
por: Zhang, Jiasheng, et al.
Publicado: (2024)
por: Zhang, Jiasheng, et al.
Publicado: (2024)
Indexing Techniques for Graph Reachability Queries
por: Zhang, Chao, et al.
Publicado: (2023)
por: Zhang, Chao, et al.
Publicado: (2023)
$\boldsymbol{Steiner}$-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
por: Wang, Zeyu, et al.
Publicado: (2024)
por: Wang, Zeyu, et al.
Publicado: (2024)
EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search
por: Zhong, Xiaoyao, et al.
Publicado: (2025)
por: Zhong, Xiaoyao, et al.
Publicado: (2025)
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
por: Zou, Zhiqiu, et al.
Publicado: (2026)
por: Zou, Zhiqiu, et al.
Publicado: (2026)
Efficient Community Detection Over Streaming Bipartite Networks (Technical Report)
por: Zhang, Nan, et al.
Publicado: (2024)
por: Zhang, Nan, et al.
Publicado: (2024)
Efficient Multiple Temporal Network Kernel Density Estimation
por: Shao, Yu, et al.
Publicado: (2025)
por: Shao, Yu, et al.
Publicado: (2025)
TKG-Thinker: Towards Dynamic Reasoning over Temporal Knowledge Graphs via Agentic Reinforcement Learning
por: Jiang, Zihao, et al.
Publicado: (2026)
por: Jiang, Zihao, et al.
Publicado: (2026)
Ejemplares similares
-
Scalable Approximate Biclique Counting over Large Bipartite Graphs
por: Chen, Jingbang, et al.
Publicado: (2025) -
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
por: Chen, Jingbang, et al.
Publicado: (2024) -
Accelerating Historical K-Core Search in Temporal Graphs
por: Ma, Zhuo, et al.
Publicado: (2025) -
PLOP: Cost-Based Placement of Semantic Operators in Hybrid Query Plans
por: Mang, Qiuyang, et al.
Publicado: (2026) -
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2024)