Sciweavers

5221 search results - page 159 / 1045
» An On-line Problem Database
Sort
View
112
Voted
CORR
2002
Springer
187views Education» more  CORR 2002»
14 years 10 months ago
Answer Sets for Consistent Query Answering in Inconsistent Databases
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 5 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
JUCS
2010
135views more  JUCS 2010»
14 years 4 months ago
Internal Representation of Database Views
: Although a database view embodies partial information about the state of the main schema, the state of the view schema is a quotient (and not a subset) of the state of the main s...
Stephen J. Hegner
110
Voted
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 1 months ago
SmartInt: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information ab...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...
SIGMOD
2001
ACM
115views Database» more  SIGMOD 2001»
15 years 10 months ago
Efficient Evaluation of XML Middle-ware Queries
We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query la...
Mary F. Fernandez, Atsuyuki Morishima, Dan Suciu