Filters








453 Hits in 2.6 sec

A bi-labeling based XPath processing system

Yi Chen, Susan B. Davidson, Yifeng Zheng
2010 Information Systems  
We present BLAS, a Bi-LAbeling based XPath processing System.  ...  Experimental results demonstrate the efficiency of the BLAS system. a b s t r a c t We present BLAS, a Bi-LAbeling based XPath processing System.  ...  Our approach, called BLAS (a Bi-LAbeling based System), uses two labeling schemes: P-labeling (where P stands for path) and D-labeling.  ... 
doi:10.1016/j.is.2009.05.005 fatcat:3tmxixssena33kzjphxulpgkfi

Verification of Tree Updates for Optimization [chapter]

Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas
2005 Lecture Notes in Computer Science  
A recent example along this line are the update languages of [16, 15, 8] which add tree update primitives on top of the declarative query languages XPath and XQuery.  ...  We give an algorithm to verify that a tree update program is Binding Independent, and show how this analysis can be used to produce optimized evaluation orderings that significantly reduce processing time  ...  If all systems are unsatisfiable, the analysis outputs that the program is verified to be BI. At runtime, the program is processed by our modification of the Galax-based XML update engine.  ... 
doi:10.1007/11513988_37 fatcat:ojhdbawudrcgzekdibphwnfavq

Structural summaries for efficient XML query processing

Sofía Brenes
2008 Proceedings of the 2008 EDBT Ph.D. workshop on - Ph.D. '08  
However, up to this point there has been a gap between the theoretical and engineering efforts taken in the context of XML.  ...  summaries for more efficient XML query processing and more accurate result size estimation.  ...  Label-Path Based Partitions An XML document X is a node-labeled tree.  ... 
doi:10.1145/1387150.1387161 fatcat:ginep2f3ofhz3gxmasdrueouda

BLAS

Yi Chen, Susan B. Davidson, Yifeng Zheng
2004 Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD '04  
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data.  ...  Experimental results demonstrate that the BLAS system has a substantial performance improvement compared to traditional XPath processing using D-labeling.  ...  Based on P-labeling and D-labeling, we build a system called BLAS (a Bi-LAbeling based System) to efficiently process XPath queries which can be represented as trees.  ... 
doi:10.1145/1007568.1007577 dblp:conf/sigmod/ChenDZ04 fatcat:bqfbbqedyfh4bjhkhkpk7kgk4u

XML-document-filtering automaton

Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
2008 Proceedings of the VLDB Endowment  
In a publish-subscribe system based on filtering of XML documents subscribers specify their interests with profiles expressed in the XPath language.  ...  The system processes a stream of XML documents and delivers to subscribers a notification or content of documents that match the profiles.  ...  In a publish-subscribe system based on XML filtering, the profiles are usually specified by filters written in the XPath language.  ... 
doi:10.14778/1454159.1454245 fatcat:mdpwvhn3cjhova2xd7svup7qvm

Path Query [chapter]

Yuqing Wu
2016 Encyclopedia of Database Systems  
The path is identified by specifying the labels of the nodes to be navigated and structural relationship (parent-child or ancestor-descendant) among the nodes.  ...  A predicate can be a path query itself, relative to the node that is associated with.  ...  DataGuide [7] was the first to be proposed, followed by the 1-index [11] , which is based on the notion of bi-simulation among nodes in an XML document.  ... 
doi:10.1007/978-1-4899-7993-3_140-2 fatcat:kvrmgo6mfbbwnphdlnnymdk5nm

Bisimulations on Data Graphs

Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira
2018 The Journal of Artificial Intelligence Research  
We study the problem of computing such bisimulations, based on the observational indistinguishability for XPath ---a language that extends modal logics like PDL with tests for data equality--- with and  ...  Bisimulation provides structural conditions to characterize indistinguishability from an external observer between nodes on labeled graphs.  ...  Introduction Bisimulation is a fundamental notion that establishes when two nodes (or states) in a labeled graph (e.g., a transition system) cannot be distinguished by an external observer.  ... 
doi:10.1613/jair.5637 fatcat:nrozgnk67ffnra2g5wp4pj2kra

Querying bi-level information

Sudarshan Murthy, David Maier, Lois Delcambre
2004 Proceedings of the 7th International Workshop on the Web and Databases colocated with ACM SIGMOD/PODS 2004 - WebDB '04  
We discuss our framework for superimposed information management, an initial implementation of a bi-level query system with an XML Query interface, and suggest mechanisms to improve scalability and performance  ...  Bi-level queries provide an alternative style of data integration where only relevant portions of a base document are mediated (not the whole document) and the superimposed layer can add information not  ...  BI-LEVEL QUERY SYSTEM A bi-level query system allows a superimposed application and its user to query the superimposed information and base information as a whole.  ... 
doi:10.1145/1017074.1017078 dblp:conf/webdb/MurthyMD04 fatcat:5jujav7jdvcnvbwngnlnalqlu4

