Sciweavers

107 search results - page 13 / 22
» Reasoning on regular path queries
Sort
View
DOCENG
2009
ACM
14 years 4 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...
GIS
2007
ACM
14 years 11 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICDE
2005
IEEE
124views Database» more  ICDE 2005»
14 years 11 months ago
XML Views as Integrity Constraints and their Use in Query Translation
The SQL queries produced in XML-to-SQL query translation are often unnecessarily complex, even for simple input XML queries. In this paper we argue that relational systems can do ...
Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F...
SIGMOD
2002
ACM
148views Database» more  SIGMOD 2002»
14 years 10 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 2 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...