Filters








175 Hits in 3.6 sec

Efficient Cache Answerability for XPath Queries [chapter]

Pedro José Marrón, Georg Lausen
2003 Lecture Notes in Computer Science  
systems -and cache answerability is no exception -need to be revisited from the point of view of the semistructured data and query model.  ...  query rewriting algorithms while, at the same time, supporting the full expressive power of XPath queries.  ...  in a very efficient way, as opposed to more classic approaches, where the efficiency of their query containment and query rewriting algorithms depend exponentially on the number of views stored in the  ... 
doi:10.1007/3-540-36556-7_16 fatcat:s24pb6655fhvzdu2otuz4x6gzu

Efficient rewriting of XPath queries using Query Set Specifications

Bogdan Cautis, Alin Deutsch, Nicola Onose, Vasilis Vassalos
2009 Proceedings of the VLDB Endowment  
We say that query Q is expressible by the specification P if it is equivalent to some expansion of P. Q is supported by P if it has an equivalent rewriting using some finite set of P's expansions.  ...  XPath queries.  ...  To the best of our knowledge, we are the first to address the problem of rewriting XPath queries using a compactly specified set of views.  ... 
doi:10.14778/1687627.1687662 fatcat:574ipwm255ejlgmv3muvtm2fxq

XML Security Views Revisited [chapter]

Benoît Groz, Sławomir Staworko, Anne-Cecile Caron, Yves Roos, Sophie Tison
2009 Lecture Notes in Computer Science  
First, we show that the full class of Regular XPath queries is closed under query rewriting.  ...  used to define the view.  ...  Query rewriting over XML views In this section we show that the class of Regular XPath queries is closed under query rewriting.  ... 
doi:10.1007/978-3-642-03793-1_4 fatcat:os62oesfqfbmpmo4r5odynmkvy

QFilter: rewriting insecure XML queries to secure ones using non-deterministic finite automata

Bo Luo, Dongwon Lee, Wang-Chien Lee, Peng Liu
2010 The VLDB journal  
QFilter is based on non-deterministic finite automata (NFA) and rewrites user's queries such that parts violating access control rules are pre-pruned.  ...  enforced without relying on security features of underlying storage system, and (3) such independency makes QFilter capable of many emerging applications, such as in-network access control and access control  ...  In the case that the input word contains wildcards but L ACR accepts only specified pathes, we make use of the output function of the Mealy machine to rewrite it into a valid word in L ACR .  ... 
doi:10.1007/s00778-010-0202-x fatcat:eo2dwrn2lvcoteplm3xy3mmbiu

Answering Queries using Views over Probabilistic XML: Complexity and Tractability [article]

Bogdan Cautis, Evgeny Kharlamov
2012 arXiv   pre-print
We study the complexity of query answering using views in a probabilistic XML setting, identifying large classes of XPath queries -- with child and descendant navigation and predicates -- for which there  ...  Accordingly, we consider rewritings that can exploit a single view, by means of compensation, and rewritings that can use multiple views, by means of intersection.  ...  For deterministic data, prior research [36, 25] on XPath rewriting studied the problem of equivalently rewriting an XPath query by navigating inside a single materialized XPath view.  ... 
arXiv:1208.0078v1 fatcat:bs653lo6dzh6ziif4ays33aqsm

Data flow testing of service choreography

Lijun Mei, W. K. Chan, T. H. Tse
2009 Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium - ESEC/FSE '09  
Messages sent from one service to another may require the use of different XPaths to manipulate or extract message contents.  ...  In this paper, we propose to associate XPath Rewriting Graphs (XRGs), a structure that relates XPath and XML schema, with actions of choreography applications that are skeletally modeled as labeled transition  ...  specifications (in the format of XPath Rewriting Graphs (XRGs)).  ... 
doi:10.1145/1595696.1595720 dblp:conf/sigsoft/MeiCT09 fatcat:jqi3okiwnvf2xat3owlgmvzmpi

Querying XML data sources that export very large sets of views

Bogdan Cautis, Alin Deutsch, Nicola Onose, Vasilis Vassalos
2011 ACM Transactions on Database Systems  
We say that query Q is expressible by the specification P if it is equivalent to some expansion of P. Q is supported by P if it has an equivalent rewriting using some finite set of P's expansions.  ...  XPath queries.  ...  The single-view rewritings considered in early XPath research have only limited benefit, as many queries with no single-view rewriting can be rewritten using multiple views.  ... 
doi:10.1145/1929934.1929939 fatcat:jb2nmk5yqzbgrmryvcyugyvwji

Answering queries using views over probabilistic XML

Bogdan Cautis, Evgeny Kharlamov
2012 Proceedings of the VLDB Endowment  
We study the complexity of query answering using views in a probabilistic XML setting, identifying large classes of XPath querieswith child and descendant navigation and predicates -for which there are  ...  Accordingly, we consider rewritings that can exploit a single view, by means of compensation, and rewritings that can use multiple views, by means of intersection.  ...  For deterministic data, prior research [36, 25] on XPath rewriting studied the problem of equivalently rewriting an XPath query by navigating inside a single materialized XPath view.  ... 
doi:10.14778/2350229.2350235 fatcat:jgzvvr5lvbaljp23qj4zikt5ja

Transformation of structure-shy programs with application to XPath queries and strategic functions

Alcino Cunha, Joost Visser
2011 Science of Computer Programming  
We discuss the application of these rewrite systems for XPath query optimization and for query migration in the context of schema evolution.  ...  We present a type-safe encoding of these rewrite systems in Haskell which itself uses strategic functional programming techniques.  ...  We have formulated sets of algebraic equivalences for XPath queries, and for their conversion into strategic and pointfree programs.  ... 
doi:10.1016/j.scico.2010.01.003 fatcat:kz3666fm3rd4nmrpdh7gk3muha

A Subsumption Hierarchy of Test Case Prioritization for Composite Services

Lijun Mei, Yan Cai, Changjiang Jia, Bo Jiang, W.K. Chan, Zhenyu Zhang, T.H. Tse
2015 IEEE Transactions on Services Computing  
For a tree tT  , an XPath query q(t) is a query on t using an XPath expression q, and returns a set of nodes of t.  ...  Similarly, viewing from outside-in produces another sequence of artifacts. We have modeled such a layer of enumerable sets of tags as an XPath Rewriting Graph (XRG) [29] .  ...  They studied the integration of coverage data on program statements and HTML elements for the testing of dynamic web applications. Their work did not consider XPath queries and regression testing.  ... 
doi:10.1109/tsc.2014.2331683 fatcat:dqa2woqvnvbjvel2mpu2qiwwii

Answering XML queries using materialized views revisited

Xiaoying Wu, Dimitri Theodoratos, Wendy Hui Wang
2009 Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09  
In the realm of XML, there is a restricted number of contributions in the direction of these problems due to the many limitations associated with the use of materialized views in traditional XML query  ...  We specify necessary and sufficient conditions for answering a treepattern query using one or multiple materialized views in terms of homomorphisms from the views to the query.  ...  The majority of the recent research efforts have been directed on rewriting XPath queries using materialized XPath views. Among them most works focus on the equivalent rewriting [2, 19, 32, 27, 1] .  ... 
doi:10.1145/1645953.1646015 dblp:conf/cikm/WuTW09 fatcat:5zbt3kh4nzgtbbsdzle4xptepa

Test case prioritization for regression testing of service-oriented business applications

Lijun Mei, Zhenyu Zhang, W. K. Chan, T. H. Tse
2009 Proceedings of the 18th international conference on World wide web - WWW '09  
We propose a multilevel coverage model to capture the business process, XPath, and WSDL from the perspective of regression testing.  ...  On the other hand, industrial service-oriented business applications are typically written in orchestration languages such as WS-BPEL and integrated with workflow steps and web services via XPath and WSDL  ...  We have proposed in [12] an XPath Rewriting Graph (XRG) to represent an XPath with a document model Ω of XML documents. We revisit XRG here to facilitate the description of our techniques.  ... 
doi:10.1145/1526709.1526830 dblp:conf/www/MeiZCT09 fatcat:rnu6b24ravbprcphzd7gykapvi

View-Based Tree-Language Rewritings for XML [chapter]

Laks V. S. Lakshmanan, Alex Thomo
2014 Lecture Notes in Computer Science  
We study query rewriting using views (QRV) for XML.  ...  For this generalization as well, we give an optimal algorithm for computing the maximally contained rewriting of queries using views.  ...  This is nothing else but the "rewriting" of the query using the view in this example. We now make precise a rewriting of a query Q using a view V . Recall sets Υ , Υ x .  ... 
doi:10.1007/978-3-319-04939-7_13 fatcat:ev67dybxizepdpiwbp5zpoogsy

Structural Properties of XPath Fragments [chapter]

Michael Benedikt, Wenfei Fan, Gabriel M. Kuper
2002 Lecture Notes in Computer Science  
Finally, we provide sound and complete axiom systems and normal forms for several of these fragments. These results are useful for simplification of XPath expressions and optimization of XML queries.  ...  We study structural properties of each of the main sublanguages of navigational XPath (W3c Recommendation) commonly used in practice.  ...  Finally, we are also exploring the use of our results in developing rewrite systems and algorithms for simplifying XPath expressions.  ... 
doi:10.1007/3-540-36285-1_6 fatcat:psihdfalmfcadgiw7ofuordg74

Structural properties of XPath fragments

Michael Benedikt, Wenfei Fan, Gabriel Kuper
2005 Theoretical Computer Science  
Finally, we provide sound and complete axiom systems and normal forms for several of these fragments. These results are useful for simplification of XPath expressions and optimization of XML queries.  ...  We study structural properties of each of the main sublanguages of navigational XPath (W3c Recommendation) commonly used in practice.  ...  Finally, we are also exploring the use of our results in developing rewrite systems and algorithms for simplifying XPath expressions.  ... 
doi:10.1016/j.tcs.2004.10.030 fatcat:aneqbbpygrctff7j2i3cn4cf3y
« Previous Showing results 1 — 15 out of 175 results