Sciweavers

145 search results - page 4 / 29
» Lineage processing over correlated probabilistic databases
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 11 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
EDBT
2009
ACM
124views Database» more  EDBT 2009»
13 years 11 months ago
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
Bruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Che...
DEXA
2003
Springer
149views Database» more  DEXA 2003»
14 years 1 months ago
Capturing Uncertainty in Spatial Queries over Imprecise Data
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
Xingbo Yu, Sharad Mehrotra
VLDB
2007
ACM
141views Database» more  VLDB 2007»
14 years 8 months ago
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...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...
ICDT
2011
ACM
242views Database» more  ICDT 2011»
12 years 12 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