Database Paper Browser

Back to institutions

University of New South Wales

Overall Rank
35 | 98.73%
Pagerank
1.2582827
Paper Count
165

Authors at This Institution

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

Showing 9 of 59 authors.

Rank Author Pagerank Papers
19,466 John Shepherd 0 2
19,467 Quan Z. Sheng 0 2
20,232 Mingchen Ju 0 1
20,612 Eileen Oi-Yan Mak 0 1
20,675 Karim Baïna 0 1
20,678 Agnieszka Rutkowska 0 1
20,679 Bryan Harianto 0 1
20,680 Halvard Skogsrud 0 1
20,681 Manh Q. Dinh 0 1
Previous Page 2 / 2 Next

Papers with at Least One Affiliated Author

Showing 50 of 165 papers, sorted by pagerank.

Rank Paper Year Venue Pagerank
428 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018725212
615 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015854099
682 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001514438
844 Maximum Biclique Search at Billion Scale 2020 VLDB 0.00013704502
887 Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints 2008 VLDB 0.00013452977
911 SPARK: Top-k Keyword Query in Relational Databases 2007 SIGMOD 0.00013341091
958 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.0001303337
1,059 Probabilistic Skylines on Uncertain Data 2007 VLDB 0.00012473585
1,340 Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach 2008 SIGMOD 0.00011196194
1,346 Efficient Computation of the Skyline Cube 2005 VLDB 0.00011186104
1,352 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011167002
1,551 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00010436335
1,566 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.0001039777
1,594 Speedup Graph Processing by Graph Ordering 2016 SIGMOD 0.00010341
1,673 More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks 2014 VLDB 0.00010125999
1,681 When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks 2018 SIGMOD 0.0001010807
1,693 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 0.00010080751
1,718 Algorithms for Materialized View Design in Data Warehousing Environment 1997 VLDB 0.00010017757
2,057 Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees 2020 VLDB 9.3142783e-05
2,094 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2515854e-05
2,110 Scaling Distance Labeling on Small-World Networks 2019 SIGMOD 9.2155364e-05
2,193 Data Consistency Properties and the Trade-offs in Commercial Cloud Storages: the Consumers’ Perspective 2011 CIDR 9.0411157e-05
2,288 A Scalable Lock Manager for Multicores 2013 SIGMOD 8.883168e-05
2,306 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 8.8599409e-05
2,312 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.8466573e-05
2,438 Efficient Structural Graph Clustering: An Index-Based Approach 2018 VLDB 8.6446076e-05
2,498 (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 8.5660019e-05
2,689 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.3170391e-05
2,789 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.186415e-05
2,807 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 8.1588693e-05
2,970 Leveraging Set Relations in Exact Set Similarity Join 2017 VLDB 7.9595777e-05
2,983 Scalable Big Graph Processing in MapReduce 2014 SIGMOD 7.9430614e-05
3,157 Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme 2011 SIGMOD 7.7577059e-05
3,191 Keyword Search on Structured and Semi-Structured Data 2009 SIGMOD 7.7236312e-05
3,243 Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity 2015 SIGMOD 7.6761752e-05
3,263 Connected Substructure Similarity Search 2010 SIGMOD 7.6516589e-05
3,314 Distributed Algorithms on Exact Personalized PageRank 2017 SIGMOD 7.594918e-05
3,401 Efficient Approximate Entity Extraction with Edit Distance Constraints 2009 SIGMOD 7.513719e-05
3,445 On Querying Historical K-Cores 2021 VLDB 7.4776352e-05
3,479 A Partition-Based Approach to Structure Similarity Search 2014 VLDB 7.4546419e-05
3,547 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.3840564e-05
3,690 Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs 2020 SIGMOD 7.2600733e-05
3,749 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.2091453e-05
3,750 Scaling Up k-Clique Densest Subgraph Detection 2023 SIGMOD 7.2078947e-05
3,962 When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks 2017 VLDB 7.0625334e-05
3,966 Local Similarity Search for Unstructured Text 2016 SIGMOD 7.0599782e-05
4,018 Efficient Bi-triangle Counting for Large Bipartite Networks 2021 VLDB 7.0241155e-05
4,032 Sliding-Window Top-k Queries on Uncertain Streams 2008 VLDB 7.0138912e-05
4,186 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.9091818e-05
4,266 Global Reinforcement of Social Networks: The Anchored Coreness Problem 2020 SIGMOD 6.860732e-05
Previous Page 1 / 4 Next