Stream processing of XPath queries with predicates

Ashish Kumar Gupta, Dan Suciu
2003 Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03  
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents.  ...  The solution we propose is to lazily construct a single deterministic pushdown automata, called the XPush Machine from the given XPath filters.  ...  Suciu was partially supported by the NSF CAREER Grant 0092955, NSF Grant IIS-0140493, a gift from Microsoft, and a Sloan Fellowship. Gupta was partially supported by the NSF CAREER Grant 0092955.  ... 
doi:10.1145/872808.872809 fatcat:lnfulpxg5nevvaatg5ctjnbt4i

Stream processing of XPath queries with predicates

Ashish Kumar Gupta, Dan Suciu
2003 Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03  
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents.  ...  The solution we propose is to lazily construct a single deterministic pushdown automata, called the XPush Machine from the given XPath filters.  ...  Suciu was partially supported by the NSF CAREER Grant 0092955, NSF Grant IIS-0140493, a gift from Microsoft, and a Sloan Fellowship. Gupta was partially supported by the NSF CAREER Grant 0092955.  ... 
doi:10.1145/872757.872809 dblp:conf/sigmod/GuptaS03 fatcat:yzxms67iajdvtg4cfx6guo6nve

SXPath

Ermelinda Oro, Massimo Ruffolo, Steffen Staab
2010 Proceedings of the VLDB Endowment  
The SXPath language is based on a combination of a spatial algebra with formal descriptions of XPath navigation, and maintains polynomial time combined complexity.  ...  Therefore, in this paper, we present Spatial XPath (SXPath), an extension of XPath 1.0 that allows for inclusion of spatial navigation primitives into the language resulting in conceptually simpler queries  ...  their XPath 1.0 based counterparts.  ... 
doi:10.14778/1921071.1921079 fatcat:unekzt4yazcjpl6xkywbjov5bq

Sequencing XML data and query twigs for fast pattern matching

Praveen Rao, Bongki Moon
2006 ACM Transactions on Database Systems  
Every XML document in the database can be transformed into a sequence of labels by Prüfer's method that constructs a one-to-one correspondence between trees and sequences.  ...  During query processing, a twig pattern is also transformed into its Prüfer sequence.  ...  processing twig queries in the PRIX system.  ... 
doi:10.1145/1132863.1132871 fatcat:2sfqruuiojhmtbs22dj4in7fmm

Load balancing parallelizing XML query processing based on shared cache chip multi-processor (CMP)
English

Zuo Wanli, Chen Yongheng, He Fengling, Chen Kerui
2011 Scientific Research and Essays  
Based on CMP, this paper proposes a novel and complete optimization framework on parallelism for XML database multithreaded query processing that strives for maximum resource utilization.  ...  Firstly, a set of algorithms for constructing the parallel sub-query plans and partitioning XML document by parallel sub-query plans are proposed.  ...  systems.  ... 
doi:10.5897/sre11.444 fatcat:peueh235djee7nycgjbyxeeqty

DescribeX: A Framework for Exploring and Querying XML Web Collections [article]

Flavio Rizzolo
2008 arXiv   pre-print
that provide DB-like functionality such as security, transaction processing, and native storage.  ...  DescribeX's light-weight approach of combining summaries with a file-at-a-time XPath processor can be a very competitive alternative, in terms of performance, to conventional fully-fledged XML query engines  ...  In this section we show how XPath queries are used to guide a refinement operation in the process of adapting an SD to a query.  ... 
arXiv:0807.2972v1 fatcat:gtyd6djo5fb6jgm6iblefcgunq

Cost-sensitive reordering of navigational primitives

Carl-Christian Kanne, Matthias Brantner, Guido Moerkotte
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
We present a method to evaluate path queries based on the novel concept of partial path instances.  ...  All I/O operations necessary for the evaluation of a path are isolated in a single operator, which may employ efficient I/O scheduling strategies such as sequential scans or asynchronous I/O.  ...  The l bi are non-full partial path instances with SL(l bi ) = SR(l bi ) = i, and NR(l bi ) = NL(l bi ) = b.  ... 
doi:10.1145/1066157.1066242 dblp:conf/sigmod/BrantnerKM05 fatcat:d272s23ofzhidncvwzw7qd6kei
« Previous Showing results 1 — 15 out of 453 results