261 search results - page 26 / 53 » An Optimization Technique for Answering Regular Path Queries |
PR
2007
14 years 11 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
111
click to vote
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
107
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
122
click to vote
DLOG
2011
14 years 3 months ago
2011
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
205
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...