default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYangjun Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Yangjun Chen
, Bobin Chen, Yujia Wu:
On the Multiple Pattern String Matching in DNA Databases. SN Comput. Sci. 4(3): 260 (2023)- [j27]Yangjun Chen, Yibin Chen, Yifeng Zhang:
Evaluation of Reachability Queries Based on Recursive DAG Decomposition. IEEE Trans. Knowl. Data Eng. 35(8): 7935-7952 (2023) - [i1]Yangjun Chen:
The 2-MAXSAT Problem Can Be Solved in Polynomial Time. CoRR abs/2304.12517 (2023) - 2022
- [c73]Yangjun Chen:
The 2-MAXSAT Problem Can Be Solved in Polynomial Time. CSCI 2022: 472-479 - 2021
- [j26]Yangjun Chen, Hoang Hai Nguyen:
On the String Matching with k Differences in DNA Databases. Proc. VLDB Endow. 14(6): 903-915 (2021) - [j25]Yangjun Chen, Gagandeep Singh:
Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries. ACM Trans. Database Syst. 46(2): 8:1-8:50 (2021) - 2020
- [j24]Yangjun Chen, Bin Guo, Xingyue Huang:
δ-Transitive closures and triangle consistency checking: a new way to evaluate graph pattern queries in large graph databases. J. Supercomput. 76(10): 8140-8174 (2020)
2010 – 2019
- 2019
- [j23]Yangjun Chen, Yibin Chen:
Introducing Cuts Into a Top-Down Process for Checking Tree Inclusion. IEEE Trans. Knowl. Data Eng. 31(6): 1136-1149 (2019) - 2018
- [j22]Yangjun Chen, Yujia Wu:
On the string matching with k mismatches. Theor. Comput. Sci. 726: 5-29 (2018) - [c72]Yangjun Chen, Wei Shi:
On the Designing of Popular Packages. iThings/GreenCom/CPSCom/SmartData 2018: 937-944 - 2017
- [c71]Yangjun Chen, Yujia Wu:
Searching BWT against Pattern Matching Machine to Find Multiple String Matches. CyberC 2017: 167-176 - [c70]Yangjun Chen, Yujia Wu:
BWT Arrays and Mismatching Trees: A New Way for String Matching with k Mismatches. ICDE 2017: 399-410 - [c69]Liansheng Jia, Hercy N. H. Cheng, Sannyuya Liu, Wang-Chen Chang, Yangjun Chen, Jianwen Sun:
Integrating Clustering and Sequential Analysis to Explore Students' Behaviors in an Online Chinese Reading Assessment System. IIAI-AAI 2017: 719-724 - [c68]Yangjun Chen, Calvin C. Y. Liao, Sannyuya Liu, Hercy N. H. Cheng, Liansheng Jia, Jianwen Sun:
Evaluating Children's Composition Based on Chinese Linguistic Features with Machine Learning. IIAI-AAI 2017: 729-734 - 2016
- [j21]Yangjun Chen, Weixin Shen:
An efficient method to evaluate intersections on big data sets. Theor. Comput. Sci. 647: 1-21 (2016) - [c67]Yangjun Chen, Yujia Wu:
On the massive string matching problem. ICNC-FSKD 2016: 350-355 - 2015
- [c66]Yangjun Chen, Yibin Chen:
Tree Inclusion Checking Revisited. DATA 2015: 301-308 - 2014
- [c65]Yangjun Chen, Yibin Chen:
On the Graph Decomposition. BDCloud 2014: 777-784 - 2012
- [j20]Yangjun Chen, Yibin Chen:
Subtree Reconstruction, Query Node Intervals and Tree Pattern Query Evaluation. J. Inf. Sci. Eng. 28(2): 263-293 (2012) - 2011
- [j19]Yangjun Chen, Yibin Chen:
On the top-down evaluation of tree inclusion problem. Int. J. Inf. Technol. Commun. Convergence 1(3): 238-253 (2011) - [j18]Yangjun Chen, Leping Zou:
Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries. Int. J. Inf. Technol. Commun. Convergence 1(3): 254-279 (2011) - [c64]Yangjun Chen, Yibin Chen:
Decomposing DAGs into spanning trees: A new way to compress transitive closures. ICDE 2011: 1007-1018 - 2010
- [c63]Yangjun Chen:
Recursive Graph Deduction and Reachability Queries. FCS 2010: 125-131 - [c62]Yangjun Chen:
Data Stream Transformation and Query Node Arrays: A New Way to Evaluate Tree Pattern Queries. IKE 2010: 72-78 - [c61]Yangjun Chen:
A time optimal algorithm for evaluating tree pattern queries. SAC 2010: 1638-1642
2000 – 2009
- 2009
- [c60]Yangjun Chen, Donovan Cooke:
XPath query evaluation based on the stack encoding. C3S2E 2009: 43-57 - [c59]Yangjun Chen:
General spanning trees and reachability query evaluation. C3S2E 2009: 243-252 - [c58]Yangjun Chen:
Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases. DEXA 2009: 356-363 - [c57]Yangjun Chen:
Decomposing a Partially Ordered Set into Chains. FCS 2009: 126-132 - [c56]Yangjun Chen:
Directed Acyclic Graphs and Disjoint Chains. ICEIS (1) 2009: 17-24 - [c55]Yangjun Chen:
General Spanning Trees and Core Labeling. ICSOFT (1) 2009: 93-98 - [c54]Yangjun Chen:
Unordered Tree Matching and Tree Pattern Queries in XML Databases. ICSOFT (2) 2009: 191-198 - [c53]Yangjun Chen:
Document Tree Reconstruction and Fast Twig Pattern Matching. IKE 2009: 393-399 - 2008
- [c52]Yangjun Chen:
A new method for generating compressed representation of transitive closure. C3S2E 2008: 229-238 - [c51]Yangjun Chen:
On the Evaluation of Large and Sparse Graph Reachability Queries. DEXA 2008: 97-105 - [c50]Yangjun Chen, Yibin Chen:
An Efficient Algorithm for Answering Graph Reachability Queries. ICDE 2008: 893-902 - [c49]Yangjun Chen:
Tree Embedding and XML Query Evaluation. ICEIS (1) 2008: 173-178 - [c48]Yangjun Chen, Yibin Chen:
Core Labeling: A New Way to Compress Transitive Closure. SITIS 2008: 3-10 - [c47]Yangjun Chen, Donovan Cooke:
Evaluation of Twig Pattern Queries Based on Ordered Tree Matching. SITIS 2008: 24-31 - [c46]Yangjun Chen:
An Efficient Streaming Algorithm for Evaluating XPath Queries. WEBIST (1) 2008: 190-196 - 2007
- [c45]Yangjun Chen:
Decomposing DAGs into Disjoint Chains. DEXA 2007: 243-253 - [c44]Yangjun Chen:
A new algorithm for twig pattern matching. ICEIS (1) 2007: 44-51 - [c43]Yangjun Chen:
Tree Encoding and Transitive Closure Compression. IV 2007: 765-770 - [c42]Yangjun Chen:
Stack Encoding Revisited. WEBIST (1) 2007: 5-14 - 2006
- [j17]Yangjun Chen, Yibin Chen:
A new tree inclusion algorithm. Inf. Process. Lett. 98(6): 253-262 (2006) - [j16]Yangjun Chen:
On the cost of searching signature trees. Inf. Process. Lett. 99(1): 19-26 (2006) - [j15]Yangjun Chen, Dunren Che:
Efficient Processing of XML Tree Pattern Queries. J. Adv. Comput. Intell. Intell. Informatics 10(5): 738-743 (2006) - [j14]Yangjun Chen, Dunren Che:
Minimization of XML Tree Pattern Queries in the Presence of Integrity Constraints. J. Adv. Comput. Intell. Intell. Informatics 10(5): 744-751 (2006) - [j13]Yangjun Chen, Yibin Chen:
On the Signature Tree Construction and Analysis. IEEE Trans. Knowl. Data Eng. 18(9): 1207-1224 (2006) - [c41]Yangjun Chen, Yibin Chen:
On the top-down tree inclusion. ACST 2006: 61-66 - [c40]Yangjun Chen:
On the Query Evaluation in Document DBs. DEXA 2006: 771-780 - [c39]Yangjun Chen:
On the evaluation of tree pattern queries. ICSOFT (2) 2006: 79-85 - [c38]Yangjun Chen, Donovan Cooke:
On the transitive closure representation and adjustable compression. SAC 2006: 450-455 - [c37]Yangjun Chen, Yong Shi, Yibin Chen:
Tree inclusion algorithm, signatures and evaluation of path-oriented queries. SAC 2006: 1020-1025 - [c36]Ron McFadyen, Yangjun Chen:
Rule-Based Query Tree Evaluation over Fragmented XML Documents. WEBIST (1) 2006: 199-205 - 2005
- [c35]Yangjun Chen:
On the General Signature Trees. DEXA 2005: 207-219 - [c34]Yangjun Chen:
On the Signature Trees and Balanced Signature Trees. ICDE 2005: 742-753 - [c33]Yangjun Chen, Yibin Chen:
On the Tree Inclusion and Query Evaluation in Document Databases. ICEIS (1) 2005: 182-190 - [c32]Ron McFadyen, Yangjun Chen, Fung-Yee Chan:
XML-Based Evaluation of Synthesized Queries. WEBIST 2005: 24-31 - [r3]Yangjun Chen:
Graph Encoding and Recursion Computation. Encyclopedia of Information Science and Technology (II) 2005: 1309-1316 - [r2]Yangjun Chen:
Path-Oriented Queries and Tree Inclusion Problems. Encyclopedia of Database Technologies and Applications 2005: 472-479 - [r1]Yangjun Chen, Yong Shi:
Signature Files and Signature File Construction. Encyclopedia of Database Technologies and Applications 2005: 638-645 - 2004
- [j12]Yangjun Chen:
Building Signature Trees into OODBs. J. Inf. Sci. Eng. 20(2): 275-304 (2004) - [c31]Ron McFadyen, Yangjun Chen, Fung-Yee Chan:
Privilege algebra for access control in digital libraries. Communications, Internet, and Information Technology 2004: 147-154 - [c30]Yangjun Chen, Yibin Chen:
Efficient Top-down Algorithms for Tree Inclusion. HPCS 2004: 183-187 - [c29]Yangjun Chen, Yibin Chen:
Signature file hierarchies and signature graphs: a new index method for object-oriented databases. SAC 2004: 724-728 - [c28]Yangjun Chen:
A new algorithm for computing transitive closures. SAC 2004: 1091-1092 - 2003
- [j11]Yangjun Chen:
On the Graph Traversal and Linear Binary-Chain Programs. IEEE Trans. Knowl. Data Eng. 15(3): 573-596 (2003) - [c27]Ron McFadyen, Yangjun Chen:
A DTD Complexity Metric. Applied Informatics 2003: 1045-1052 - [c26]Yangjun Chen:
Graph Decomposition and Recursive Closures. CAiSE Short Paper Proceedings 2003 - [c25]Yangjun Chen:
A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases. IV 2003: 206-215 - [p2]Yangjun Chen, Gerald Huck:
Building Signature-Trees on Path Signatures in Document Databases. Effective Databases for Text & Document Management 2003: 53-73 - [p1]Yangjun Chen:
On the Computation of Recursion in Relational Databases. Effective Databases for Text & Document Management 2003: 263-277 - 2002
- [j10]Yangjun Chen:
Signature files and signature trees. Inf. Process. Lett. 82(4): 213-221 (2002) - [c24]Yangjun Chen, Dunren Che, Karl Aberer:
On the efficient evaluation of relaxed queries in biological databases. CIKM 2002: 227-236 - [c23]Yangjun Chen, Tony Liu, Paul G. Sorenson:
Personal Web Space. ICDCS Workshops 2002: 169-175 - 2001
- [c22]Yangjun Chen, Gerald Huck:
On the Evaluation of Path-Oriented Queries in Document Databases. DEXA 2001: 953-962 - [c21]Yangjun Chen, Ron McFadyen, Fung-Yee Chan:
Mapping DTDs to Object-Oriented Schemas. WISE (1) 2001: 161-170 - 2000
- [j9]Yangjun Chen:
A Systematic Method for Query Evaluation in Distributed Heterogeneous Databases. J. Inf. Sci. Eng. 16(4): 463-497 (2000) - [j8]Yangjun Chen:
Integrating Heterogeneous OO Schemas. J. Inf. Sci. Eng. 16(4): 555-591 (2000)
1990 – 1999
- 1999
- [j7]Yangjun Chen:
Arc Consistency Revisited. Inf. Process. Lett. 70(4): 175-184 (1999) - [j6]Yangjun Chen:
On the arc consistency problem. J. Comput. Sci. Technol. 14(4): 298-308 (1999) - [c20]Yangjun Chen, Karl Aberer:
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases. DEXA 1999: 473-484 - [c19]Yangjun Chen, Wolfgang Benn:
Integrating Heterogeneous OO Schemas. ICDE 1999: 101 - [c18]Dunren Che, Yangjun Chen, Karl Aberer:
A Query System in a Biological Database. SSDBM 1999: 158-167 - [c17]Dunren Che, Yangjun Chen, Karl Aberer, Hannelore Eisner:
The Advanced Web Query System of GPCRDB. SSDBM 1999: 281 - [c16]Dunren Che, Karl Aberer, Yangjun Chen:
The Design of Query Interfaces to the GPCRDB Biological Database. UIDIS 1999: 22-31 - 1998
- [j5]Yangjun Chen:
Graph traversal and top-down evaluation of logic queries. J. Comput. Sci. Technol. 13(4): 300-316 (1998) - [c15]Yangjun Chen, Karl Aberer:
Layered Index Structures in Document Database Systems. CIKM 1998: 406-413 - [c14]Yangjun Chen, Wolfgang Benn:
Query Evaluation for Distributed Heterogeneous Relational Databases. CoopIS 1998: 44-53 - [c13]Yangjun Chen:
Evaluating Linear Binary Programs by Traversing Automaton Hierarchy. DDLP 1998: 37-46 - 1997
- [j4]Yangjun Chen:
Magic sets and stratified databases. Int. J. Intell. Syst. 12(3): 203-231 (1997) - [j3]Yangjun Chen:
Magic sets revisited. J. Comput. Sci. Technol. 12(4): 346-365 (1997) - [j2]Yangjun Chen:
Counting and topological order. J. Comput. Sci. Technol. 12(6): 497-509 (1997) - [c12]Yangjun Chen:
Speeding up the Counting Method by Computing Heritage Functions in Topological Order. ADBIS 1997: 108-116 - [c11]Yangjun Chen, Wolfgang Benn:
Poster on Rule-based Technology for Schema Transformation. CoopIS 1997: 232 - [c10]Yangjun Chen, Wolfgang Benn:
On the Query Treatment in Federated Systems. DEXA 1997: 583-592 - [c9]Yangjun Chen, Wolfgang Benn:
Multidatabase Query Optimization: Tree Balance and Node Allocation. IDEAS 1997: 63-72 - [c8]Yangjun Chen, Wolfgang Benn:
Building DD to Support Query Processing in Federated Systems. KRDB 1997: 5.1-5.10 - 1996
- [j1]Yangjun Chen:
On the bottom - up evaluation of recursive queries. Int. J. Intell. Syst. 11(10): 807-832 (1996) - [c7]Yangjun Chen, Wolfgang Benn:
A Rule-based Strategy for Transforming Relational Schemas into OO Schemas. CODAS 1996: 56-59 - [c6]Yangjun Chen, Wolfgang Benn:
On the Query Optimization in Multidatabases. CODAS 1996: 84-91 - [c5]Yangjun Chen, Wolfgang Benn:
On the Query Translation in Federative Relational Databases. DEXA Workshop 1996: 491-498 - 1995
- [b1]Yangjun Chen:
Processing of recursive rules in knowledge-based systems - algorithms for handling recursive rules and negative information and performance measurements. Kaiserslautern University of Technology, Germany, 1995, pp. 1-221 - 1994
- [c4]Yangjun Chen, Theo Härder:
An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs. CIKM 1994: 34-41 - [c3]Yangjun Chen, Theo Härder:
On the Optimal Top-down Evaluation of Recursive Queries. DEXA 1994: 47-56 - 1993
- [c2]Yangjun Chen:
A Bottom-up Query Evaluation Method for Stratified Databases. ICDE 1993: 568-575 - 1991
- [c1]Yangjun Chen:
Improving Han and Lee's path consistency algorithm. ICTAI 1991: 346-350
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
