Titlebook: Database and Expert Systems Applications; 14th International C Vladimír Mařík,Werner Retschitzegger,Olga Štěpánko Conference proceedings 20

无可争辩

休战

XML Schemata Inference and Evolutionta. Our techniques are based on both an incremental clustering algorithm, which groups together the incoming XML documents according to their structural similarities, and a schema inference method, which maintains dynamically the schema of each detected document cluster. Our proposal takes into cons

nettle

Bulk Loading the MKL-Treemensional space by means of the MKL transform, a multi-space generalization of the KL transform. A local dimensionality reduction is performed at each node of the tree, allowing more selective features to be extracted and thus increasing the discriminating power of the index. The dynamical version o

繁殖

缩减了

Optimizing Both Cache and Disk Performance of R-Treestions of R-Trees optimized for CPU cache performance in main memory environments, where the node size is wider than the cache line size and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-Trees, disk-optim

GUMP

Frequency-Range

疏远天际

larder

Forehead-Lift