Sciweavers

995 search results - page 169 / 199
» Optimization of Complex Nested Queries in Relational Databas...
Sort
View
142
Voted
VLDB
1999
ACM
145views Database» more  VLDB 1999»
15 years 6 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
151
Voted
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 7 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
PVLDB
2008
84views more  PVLDB 2008»
15 years 1 months ago
When is it time to rethink the aggregate configuration of your OLAP server?
OLAP servers based on relational backends typically exploit materialized aggregate tables to improve response times of complex analytical queries. One of the key problems in this ...
Katja Hose, Daniel Klan, Matthias Marx, Kai-Uwe Sa...
FOCS
2004
IEEE
15 years 5 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
ICCV
2009
IEEE
14 years 11 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu