This map shows the geographic impact of Hongjun Lü's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hongjun Lü with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hongjun Lü more than expected).
This network shows the impact of papers produced by Hongjun Lü. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hongjun Lü. The network helps show where Hongjun Lü may publish in the future.
Co-authorship network of co-authors of Hongjun Lü
This figure shows the co-authorship network connecting the top 25 collaborators of Hongjun Lü.
A scholar is included among the top collaborators of Hongjun Lü based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Hongjun Lü. Hongjun Lü is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Wang, Wei, Haifeng Jiang, Hongzhi Wang, et al.. (2005). Efficient processing of XML path queries using the disk-based F&B Index. Very Large Data Bases. 145–156.38 indexed citations
2.
Jiang, Haifeng, Hongjun Lü, & Wei Wang. (2004). Efficient Processing of Twig Queries with OR-Predicates.. International Conference on Management of Data. 59–70.16 indexed citations
3.
Yu, Jeffrey Xu, et al.. (2004). Selecting Views with Maintenance Cost Constraints: Issues Heuristics and Performance.4 indexed citations
4.
Lü, Hongjun, et al.. (2003). Extending a Web Browser with client-side mining. Lecture notes in computer science. 2642. 166–177.6 indexed citations
5.
Fung, Gabriel Pui Cheong, Jeffrey Xu Yu, & Hongjun Lü. (2002). Discriminative Category Matching: Efficient Text Classification for Huge Discriminative Category Matching: Efficient Text Classification for Huge. 187.2 indexed citations
Zhou, Aoying, et al.. (2001). VXMLR: A Visual XML-Relational Database System. Very Large Data Bases. 719–720.17 indexed citations
8.
Lü, Hongjun, et al.. (2000). A Study on the Performance of Large Bayes Classifier. 1810. 271.1 indexed citations
9.
Lü, Hongjun, Jiawei Han, & Ling Feng. (1998). Stock movement prediction and N-dimensional inter-transaction association rules. International Conference on Management of Data.60 indexed citations
Lü, Hongjun, Kian‐Lee Tan, & Son Duy Dao. (1995). The Fittest Survives: An Adaptive Approach to Query Optimization. Very Large Data Bases. 251–262.7 indexed citations
13.
Lü, Hongjun, Beng Chin Ooi, & Kian‐Lee Tan. (1994). On Spatially Partitioned Temporal Join. Very Large Data Bases. 546–557.15 indexed citations
14.
Ooi, Beng Chin, et al.. (1992). Extensible Buffer Management of Indexes. Very Large Data Bases. 444–454.17 indexed citations
15.
Lü, Hongjun, Ming-Chien Shan, & Kian‐Lee Tan. (1991). Optimization of Multi-Way Join Queries for Parallel Execution. Very Large Data Bases. 549–560.47 indexed citations
16.
Lü, Hongjun, et al.. (1990). Hash-based join algorithms for multiprocessor computers with shared memory. Very Large Data Bases. 198–209.41 indexed citations
17.
Lü, Hongjun. (1987). New Strategies for Computing the Transitive Closure of a Database Relation. Very Large Data Bases. 267–274.47 indexed citations
18.
Carey, Michael J. & Hongjun Lü. (1986). Load-Balanced Task Allocation in Locally Distributed Computer Systems.. Proceedings of the International Conference on Parallel Processing. 1037–1039.14 indexed citations
19.
Lü, Hongjun & Michael J. Carey. (1985). Some experimental results on distributed join algorithms in a local network. Very Large Data Bases. 106–118.30 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.