1125 search results - page 116 / 225 » Query Answering in Inconsistent Databases |
102
click to vote
ICDT
1995
ACM
15 years 5 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
202
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
113
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Privacy preserving data publishing has attracted considerable research interest in recent years. Among the existing solutions, -differential privacy provides one of the strongest p...
117
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
117
click to vote
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...