Title:   Querying and Mining in Graph Databases
Speaker: Ambuj Singh (UC Santa Barbara)


Abstract:
A number of scientific endeavors are generating data that can be
modeled as graphs: high-throughput biological experiments on
protein interactions, high throughput screening of chemical
compounds, social networks, ecological networks and food-webs,
database schema and ontologies.  Access and analysis of the
resulting annotated and probabilistic graphs is crucial for
advancing the state of scientific research, accurate modeling and
analysis of existing systems, and re-engineering of new systems. I
will discuss a set of scalable querying and mining tools for graph
databases.  Specifically, I will discuss querying for similar
graphs and subgraphs, discovery of significant subgraphs in a
graph database, and the mining of well-connected clusters in large
probabilistic graphs.


Biography: Ambuj K. Singh is a professor of computer science at
the University of California at Santa Barbara.  He received his
B.Tech. from the Indian Institute of Technology at Kharagpur and
Ph.D. from the University of Texas at Austin.  His current
interests are in the areas of databases and bioinformatics.