Sciweavers

2135 search results - page 149 / 427
» Database Paper - The IRI Marketing Data Set
Sort
View
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...
TOIS
2002
97views more  TOIS 2002»
15 years 5 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ICDE
2009
IEEE
141views Database» more  ICDE 2009»
16 years 7 months ago
Privacy Preserving Publishing on Multiple Quasi-identifiers
In some applications of privacy preserving data publishing, a practical demand is to publish a data set on multiple quasi-identifiers for multiple users simultaneously, which poses...
Jian Pei, Yufei Tao, Jiexing Li, Xiaokui Xiao
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 6 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
16 years 11 hour ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...