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...
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...
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...
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...
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...