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