Chien-Tse Fang

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:25/2697 · DBLP profile ↗

← Back

2ranked-venue papers

0as first author

0since 2021 · last 2007

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Computer networks · 1

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 1 paper		Distributed systems · 92% Parallel and multicore computing · 8%
Databases, data mining, and information retrieval 1 paper		Information retrieval · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Information retrieval › indexing › text indexing keyword indexing	0.1	1	2007	Keyword search in DHT-based peer-to-peer networks · IEEE J. Sel. Areas Commun. 2007
Distributed systems › peer-to-peer systems distributed hash table	0.1	1	2007	Keyword search in DHT-based peer-to-peer networks · IEEE J. Sel. Areas Commun. 2007
Distributed systems › peer-to-peer systems keyword search	0.1	1	2007	Keyword search in DHT-based peer-to-peer networks · IEEE J. Sel. Areas Commun. 2007
Distributed systems peer-to-peer systems	0.1	1	2007	Keyword search in DHT-based peer-to-peer networks · IEEE J. Sel. Areas Commun. 2007
Distributed systems fault tolerance	0.0	1	2007	Keyword search in DHT-based peer-to-peer networks · IEEE J. Sel. Areas Commun. 2007
Parallel and multicore computing load balancing	0.0	1	2007	Keyword search in DHT-based peer-to-peer networks · IEEE J. Sel. Areas Commun. 2007

Methods — techniques the papers use, named apart from their topics

keyword index · 0.1distributed hash table · 0.1

Year	Publication	Venue	Position
2007	Keyword search in DHT-based peer-to-peer networks abstract Although search by keywords is particularly important for resource and service discovery in P2P networks, existing techniques for keyword search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking and keyword expansion. In this paper, we present a general keyword index and search scheme for structured P2P networks that avoids these problems, and in which object insert, delete, and search can be efficiently performed. Some experimental results are also presented to support our claim. Yuh-Jzer Joung, Li-Wei Yang, Chien-Tse Fang	IEEE J. Sel. Areas Commun.	3
2005	Keyword Search in DHT-Based Peer-to-Peer Networks abstract Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking. In this paper, we present a general keyword index and search scheme for structured P2P networks that avoids these problems, and in which object insert, delete, and search can be efficiently performed. Some experimental results are also presented to support our claim. Yuh-Jzer Joung, Chien-Tse Fang, Li-Wei Yang	ICDCS	2