default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward P. F. Chan
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j20]Edward P. F. Chan, Yaya Yang:
Shortest Path Tree Computation in Dynamic Graphs. IEEE Trans. Computers 58(4): 541-557 (2009)- [c20]Edward P. F. Chan, Jie Zhang:
Efficient Evaluation of Static and Dynamic Optimal Route Queries. SSTD 2009: 386-391 - 2007
- [j19]Edward P. F. Chan, Heechul Lim:
Optimization and evaluation of shortest path queries. VLDB J. 16(3): 343-369 (2007) - [c19]Edward P. F. Chan, Jie Zhang:
A fast unified optimal route query evaluation algorithm. CIKM 2007: 371-380 - 2003
- [j18]Edward P. F. Chan:
Buffer Queries. IEEE Trans. Knowl. Data Eng. 15(4): 895-910 (2003) - 2002
- [j17]Edward P. F. Chan, Kevin K. W. Chow:
On multi-scale display of geometric objects. Data Knowl. Eng. 40(1): 91-119 (2002) - 2001
- [c18]Edward P. F. Chan, Ning Zhang:
Finding Shortest Paths in Large Network Systems. ACM-GIS 2001: 160-166 - [c17]Edward P. F. Chan:
Evaluation of Buffer Queries in Spatial Databases. SSTD 2001: 197-216 - 2000
- [j16]Edward P. F. Chan, Ron van der Meyden:
Containment and Optimization of Object-Preserving Conjunctive Queries. SIAM J. Comput. 29(4): 1371-1400 (2000) - [c16]Edward P. F. Chan, Koji Ueda:
Efficient Query Result Retrieval over the Web. ICPADS 2000: 161-170
1990 – 1999
- 1997
- [c15]Edward P. F. Chan, Jimmy N. H. Ng:
A General and Efficient Implementation of Geometric Operators and Predicates. SSD 1997: 69-93 - 1996
- [c14]Edward P. F. Chan, Jonathan M. T. Wong:
Querying and Visualization of Geometric Data. ACM-GIS 1996: 129-138 - 1995
- [c13]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
- [j15]Edward P. F. Chan:
Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries. Theor. Comput. Sci. 134(2): 287-309 (1994) - 1993
- [j14]Edward P. F. Chan:
A Possible World Semantics for Disjunctive Databases. IEEE Trans. Knowl. Data Eng. 5(2): 282-292 (1993) - 1992
- [j13]Edward P. F. Chan, Paolo Atzeni
:
Connection-Trap-Free Database Schemes. J. Comput. Syst. Sci. 44(1): 1-22 (1992) - [c12]Edward P. F. Chan:
Containment and Minimization of Positive Conjunctive Queries in OODB's. PODS 1992: 202-211 - 1991
- [j12]Paolo Atzeni, Edward P. F. Chan:
Independent Database Schemes under Functional and Inclusion Dependencies. Acta Informatica 28(8): 777-779 (1991) - [j11]Edward P. F. Chan, Héctor J. Hernández:
Independence-Reducible Database Schemes. J. ACM 38(4): 854-886 (1991) - [j10]Héctor J. Hernández, Edward P. F. Chan:
Constant-Time-Maintainable BCNF Database Schemes. ACM Trans. Database Syst. 16(4): 571-599 (1991) - 1990
- [j9]Paolo Atzeni, Edward P. F. Chan:
Efficient and Optimal Query Answering on Independent Schemes. Theor. Comput. Sci. 77(3): 291-308 (1990)
1980 – 1989
- 1989
- [j8]Edward P. F. Chan:
A Design Theory for Solving the Anomalies Problem. SIAM J. Comput. 18(3): 429-448 (1989) - [j7]Paolo Atzeni, Edward P. F. Chan:
Efficient Optimization of Simple Chase Join Expressions. ACM Trans. Database Syst. 14(2): 212-230 (1989) - 1988
- [j6]Edward P. F. Chan, Héctor J. Hernández:
On Generating Database Schemes Bounded or Constant-time-maintainable by Extensibility. Acta Informatica 25(5): 475-496 (1988) - [j5]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) - [j4]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) - [c11]Edward P. F. Chan, Héctor J. Hernández:
Independence-reducible Database Schemes. PODS 1988: 163-173 - [c10]Héctor J. Hernández, Edward P. F. Chan:
A Characterization of Constant-time-mainteinability for BCNF Database Schemes. SIGMOD Conference 1988: 209-217 - 1987
- [j3]Edward P. F. Chan, Alberto O. Mendelzon:
On testing soundness of relational expressions. Inf. Syst. 12(2): 167-170 (1987) - [j2]Edward P. F. Chan, Alberto O. Mendelzon:
Answering queries on embedded-complete database schemes. J. ACM 34(2): 349-375 (1987) - [j1]Edward P. F. Chan, Alberto O. Mendelzon:
Independent and Separable Database Schemes. SIAM J. Comput. 16(5): 841-851 (1987) - [c9]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 - [c8]Paolo Atzeni, Edward P. F. Chan:
Independent Database Schemes under Functional and Inclusion Dependencies. VLDB 1987: 159-166 - 1986
- [c7]Cao An Wang, Edward P. F. Chan:
Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons. SCG 1986: 34-42 - [c6]Edward P. F. Chan, Héctor J. Hernández:
On the Desirability of gamma-Acyclic BCNF Database Schemes. ICDT 1986: 105-122 - [c5]Edward P. F. Chan, Paolo Atzeni:
On the Properties and Characterization of Connection-tap-free Schemes. PODS 1986: 140-147 - 1985
- [c4]Paolo Atzeni, Edward P. F. Chan:
Efficient Query Answering in the Representative Instance Approach. PODS 1985: 181-188 - 1984
- [b1]Edward P. F. Chan:
Query answering and schema analysis under the weak instance model. University of Toronto, Canada, 1984 - [c3]Edward P. F. Chan:
Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions. SIGMOD Conference 1984: 149-163 - 1983
- [c2]Edward P. F. Chan, Alberto O. Mendelzon:
Independent and Separable Database Schemes. PODS 1983: 288-296
1970 – 1979
- 1979
- [c1]Edward P. F. Chan, Frederick H. Lochovsky:
A Graphical Database Design Aid using the Entity-Relationship Model. ER 1979: 295-310
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
