Ming-Ling Lo

1.0k total citations
16 papers, 683 citations indexed

About

Ming-Ling Lo is a scholar working on Computer Networks and Communications, Signal Processing and Computer Vision and Pattern Recognition. According to data from OpenAlex, Ming-Ling Lo has authored 16 papers receiving a total of 683 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computer Networks and Communications, 11 papers in Signal Processing and 7 papers in Computer Vision and Pattern Recognition. Recurrent topics in Ming-Ling Lo's work include Data Management and Algorithms (9 papers), Advanced Database Systems and Queries (8 papers) and Algorithms and Data Compression (7 papers). Ming-Ling Lo is often cited by papers focused on Data Management and Algorithms (9 papers), Advanced Database Systems and Queries (8 papers) and Algorithms and Data Compression (7 papers). Ming-Ling Lo collaborates with scholars based in United States and United Kingdom. Ming-Ling Lo's co-authors include Chinya V. Ravishankar, Yuan‐Chi Chang, John R. Smith, Vittorio Castelli, Lawrence D. Bergman, Chung‐Sheng Li, Ming-Syan Chen⋆, Philip S. Yu, Honesty C. Young and Kun‐Lung Wu and has published in prestigious journals such as IEEE Transactions on Knowledge and Data Engineering, ACM SIGMOD Record and Very Large Data Bases.

In The Last Decade

Ming-Ling Lo

16 papers receiving 645 citations

Peers

Ming-Ling Lo
Xiaopeng Xiong United States
Pin-Kwang Eng Singapore
Andreas Kipf Germany
Petko Bakalov United States
Moustafa A. Hammad United States
Navin Kabra United States
Shaul Dar United States
Xiaopeng Xiong United States
Ming-Ling Lo
Citations per year, relative to Ming-Ling Lo Ming-Ling Lo (= 1×) peers Xiaopeng Xiong

Countries citing papers authored by Ming-Ling Lo

Since Specialization
Citations

This map shows the geographic impact of Ming-Ling Lo'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 Ming-Ling Lo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ming-Ling Lo more than expected).

Fields of papers citing papers by Ming-Ling Lo

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ming-Ling Lo. 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 Ming-Ling Lo. The network helps show where Ming-Ling Lo may publish in the future.

Co-authorship network of co-authors of Ming-Ling Lo

This figure shows the co-authorship network connecting the top 25 collaborators of Ming-Ling Lo. A scholar is included among the top collaborators of Ming-Ling Lo 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 Ming-Ling Lo. Ming-Ling Lo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

16 of 16 papers shown
1.
Lo, Ming-Ling, Kun‐Lung Wu, & P.S. Yu. (2002). TabSum: a flexible and dynamic table summarization approach. 628–635. 5 indexed citations
2.
Jiang, Jianmin & Ming-Ling Lo. (2002). Comparative investigation of a non-linear predictive codec versus JPEG lossless compression. 5. 2653–2656. 1 indexed citations
3.
Lo, Ming-Ling & Chinya V. Ravishankar. (2002). Towards eliminating random I/O in hash joins. 422–429. 1 indexed citations
4.
Chang, Yuan‐Chi, Lawrence D. Bergman, Vittorio Castelli, et al.. (2000). The onion technique. 391–402. 89 indexed citations
5.
Chang, Yuan‐Chi, Ming-Ling Lo, & John R. Smith. (2000). <title>Issues and solutions for storage, retrieval, and searching of MPEG-7 documents</title>. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 4210. 60–71. 1 indexed citations
6.
Chang, Yuan‐Chi, Lawrence D. Bergman, Vittorio Castelli, et al.. (2000). The onion technique. ACM SIGMOD Record. 29(2). 391–402. 140 indexed citations
7.
Lo, Ming-Ling & Chinya V. Ravishankar. (1998). The design and implementation of seeded trees: an efficient method for spatial joins. IEEE Transactions on Knowledge and Data Engineering. 10(1). 136–152. 12 indexed citations
8.
Lo, Ming-Ling & Chinya V. Ravishankar. (1996). Spatial hash-joins. 247–258. 149 indexed citations
9.
Lo, Ming-Ling & Chinya V. Ravishankar. (1996). Spatial hash-joins. ACM SIGMOD Record. 25(2). 247–258. 47 indexed citations
10.
Chen⋆, Ming-Syan, Ming-Ling Lo, Philip S. Yu, & Honesty C. Young. (1995). Applying segmented right-deep trees to pipelining multiple hash joins. IEEE Transactions on Knowledge and Data Engineering. 7(4). 656–668. 12 indexed citations
11.
Lo, Ming-Ling & Chinya V. Ravishankar. (1994). Spatial joins using seeded trees. ACM SIGMOD Record. 23(2). 209–220. 25 indexed citations
12.
Lo, Ming-Ling & Chinya V. Ravishankar. (1994). Spatial joins using seeded trees. 209–220. 110 indexed citations
13.
Lo, Ming-Ling, Ming-Syan Chen⋆, Chinya V. Ravishankar, & Philip S. Yu. (1993). On optimal processor allocation to support pipelined hash joins. ACM SIGMOD Record. 22(2). 69–78. 3 indexed citations
14.
Lo, Ming-Ling, Ming-Syan Chen⋆, Chinya V. Ravishankar, & Philip S. Yu. (1993). On optimal processor allocation to support pipelined hash joins. 69–78. 31 indexed citations
15.
Lo, Ming-Ling & Chinya V. Ravishankar. (1992). A concurrency control protocol for nested transactions. Conference of the Centre for Advanced Studies on Collaborative Research. 67–80. 1 indexed citations
16.
Chen⋆, Ming-Syan, Ming-Ling Lo, Philip S. Yu, & Honesty C. Young. (1992). Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins. Very Large Data Bases. 15–26. 56 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026