Edward P. F. Chan

According to our database, Edward P. F. Chan authored at least 37 papers between 1979 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

Shortest Path Tree Computation in Dynamic Graphs.

Edward P. F. Chan, Yaya Yang

IEEE Trans. Computers, 2009

Efficient Evaluation of Static and Dynamic Optimal Route Queries.

Edward P. F. Chan, Jie Zhang

Proceedings of the Advances in Spatial and Temporal Databases, 2009

2007

Optimization and evaluation of shortest path queries.

Edward P. F. Chan, Heechul Lim

VLDB J., 2007

A fast unified optimal route query evaluation algorithm.

Edward P. F. Chan, Jie Zhang

Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

2003

Buffer Queries.

Edward P. F. Chan

IEEE Trans. Knowl. Data Eng., 2003

2002

On multi-scale display of geometric objects.

Edward P. F. Chan, Kevin K. W. Chow

Data Knowl. Eng., 2002

2001

Evaluation of Buffer Queries in Spatial Databases.

Edward P. F. Chan

Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001

Finding Shortest Paths in Large Network Systems.

Edward P. F. Chan, Ning Zhang

Proceedings of the ACM-GIS 2001, 2001

2000

Containment and Optimization of Object-Preserving Conjunctive Queries.

Edward P. F. Chan, Ron van der Meyden

SIAM J. Comput., 2000

Efficient Query Result Retrieval over the Web.

Edward P. F. Chan, Koji Ueda

Proceedings of the Seventh International Conference on Parallel and Distributed Systems, 2000

1997

A General and Efficient Implementation of Geometric Operators and Predicates.

Edward P. F. Chan, Jimmy N. H. Ng

Proceedings of the Advances in Spatial Databases, 1997

1996

Querying and Visualization of Geometric Data.

Edward P. F. Chan, Jonathan M. T. Wong

Proceedings of the GIS '96, 1996

1995

Testing Containment of Object-Oriented Conjunctive Queries is Pi_2^p-hard.

Edward P. F. Chan, Ron van der Meyden

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries.

Edward P. F. Chan

Theor. Comput. Sci., 1994

1993

A Possible World Semantics for Disjunctive Databases.

Edward P. F. Chan

IEEE Trans. Knowl. Data Eng., 1993

1992

Connection-Trap-Free Database Schemes.

Edward P. F. Chan, Paolo Atzeni

J. Comput. Syst. Sci., 1992

Containment and Minimization of Positive Conjunctive Queries in OODB's.

Edward P. F. Chan

Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992

1991

Constant-Time-Maintainable BCNF Database Schemes.

Héctor J. Hernández, Edward P. F. Chan

ACM Trans. Database Syst., 1991

Independence-Reducible Database Schemes.

Edward P. F. Chan, Héctor J. Hernández

J. ACM, 1991

Independent Database Schemes under Functional and Inclusion Dependencies.

Paolo Atzeni, Edward P. F. Chan

Acta Informatica, 1991

1990

Efficient and Optimal Query Answering on Independent Schemes.

Paolo Atzeni, Edward P. F. Chan

Theor. Comput. Sci., 1990

1989

Efficient Optimization of Simple Chase Join Expressions.

Paolo Atzeni, Edward P. F. Chan

ACM Trans. Database Syst., 1989

A Design Theory for Solving the Anomalies Problem.

Edward P. F. Chan

SIAM J. Comput., 1989

1988

On the Desirability of gamma-Acyclic BCNF Database Schemes.

Edward P. F. Chan, Héctor J. Hernández

Theor. Comput. Sci., 1988

Testing Unboundedness of Database Schemes and Functional Dependencies.

Edward P. F. Chan, Héctor J. Hernández

Inf. Process. Lett., 1988

On Generating Database Schemes Bounded or Constant-time-maintainable by Extensibility.

Edward P. F. Chan, Héctor J. Hernández

Acta Informatica, 1988

A Characterization of Constant-time-mainteinability for BCNF Database Schemes.

Héctor J. Hernández, Edward P. F. Chan

Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

1987

Independent and Separable Database Schemes.

Edward P. F. Chan, Alberto O. Mendelzon

SIAM J. Comput., 1987

Answering queries on embedded-complete database schemes.

Edward P. F. Chan, Alberto O. Mendelzon

J. ACM, 1987

On testing soundness of relational expressions.

Edward P. F. Chan, Alberto O. Mendelzon

Inf. Syst., 1987

On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies.

Edward P. F. Chan, Héctor J. Hernández

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.

Edward P. F. Chan, Paolo Atzeni

Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons.

Cao An Wang, Edward P. F. Chan

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Efficient Query Answering in the Representative Instance Approach.

Paolo Atzeni, Edward P. F. Chan

Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985

1984

Query answering and schema analysis under the weak instance model.

Edward P. F. Chan

PhD thesis, 1984

Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions.

Edward P. F. Chan

Proceedings of the SIGMOD'84, 1984

1979

A Graphical Database Design Aid using the Entity-Relationship Model.

Edward P. F. Chan, Frederick H. Lochovsky

Proceedings of the Entity-Relationship Approach to Systems Analysis and Design. Proc. 1st International Conference on the Entity-Relationship Approach, 1979