Titlebook: Data Warehousing and Knowledge Discovery; 7th International Co A Min Tjoa,Juan Trujillo Conference proceedings 2005 Springer-Verlag Berlin

貪污

書目名稱Data Warehousing and Knowledge Discovery影響因子(影響力)




書目名稱Data Warehousing and Knowledge Discovery影響因子(影響力)學(xué)科排名




書目名稱Data Warehousing and Knowledge Discovery網(wǎng)絡(luò)公開度




書目名稱Data Warehousing and Knowledge Discovery網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Data Warehousing and Knowledge Discovery被引頻次




書目名稱Data Warehousing and Knowledge Discovery被引頻次學(xué)科排名




書目名稱Data Warehousing and Knowledge Discovery年度引用




書目名稱Data Warehousing and Knowledge Discovery年度引用學(xué)科排名




書目名稱Data Warehousing and Knowledge Discovery讀者反饋




書目名稱Data Warehousing and Knowledge Discovery讀者反饋學(xué)科排名

MAOIS

Adulterate

Progressive Ranking of Range Aggregateshms is based on both ranking and cumulative information to progressively rank aggregation results. Furthermore we empirically evaluate our techniques and the experimental results show that the query cost is improved significantly.

FLUSH

轉(zhuǎn)折點(diǎn)

Ronen Barzel,John R. Hughes,Daniel N. Woodhms is based on both ranking and cumulative information to progressively rank aggregation results. Furthermore we empirically evaluate our techniques and the experimental results show that the query cost is improved significantly.

NICE

Conference proceedings 2005different relevant and still unsolved research problems, such as the modelling of ETL processes and integration problems, designing OLAP technologies from XML do- ments, modelling data warehouses and data mining applications together, impro- ments in query processing, partitioning and implementation

NICE

教義

Graph-Based Modeling of ETL Activities with Multi-level Transformations and Updates(c) transforming the graph to allow zoom-in/out at multiple levels of abstraction (i.e., passing from the detailed description of the graph at the attribute level to more compact variants involving programs, relations and queries and vice-versa).

Flatter

On Efficient Storing and Processing of Long Aggregate Lists. We present test results and we use them for estimating the best combination of the configuration parameters: number of pages, size of a single page and number of available database connections. The Materialized Aggregate List can be applied on every aggregation level in various indexing structures, such as, an aR-tree.

lactic