Sciweavers

1125 search results - page 17 / 225
» Query Answering in Inconsistent Databases
Sort
View
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
14 years 1 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 2 months ago
Finding Top-k Approximate Answers to Path Queries
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...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICDE
2000
IEEE
138views Database» more  ICDE 2000»
14 years 9 months ago
Answering Regular Path Queries Using Views
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
VLDB
2004
ACM
96views Database» more  VLDB 2004»
14 years 1 months ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
14 years 9 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi