Sciweavers

525 search results - page 24 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 3 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
IS
2007
14 years 11 months ago
Evaluation of probabilistic queries over imprecise data in constantly-evolving environments
Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a database system, and a...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
EDBT
2009
ACM
115views Database» more  EDBT 2009»
15 years 6 months ago
Top-k dominating queries in uncertain databases
Due to the existence of uncertain data in a wide spectrum of real applications, uncertain query processing has become increasingly important, which dramatically differs from handl...
Xiang Lian, Lei Chen 0002
ESWS
2008
Springer
15 years 1 months ago
Foundations of RDF Databases
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
Claudio Gutierrez
ER
2010
Springer
164views Database» more  ER 2010»
14 years 9 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone