Containment of Partially Specified Tree-Pattern Queries

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

dc.contributor.author	Theodoratos, D	en
dc.contributor.author	Dalamagas, T	en
dc.contributor.author	Placek, P	en
dc.contributor.author	Souldatos, S	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/34987
dc.subject	Experimental Evaluation	en
dc.subject	Information Extraction	en
dc.subject	Necessary and Sufficient Condition	en
dc.subject	Query Language	en
dc.subject	Query Optimization	en
dc.subject	Scientific Data	en
dc.subject	Tree Structure	en
dc.title	Containment of Partially Specified Tree-Pattern Queries	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/SSDBM.2006.16	en
heal.identifier.secondary	http://dx.doi.org/10.1109/SSDBM.2006.16	en
heal.publicationDate	2006	en
heal.abstract	Nowadays, huge volumes of data, including scientific data, are organized or exported in tree-structured form. Query- ing capabilities are provided through tree-pattern queries. The need for integrating multiple data sources with differ- ent tree structures has driven, recently, the suggestion of query languages that relax the complete specification of a tree pattern. In this paper we adopt a query language	en
heal.journalName	Statistical and Scientific Database Management	en
dc.identifier.doi	10.1109/SSDBM.2006.16	en