Heuristic containment check of partial tree-pattern queries in the presence of index graphs

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

dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Souldatos, S	en
dc.contributor.author	Dalamagas, T	en
dc.contributor.author	Placek, P	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:50:15Z
dc.date.available	2014-03-01T02:50:15Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34999
dc.subject	Experimental Evaluation	en
dc.subject	Indexation	en
dc.subject	Information Extraction	en
dc.subject	Query Language	en
dc.subject	Satisfiability	en
dc.subject	Tree Structure	en
dc.subject	On The Fly	en
dc.title	Heuristic containment check of partial tree-pattern queries in the presence of index graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1183614.1183679	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1183614.1183679	en
heal.publicationDate	2006	en
heal.abstract	The wideadoption ofXML hasincreased theinterestof thedatabase community on tree-structured datamanagement techniques. Query- ing capabilities are provided through tree-pattern queries. The need for querying tree-structured data sources when their structure is not fully known, and the need to integrate multiple data sources with different tree structures have driven, recently, the suggestion of query languages that relax the complete specification of a	en
heal.journalName	International Conference on Information and Knowledge Management	en
dc.identifier.doi	10.1145/1183614.1183679	en