Demo Data from EDBT 2026 / reviewers in the wild / expert
Jenn-Yang Tien
dblp:69/5371
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Interconnection networks and networks-on-chip · 85% Hardware reliability and fault tolerance · 8% Parallel and multicore computing · 6% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip
broadcasting |
0.0 | 1 | 1993 | Broadcasting on Incomplete Hypercubes · IEEE Trans. Computers 1993 |
Interconnection networks and networks-on-chip
hypercube network |
0.0 | 1 | 1993 | Broadcasting on Incomplete Hypercubes · IEEE Trans. Computers 1993 |
Interconnection networks and networks-on-chip › hypercube network
incomplete hypercube |
0.0 | 1 | 1993 | Broadcasting on Incomplete Hypercubes · IEEE Trans. Computers 1993 |
Query processing and optimization › join processing › join algorithms
hash join |
0.0 | 1 | 1991 | Comments on 'Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers' · IEEE Trans. Knowl. Data Eng. 1991 |
Query processing and optimization › join processing
parallel join |
0.0 | 1 | 1991 | Comments on 'Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers' · IEEE Trans. Knowl. Data Eng. 1991 |
Hardware reliability and fault tolerance › network fault tolerance
faulty node tolerance |
0.0 | 1 | 1993 | Broadcasting on Incomplete Hypercubes · IEEE Trans. Computers 1993 |
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1991 | Comments on 'Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers' · IEEE Trans. Knowl. Data Eng. 1991 |
Methods — techniques the papers use, named apart from their topics
cost analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Broadcasting on Incomplete HypercubesabstractIncomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0> Jenn-Yang Tien, C. T. Howard Ho, Wei-Pang Yang |
IEEE Trans. Computers | 1 |
| 1991 | Hierarchical spanning trees and distributing on incomplete hypercubes
Jenn-Yang Tien, Wei-Pang Yang |
Parallel Comput. | 1 |
| 1991 | Comments on 'Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers'abstractThe cost distributions of both the parallel hybrid-hash join and the parallel join-index join algorithms proposed in the above-named work (ibid., vol.1, p.329-43, Sept. 1989) are presented in more detail. The result shows that almost the entire relation may need to be retrieved from disk, though the join selectivity is low. A table of semi-join selectives and cube sizes is given to show the condition that the join-index method performs better than the hybrid-hash method, i.e., the really low selectivity for the join-index method. An error in one of the cost formulas is corrected, and a more efficient method on the final join in the join-index method is proposed.> Jenn-Yang Tien, Wei-Pang Yang |
IEEE Trans. Knowl. Data Eng. | 1 |