Edward P. F. Chan

According to our database1, Edward P. F. Chan
  • authored at least 40 papers between 1979 and 2009.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2009
Shortest Path Tree Computation in Dynamic Graphs.
IEEE Trans. Computers, 2009

Efficient Evaluation of Static and Dynamic Optimal Route Queries.
Proceedings of the Advances in Spatial and Temporal Databases, 2009

2007
Optimization and evaluation of shortest path queries.
VLDB J., 2007

A fast unified optimal route query evaluation algorithm.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

2003
Buffer Queries.
IEEE Trans. Knowl. Data Eng., 2003

2002
On multi-scale display of geometric objects.
Data Knowl. Eng., 2002

2001
Evaluation of Buffer Queries in Spatial Databases.
Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001

Finding Shortest Paths in Large Network Systems.
Proceedings of the ACM-GIS 2001, 2001

2000
Containment and Optimization of Object-Preserving Conjunctive Queries.
SIAM J. Comput., 2000

Efficient Query Result Retrieval over the Web.
Proceedings of the Seventh International Conference on Parallel and Distributed Systems, 2000

1997
A General and Efficient Implementation of Geometric Operators and Predicates.
Proceedings of the Advances in Spatial Databases, 1997

1996
Querying and Visualization of Geometric Data.
Proceedings of the GIS '96, 1996

1995
Testing Containment of Object-Oriented Conjunctive Queries is Pi_2^p-hard.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries.
Theor. Comput. Sci., 1994

1993
A Possible World Semantics for Disjunctive Databases.
IEEE Trans. Knowl. Data Eng., 1993

1992
Connection-Trap-Free Database Schemes.
J. Comput. Syst. Sci., 1992

Containment and Minimization of Positive Conjunctive Queries in OODB's.
Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992

1991
Constant-Time-Maintainable BCNF Database Schemes.
ACM Trans. Database Syst., 1991

Independence-Reducible Database Schemes.
J. ACM, 1991

Independent Database Schemes under Functional and Inclusion Dependencies.
Acta Inf., 1991

1990
Efficient and Optimal Query Answering on Independent Schemes.
Theor. Comput. Sci., 1990

1989
Efficient Optimization of Simple Chase Join Expressions.
ACM Trans. Database Syst., 1989

A Design Theory for Solving the Anomalies Problem.
SIAM J. Comput., 1989

1988
On the Desirability of gamma-Acyclic BCNF Database Schemes.
Theor. Comput. Sci., 1988

Testing Unboundedness of Database Schemes and Functional Dependencies.
Inf. Process. Lett., 1988

On Generating Database Schemes Bounded or Constant-time-maintainable by Extensibility.
Acta Inf., 1988

A Characterization of Constant-time-mainteinability for BCNF Database Schemes.
Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

Independence-reducible Database Schemes.
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

1987
Independent and Separable Database Schemes.
SIAM J. Comput., 1987

Answering queries on embedded-complete database schemes.
J. ACM, 1987

On testing soundness of relational expressions.
Inf. Syst., 1987

Independent Database Schemes under Functional and Inclusion Dependencies.
Proceedings of the VLDB'87, 1987

On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986
On the Properties and Characterization of Connection-tap-free Schemes.
Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

On the Desirability of gamma-Acyclic BCNF Database Schemes.
Proceedings of the ICDT'86, 1986

Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Efficient Query Answering in the Representative Instance Approach.
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985

1984
Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions.
Proceedings of the SIGMOD'84, 1984

1983
Independent and Separable Database Schemes.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1979
A Graphical Database Design Aid using the Entity-Relationship Model.
Proceedings of the Entity-Relationship Approach to Systems Analysis and Design. Proc. 1st International Conference on the Entity-Relationship Approach, 1979


  Loading...