Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 4,636 papers for “XML processing”

XML Processing

Bhim P. Upadhyaya · Undergraduate topics in computer science · 2017

Cited by 0

XML Processing

Allen Jones, Adam Freeman · Apress eBooks · 2010

AbstractOne of the most remarkable aspects of the Microsoft .NET Framework is its deep integration with XML. In many .NET applications, you won't even be aware you're using XML technologies—they'll just be used behind the scenes when you serialize a Microsoft ADO.NET DataSet, call a web service, or read application settings from a Web.config configuration file. In other cases, you'll want to work directly with the System.Xml namespaces to manipulate Extensible Markup Language (XML) data. Common XML tasks don't just include parsing an XML file, but also include validating it against a schema, applying an Extensible Stylesheet Language (XSL) transform to create a new document or Hypertext Markup Language (HTML) page, and searching intelligently with XPath.KeywordsXPath ExpressionConstructor ArgumentProduct CatalogPublic ClassItem ElementThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Cited by 0

XML Processing

Mark Pilgrim · Apress eBooks · 2004

This chapter and the next chapter are about XML processing in Python. It would be helpful if you already knew what an XML document looks like—that it's made up of structured tags to form a hierarchy of elements, and so on. If this doesn't make sense to you, there are many XML tutorials that can explain the basics (http://directory.google.com/Top/Computers/Data_Formats/Markup_Languages/XML/ Resources/FAOs,_Help,_and_ Tutorials/).KeywordsChild NodeCarriage ReturnText NodeAttr ObjectRegular StringThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Cited by 0

XML query processing

Daniela Florescu, Donald Kossmann · 2005

XQuery is starting to gain significant traction as a language for querying and transforming XML data. It is used in a variety of different products. Examples to date include XML database systems, XML document repositories, XML data integation, workflow systems, and publish and subscribe systems. In addition, XPath of which XQuery is a superset is used in various products such as Web browsers. Although the W3C XQuery specification has not yet attained Recommendation status, and the definition of the language has not entirely stabilized, a number of alternative proposals to implement and optimize XQuery have appeared both in industry and in the research community. Given the wide range of applications for which XQuery is applicable, a wide spectrum of alternative techniques have been proposed for XQuery processing. Some of these techniques are only useful for certain applications, other techniques are general-purpose. The goal of this seminar is to give an overview of the existing approaches to process XQuery expressions and to give details of the most important techniques. The presenters have experience from designing and building an industrial-strength XQuery engine [1]. The seminar will give details of that XQuery engine, but the seminar will also give extensive coverage of other XQuery engines and of the state of the art in the research community. The agenda for the seminar is as follows: (1) Introduction to XQuery: Motivation, XQuery data model, XQuery type system, Basic query language concepts; (2) Internal Representation of XML Data: DOM, SAX Events, TokenStream, Skeleton, Vertical Partitioning; (3) XQuery Algebras: XQuery Core vs. Relational Algebra, XQuery Algebras from Research Projects; (4) XPath Query Processing: Transducers, Automata, etc.; (5) XQuery Optimization: XML query equivalence, Rewrite Rules, Cost Models; (6) XQuery Runtime Systems: Iterator Models, Algorithms for XQuery Operators; (7) XML Indexes: Value and path indexes, others; (8) XQuery Products and Prototypes: XQRL/BEA, Galax, Saxon, etc. (as available); (9) Advanced Query Processing Techniques, Related Topics: Querying compressed XML data, Multi-Query Optimization, Publish/Subscribe and XML Information Filter, XML Data Integration, XML Updates, XML integrity constraints; (10) Summary.

Cited by 6

XML query processing

Χαράλαμπος Γεωργιάδης · National Archive of Doctoral Theses (National Documentation Center (Greece)) · 2010

Τα τελευταία χρόνια η XML υιοθετήθηκε σε μία σειρά εφαρμογών ηλεκτρονικού επιχειρείν, ως μοντέλο ανταλλαγής μηνυμάτων μεταξύ εφαρμογών και υπηρεσιών ιστού, ως μοντέλο δεδομένων για εφαρμογές ολοκλήρωσης δεδομένων αλλά και ως μοντέλο αποθήκευσης και επεξεργασίας δεδομένων εφαρμογών. Το θέμα της διδακτορικής διατριβής είναι η επεξεργασία επερωτήσεων σε ημιδομημένα δεδομένα, και συγκεκριμένα σε XML έγγραφα, και χωρίζεται σε δύο ενότητες. Η πρώτη ενότητα αφορά στην επεξεργασία επερωτήσεων σε XML δεδομένα, επερωτήσεις των οποίων η αποδοτικότητα είναι υψίστης σημασίας για συστήματα ολοκλήρωσης πληροφορίας που βασίζονται σε XML. Η δεύτερη ενότητα αφορά στην ανάπτυξη ενός ολοκληρωμένου βελτιστοποιητή βάσει εκτίμησης κόστους για XPath επερωτήσεις, ο οποίος βασίζεται σε μία λογική άλγεβρα για XPath επερωτήσεις και στον σχεδιασμό και υλοποίηση αποδοτικών φυσικών τελεστών για τους λογικές τελεστές που περιλαμβάνει η συγκεκριμένη άλγεβρα. Ειδικότερα, όσον αφορά την πρώτη ενότητα της διδακτορικής διατριβής, μελετήθηκε η σχετική υπάρχουσα βιβλιογραφία και αναπτύχθηκε μία μέθοδος επεξεργασίας επερωτήσεων σε ημιδομημένα δεδομένα, και συγκεκριμένα σε XML, η οποία χρησιμοποιεί την λειτουργικότητα των Σχεσιακών Συστημάτων Διαχείρισης Βάσεων Δεδομένων (ΣΣΔΒΔ). Η συγκεκριμένη ερευνητική δουλειά χωρίζεται σε δύο φάσης: στην πρώτη φάση αναπτύχθηκαν οι βασικές μέθοδοι και αλγόριθμοι για την επεξεργασία αυτού του είδους των επερωτήσεων ενώ στην δεύτερη οι μέθοδοι αυτοί βελτιώθηκαν και επεκτάθηκαν σημαντικά, τόσο σε σχέση με την αποδοτικότητά τους όσο σε σχέση με την λειτουργικότητα τους. Η δεύτερη ενότητα της διδακτορικής διατριβής επικεντρώθηκε στην δημιουργία ενός βελτιστοποιητή XPath επερωτήσεων που βασίζεται σε εκτίμηση κόστους. Συγκεκριμένα δημιουργήθηκε ένα πλαίσιο βελτιστοποίησης βασιζόμενης σε εκτίμηση κόστους και εκτέλεσης XPath επερωτήσεων και εκτιμήθηκε πειραματικά η αποδοτικότητα και η αποτελεσματικότητα του συστήματος. Το πλαίσιο βασίζεται σε μία λογική XPath άλγεβρα με πρωτότυπα χαρακτηριστικά και τελεστές καθώς και σε ένα σύνολο κανόνων μετασχηματισμού που μαζί επιτρέπουν να εκφραστούν αλγεβρικά πολλές υπάρχοντες αλλά και πρωτότυπες στρατηγικές επεξεργασίας XPath επερωτήσεων. Ένα σημαντικό συστατικό στοιχείο του πλαισίου είναι ένας ιδιαίτερα αποδοτικός αλγόριθμος επιλογής φυσικού πλάνου για XPath επερωτήσεις. Ο βελτιστοποιητής είναι ανεξάρτητος του φυσικού μοντέλου δεδομένων και του συστήματος αποθήκευσης αλλά και των διαθέσιμων υλοποιήσεων φυσικών τελεστών. Βασίζεται σε ένα σύνολο καλά ορισμένων API. Αναπτύχθηκαν διάφορες υλοποιήσεις των συγκεκριμένων API, που περιλαμβάνουν βασικές μεθόδους πρόσβασης δεδομένων, οι οποίες αντιστοιχούν σε διαφορετικά συστήματα αποθήκευσης XML δεδομένων. Παράλληλε υλοποιήθηκε ένα μεγάλο σύνολο από φυσικούς τελεστές, εκτιμητές στατιστικών και μοντέλα κόστους.

Cited by 0Open access

XML Stream Processing

Junichi Tatemura · IGI Global eBooks · 2010

This chapter reviews recent advances on stream XML query evaluation algorithms with stack-based encoding of intermediary data. Originally proposed for disk-resident XML, the stack-based architecture has been extended for streaming algorithms for both single and multiple query processing, ranging from XPath filtering to more complex XQuery. The key benefit of the stack-based architecture is its succinct encoding of partial query results, which can cause exponential enumeration if encoded naively. In addition, the chapter discusses opportunities to integrate benefits demonstrated in the reviewed work. For single-query processing, a sketch is given for an integrated algorithm, StreamTwig2Stack, that achieves all the benefits of existing algorithms in terms of functionality, time complexity, and buffer memory optimality.

Cited by 2

Efficient XML query processing

Ioana Manolescu · HAL (Le Centre pour la Communication Scientifique Directe) · 2009

The increase in popularity of the XML format for representing data brought multiple challenges to the data management community, in particular concerning efficient query evaluation. At the same time, XML technologies are highly connected to distribution and data exchange, leading to the need for new distributed data management techniques. We present some results of our work on issues related to XML query processing. We first introduce a new language for describing materialized views, called XML Access Modules or XAMs, and a complete approach for XQuery evaluation based on XAM-specified views. We then discuss optimization techniques for ActiveXML, a language for the integration of distributed XML streams. Finally, we discuss architectures for handling large volumes of XML data on distributed hash tables, in the KadoP and ViP2P platforms developed in the Gemo group.

Cited by 0Open access

XML Stream Query Processing

Mingzhu Wei, Ming Li, Elke A. Rundensteiner et al. · IGI Global eBooks · 2010

Stream applications bring the challenge of efficiently processing queries on sequentially accessible XML data streams. In this chapter, the authors study the current techniques and open challenges of XML stream processing. Firstly, they examine the input data semantics in XML streams and introduce the state-of-the-art of XML stream processing. Secondly, they compare and contrast the automatonbased and algebra-based techniques used in XML stream query execution. Thirdly, they study different optimization strategies that have been investigated for XML stream processing – in particular, they discuss cost-based optimization as well as schema-based optimization strategies. Lastly but not least, the authors list several key open challenges in XML stream processing.

Cited by 1

Foundations of XML Processing

Haruo Hosoya · Cambridge University Press eBooks · 2010

This is the first book that provides a solid theoretical account of the foundation of the popular data format XML. Part I establishes basic concepts, starting with schemas, tree automata and pattern matching, and concluding with static typechecking for XML as a highlight of the book. In Part II, the author turns his attention to more advanced topics, including efficient 'on-the-fly' tree automata algorithms, path- and logic-based queries, tree transformation, and exact typechecking. The author provides many examples of code fragments to illustrate features, and exercises to enhance understanding. Thus the book will be ideal for students and researchers whether just beginning, or experienced in XML research.

Cited by 12

On xml query processing

Wen‐Chi Hou, Zhewei Jiang · 2008

While XML (Extensible Markup Language) has been widely accepted as the standard for data storage, exchange, and integration over the Internet, The XML query processing becomes an interesting and challenging research topic in XML database research because of the rapidly emerging applications in XML query analysis and optimization. Finding all occurrences of the given query pattern is the core operation of XML query processing, which typically involves the tree-structured navigation and pattern matching. While currently proposed query processing algorithm, such as TwigStack, iTwigList and TJFast, provides an effective way to locate and retrieve the query matches, its time and space efficiency still needs more enhancement. The potentially large size of the intermediate results and the cumbersome path merging phase, which are two major deficiencies among the current algorithms, slow down the query estimation process. This kind of situation is further exacerbated in the online applications that require the evaluation process to be reported timely and flexibly. Our research improves XML query processing on two main aspects. First, we proposed a novel single-phase holistic query matching method, which elegantly avoids the generation and processing of intermediate results in traditional two-phase based algorithms. Without generating individual path matches as intermediate results, our method is able to avoid the storage and output/input of the individual path matches, and totally eliminate the potentially time-consuming merging operation. Experimental results demonstrate the applicability and advantages of our approach. On the other hand, we enhance the XML query processors with the ability to process queries progressively or incrementally and report partial or estimated results and progress of query evaluation continually. The methodology lays its foundation on sampling. We shed light on how effective samples can be drawn from semi-structured XML data, as opposed to flat-table relational data. Several innovative sampling schemes on XML data are designed. The progress of query processing is also reported continually. The proposed methodology advances XML query processing to the next level - being more flexible, responsive, user-informed, and user-controllable, to meet emerging needs and future challenges.

Cited by 0

Streamlining functional XML processing

Keisuke Nakano · 2005

Since an XML document has tree structure, XML transformations are ordinarily defined as recursive functions over the tree. Their direct implementation often causes inefficient memory usage because the input XML tree needs to be completely stored in memory. In contrast, XML stream processing can minimize the memory usage and execution time since it begins to output the transformation result before reading the whole input. However, it is much harder to write the XML transformation program in stream processing style than in functional style because stream processing requires stateful programming. In this paper, we propose a method for automatic derivation of XML stream processor from XML tree transformation written in functional style. We use an extension of macro forest transducers as a model of functional XML processing. Since an XML parser is represented by (infinitary) top-down tree transducer, the automatic derivation of XML stream processor is based on the composition of the top-down tree transducer and the extension of macro forest transducers. 1

Cited by 0

Structural XML Query Processing

Radim Bača, Michal Krátký, Irena Holubová et al. · ACM Computing Surveys · 2017

Since the boom in new proposals on techniques for efficient querying of XML data is now over and the research world has shifted its attention toward new types of data formats, we believe that it is crucial to review what has been done in the area to help users choose an appropriate strategy and scientists exploit the contributions in new areas of data processing. The aim of this work is to provide a comprehensive study of the state-of-the-art of approaches for the structural querying of XML data. In particular, we start with a description of labeling schemas to capture the structure of the data and the respective storage strategies. Then we deal with the key part of every XML query processing: a twig query join, XML query algebras, optimizations of query plans, and selectivity estimation of XML queries. To the best of our knowledge, this is the first work that provides such a detailed description of XML query processing techniques that are related to structural aspects and that contains information about their theoretical and practical features as well as about their mutual compatibility and general usability.

Cited by 13

Parallel processing XML documents

Kevin Lü, Yuanling Zhu, Wenjun Sun et al. · Proceedings - International Database Engineering and Applications Symposium · 2003

As Web applications are time vulnerable, the increasing size of XML documents and the complexity of evaluating XML queries pose new performance challenges to existing information retrieval technologies. This paper introduces a new approach for developing a purpose-built XML data management system to improve the system performance of a Web site with XML support by using parallel data processing techniques. To improve the system performance, we propose a parallelisation model for XML data processing, where the data storage strategies, data placement methods and query evaluation techniques have been studied. Other related issues are also presented.

Cited by 19

XML Processing in Java

Tapio Laitinen · Jyväskylä University Digital Archive (University of Jyväskylä) · 2005

Jyväskylä: University of Jyväskylä, 2005. 40 pages. Bachelor's Thesis. XML and Java have both gained considerable attention in last few years. In this thesis, different mechanisms for processing XML in general, and in Java in particular, are examined. These mechanisms are the three XML processing models, SAX, DOM and JDOM, and XSL Transformations (XSLT). The purpose of this thesis is to examine how XML processing or, more accurately, parsing, interpreting, and transforming is done in Java programming language. In addition to that, some evaluation of suitability of Java for this task is carried out. Complete code examples of different XML processing techniques are provided in appendices, but they are kept relatively short because extensive example applications are not appropriate for this thesis. Every processing model has its strengths and weaknesses which makes some of the models more suitable for a particular task than the others. This thesis helps in making a choice between the processing models by listing some of their benefits and drawbacks. All in all, Java seems to suit adequately for most XML processing applications.

Cited by 0

XML transformation flow processing

Jérôme Euzenat, Jérôme Euzenat, Laurent Tardif et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2001

The XSLT language is both complex in simple cases (such as attribute renaming or element hiding) and restricted in complex cases (complex information flows require processing multiple stylesheets). We propose a framework which improves on XSLT by providing simple-to-use and easyto-analyse macros for common basic transformation tasks. It also provides a superstructure for composing multiple stylesheets, with multiple input and output documents, in ways not accessible within XSLT. Having the whole transformation description in an integrated format allows better control and analysis of the complete transformation.

Cited by 0Open access