Titlebook: Advances in Database Technology - EDBT ‘98; 6th International Co Hans-J?rg Schek,Gustavo Alonso,Isidro Ramos Conference proceedings 1998 Sp

傲慢物

An evaluation of alternative disk scheduling techniques in support of variable bit rate continuous 978-3-642-58337-7

Chagrin

痛苦一生

道學(xué)氣

暫時(shí)過(guò)來(lái)

Complex aggregation at multiple granularities,ion taking place via an information system, such an agreement is called a "grammar" or a "conceptual schemea" of this information system. "Information analysis" is that field and also that phase of development of an information system in which the grammar or the conceptual schemea of the information

tattle

Jacob W. P. Keeling,Rita K. Millerch is used only for maintaining and updating a new data structure we designed, the maximum frequent candidate set. It is used to prune candidates in the bottom-up search. A very important characteristic of the algorithm is that it does not require explicite examination of every frequent itemset. The

悠然

Jongkuen Lee,David Dominguez-Solaperiments demonstrate that incremental generalization can be performed efficiently at a low degree of overly generalization. Furthermore, an optimal cardinality for the sets of updates can be determined experimentally yielding the best efficiency.

箴言

thrombus

Tong Li,Yannick Gachet,Sylvie Tournier%-quantile, results in a bad query performance in high-dimensional spaces. Therefore, we use a sophisticated unbalanced split strategy, which leads to a much better space partitioning. An exhaustive experimental evaluation shows that our technique clearly outperforms both classic index construction

危機(jī)

Eishi Noguchi,Mariana C. Gadaletaportant because, as we show, existing datacube evaluation algorithms can be used to compute multi-feature cubes that are distributive or algebraic, without any increase in I/O complexity. We evaluate the CPU performance of computing multi-feature cubes using the datacube evaluation algorithm of Ross