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: 13504
Venue: VLDB
Year: 2024
Pagerank: 4.1905499e-05
Overall Rank: 11,045 | 23.24%
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
106	Truss Decomposition in Massive Networks	2012	VLDB	0.00048373761
284	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029014359
888	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015549756
1,529	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00011484853
2,852	Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs	2019	SIGMOD	8.0158741e-05
2,908	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.92992e-05
3,439	Incremental Graph Computations: Doable and Undoable	2017	SIGMOD	7.0916563e-05
3,804	Group Recommendation: Semantics and Efficiency	2009	VLDB	6.7487709e-05
4,133	On Querying Historical K-Cores	2021	VLDB	6.4185206e-05
4,158	Butterfly Counting on Uncertain Bipartite Graphs	2022	VLDB	6.3898204e-05
4,209	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	6.3511029e-05
4,460	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1592411e-05
4,484	Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs	2024	VLDB	6.1426351e-05
6,185	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1618114e-05
6,729	Maximal D-truss Search in Dynamic Directed Graphs	2023	VLDB	4.943658e-05
7,339	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7530782e-05
7,789	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	4.6465475e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,572	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1905499e-05
10,189	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD	4.1905499e-05
6,660	On Querying Historical Connectivity in Temporal Graphs	2024	SIGMOD	4.9672425e-05
4,726	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	5.9632682e-05
10,556	On More Efficiently and Versatilely Querying Historical k-Cores	2025	VLDB	4.1905499e-05
7,339	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7530782e-05
6,185	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1618114e-05
5,548	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4445937e-05
4,133	On Querying Historical K-Cores	2021	VLDB	6.4185206e-05
10,232	Efficient Temporal Subgraph Management: A New Interval Index	2026	VLDB	4.1905499e-05