By Topic

Conceptual graphs as schemas for semi-structured databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Su, Y.F. ; Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong ; Wong, K.F.

As the World Wide Web grows dramatically in recent years, there is increasing interest in semi-structured data on the web. Semi-structured data are usually represented in graph format, many graph schemas have then been proposed to extract schemas from those data graphs. Conceptual graphs, which use incremental conceptual clustering method to extract schemas, have initially been proposed in 2000. In this paper, we revise the original algorithm to generate a conceptual graph by proposing some new operators in the construction process. The results have shown that with the revised algorithm the quality of the conceptual graphs has been improved in terms of query optimization.

Published in:

Database Systems for Advanced Applications, 2001. Proceedings. Seventh International Conference on

Date of Conference:

21-21 April 2001