Database Paper Browser

Back to institutions

Kent State University

Overall Rank
159 | 94.07%
Pagerank
0.23669282
Paper Count
27

Authors at This Institution

Listed authors are those whose most frequent affiliation is this institution.

Showing 12 of 12 authors.

Rank Author Pagerank Papers
351 Ruoming Jin 0.16033713 16
411 Xiang Lian 0.13768894 19
1,172 Ning Ruan 0.058560188 5
1,418 Yang Xiang 0.049897248 4
3,404 David Fuhry 0.023539231 2
7,826 Victor E. Lee 0.011088062 1
7,867 Lin Liu 0.010920551 1
8,979 Hui Hong 0.0088430021 1
9,121 Saikat Dey 0.0086629396 1
9,585 Guan Wang 0.0082801115 1
10,473 Gokarna Sharma 0.0077297924 1
12,728 Ahmed Al-Baghdadi 0.0069096204 1
Previous Page 1 / 1 Next

Papers with at Least One Affiliated Author

Showing 27 of 27 papers, sorted by pagerank.

Rank Paper Year Venue Pagerank
279 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00029113513
498 Large Scale Real-time Ridesharing with Service Guarantee on Road Networks 2014 VLDB 0.00021678756
788 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD 0.00016650034
1,013 Robust Local Community Detection: On Free Rider Effect and Its Elimination 2015 VLDB 0.00014645542
1,378 A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs 2012 SIGMOD 0.00012294512
1,450 Distance-Constraint Reachability Computation in Uncertain Graphs 2011 VLDB 0.00011925844
1,920 Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs 2014 SIGMOD 0.00010090791
2,957 Computing Label-Constraint Reachability in Graph Databases 2010 SIGMOD 7.8198686e-05
3,127 SCARAB: Scaling Reachability Computation on Large Graphs 2012 SIGMOD 7.5046522e-05
3,671 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 6.8560247e-05
4,057 Noah: A Dynamic Ridesharing System 2013 SIGMOD 6.4872768e-05
4,089 On Dense Pattern Mining in Graph Streams [Extended Abstract] 2010 VLDB 6.4587806e-05
4,478 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB 6.1506256e-05
4,718 Weighted Reservoir Sampling from Distributed Streams 2019 PODS 5.9749691e-05
4,973 Constrained Shortest Path Query in a Large Time-Dependent Graph 2019 VLDB 5.7909705e-05
5,215 Relational Approach for Shortest Path Discovery over Large Graphs 2012 VLDB 5.6228603e-05
5,485 Neighborhood-Privacy Protected Shortest Distance Computing in Cloud 2011 SIGMOD 5.4813218e-05
5,666 Fine-Grained Replication and Scheduling with Freshness and Correctness Guarantees 2005 VLDB 5.3812333e-05
6,441 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.0603113e-05
7,290 Topic-based Community Search over Spatial-Social Networks 2020 VLDB 4.7742854e-05
7,475 Optimizing Index for Taxonomy Keyword Search 2012 SIGMOD 4.7191809e-05
7,798 Triangular Stability Maximization by Influence Spread over Social Networks 2023 VLDB 4.6482149e-05
8,005 Online Topic-Aware Entity Resolution Over Incomplete Data Streams 2021 SIGMOD 4.6081461e-05
9,173 HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs 2024 SIGMOD 4.3842827e-05
10,062 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.1945683e-05
10,696 S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics 2025 VLDB 4.1945683e-05
11,769 Efficient Ad-Hoc Graph Inference and Matching in Biological Databases 2017 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next