Sciweavers

59 search results - page 2 / 12
» Efficient Implementation of an Optimal Interpolator for Larg...
Sort
View
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 6 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
13 years 9 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
SSD
1997
Springer
140views Database» more  SSD 1997»
13 years 9 months ago
Spatial Data Mining: A Database Approach
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
PVLDB
2008
182views more  PVLDB 2008»
13 years 4 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
KDD
2000
ACM
142views Data Mining» more  KDD 2000»
13 years 9 months ago
Automating exploratory data analysis for efficient data mining
Having access to large data sets for the purpose of predictive data mining does not guarantee good models, even when the size of the training data is virtually unlimited. Instead,...
Jonathan D. Becher, Pavel Berkhin, Edmund Freeman