Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/29963
Title: Extracting schemas for database exploration
Authors: YANG XIAOYAN
Keywords: schema summary, database exploration, query recommendation
Issue Date: 13-May-2011
Source: YANG XIAOYAN (2011-05-13). Extracting schemas for database exploration. ScholarBank@NUS Repository.
Abstract: The complexity of databases is increasing considerably and continuously. Databases of enterprises and information-intensive organizations typically have hundreds of interlinked tables. Understanding and exploring these databases through useful queries are becoming more and more challenging. Conventional database schema is not sufficient to address this type of problem. In this dissertation, we propose approaches to extract new schema information from relational databases to facilitate user interaction with databases. More specifically, we first extract schemas from query logs to help users formulate complex join queries over databases lacking of conventional schema. Secondly, we propose a novel schema summarization method for complex databases. The resulting summary serves as a quick overview of the main content of the database. Lastly, we design algorithms to generate adaptive summary graphs based on user-specified query tables, which reflect the relationships among these tables through important intermediate tables and joins. Besides addressing the above three problems, we also propose new distance metrics over schema tables. Extensive experiments are conducted over real data and benchmark databases to evaluate the effectiveness of our proposed methods.
URI: http://scholarbank.nus.edu.sg/handle/10635/29963
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
YangXY.pdf1.43 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

270
checked on Dec 11, 2017

Download(s)

354
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.