Sciweavers

11862 search results - page 2254 / 2373
» Relative information completeness
Sort
View
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 9 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 9 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
PODS
2008
ACM
170views Database» more  PODS 2008»
14 years 9 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis
EDBT
2002
ACM
159views Database» more  EDBT 2002»
14 years 9 months ago
Cut-and-Pick Transactions for Proxy Log Mining
Web logs collected by proxy servers, referred to as proxy logs or proxy traces, contain information about Web document accesses by many users against many Web sites. This "man...
Wenwu Lou, Guimei Liu, Hongjun Lu, Qiang Yang
« Prev « First page 2254 / 2373 Last » Next »