Yangjun Chen

Yangjun Chen received the BS degree in information system engineering from the University of the National Defense Science and Technology, China, in 1982, and the Diploma and PhD degrees in computer science from the University of Kaiserslautern, Germany, in 1990 and 1995, respectively. From 1995 to 1997, he worked as a postdoctor at the Technical University of Chemnitz-Zwickau, Germany. After that, he worked as a senior engineer at the German National Information Research Center. Since July 2000, he is a professor at the University of Winnipeg, Canada. He has published more than 180 articles in these areas.

Publications

An Efficient and Effective Index Structure for Query Evaluation in Search Engines
An Efficient and Effective Index Structure for Query Evaluation in Search Engines
Yangjun Chen. © 2019. 14 pages.
In this chapter, the authors discuss an efficient and effective index mechanism for search engines to support both conjunctive and disjunctive queries. The main idea behind it is...
A Fast and Space-Economical Algorithm for the Tree Inclusion Problem
A Fast and Space-Economical Algorithm for the Tree Inclusion Problem
Yangjun Chen, Yibin Chen. © 2019. 16 pages.
The ordered tree inclusion is an interesting problem, by which the authors will check whether a pattern tree P can be included in a target tree T, where the order of siblings in...
A Fast and Space-Economical Algorithm for the Tree Inclusion Problem
A Fast and Space-Economical Algorithm for the Tree Inclusion Problem
Yangjun Chen, Yibin Chen. © 2018. 13 pages.
An Efficient and Effective Index Structure for Query Evaluation in Search Engines
An Efficient and Effective Index Structure for Query Evaluation in Search Engines
Yangjun Chen. © 2018. 11 pages.
In this chapter, we discuss an efficient and effective index mechanism for search engines to support both conjunctive and disjunctive queries. The main idea behind it is to...
Graph Encoding and Recursion Computation
Graph Encoding and Recursion Computation
Yangjun Chen. © 2005. 8 pages.
It is a general opinion that relational database systems are inadequate for manipulating composite objects that arise in novel applications such as Web and document databases...