Sciweavers

373 search results - page 9 / 75
» Querying Priced Information in Databases: The Conjunctive Ca...
Sort
View
SMC
2010
IEEE
124views Control Systems» more  SMC 2010»
14 years 8 months ago
SoftFacts: A top-k retrieval engine for ontology mediated access to relational databases
—We outline SoftFacts, an ontology mediated top-k information retrieval system over relational databases. An ontology layer is used to define (in terms of a OWL-QL like Semantic...
Umberto Straccia
112
Voted
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
14 years 13 days ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
PODS
2009
ACM
113views Database» more  PODS 2009»
15 years 10 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
SEBD
2004
143views Database» more  SEBD 2004»
14 years 11 months ago
The coDB Robust Peer-to-Peer Database System
In this paper we give an overview of the coDB semantically well-founded P2P DB system. A network of databases, possibly with different schemas, are interconnected by means of GLAV ...
Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenk...
73
Voted
EDBT
2008
ACM
122views Database» more  EDBT 2008»
15 years 9 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos