Improving Han and Lee's path consistency algorithm. - Yangjun Chen (ICTAI, 1991)

A Bottom-up Query Evaluation Method for Stratified Databases. - Yangjun Chen (ICDE, 1993)

An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs. - Yangjun Chen; Theo Härder (CIKM, 1994)

On the Optimal Top-down Evaluation of Recursive Queries. - Yangjun Chen; Theo Härder (DEXA, 1994)

Processing of recursive rules in knowledge-based systems - algorithms for handling recursive rules and negative information and performance measurements. - Yangjun Chen (1995)

A Rule-based Strategy for Transforming Relational Schemas into OO Schemas. - Yangjun Chen; Wolfgang Benn (CODAS, 1996)

On the Query Optimization in Multidatabases. - Yangjun Chen; Wolfgang Benn (CODAS, 1996)

On the Query Translation in Federative Relational Databases. - Yangjun Chen; Wolfgang Benn (DEXA Workshop, 1996)

On the bottom - up evaluation of recursive queries. - Yangjun Chen (Int. J. Intell. Syst., 1996)

Speeding up the Counting Method by Computing Heritage Functions in Topological Order. - Yangjun Chen (ADBIS, 1997)

Poster on Rule-based Technology for Schema Transformation. - Yangjun Chen; Wolfgang Benn (CoopIS, 1997)

On the Query Treatment in Federated Systems. - Yangjun Chen; Wolfgang Benn (DEXA, 1997)

Multidatabase Query Optimization: Tree Balance and Node Allocation. - Yangjun Chen; Wolfgang Benn (IDEAS, 1997)

Building DD to Support Query Processing in Federated Systems. - Yangjun Chen; Wolfgang Benn (KRDB, 1997)

Magic sets and stratified databases. - Yangjun Chen (Int. J. Intell. Syst., 1997)

Magic sets revisited. - Yangjun Chen (J. Comput. Sci. Technol., 1997)

Counting and topological order. - Yangjun Chen (J. Comput. Sci. Technol., 1997)

Layered Index Structures in Document Database Systems. - Yangjun Chen; Karl Aberer (CIKM, 1998)

Query Evaluation for Distributed Heterogeneous Relational Databases. - Yangjun Chen; Wolfgang Benn (CoopIS, 1998)

Evaluating Linear Binary Programs by Traversing Automaton Hierarchy. - Yangjun Chen (DDLP, 1998)

Graph traversal and top-down evaluation of logic queries. - Yangjun Chen (J. Comput. Sci. Technol., 1998)

Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases. - Yangjun Chen; Karl Aberer (DEXA, 1999)

Integrating Heterogeneous OO Schemas. - Yangjun Chen; Wolfgang Benn (ICDE, 1999)

A Query System in a Biological Database. - Dunren Che; Yangjun Chen; Karl Aberer (SSDBM, 1999)

The Advanced Web Query System of GPCRDB. - Dunren Che; Yangjun Chen; Karl Aberer; Hannelore Eisner (SSDBM, 1999)

The Design of Query Interfaces to the GPCRDB Biological Database. - Dunren Che; Karl Aberer; Yangjun Chen (UIDIS, 1999)

Arc Consistency Revisited. - Yangjun Chen (Inf. Process. Lett., 1999)

On the arc consistency problem. - Yangjun Chen (J. Comput. Sci. Technol., 1999)

A Systematic Method for Query Evaluation in Distributed Heterogeneous Databases. - Yangjun Chen (J. Inf. Sci. Eng., 2000)

Integrating Heterogeneous OO Schemas. - Yangjun Chen (J. Inf. Sci. Eng., 2000)

On the Evaluation of Path-Oriented Queries in Document Databases. - Yangjun Chen; Gerald Huck (DEXA, 2001)

Mapping DTDs to Object-Oriented Schemas. - Yangjun Chen; Ron McFadyen; Fung-Yee Chan (WISE (1), 2001)

On the efficient evaluation of relaxed queries in biological databases. - Yangjun Chen; Dunren Che; Karl Aberer (CIKM, 2002)

Personal Web Space. - Yangjun Chen; Tony Liu 002; Paul G. Sorenson (ICDCS Workshops, 2002)

Signature files and signature trees. - Yangjun Chen (Inf. Process. Lett., 2002)

On the Computation of Recursion in Relational Databases. - Yangjun Chen (Effective Databases for Text & Document Management, 2003)

Building Signature-Trees on Path Signatures in Document Databases. - Yangjun Chen; Gerald Huck (Effective Databases for Text & Document Management, 2003)

A DTD Complexity Metric. - Ron McFadyen; Yangjun Chen (Applied Informatics, 2003)

Graph Decomposition and Recursive Closures. - Yangjun Chen (CAiSE Short Paper Proceedings, 2003)

A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases. - Yangjun Chen (IV, 2003)

On the Graph Traversal and Linear Binary-Chain Programs. - Yangjun Chen (IEEE Trans. Knowl. Data Eng., 2003)

Privilege algebra for access control in digital libraries. - Ron McFadyen; Yangjun Chen; Fung-Yee Chan (Communications, Internet, and Information Technology, 2004)

Efficient Top-down Algorithms for Tree Inclusion. - Yangjun Chen; Yibin Chen (HPCS, 2004)

A new algorithm for computing transitive closures. - Yangjun Chen (SAC, 2004)

Signature file hierarchies and signature graphs: a new index method for object-oriented databases. - Yangjun Chen; Yibin Chen (SAC, 2004)

Building Signature Trees into OODBs. - Yangjun Chen (J. Inf. Sci. Eng., 2004)

Graph Encoding and Recursion Computation. - Yangjun Chen (Encyclopedia of Information Science and Technology (II), 2005)

Path-Oriented Queries and Tree Inclusion Problems. - Yangjun Chen (Encyclopedia of Database Technologies and Applications, 2005)

Signature Files and Signature File Construction. - Yangjun Chen; Yong Shi (Encyclopedia of Database Technologies and Applications, 2005)

On the General Signature Trees. - Yangjun Chen (DEXA, 2005)

On the Signature Trees and Balanced Signature Trees. - Yangjun Chen (ICDE, 2005)

On the Tree Inclusion and Query Evaluation in Document Databases. - Yangjun Chen; Yibin Chen (ICEIS (1), 2005)

XML-Based Evaluation of Synthesized Queries. - Ron McFadyen; Yangjun Chen; Fung-Yee Chan (WEBIST, 2005)

On the top-down tree inclusion. - Yangjun Chen; Yibin Chen (ACST, 2006)

On the Query Evaluation in Document DBs. - Yangjun Chen (DEXA, 2006)

On the evaluation of tree pattern queries. - Yangjun Chen (ICSOFT (2), 2006)

On the transitive closure representation and adjustable compression. - Yangjun Chen; Donovan Cooke (SAC, 2006)

Tree inclusion algorithm, signatures and evaluation of path-oriented queries. - Yangjun Chen; Yong Shi; Yibin Chen (SAC, 2006)

Rule-Based Query Tree Evaluation over Fragmented XML Documents. - Ron McFadyen; Yangjun Chen (WEBIST (1), 2006)

On the cost of searching signature trees. - Yangjun Chen (Inf. Process. Lett., 2006)

A new tree inclusion algorithm. - Yangjun Chen; Yibin Chen (Inf. Process. Lett., 2006)

Efficient Processing of XML Tree Pattern Queries. - Yangjun Chen; Dunren Che (J. Adv. Comput. Intell. Intell. Informatics, 2006)

Minimization of XML Tree Pattern Queries in the Presence of Integrity Constraints. - Yangjun Chen; Dunren Che (J. Adv. Comput. Intell. Intell. Informatics, 2006)

On the Signature Tree Construction and Analysis. - Yangjun Chen; Yibin Chen (IEEE Trans. Knowl. Data Eng., 2006)

Decomposing DAGs into Disjoint Chains. - Yangjun Chen (DEXA, 2007)

A new algorithm for twig pattern matching. - Yangjun Chen (ICEIS (1), 2007)

Tree Encoding and Transitive Closure Compression. - Yangjun Chen (IV, 2007)

Stack Encoding Revisited. - Yangjun Chen (WEBIST (1), 2007)

A new method for generating compressed representation of transitive closure. - Yangjun Chen (C3S2E, 2008)

On the Evaluation of Large and Sparse Graph Reachability Queries. - Yangjun Chen (DEXA, 2008)

An Efficient Algorithm for Answering Graph Reachability Queries. - Yangjun Chen; Yibin Chen (ICDE, 2008)

Tree Embedding and XML Query Evaluation. - Yangjun Chen (ICEIS (1), 2008)

Core Labeling: A New Way to Compress Transitive Closure. - Yangjun Chen; Yibin Chen (SITIS, 2008)

Evaluation of Twig Pattern Queries Based on Ordered Tree Matching. - Yangjun Chen; Donovan Cooke (SITIS, 2008)

An Efficient Streaming Algorithm for Evaluating XPath Queries. - Yangjun Chen (WEBIST (1), 2008)

