Sciweavers

610 search results - page 6 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
14 years 16 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
EDBT
2006
ACM
121views Database» more  EDBT 2006»
15 years 9 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
VLDB
2007
ACM
95views Database» more  VLDB 2007»
15 years 10 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 4 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
MOBIDE
2006
ACM
15 years 3 months ago
Evaluation of probabilistic queries in moving objects databases
The representation of moving objects in spatial database systems has become an important research topic in recent years. As it is not realistic to track and store the location of ...
Talel Abdessalem, Laurent Decreusefond, José...