Efficient Index for Temporal Core Queries over Bipartite Graphs

Summary: Novel index for temporal (α,β)-core queries on bipartite graphs using a DAG-like hierarchy of qualified time windows that encodes temporal containment. Space-optimized structure with incremental maintenance for fast queries/updates; validated on 8 real datasets. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13503
Venue: VLDB
Year: 2024
Pagerank: 4.1945683e-05
Overall Rank: 11,042 | 23.19%
DOI: 10.14778/3681954.3681965

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
108	Truss Decomposition in Massive Networks	2012	VLDB	0.00048300163
283	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029041257
891	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015564292
1,530	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00011495611
2,846	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD	8.0234377e-05
2,903	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.9375744e-05
3,394	Incremental Graph Computations: Doable and Undoable	2017	SIGMOD	7.1480446e-05
3,802	Group Recommendation: Semantics and Efficiency	2009	VLDB	6.7552492e-05
4,139	On Querying Historical K-Cores	2021	VLDB	6.415046e-05
4,171	Butterfly Counting on Uncertain Bipartite Graphs	2022	VLDB	6.3879236e-05
4,208	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	6.357214e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05
4,481	Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs	2024	VLDB	6.1485442e-05
6,183	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1667703e-05
6,725	Maximal D-truss Search in Dynamic Directed Graphs	2023	VLDB	4.9484066e-05
7,341	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7576413e-05
7,788	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	4.651009e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,563	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1945683e-05
10,189	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD	4.1945683e-05
6,657	On Querying Historical Connectivity in Temporal Graphs	2024	SIGMOD	4.9720132e-05
4,970	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	5.7945079e-05
10,547	On More Efficiently and Versatilely Querying Historical k-Cores	2025	VLDB	4.1945683e-05
7,341	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7576413e-05
6,183	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1667703e-05
5,540	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4498271e-05
4,139	On Querying Historical K-Cores	2021	VLDB	6.415046e-05
10,232	Efficient Temporal Subgraph Management: A New Interval Index	2026	VLDB	4.1945683e-05