A heuristic approach for checking containment of generalized tree-pattern queries

Placek, P; Theodoratos, D; Souldatos, S; Dalamagas, T; Sellis, T

dc.contributor.author	Placek, P	en
dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Souldatos, S	en
dc.contributor.author	Dalamagas, T	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:51:18Z
dc.date.available	2014-03-01T02:51:18Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35462
dc.subject	Canonical Form	en
dc.subject	Experimental Evaluation	en
dc.subject	Necessary and Sufficient Condition	en
dc.subject	Query Language	en
dc.subject	Query Optimization	en
dc.subject	Query Processing	en
dc.title	A heuristic approach for checking containment of generalized tree-pattern queries	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1458082.1458155	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1458082.1458155	en
heal.publicationDate	2008	en
heal.abstract	Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very com- plex or not fully known to the user, and the need to integrate multiple XML data sources with different structures have driven, recently, the suggestion of query languages that relax the complete specification of	en
heal.journalName	International Conference on Information and Knowledge Management	en
dc.identifier.doi	10.1145/1458082.1458155	en