Sciweavers

498 search results - page 45 / 100
» Estimating Robust Query Models with Convex Optimization
Sort
View
TKDE
2012
487views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
13 years 12 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer
JMLR
2008
209views more  JMLR 2008»
13 years 7 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
SIGMOD
1999
ACM
127views Database» more  SIGMOD 1999»
14 years 3 days ago
An Adaptive Query Execution System for Data Integration
Query processing in data integration occurs over network-bound, autonomous data sources. This requires extensions to traditional optimization and execution techniques for three re...
Zachary G. Ives, Daniela Florescu, Marc Friedman, ...