2008
with FLWOR power and functional updates Abstract—The size of XML trees that can be processed by an XML API for declarative, in-memory processing is bound by the available memory. As a result, certain scenarios involving huge trees or many processes on large trees may fail to be feasible with (declarative) in-memory processing; lower-level APIs for XML parsing and unparsing must be reconsidered. As a remedy, we enable streaming for an in-memory XML API so that the convenient (declarative) programming model of the baseline API is preserved. Some restrictions are to be imposed on the streaming mode of the API, thereby achieving also predictability and controllability of the streaming power. The presented development uses LINQ to XML (formerly called XLinq) as the baseline API and works out one particular API extension for a streaming-enabled LINQ to XML API. As an important byproduct of this effort, functional updates are proposed, which complement the existing, imperative updates of the LINQ to XML API.
Cited by 0
Luc Segoufin, Victor Vianu · 2002
This paper investigates the on-line validation of streaming XML documents with respect to a DTD, under memory constraints. We first consider validation using constant memory, formalized by a finite-state automaton (FSA). We examine two flavors of the problem, depending on whether or not the XML document is assumed to be well-formed. The main results of the paper provide conditions on the DTDs under which validation of either flavor can be done using an FSA. For DTDs that cannot be validated by an FSA, we investigate two alternatives. The first relaxes the constant memory requirement by allowing a stack bounded in the depth of the XML document, while maintaining the deterministic, one-pass requirement. The second approach consists in refining the DTD to provide additional information that allows validation by an FSA.
Cited by 145
Maryam Shoaran, Alex Thomo · Theoretical Computer Science · 2011
Cited by 7
Peter Saint-Andre · IEEE Internet Computing · 2005
Jabber is an open alternative to closed instant messaging (IM) and presence services. At its core is the extensible messaging and presence protocol (XMPP), which defines how to stream XML content and is being used to build not only a large open IM network but also a wide range of XML applications. This article provides an overview of Jabber/XMPP protocols and technologies, as well as an introduction to XMPP-based applications.
Cited by 67
Cyril Concolato, Emmanouil Potetsianakis · SPIRE - Sciences Po Institutional REpository · 2015
International audience
Cited by 2
Oliver Becker · 2003
STX (Streaming Transformations for XML) ist eine Transformationssprache, die als schnelle und speicherschonende Alternative zu XSLT entworfen wurde. STX weist gewisse syntaktische Ahnlichkeiten zu XSLT auf, arbeitet jedoch auf einem Strom von SAX-Events und transformiert diesen unmittelbar in einen entsprechenden Ergebnis-Strom. STX-Transformationen konnen auf diese Weise unter anderem als SAX-Filter eingesetzt werden.
Cited by 18
Maryam Shoaran, Alex Thomo · Lecture notes in computer science · 2010
Cited by 1
Yunqi Michelle Zhang · 2006
XML is the preeminent data exchange format on the internet. An XML document can be seen as a rooted labeled tree, in which the children of each node are ordered. There are two ways we can query XML, namely XPath and XQuery(see introduction below). The major bottleneck for streaming XML queries is the large amount of
Cited by 0
Alain Frisch, Keisuke Nakano · 2007
This paper describes XStream, a Turing-complete programming language which allows the programmer to write XML transformations in a functional tree-processing style and have them evaluated in a streaming way: the output is produced incrementally while the input is still being parsed. The programmer does not need to care explicitly about buffering. We introduce the language, describe some techniques used in the implementation and present some performance results.
Cited by 15
Alain Frisch, Keisuke Nakano · 2008
This paper describes XStream, a Turing-complete programming language which allows the programmer to write XML transformations in a functional tree-processing style and have them evaluated in a streaming way: the output is produced incrementally while the input is still being parsed. The programmer does not need to care explicitly about buffering. We introduce the language, describe some techniques used in the implementation and present some performance results.
Cited by 0
Daniel Zinn, Shawn Bowers, Sven Köhler et al. · Journal of Computer and System Sciences · 2009
Cited by 28
Xiaoying Wu, Dimitri Theodoratos · The VLDB Journal · 2012
Cited by 22
Wook-shin Han, Haifeng Jiang, Howard Ho et al. · 2014
We study the problem of extracting flattened tuple data from stream-ing, hierarchical XML data. Tuple-extraction queries are essen-tially XML pattern queries with multiple extraction nodes. Their typical applications include mapping-based XML transformation and integrated (set-based) processing of XML and relational data. Holistic twig joins are known for the optimal matching of XML pattern queries on parsed/indexed XML data. Naı̈ve application of the holistic twig joins to streaming XML data incurs unneces-sary disk I/Os. We adapt the holistic twig joins for tuple-extraction queries on streaming XML with two novel features: first, we use the block-and-trigger technique to consume streaming XML data in a best-effort fashion without compromising the optimality of holistic matching; second, to reduce peak buffer sizes and overall running times, we apply query-path pruning and existential-match pruning techniques to aggressively filter irrelevant incoming data. We compare our solution with the direct competitor TurboXPath and other alternative approaches that use full-fledged query engines such as XQuery or XSLT engines for tuple extraction. The exper-iments using real-world XML data and queries demonstrated that our approach 1) outperformed its competitors by up to orders of magnitude, and 2) exhibited almost linear scalability. Our solution has been demonstrated extensively to IBM customers and will be included in customer engagement applications in healthcare. 1.
Cited by 0
Robert J. Clark · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · 2008
We present a novel solution to streaming XPath query evaluation, capable of supporting forward and reverse axes queries. We show a conversion of an XPath query to a Visibly Pushdown Automaton that preserves the semantics of the query. It was shown in [1] that such a construction results in an automation suitable for efficient streaming query evaluation. We also show that the constructed automaton is polynomial in size of the query when negated predicates are disallowed. 1
Cited by 1Open access
Yaw-huei Chen, Ming-chi Ho · 2008
Many XML query processing techniques have been proposed for processing structural joins. These algorithms find all element sets that satisfy the query pattern efficiently. However, sometimes we only need an aggregate value of the final result. Simpler algorithms are needed for processing the aggregate operations. Using start and end tags and a chain of linked stacks, we propose new algorithms for processing aggregate queries. Since no extra index structure is used in our method, the algorithm is suitable for processing streaming XML data. In addition, the experimental results indicate that the performance of our method is better than the index-based approach.
Cited by 0
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan · 2008
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents are naturally visibly pushdown with the Vpa pushing onto the stack on open-tags and popping the stack on close-tags. In this paper we demonstrate the power and ease visibly pushdown automata give in the design of streaming algorithms for XML documents. We study the problems of type-checking streaming XML documents against SDTD schemas, and the problem of typing tags in a streaming XML document according to an SDTD schema. For the latter problem, we consider both pre-order typing and post-order typing of a document, which dynamically determines types at open-tags and close-tags respectively as soon as they are met. We also generalize the problems of pre-order and post-order typing to prefix querying. We show that a deterministic Vpa yields an algorithm to the problem of answering in one pass the set of all answers to any query that has the property that a node satisfying the query is determined solely by the prefix leading to the node. All the streaming algorithms we develop in this paper are based on the construction of deterministic Vpas, and hence, for any fixed problem, the algorithms process each element of the input in constant time, and use space O(d), where d is the depth of the document.
Cited by 0
한욱신, Haifeng Jiang, Howard Ho et al. · Open Access System for Information Sharing (Pohang University of Science and Technology) · 2018
Cited by 0
rebecca · Zenodo (CERN European Organization for Nuclear Research) · 2020
CLICK THIS LINK TO WATCH >> https://allocine.live/movie/505379/rebecca.html\n\n\n\nGUARDA ORA: Link diretto streaming FILM online ITA === https://allocine.live/movie/505379/rebecca.html\n\nCOMPLETO@)) Rebecca Film Italiano HD Streaming Online VK DVDrip (COMPLETO 2015)\n\n\n\nLink Streaming Rebecca === https://allocine.live/movie/505379/rebecca.html\n\nsull'uscita: 2020-10-16 (121min)\n\n\n\n\n\nTagline :\n\n\n\nGeneri : Romance, Drama, Mystery, Thriller\n\n\n\nSocietà di produzione: Working Title Films, Big Talk Productions\n\n\n\nPaesi di produzione : United Kingdom\n\n\n\nSinossi :\n\nDopo una vorticosa storia d'amore, una ragazza ingenua sposa un vedovo facoltoso, ma nella dimora della sua famiglia l'ombra della moglie defunta è sempre presente.
Cited by 0Open access
2014
In prior work it has been shown that the design of scientific workflows can benefit from a collection-oriented mod-eling paradigm which views scientific workflows as pipelines of XML stream processors. In this paper, we present approaches for exploiting data parallelism in XML processing pipelines through novel compilation strategies to the Map-Reduce framework. Pipelines in our approach consist of sequences of processing steps that receive XML-structured data and produce, often through calls to “black-box ” (scientific) functions, modified (i.e., updated) XML structures. Our main contributions are (i) the development of a set of strategies for compiling scientific workflows, modeled as XML process pipelines, into parallel MapReduce networks, and (ii) a discussion of their advantages and trade-offs, based on a thorough experimental evaluation of the various translation strategies. Our evaluation uses the Hadoop MapReduce system as an implementation platform. Our results show that execution times of XML work-flow pipelines can be significantly reduced using our compilation strategies. These efficiency gains, together with the benefits of MapReduce (e.g., fault tolerance) make our approach ideal for executing large-scale, compute-intensive XML-based scientific workflows. 1.
Cited by 0
Joonho Kwon, Praveen Rao, Bongki Moon et al. · 2007
In recent years, publish-subscribe systems based on XML document filtering have received much intention in ubiquitous computing environments and Internet applications. Their common need is to process a large number of content against millions of user subscriptions. In this paper, we present the design of the FiST-P system for XML filtering system based on the sequence approach. The FiST-P system can process the structure matching and also handle value-based predicates in the twig patterns. The value-based predicates are handled differently according to their operators. We also described the cost for processing a twig pattern which includes value-based predicates.
Cited by 4