390 search results - page 4 / 78 » Approximate Query Answering in Locally Closed Databases |
FQAS
2009
Springer
14 years 5 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
JIIS
2008
13 years 11 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
VLDB
2001
ACM
14 years 11 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
TODS
2008
13 years 10 months ago
2008
FOIKS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...