Sciweavers

61 search results - page 3 / 13
» Mining Violations to Relax Relational Database Constraints
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 6 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 6 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
CP
1998
Springer
13 years 10 months ago
Constraints for Object Recognition in Aerial Images - Handling of Unobserved Features
In this paper we will show how constraint solving methods can be applied for the recognition of buildings in aerial images. Object models are transformed to constraint representati...
Thomas H. Kolbe
DLOG
2008
13 years 8 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
KDD
1994
ACM
115views Data Mining» more  KDD 1994»
13 years 10 months ago
Extracting Domain Semantics for Knowledge Discovery in Relational Databases
Our research investigates howdomainsemantics are discovered froma relational database at a high level of automation. Thediscoveries are then represented as the extendedEntityRelat...
Roger H. L. Chiang, Terence M. Barron, Veda C. Sto...