Sciweavers

756 search results - page 129 / 152
» SQL: From Traditional Databases to Big Data
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Sufficient Dimensionality Reduction for Visual Sequence Classification
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
Alex Shyr, Raquel Urtasun, Michael Jordan
CIDM
2007
IEEE
13 years 11 months ago
An Efficient Distance Calculation Method for Uncertain Objects
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
Lurong Xiao, Edward Hung
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 1 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu

Publication
502views
15 years 7 months ago
Spatio-Temporal Histograms
This paper presents a framework for building and continuously maintaining spatio-temporal histograms (ST-Histograms, for short). ST-Histograms are used for selectivity estimation o...
Hicham G. Elmongui, Mohamed F. Mokbel, Walid G. Ar...
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 7 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe