Querying tree-structured data using dimension graphs

Theodoratos, D; Dalamagas, T

dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Dalamagas, T	en
dc.date.accessioned	2014-03-01T02:43:29Z
dc.date.available	2014-03-01T02:43:29Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31434
dc.subject	E Commerce	en
dc.subject	Necessary and Sufficient Condition	en
dc.subject	Query Language	en
dc.subject	Semantic Relations	en
dc.subject	Tree Structure	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Information systems	en
dc.subject.other	Query processing	en
dc.subject.other	Taxonomies	en
dc.subject.other	Tree structure	en
dc.subject.other	Data processing	en
dc.subject.other	Database systems	en
dc.subject.other	Electronic commerce	en
dc.subject.other	Hierarchical systems	en
dc.subject.other	Mathematical models	en
dc.subject.other	Problem solving	en
dc.subject.other	Trees (mathematics)	en
dc.subject.other	World Wide Web	en
dc.subject.other	Query languages	en
dc.title	Querying tree-structured data using dimension graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11431855_15	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11431855_15	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept hierarchies, e-commerce product catalogs are examples of such structures. Querying multiple data sources that use tree structures to organize their data is a challenging issue due to name mismatches, structural differences and structural inconsistencies that occur in such structures, even for a single knowledge domain. In this paper, we present a method to query 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 and evaluate queries on trees. We design a query language to query tree-structured data. A key feature of this language is that queries are not restricted by the structure of the trees. We present a technique for evaluating queries and we provide necessary and sufficient conditions for checking query unsatisfiability. We also show how dimension graphs can be used to query multiple trees in the presence of structural differences and inconsistencies. © Springer-Verlag Berlin Heidelberg 2005.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11431855_15	en
dc.identifier.isi	ISI:000230168200015	en
dc.identifier.volume	3520	en
dc.identifier.spage	201	en
dc.identifier.epage	215	en