General spanning trees and reachability query evaluation. - Yangjun Chen (C3S2E, 2009)

XPath query evaluation based on the stack encoding. - Yangjun Chen; Donovan Cooke (C3S2E, 2009)

Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases. - Yangjun Chen (DEXA, 2009)

Decomposing a Partially Ordered Set into Chains. - Yangjun Chen (FCS, 2009)

Directed Acyclic Graphs and Disjoint Chains. - Yangjun Chen (ICEIS (1), 2009)

General Spanning Trees and Core Labeling. - Yangjun Chen (ICSOFT (1), 2009)

Unordered Tree Matching and Tree Pattern Queries in XML Databases. - Yangjun Chen (ICSOFT (2), 2009)

Document Tree Reconstruction and Fast Twig Pattern Matching. - Yangjun Chen (IKE, 2009)

Recursive Graph Deduction and Reachability Queries. - Yangjun Chen (FCS, 2010)

Data Stream Transformation and Query Node Arrays: A New Way to Evaluate Tree Pattern Queries. - Yangjun Chen (IKE, 2010)

A time optimal algorithm for evaluating tree pattern queries. - Yangjun Chen (SAC, 2010)

Decomposing DAGs into spanning trees: A new way to compress transitive closures. - Yangjun Chen; Yibin Chen (ICDE, 2011)

On the top-down evaluation of tree inclusion problem. - Yangjun Chen; Yibin Chen (Int. J. Inf. Technol. Commun. Convergence, 2011)

Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries. - Yangjun Chen; Leping Zou (Int. J. Inf. Technol. Commun. Convergence, 2011)

Subtree Reconstruction, Query Node Intervals and Tree Pattern Query Evaluation. - Yangjun Chen; Yibin Chen (J. Inf. Sci. Eng., 2012)

On the Graph Decomposition. - Yangjun Chen; Yibin Chen (BDCloud, 2014)

Tree Inclusion Checking Revisited. - Yangjun Chen; Yibin Chen (DATA, 2015)

On the massive string matching problem. - Yangjun Chen; Yujia Wu (ICNC-FSKD, 2016)

An efficient method to evaluate intersections on big data sets. - Yangjun Chen; Weixin Shen (Theor. Comput. Sci., 2016)

Searching BWT against Pattern Matching Machine to Find Multiple String Matches. - Yangjun Chen; Yujia Wu (CyberC, 2017)

BWT Arrays and Mismatching Trees: A New Way for String Matching with k Mismatches. - Yangjun Chen; Yujia Wu (ICDE, 2017)

Evaluating Children's Composition Based on Chinese Linguistic Features with Machine Learning. - Yangjun Chen; Calvin C. Y. Liao; Sannyuya Liu; Hercy N. H. Cheng; Liansheng Jia; Jianwen Sun (IIAI-AAI, 2017)

Integrating Clustering and Sequential Analysis to Explore Students' Behaviors in an Online Chinese Reading Assessment System. - Liansheng Jia; Hercy N. H. Cheng; Sannyuya Liu; Wang-Chen Chang; Yangjun Chen; Jianwen Sun (IIAI-AAI, 2017)

On the Designing of Popular Packages. - Yangjun Chen; Wei Shi (iThings/GreenCom/CPSCom/SmartData, 2018)

On the string matching with k mismatches. - Yangjun Chen; Yujia Wu (Theor. Comput. Sci., 2018)

Introducing Cuts Into a Top-Down Process for Checking Tree Inclusion. - Yangjun Chen; Yibin Chen (IEEE Trans. Knowl. Data Eng., 2019)

δ-Transitive closures and triangle consistency checking: a new way to evaluate graph pattern queries in large graph databases. - Yangjun Chen; Bin Guo; Xingyue Huang (J. Supercomput., 2020)

On the String Matching with k Differences in DNA Databases. - Yangjun Chen; Hoang Hai Nguyen (Proc. VLDB Endow., 2021)

Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries. - Yangjun Chen; Gagandeep Singh (ACM Trans. Database Syst., 2021)

The 2-MAXSAT Problem Can Be Solved in Polynomial Time. - Yangjun Chen (CSCI, 2022)

Priority-First Search and Mining Popular Packages. - Yangjun Chen; Bobin Chen (ISCMI, 2022)

On the Multiple Pattern String Matching in DNA Databases. - Yangjun Chen; Bobin Chen; Yujia Wu (SN Comput. Sci., 2023)

Evaluation of Reachability Queries Based on Recursive DAG Decomposition. - Yangjun Chen; Yibin Chen; Yifeng Zhang (IEEE Trans. Knowl. Data Eng., 2023)