Sciweavers

610 search results - page 7 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
SIGMOD
2001
ACM
115views Database» more  SIGMOD 2001»
15 years 10 months ago
Efficient Evaluation of XML Middle-ware Queries
We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query la...
Mary F. Fernandez, Atsuyuki Morishima, Dan Suciu
TKDE
2008
234views more  TKDE 2008»
14 years 9 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 4 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
ICDT
2009
ACM
109views Database» more  ICDT 2009»
15 years 10 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
15 years 9 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch