The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Edward P. F. Chan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  38. A fast unified optimal route query evaluation algorithm. [Citation Graph (, )][DBLP]


  39. Efficient Evaluation of Static and Dynamic Optimal Route Queries. [Citation Graph (, )][DBLP]


Search in 0.100secs, Finished in 0.101secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002