Mikolaj Bojańczyk
Pawel Parys
ABSTRACT
We consider a fragment of XPath where attribute values can only be tested for equality. We show that for any fixed unary query in this fragment, the set of nodes that satisfy the query can be calculated in time linear in the document size.
- M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. In Principles of Database Systems, pages 10 -- 19, 2006. Google Scholar
Digital Library
- T. Colcombet. A combinatorial theorem for trees. In ICALP'07, Lecture Notes in Computer Science. Springer-Verlag, 2007. Google ScholarDigital Library
- T. Colcombet. Factorisation forests for infinite words. In FCT'07, 2007. Google ScholarDigital Library
- T. Colcombet. On Factorization Forests. Technical Report hal-00125047, Irisa Rennes, 2007.Google Scholar
- R. Pichler G. Gottlob, C. Koch. Xpath query evaluation: Improving time and space efficiency. In ICDE'03, pages 379--390, 2003.Google ScholarCross Ref
- R. Pichler G. Gottlob, C. Koch. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2):444--491, 2005. Google ScholarDigital Library
- C. Koch M. Benedikt. XPath leashed. ACM Computing Surveys. Google ScholarDigital Library
- F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002. Google ScholarDigital Library
- I. Simon. Factorization forests of finite height. Theoretical Computer Science, 72:65 -- 94, 1990. Google ScholarDigital Library
Index Terms
- XPath evaluation in linear time
Recommendations
Constructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
Conditional XPath
Special Issue: SIGMOD/PODS 2004XPath 1.0 is a variable free language designed to specify paths between nodes in XML documents. Such paths can alternatively be specified in first-order logic. The logical abstraction of XPath 1.0, usually called Navigational or Core XPath, is not ...
A Paraconsistent Linear-time Temporal Logic
Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time ...
Comments