On the memory requirements of XPath evaluation over XML streams
TLDR
This paper presents a general lower bound technique, which given a query, specifies the minimum amount of memory that any algorithm evaluating the query on a stream would need to incur, and states the lower bounds in terms of new graph-theoretic properties of queries.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2007-05-01 and is currently open access. It has received 51 citations till now. The article focuses on the topics: XPath & Query language.read more
Citations
More filters
Journal ArticleDOI
XPath leashed
Michael Benedikt,Christoph Koch +1 more
TL;DR: This survey gives an overview of formal results on the XML query language XPath and its fragments compared to other formalisms for querying trees, algorithms, and complexity bounds for evaluation ofXPath queries, as well as static analysis of XPath queries.
Proceedings ArticleDOI
An Efficient XPath Query Processor for XML Streams
TL;DR: This paper uses a compact data structure to encode pattern matches rather than storing them explicitly and proposes a polynomial time streaming algorithm to evaluate XPath queries by probing the data structure in a lazy fashion.
Proceedings ArticleDOI
Combined Static and Dynamic Analysis for Effective Buffer Minimization in Streaming XQuery Evaluation
TL;DR: In this article, the authors propose a buffer management scheme which combines static and dynamic analysis to keep main memory consumption low, which relies on a technique that is called active garbage collection and which actively purges buffers at runtime based on the current status of query evaluation.
Proceedings ArticleDOI
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
M. Shalem,Ziv Bar-Yossef +1 more
TL;DR: A first large-scale study of the space complexity of evaluating XPath queries over indexed XML documents shows the space to depend on three factors: whether the query is a path or a tree; the types of axes occurring in the query and their occurrence pattern; and the mode of query evaluation.
Proceedings ArticleDOI
Randomized computations on large data sets: tight lower bounds
TL;DR: There exist queries in XQuery, XPath, and relational algebra, such that any (randomized) Las Vegas algorithm that evaluates these queries must perform Ω(logN) random accesses to external memory devices, provided that the internal memory size is at most O(4√N/logN), where N denotes the size of the input data.
References
More filters
Journal Article
Extensible Markup Language (XML).
TL;DR: XML is an extremely simple dialect of SGML which is completely described in this document, to enable generic SGML to be served, received, and processed on the Web in the way that is now possible with HTML.
Proceedings ArticleDOI
Storing and querying ordered XML using a relational database system
Igor Tatarinov,Stratis D. Viglas,Kevin Scott Beyer,Jayavel Shanmugasundaram,Eugene J. Shekita,Chun Zhang +5 more
TL;DR: This paper shows that XML's ordered data model can indeed be efficiently supported by a relational database system, and proposes three order encoding methods that can be used to represent XML order in the relational data model, and also proposes algorithms for translating ordered XPath expressions into SQL using these encoding methods.
XQuery 1.0 : An XML Query Language
TL;DR: XML is a versatile markup language, capable of labeling the information content of diverse data sources including structured and semi-structured documents, relational databases, and object repositories.
Book
Communication Complexity
Eyal Kushilevitz,Noam Nisan +1 more
TL;DR: This chapter surveys the theory of two-party communication complexity and presents results regarding the following models of computation: • Finite automata • Turing machines • Decision trees • Ordered binary decision diagrams • VLSI chips • Networks of threshold gates.
XML Path Language (XPath) Version 1.0
Steven J. DeRose,Inso Corp +1 more
TL;DR: XPath is a language for addressing parts of an XML document, designed to be used by both XSLT and XPointer, and has been endorsed by the Director as a W3C Recommendation.