Sciweavers

37 search results - page 5 / 8
» Containment and Equivalence for an XPath Fragment
Sort
View
CIKM
2008
Springer
13 years 9 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 4 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
ICALP
2005
Springer
14 years 29 days ago
Idealized Algol with Ground Recursion, and DPDA Equivalence
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiew...
FSTTCS
2007
Springer
13 years 11 months ago
Efficient and Expressive Tree Filters
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
Michael Benedikt, Alan Jeffrey
DIAGRAMS
2010
Springer
13 years 7 months ago
Fragments of Spider Diagrams of Order and Their Relative Expressiveness
Abstract. Investigating the expressiveness of a diagrammatic logic provides insight into how its syntactic elements interact at the semantic level. Moreover, it allows for comparis...
Aidan Delaney, Gem Stapleton, John Taylor, Simon J...