Semantic integration of tree-structured data using dimension graphs

Dalamagas, T; Theodoratos, D; Koufopoulos, A; Liu, I-T

dc.contributor.author	Dalamagas, T	en
dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Koufopoulos, A	en
dc.contributor.author	Liu, I-T	en
dc.date.accessioned	2014-03-01T02:43:32Z
dc.date.available	2014-03-01T02:43:32Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31458
dc.subject	Necessary and Sufficient Condition	en
dc.subject	Query Evaluation	en
dc.subject	Query Language	en
dc.subject	Satisfiability	en
dc.subject	Semantic Integration	en
dc.subject	Semantic Relations	en
dc.subject	Tree Structure	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Dimension graphs	en
dc.subject.other	Structural differences	en
dc.subject.other	Tree structured data	en
dc.subject.other	Web data	en
dc.subject.other	Integration	en
dc.subject.other	Query processing	en
dc.subject.other	Semantics	en
dc.subject.other	Web services	en
dc.subject.other	Trees (mathematics)	en
dc.title	Semantic integration of tree-structured data using dimension graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11603412_8	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11603412_8	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	Nowadays, huge volumes of Web data are organized or exported in tree-structured form. Popular examples of such structures are product catalogs of e-market stores, taxonomies of thematic categories, XML data encodings, etc. Even for a single knowledge domain, name mismatches, structural differences and structural inconsistencies raise difficulties when many data sources need to be integrated and queried in a uniform way. In this paper, we present a method for semantically integrating tree-structured data. We introduce dimensions which are sets of semantically related nodes in tree structures. Based on dimensions, we suggest dimension graphs. Dimension graphs can be automatically extracted from trees and abstract their structural information. They are semantically rich constructs that provide query guidance to pose queries, assist query evaluation and support integration of tree-structured data. We design a query language to query tree-structured data. The language allows full, partial or no specification of the structure of the underlying tree-structured data used to issue queries. Thus, queries in our language are not restricted by the structure of the trees. We provide necessary and sufficient conditions for checking query satisfiability and we present a technique for evaluating satisfiable queries. Finally, we conducted several experiments to compare our method for integrating tree-structured data with one that does not exploit dimension graphs. Our results demonstrate the superiority of our approach. © Springer-Verlag Berlin Heidelberg 2005.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11603412_8	en
dc.identifier.isi	ISI:000234830300008	en
dc.identifier.volume	3730 LNCS	en
dc.identifier.spage	250	en
dc.identifier.epage	279	en