Sciweavers

148 search results - page 22 / 30
» Query Selectivity Estimation for Uncertain Data
Sort
View
ACTA
2006
104views more  ACTA 2006»
13 years 7 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 7 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
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
EDBT
2006
ACM
129views Database» more  EDBT 2006»
14 years 7 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 8 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...