Sciweavers

107 search results - page 14 / 22
» Reasoning on regular path queries
Sort
View
PLANX
2007
13 years 11 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
FOCS
2009
IEEE
14 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
CL
1999
Springer
13 years 9 months ago
An execution scheme for interactive problem-solving in concurrent constraint logic programming languages
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
Jimmy Ho-Man Lee, Ho-fung Leung
ICALP
2000
Springer
14 years 1 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
INEX
2004
Springer
14 years 3 months ago
If INEX Is the Answer, What Is the Question?
The INEX query languages allow the extraction of fragments from selected documents. This power is not much used in INEX queries. The paper suggests reasons why, and considers which...
Richard A. O'Keefe