Sciweavers

3341 search results - page 308 / 669
» On Bounded Queries and Approximation
Sort
View
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
16 years 1 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
DAGSTUHL
2006
15 years 8 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
CORR
2011
Springer
175views Education» more  CORR 2011»
15 years 1 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...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
14 years 10 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 8 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...