Yangjun Chen

Available identifiers

zbMath Open chen.yangjunMaRDI QIDQ306700

List of research outcomes

Publication	Date of Publication	Type
On the string matching with \(k\) mismatches	2018-04-16	Paper
An efficient method to evaluate intersections on big data sets	2016-09-01	Paper
On the cost of searching signature trees	2010-01-29	Paper
A new tree inclusion algorithm	2010-01-18	Paper
Signature files and signature trees.	2003-01-21	Paper
Arc consistency revisited	2002-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4535546	2002-06-16	Paper
On the graph traversal method for evaluating linear binary-chain programs	2001-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q4939253	2000-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q4251471	2000-01-25	Paper
OLDTNF-based evaluation method for handling recursive queries in deductive databases	1999-07-28	Paper
Graph traversal and top-down evaluation of logic queries	1998-08-20	Paper
Magic sets revisited	1998-02-16	Paper
Counting and topological order	1998-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q3125846	1997-11-18	Paper
On the bottom-up evaluation of recursive queries	1996-01-01	Paper

Research outcomes over time

This page was built for person: Yangjun Chen