Checking Satisfiability of Tree Pattern Queries for Active XML Documents
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/201 |
Resumo: | Satisfiability is an important problem of queries for XML documents. This paper focuses on the satisfiability of tree pattern queries for Active XML(AXML for short) documents conforming to a given AXML schema. An AXML document is an XML document where some data is given explicitly and other parts are defined intensionally by means of embedded calls to Web services, which can be invoked to generate data. For the efficient evaluation of a query over an AXML document, one should check whether there exists an (A)XML document obtained from the original one by invoking some Web services, on which the query has a non-empty answer. An algorithm for checking satisfiability of tree pattern queries for AXML documents that runs polynomial time is proposed based on tree automata theory. Then experiments were made to verify the utility of satisfiability checking as a preprocessing step in queries procession. Our results show that the check takes a negligible fraction of the time needed for processing the query while often yielding substantial savings. |
id |
UFLA-5_fef74b1f333accdb6c4074b0daf948b3 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/201 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Checking Satisfiability of Tree Pattern Queries for Active XML DocumentsActive XMLtree pattern queriestree automatasatisfiability.Satisfiability is an important problem of queries for XML documents. This paper focuses on the satisfiability of tree pattern queries for Active XML(AXML for short) documents conforming to a given AXML schema. An AXML document is an XML document where some data is given explicitly and other parts are defined intensionally by means of embedded calls to Web services, which can be invoked to generate data. For the efficient evaluation of a query over an AXML document, one should check whether there exists an (A)XML document obtained from the original one by invoking some Web services, on which the query has a non-empty answer. An algorithm for checking satisfiability of tree pattern queries for AXML documents that runs polynomial time is proposed based on tree automata theory. Then experiments were made to verify the utility of satisfiability checking as a preprocessing step in queries procession. Our results show that the check takes a negligible fraction of the time needed for processing the query while often yielding substantial savings.Editora da UFLA2008-03-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/201INFOCOMP Journal of Computer Science; Vol. 7 No. 1 (2008): March, 2008; 11-181982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/201/186Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessMa, Hai-TaoHao, Zhong-XiaoZhu, Yan2015-06-27T23:26:36Zoai:infocomp.dcc.ufla.br:article/201Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:24.002423INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents |
title |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents |
spellingShingle |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents Ma, Hai-Tao Active XML tree pattern queries tree automata satisfiability. |
title_short |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents |
title_full |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents |
title_fullStr |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents |
title_full_unstemmed |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents |
title_sort |
Checking Satisfiability of Tree Pattern Queries for Active XML Documents |
author |
Ma, Hai-Tao |
author_facet |
Ma, Hai-Tao Hao, Zhong-Xiao Zhu, Yan |
author_role |
author |
author2 |
Hao, Zhong-Xiao Zhu, Yan |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Ma, Hai-Tao Hao, Zhong-Xiao Zhu, Yan |
dc.subject.por.fl_str_mv |
Active XML tree pattern queries tree automata satisfiability. |
topic |
Active XML tree pattern queries tree automata satisfiability. |
description |
Satisfiability is an important problem of queries for XML documents. This paper focuses on the satisfiability of tree pattern queries for Active XML(AXML for short) documents conforming to a given AXML schema. An AXML document is an XML document where some data is given explicitly and other parts are defined intensionally by means of embedded calls to Web services, which can be invoked to generate data. For the efficient evaluation of a query over an AXML document, one should check whether there exists an (A)XML document obtained from the original one by invoking some Web services, on which the query has a non-empty answer. An algorithm for checking satisfiability of tree pattern queries for AXML documents that runs polynomial time is proposed based on tree automata theory. Then experiments were made to verify the utility of satisfiability checking as a preprocessing step in queries procession. Our results show that the check takes a negligible fraction of the time needed for processing the query while often yielding substantial savings. |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-03-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/201 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/201 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/201/186 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 7 No. 1 (2008): March, 2008; 11-18 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740470415360 |