929 search results - page 10 / 186 » Answering imprecise database queries: a novel approach |
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...
OWLED
2008
13 years 9 months ago
2008
We study conjunctive query answering in the description logic EL, the core of the designated OWL2-EL profile of OWL2. In particular, we present an approach that allows the use of c...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...