Research Projects

$ Last generated: Thu Jul 3 20:18:59 2008 EST $

Current Projects

	In the Data Linkage project, we re-visit the traditional record linkage problem to cope with novel challenges such as intricate interplay of match vs. merge steps, increased scalability, and agile adaptivility. In particular, as solutions to the challenges, we study four sub-problems: the googled linkage, parallel linkage, group linkage, and adaptive linkage problems.
	The concept of Web Services has been recently proposed as a means to achieve the true Intelligent Semantic Web paradigm, but it still lacks of many necessary functionalities. In the Atherton project, in particular, we are interested in developing a new Web Services modeling methodology, Web Services generation and composition framework, and Web Services based applications.

	Is a journal A in a field X better than a journal B in a field Y? Which venues are the best place to submit your papers? Currently, there is no universally agreed method to answer these interesting questions. In the AppleRank project, toward these questions, we aim at developing a novel framework that can rank bibliographic entities (termed as "apples") better.
	In order to meet needs for flexible and efficient support of access control systems for the XML model, the L³ project explores how to leverage on techniques developed for relational access control systems.
	In the QUAGGA project, we investigate research issues in the "Quality of Data" (QoD) to achieve clean databases. The existence of poor or erroneous data in databases causes the so-called Garbage-in, Garbage-out problem. As the sources of data become diverse, their formats become heterogeneous, and the volume of data grows rapidly, maintaining and improving the quality of such data gets harder. Therefore, in this project, we study database-centric data quality and cleaning problems.
	The OpenDBLP project renovates the old DBLP system into a Web Services based on-line digital library, where not only human users but also software agents can issue queries to retrieve bibliographic information. As a killer application, the DBLP system itself was completely simulated with the Google flavour, too.