ࡱ> 4630bjbjUU >*??0+++++????$c ?Po( 2l+++++ ?q0@@@+@ :Resumo A necessidade da utilizao de informaes presentes em bases de dados semiestruturadas, especialmente XML, cresce a cada dia. O atendimento a esta demanda deve ser realizado da maneira mais rpida e satisfatria possvel. Enquanto algumas abordagens de consulta sobre documentos XML utilizam tcnicas dependentes de sistemas gerenciadores de banco de dados especficos para otimizao do tempo de resposta, a proposta com linguagens de inferncia desenvolvida por Lima et al.  ADDIN ZOTERO_ITEM CSL_CITATION {"citationID":"2c79da7n40","properties":{"formattedCitation":"(2012)","plainCitation":"(2012)"},"citationItems":[{"id":43,"uris":["http://zotero.org/groups/42995/items/36ZHRRFB"],"uri":["http://zotero.org/groups/42995/items/36ZHRRFB"],"itemData":{"id":43,"type":"article-journal","title":"Towards Querying Implicit Knowledge in XML Documents.","container-title":"Journal of Information and Data Management (JIDM)","page":"51-60","volume":"3","issue":"1","author":[{"family":"Lima","given":"D."},{"family":"Delgado","given":"C."},{"family":"Murta","given":"L."},{"family":"Braganholo","given":"V."}],"issued":{"date-parts":[["2012"]]}},"suppress-author":true}],"schema":"https://github.com/citation-style-language/schema/raw/master/csl-citation.json"} (2012) mostrou-se bastante promissora. A abordagem de Lima et al. prope um mtodo de traduo de documentos XML para fatos Prolog, propiciando assim a realizao de consultas utilizando inferncia. Uma avaliao ad-hoc mostrou que consultas Prolog sobre essas bases de fatos eram processadas mais eficientemente do que as consultas XML equivalentes. Diante disso, Santos et al.  ADDIN ZOTERO_ITEM CSL_CITATION {"citationID":"1dhi5bmb87","properties":{"formattedCitation":"(2012)","plainCitation":"(2012)"},"citationItems":[{"id":24,"uris":["http://zotero.org/groups/42995/items/2FU2TDPN"],"uri":["http://zotero.org/groups/42995/items/2FU2TDPN"],"itemData":{"id":24,"type":"paper-conference","title":"Processamento de Consultas XML usando Mquinas de Inferncia","container-title":"Simpsio Brasileiro de Banco de Dados","publisher-place":"So Paulo, Brasil","page":"129-136","event":"Simpsio Brasileiro de Banco de Dados (SBBD)","event-place":"So Paulo, Brasil","author":[{"family":"Santos","given":"Fbio"},{"family":"Pinheiro","given":"Rafael"},{"family":"Braganholo","given":"Vanessa"}],"issued":{"date-parts":[["2012"]]}},"suppress-author":true}],"schema":"https://github.com/citation-style-language/schema/raw/master/csl-citation.json"} (2012) desenvolveram um algoritmo bsico de traduo automtica de consultas XPath para predicados Prolog. No entanto o algoritmo oferece somente suporte a consultas simples, no contemplando a utilizao de filtros mltiplos, expresses e funes presentes na XPath. Este trabalho se baseia em de trabalhos anteriores com o objetivo principal de oferecer apoio traduo de um conjunto mais amplo de consultas, assim como a obteno automatizada de resultados em formato XML. O trabalho desenvolvido (XP2PL) traduz para Prolog diversas funes, expresses e filtros presentes na XPath, permitindo ao usurio maior poder de expresso no momento da criao das consultas, quando comparado com abordagens semelhantes. Experimentos foram realizados comparando os resultados obtidos por este trabalho com os dos interpretadores XPath Galax e Saxon, alm do banco de dados XML nativo Sedna. As consultas do benchmark XPathMark foram utilizadas para analisar o poder de expresso, alm de medir os tempos de resposta de cada abordagem. Os resultados alcanados foram promissores. Em relao ao desempenho, a maioria das consultas Prolog apresenta desempenho superior quando comparadas a trs diferentes processadores XPath avaliados nesse trabalho, utilizando base de 10 MB. Palavras-chave: Processamento de Consulta; Prolog; XML; XPath. ABSTRACT The need to use information contained in semi-structured databases, especially XML, grows every day. Fullfilling this demand should be done as quickly and satisfactorily as possible. While some query approaches to XML documents use specific database management systems techniques to optimize the response time, the proposal with inference languages by Lima et al. (2012) proved to be quite promising. Lima et al. translates XML documents into Prolog facts, thereby providing query capabilities using inference. An ad-hoc evaluation showed that Prolog queries over these knowledge bases run fastaer than their equivalente XML queries. Then, Santos et al. (2012) developed a basic algorithm to automatically translate XPath queries into Prolog predicates. However, the algorithm provides support only for simple queries, not contemplating the use of multiple filters, expressions and XPath functions. This work builds upon previous approaches with the main objective of supporting the translation of a set of new queries, and also to automatically obtaining results in XML format. The work developed (XP2PL) translates several XPath functions, expressions and filters to Prolog, allowing the user greater power of expression in query creation process, when compared with similar approaches. Experiments were performed comparing the results of this work with the XPath interpreters Galax and Saxon, and also with the Sedna native XML database. Queries of XPathMark benchmark were used to analyze the expression power and measure the response times of each approach. The results were promising The majority of the Prolog queries presented better performance when compared to the three different XPath processors that were evaluated in this work, using a 10 MB dataset. Keywords: Query Processing; Prolog; XML; XPath. z|    0 1 2 6 7 l º³¨|qcUJ?hlhanHtHhhanHtHhhSha6]nHtHhv{ha6]nHtHh/hanHtHh}hanHtHh^ohanHtHhMhanHtHhVhanHtHhp/hanHtH h^hahanHtHjhaUnHtHhNha6]nHtHhNha0JhNhanHtHhNha5;CJ\aJ  0 $`a$gdk`gdk`gdvTkgdvTk $h`a$gdvTk l n )9GUjoqrɾvjbj[jPE:hMhanHtHhVhanHtHhp/hanHtH h^hahanHtHjhaUnHtHhNha6]nHtHhNhanHtHhZzhanHtHh0nhanHtHhCjhanHtHhha6]nHtHho[hanHtHh cihanHtHhf>hanHtHhihanHtHh}hanHtHh)QhanHtH!.8|:?YZɾ|qiq^SiH=hZzhanHtHh0nhanHtHhCjhanHtHho[hanHtHhanHtHh cihanHtHhf>hanHtHhihanHtHh}hanHtHh)QhanHtHhMOhanHtHhlhanHtHhhanHtHhhShanHtHhv{hanHtHh/hanHtHh}hanHtHh^ohanHtHZh]f (/0ɾ⡝zrfWhkhaCJaJmH sH haCJaJmH sH hamH sH hkha6]mH sH hkhamH sH hkha5\hah}hanHtHh^ohanHtH hMhahVhanHtHhp/hanHtHhp4ha6]nHtHhanHtHhNhanHtHh0ahanHtH<P1h:py. A!"#$% Dpj  666666666666666666666666666666666666666666 6666666666 666666666666 6666666666666666666666666666666666666666666666666666666666666666662 0@P`p2( 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p8XV~ OJPJQJ_HmHnHsHtH\`\ vTkNormal$dh`a$ CJOJQJ_HaJmHsHtH DA`D 0Default Paragraph FontRiR 0 Table Normal4 l4a (k ( 0No List B'@B vTk0Comment ReferenceCJaJPK![Content_Types].xmlj0Eжr(΢Iw},-j4 wP-t#bΙ{UTU^hd}㨫)*1P' ^W0)T9<l#$yi};~@(Hu* Dנz/0ǰ $ X3aZ,D0j~3߶b~i>3\`?/[G\!-Rk.sԻ..a濭?PK!֧6 _rels/.relsj0 }Q%v/C/}(h"O = C?hv=Ʌ%[xp{۵_Pѣ<1H0ORBdJE4b$q_6LR7`0̞O,En7Lib/SeеPK!kytheme/theme/themeManager.xml M @}w7c(EbˮCAǠҟ7՛K Y, e.|,H,lxɴIsQ}#Ր ֵ+!,^$j=GW)E+& 8PK!Ptheme/theme/theme1.xmlYOo6w toc'vuر-MniP@I}úama[إ4:lЯGRX^6؊>$ !)O^rC$y@/yH*񄴽)޵߻UDb`}"qۋJחX^)I`nEp)liV[]1M<OP6r=zgbIguSebORD۫qu gZo~ٺlAplxpT0+[}`jzAV2Fi@qv֬5\|ʜ̭NleXdsjcs7f W+Ն7`g ȘJj|h(KD- dXiJ؇(x$( :;˹! I_TS 1?E??ZBΪmU/?~xY'y5g&΋/ɋ>GMGeD3Vq%'#q$8K)fw9:ĵ x}rxwr:\TZaG*y8IjbRc|XŻǿI u3KGnD1NIBs RuK>V.EL+M2#'fi ~V vl{u8zH *:(W☕ ~JTe\O*tHGHY}KNP*ݾ˦TѼ9/#A7qZ$*c?qUnwN%Oi4 =3ڗP 1Pm \\9Mؓ2aD];Yt\[x]}Wr|]g- eW )6-rCSj id DЇAΜIqbJ#x꺃 6k#ASh&ʌt(Q%p%m&]caSl=X\P1Mh9MVdDAaVB[݈fJíP|8 քAV^f Hn- "d>znNJ ة>b&2vKyϼD:,AGm\nziÙ.uχYC6OMf3or$5NHT[XF64T,ќM0E)`#5XY`פ;%1U٥m;R>QD DcpU'&LE/pm%]8firS4d 7y\`JnίI R3U~7+׸#m qBiDi*L69mY&iHE=(K&N!V.KeLDĕ{D vEꦚdeNƟe(MN9ߜR6&3(a/DUz<{ˊYȳV)9Z[4^n5!J?Q3eBoCM m<.vpIYfZY_p[=al-Y}Nc͙ŋ4vfavl'SA8|*u{-ߟ0%M07%<ҍPK! ѐ'theme/theme/_rels/themeManager.xml.relsM 0wooӺ&݈Э5 6?$Q ,.aic21h:qm@RN;d`o7gK(M&$R(.1r'JЊT8V"AȻHu}|$b{P8g/]QAsم(#L[PK-![Content_Types].xmlPK-!֧6 +_rels/.relsPK-!kytheme/theme/themeManager.xmlPK-!Ptheme/theme/theme1.xmlPK-! ѐ' theme/theme/_rels/themeManager.xml.relsPK] 0*l Z00q 0QQ_GoBack 2 2& ,V@f>Cjp/B15O)Q6QhSo[0a civTkZzv{|kMO0np4iM^y}i}^oaN/l02@0@@Unknowng*Ax Times New RomanTimes New Roman5Symbol3" Arial7.@CalibriACambria Math"HgHg w!0$P0vTk!xxRESUMOLeonardo Cesar MachadoHelioOh+'0   D P \hpxRESUMOLeonardo Cesar MachadoNormal_WordconvHelio5Microsoft Office Outlook@@Z@ҁ w՜.+,0 hp|   RESUMO Title  !"$%&'()*,-./0125Root Entry F 71Table@WordDocument>*SummaryInformation(#DocumentSummaryInformation8+CompObjy  F'Microsoft Office Word 97-2003 Document MSWordDocWord.Document.89q  F#Documento do Microsoft Office Word MSWordDocWord.Document.89q