PhD Thesis Proposal Defence


"Query Processing on Graph Databases"

by

Mr. Sheung-Chak CHENG


Abstract:

Graphs are prevalently used to model the relationships between objects
in various domains. As graph databases are becoming more and more
popular, it has become increasingly important to process graph queries
efficiently. Query processing graph databases is costly since it
involves subgraph isomorphism testing, which is an NP-complete
problem. In our initial work, we propose a graph indexing technique
based on the concept of frequent subgraphs. Preliminary results show
that our index is orders of magnitude more efficient than using the
state-of-the-art graph indexes. In this proposal, we report our
current work and discuss several on-going plans on querying graph
databases.


Date:     		Tuesday, 3 July 2007

Time:                   2:00p.m.-4:00p.m.

Venue:                  Room 3494
			lifts 25-26

Committee Members:      Dr. Wilfred Ng (Supervisor)
                        Prof. Dimitris Papadias (Chairperson)
			Dr. Lei Chen
			Prof. Dik-Lun Lee


**** ALL are Welcome ****