| 2009 |
| 40 | Shortest Path Tree Computation in Dynamic Graphs. Edward P. F. Chan, Yaya Yang. IEEE Trans. Computers (58): 541-557 (2009). Web SearchBibTeXDownload |
| 39 | Efficient Evaluation of Static and Dynamic Optimal Route Queries. Edward P. F. Chan, Jie Zhang. SSTD 2009, 386-391. Web SearchBibTeXDownload |
| 2007 |
| 38 | A fast unified optimal route query evaluation algorithm. Edward P. F. Chan, Jie Zhang. CIKM 2007, 371-380. Web SearchBibTeXDownload |
| 37 | Optimization and evaluation of shortest path queries. Edward P. F. Chan, Heechul Lim. VLDB J. (16): 343-369 (2007). Web SearchBibTeXDownload |
| 2003 |
| 36 | Buffer Queries. Edward P. F. Chan. IEEE Trans. Knowl. Data Eng. (15): 895-910 (2003). Web SearchBibTeXDownload |
| 2002 |
| 35 | On multi-scale display of geometric objects. Edward P. F. Chan, Kevin K. W. Chow. Data Knowl. Eng. (40): 91-119 (2002). Web SearchBibTeXDownload |
| 2001 |
| 34 | Finding Shortest Paths in Large Network Systems. Edward P. F. Chan, Ning Zhang. ACM-GIS 2001, 160-166. Web SearchBibTeX |
| 33 | Evaluation of Buffer Queries in Spatial Databases. Edward P. F. Chan. SSTD 2001, 197-216. Web SearchBibTeXDownload |
| 2000 |
| 32 | Efficient Query Result Retrieval over the Web. Edward P. F. Chan, Koji Ueda. ICPADS 2000, 161-170. Web SearchBibTeXDownload |
| 31 | Containment and Optimization of Object-Preserving Conjunctive Queries. Edward P. F. Chan, Ron van der Meyden. SIAM J. Comput. (29): 1371-1400 (2000). Web SearchBibTeXDownload |
| 1997 |
| 30 | A General and Efficient Implementation of Geometric Operators and Predicates. Edward P. F. Chan, Jimmy N. H. Ng. SSD 1997, 69-93. Web SearchBibTeXDownload |
| 1996 |
| 29 | Querying and Visualization of Geometric Data. Edward P. F. Chan, Jonathan M. T. Wong. ACM-GIS 1996, 129-138. Web SearchBibTeXDownload |
| 1995 |
| 28 | Testing Containment of Object-Oriented Conjunctive Queries is Pi_2^p-hard. Edward P. F. Chan, Ron van der Meyden. COCOON 1995, 81-90. Web SearchBibTeXDownload |
| 1994 |
| 27 | Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries. Edward P. F. Chan. Theor. Comput. Sci. (134): 287-309 (1994). Web SearchBibTeXDownload |
| 1993 |
| 26 | A Possible World Semantics for Disjunctive Databases. Edward P. F. Chan. IEEE Trans. Knowl. Data Eng. (5): 282-292 (1993). Web SearchBibTeXDownload |
| 1992 |
| 25 | Connection-Trap-Free Database Schemes. Edward P. F. Chan, Paolo Atzeni. J. Comput. Syst. Sci. (44): 1-22 (1992). Cited by 3Web SearchBibTeXDownload |
| 24 | Containment and Minimization of Positive Conjunctive Queries in OODB's. Edward P. F. Chan. PODS 1992, 202-211. Web SearchBibTeXDownload |
| 1991 |
| 23 | Constant-Time-Maintainable BCNF Database Schemes. Héctor J. Hernández, Edward P. F. Chan. ACM Trans. Database Syst. (16): 571-599 (1991). Web SearchBibTeXDownload |
| 22 | Independent Database Schemes under Functional and Inclusion Dependencies. Paolo Atzeni, Edward P. F. Chan. Acta Inf. (28): 777-779 (1991). Cited by 15Web SearchBibTeXDownload |
| 21 | Independence-Reducible Database Schemes. Edward P. F. Chan, Héctor J. Hernández. J. ACM (38): 854-886 (1991). Web SearchBibTeXDownload |
| 1990 |
| 20 | Efficient and Optimal Query Answering on Independent Schemes. Paolo Atzeni, Edward P. F. Chan. Theor. Comput. Sci. (77): 291-308 (1990). Cited by 5Web SearchBibTeXDownload |
| 1989 |
| 19 | Efficient Optimization of Simple Chase Join Expressions. Paolo Atzeni, Edward P. F. Chan. ACM Trans. Database Syst. (14): 212-230 (1989). Cited by 11Web SearchBibTeXDownload |
| 18 | A Design Theory for Solving the Anomalies Problem. Edward P. F. Chan. SIAM J. Comput. (18): 429-448 (1989). Web SearchBibTeXDownload |
| 1988 |
| 17 | On Generating Database Schemes Bounded or Constant-time-maintainable by Extensibility. Edward P. F. Chan, Héctor J. Hernández. Acta Inf. (25): 475-496 (1988). Web SearchBibTeXDownload |
| 16 | Testing Unboundedness of Database Schemes and Functional Dependencies. Edward P. F. Chan, Héctor J. Hernández. Inf. Process. Lett. (28): 317-326 (1988). Web SearchBibTeXDownload |
| 15 | Independence-reducible Database Schemes. Edward P. F. Chan, Héctor J. Hernández. PODS 1988, 163-173. Web SearchBibTeX |
| 14 | A Characterization of Constant-time-mainteinability for BCNF Database Schemes. Héctor J. Hernández, Edward P. F. Chan. SIGMOD Conference 1988, 209-217. Web SearchBibTeX |
| 13 | On the Desirability of gamma-Acyclic BCNF Database Schemes. Edward P. F. Chan, Héctor J. Hernández. Theor. Comput. Sci. (62): 67-104 (1988). Web SearchBibTeXDownload |
| 1987 |
| 12 | On testing soundness of relational expressions. Edward P. F. Chan, Alberto O. Mendelzon. Inf. Syst. (12): 167-170 (1987). Web SearchBibTeXDownload |
| 11 | Answering queries on embedded-complete database schemes. Edward P. F. Chan, Alberto O. Mendelzon. J. ACM (34): 349-375 (1987). Cited by 17Web SearchBibTeXDownload |
| 10 | On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies. Edward P. F. Chan, Héctor J. Hernández. PODS 1987, 48-57. Web SearchBibTeX |
| 9 | Independent and Separable Database Schemes. Edward P. F. Chan, Alberto O. Mendelzon. SIAM J. Comput. (16): 841-851 (1987). Cited by 27Web SearchBibTeXDownload |
| 8 | Independent Database Schemes under Functional and Inclusion Dependencies. Paolo Atzeni, Edward P. F. Chan. VLDB 1987, 159-166. Cited by 15Web SearchBibTeX |
| 1986 |
| 7 | On the Desirability of gamma-Acyclic BCNF Database Schemes. Edward P. F. Chan, Héctor J. Hernández. ICDT 1986, 105-122. Web SearchBibTeXDownload |
| 6 | On the Properties and Characterization of Connection-tap-free Schemes. Edward P. F. Chan, Paolo Atzeni. PODS 1986, 140-147. Cited by 6Web SearchBibTeX |
| 5 | Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons. C. Wang, Edward P. F. Chan. Symposium on Computational Geometry 1986, 34-42. Web SearchBibTeXDownload |
| 1985 |
| 4 | Efficient Query Answering in the Representative Instance Approach. Paolo Atzeni, Edward P. F. Chan. PODS 1985, 181-188. Cited by 28Web SearchBibTeX |
| 1984 |
| 3 | Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions. Edward P. F. Chan. SIGMOD Conference 1984, 149-163. Web SearchBibTeX |
| 1983 |
| 2 | Independent and Separable Database Schemes. Edward P. F. Chan, Alberto O. Mendelzon. PODS 1983, 288-296. Cited by 27Web SearchBibTeX |
| 1979 |
| 1 | A Graphical Database Design Aid using the Entity-Relationship Model. Edward P. F. Chan, Frederick H. Lochovsky. ER 1979, 295-310. Web SearchBibTeX |