Honesty C. Young

912 total citations
37 papers, 553 citations indexed

About

Honesty C. Young is a scholar working on Computer Networks and Communications, Hardware and Architecture and Information Systems. According to data from OpenAlex, Honesty C. Young has authored 37 papers receiving a total of 553 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computer Networks and Communications, 14 papers in Hardware and Architecture and 8 papers in Information Systems. Recurrent topics in Honesty C. Young's work include Advanced Data Storage Technologies (22 papers), Distributed systems and fault tolerance (14 papers) and Parallel Computing and Optimization Techniques (13 papers). Honesty C. Young is often cited by papers focused on Advanced Data Storage Technologies (22 papers), Distributed systems and fault tolerance (14 papers) and Parallel Computing and Optimization Techniques (13 papers). Honesty C. Young collaborates with scholars based in United States, Taiwan and China. Honesty C. Young's co-authors include Alan Jay Smith, Windsor W. Hsu, James W. Stamos, Eugene J. Shekita, Ming-Ling Lo, Ming-Syan Chen⋆, Philip S. Yu, Kian‐Lee Tan, Raymond A. Lorie and James Goodman and has published in prestigious journals such as IEEE Transactions on Knowledge and Data Engineering, IEEE Transactions on Parallel and Distributed Systems and IBM Journal of Research and Development.

In The Last Decade

Honesty C. Young

33 papers receiving 489 citations

Peers

Honesty C. Young
Çagri Balkesen Switzerland
Gautam Altekar United States
Eric Sedlar United States
Orestis Polychroniou United States
B. Schwartz Germany
Anil Shanbhag United States
Hwansoo Han South Korea
Çagri Balkesen Switzerland
Honesty C. Young
Citations per year, relative to Honesty C. Young Honesty C. Young (= 1×) peers Çagri Balkesen

Countries citing papers authored by Honesty C. Young

Since Specialization
Citations

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

Fields of papers citing papers by Honesty C. Young

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Honesty C. Young

This figure shows the co-authorship network connecting the top 25 collaborators of Honesty C. Young. A scholar is included among the top collaborators of Honesty C. Young 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 Honesty C. Young. Honesty C. Young 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.
Hsu, Windsor W., Alan Jay Smith, & Honesty C. Young. (2005). The automatic improvement of locality in storage systems. ACM Transactions on Computer Systems. 23(4). 424–473. 61 indexed citations
2.
3.
Young, Honesty C. & Eugene J. Shekita. (2002). An intelligent I-cache prefetch mechanism. 20. 44–49. 11 indexed citations
4.
Hua, K.A., Wallapak Tavanapong, & Honesty C. Young. (2002). A performance evaluation of load balancing techniques for join operations on multicomputer database systems. 9. 44–51. 3 indexed citations
6.
Hua, K.A., et al.. (2002). SEP: a space efficient pipelining technique for managing disk buffers in multimedia servers. 3. 598–607. 3 indexed citations
7.
Smith, Alan Jay, et al.. (2002). Projecting the performance of decision support workloads on systems with smart storage (SmartSTOR). 417–425. 12 indexed citations
8.
Hsu, Windsor W., Alan Jay Smith, & Honesty C. Young. (2001). I/O reference behavior of production database workloads and the TPC benchmarks—an analysis at the logical level. ACM Transactions on Database Systems. 26(1). 96–143. 49 indexed citations
9.
Hsu, Windsor W., Alan Jay Smith, & Honesty C. Young. (1999). Analysis of the Characteristics of Production Database Workloads and Comparison with the TPC Benchmarks. UC Berkeley. 12 indexed citations
10.
Young, Honesty C., et al.. (1997). Fast cache access with full-map block directory. 578–586. 1 indexed citations
11.
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
12.
Shekita, Eugene J., Honesty C. Young, & Kian‐Lee Tan. (1993). Multi-Join Optimization for Symmetric Multiprocessors. Very Large Data Bases. 479–492. 49 indexed citations
13.
Hua, Kien A., et al.. (1993). Considering data skew factor in multi-way join query optimization for parallel execution. The VLDB Journal. 2(3). 303–330. 9 indexed citations
14.
Swami, Arun & Honesty C. Young. (1993). Online Algorithms for Handling Skew in Parallel Joins. 253–257. 2 indexed citations
15.
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
16.
Hua, Kien A., Chiang Lee, & Honesty C. Young. (1991). A Cell-Based Data Partitioning Strategy for Efficient Load Balancing in A Distributed Memory Multicomputer Database System.. Proceedings of the International Conference on Parallel Processing. 479–483. 2 indexed citations
17.
Lorie, Raymond A. & Honesty C. Young. (1989). A low communication sort algorithm for a parallel database machine. Very Large Data Bases. 125–134. 21 indexed citations
18.
Young, Honesty C.. (1988). Code Scheduling Methods for some architectural features in pipe. Microprocessing and Microprogramming. 22(1). 39–63. 5 indexed citations
19.
Young, Honesty C. & James Goodman. (1986). The Design of a Queue-Based Vector Supercomputer.. Proceedings of the International Conference on Parallel Processing. 483–486. 3 indexed citations
20.
Young, Honesty C.. (1985). Evaluation of a decoupled computer architecture and the design of a vector extension (pipelined processor; delayed branch, code scheduling, software pipelining, queue register). 5 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