Sciweavers

242 search results - page 15 / 49
» Approximate substring selectivity estimation
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 7 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
14 years 1 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki
TASE
2008
IEEE
13 years 7 months ago
Sensor Selection in Arbitrary Dimensions
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
Volkan Isler, Malik Magdon-Ismail
TSP
2008
102views more  TSP 2008»
13 years 7 months ago
Spatially Adaptive Estimation via Fitted Local Likelihood Techniques
Abstract--This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modeling of observations and estimated signals. T...
Vladimir Katkovnik, Vladimir Spokoiny