The following pages link to Yangjun Chen (Q306700):
Displayed 17 items.
- (Q164163) (redirect page) (← links)
- An efficient method to evaluate intersections on big data sets (Q306702) (← links)
- A new tree inclusion algorithm (Q844212) (← links)
- On the cost of searching signature trees (Q845663) (← links)
- Graph traversal and top-down evaluation of logic queries (Q1130171) (← links)
- OLDTNF-based evaluation method for handling recursive queries in deductive databases (Q1286645) (← links)
- Magic sets revisited (Q1368187) (← links)
- Counting and topological order (Q1375328) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Signature files and signature trees. (Q1853015) (← links)
- (Q3125846) (← links)
- (Q4251471) (← links)
- On the bottom-up evaluation of recursive queries (Q4332202) (← links)
- (Q4535546) (← links)
- (Q4939253) (← links)
- Arc consistency revisited (Q5915513) (← links)
- On the graph traversal method for evaluating linear binary-chain programs (Q5926750) (← links)