Sciweavers

2883 search results - page 176 / 577
» Algorithms for merged indexes
Sort
View
KDD
1998
ACM
131views Data Mining» more  KDD 1998»
15 years 10 months ago
Interestingness-Based Interval Merger for Numeric Association Rules
We present an algorithm for mining association rules from relational tables containing numeric and categorical attributes. The approach is to merge adjacent intervals of numeric v...
Ke Wang, Soon Hock William Tay, Bing Liu
SMA
2008
ACM
135views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Isosurface extraction and interpretation on very large datasets in geophysics
In order to deal with the heavy trend in size increase of volumetric datasets, research in isosurface extraction has focused in the past few years on related aspects such as surfa...
Guilhem Dupuy, Bruno Jobard, Sebastien Guillon, No...
PDIS
1993
IEEE
15 years 10 months ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
DEXA
2008
Springer
117views Database» more  DEXA 2008»
15 years 7 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
JCST
2006
65views more  JCST 2006»
15 years 6 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos