28 search results - page 4 / 6 » Preference-Driven Querying of Inconsistent Relational Databa... |
LPNMR
2005
Springer
13 years 11 months ago
2005
Springer
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
GIS
2009
ACM
13 years 3 months ago
2009
ACM
We propose a location-based query anonymization technique, LBS (k,T)-anonymization, that ensures anonymity of user's query in a specific time window against what we call know...
CISM
1993
13 years 9 months ago
1993
The weak instance model is a framework to consider the relations in a database as a whole, regardless of the way attributes are grouped in the individual relations. Queries and upd...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...