261 search results - page 23 / 53 » An Optimization Technique for Answering Regular Path Queries |
110
click to vote
ESWS
2011
Springer
14 years 3 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
99
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
120
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
111
click to vote
COMPGEOM
1998
ACM
15 years 4 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
111
click to vote
STOC
2002
ACM
16 years 1 days ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...