Sciweavers

53 search results - page 9 / 11
» Preferential Regular Path Queries
Sort
View
DOCENG
2009
ACM
14 years 5 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
SIGMOD
2002
ACM
148views Database» more  SIGMOD 2002»
14 years 11 months ago
Accelerating XPath location steps
This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all...
Torsten Grust
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 4 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
PLANX
2007
14 years 8 days 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 5 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