Sciweavers

8763 search results - page 178 / 1753
» Querying Database Knowledge
Sort
View
AAAI
2007
15 years 6 months ago
Approximate Query Answering in Locally Closed Databases
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
Alvaro Cortés-Calabuig, Marc Denecker, Ofer...
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 5 months ago
QPIAD: Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Hemal Khatri, Jianchun Fan, Yi Chen, Subbarao Kamb...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
14 years 7 months 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
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 5 months ago
Optimizing SQL Queries over Text Databases
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
Alpa Jain, AnHai Doan, Luis Gravano
DASFAA
2005
IEEE
153views Database» more  DASFAA 2005»
15 years 10 months ago
FASST Mining: Discovering Frequently Changing Semantic Structure from Versions of Unordered XML Documents
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
Qiankun Zhao, Sourav S. Bhowmick