標(biāo)題: Titlebook: Data Warehousing and Knowledge Discovery; 7th International Co A Min Tjoa,Juan Trujillo Conference proceedings 2005 Springer-Verlag Berlin [打印本頁] 作者: 貪污 時(shí)間: 2025-3-21 17:29
書目名稱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 時(shí)間: 2025-3-21 23:11 作者: Adulterate 時(shí)間: 2025-3-22 00:54
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 時(shí)間: 2025-3-22 07:59 作者: 轉(zhuǎn)折點(diǎn) 時(shí)間: 2025-3-22 12:05
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 時(shí)間: 2025-3-22 15:46
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 時(shí)間: 2025-3-22 17:13 作者: 教義 時(shí)間: 2025-3-22 23:01
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 時(shí)間: 2025-3-23 01:45
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 時(shí)間: 2025-3-23 05:58 作者: octogenarian 時(shí)間: 2025-3-23 12:23 作者: reflection 時(shí)間: 2025-3-23 15:11
Martijn Kragtwijk,Anton Nijholt,Job Zwiersa warehousing research. This paper presents an incremental view maintenance approach based on schema transformation pathways. Our approach is not limited to one specific data model or query language, and would be useful in any data transformation/integration framework based on sequences of primitive schema transformations.作者: 新手 時(shí)間: 2025-3-23 20:18
Christopher Pramerdorfer,Martin Kampelnistrators to register changes. We describe a prototypical implementation of the concept which imports multidimensional structures from Hyperion Essbase data warehouses, compares these versions and generates a list of differences.作者: 籠子 時(shí)間: 2025-3-24 01:07
TzeWei Yeoh,Hernán E. Aguirre,Kiyoshi Tanakafinal database implementation structures such as tables, rows or columns. Finally, to show the benefit of our approach we implement the specified association rules on a commercial data warehouse management server.作者: 網(wǎng)絡(luò)添麻煩 時(shí)間: 2025-3-24 04:55 作者: 頌揚(yáng)本人 時(shí)間: 2025-3-24 06:51
Antoine Leclercq,S. Akkouche,E. Galin approach is the derivation of a materialized view built by merging the sources, and refers to a scenario of tightly coupled integration in which queries are performed against the view. We illustrate architecture and functionality of the tool and the underlying techniques that implement the two integration strategies.作者: Wallow 時(shí)間: 2025-3-24 13:04 作者: AMOR 時(shí)間: 2025-3-24 18:04 作者: 詳細(xì)目錄 時(shí)間: 2025-3-24 19:34 作者: 裂隙 時(shí)間: 2025-3-24 23:59
Extending the UML for Designing Association Rule Mining Models for Data Warehousesfinal database implementation structures such as tables, rows or columns. Finally, to show the benefit of our approach we implement the specified association rules on a commercial data warehouse management server.作者: 一加就噴出 時(shí)間: 2025-3-25 04:37 作者: circumvent 時(shí)間: 2025-3-25 10:58 作者: 口音在加重 時(shí)間: 2025-3-25 12:36 作者: A保存的 時(shí)間: 2025-3-25 17:04 作者: 領(lǐng)袖氣質(zhì) 時(shí)間: 2025-3-25 22:24
Using Schema Transformation Pathways for Incremental View Maintenancea warehousing research. This paper presents an incremental view maintenance approach based on schema transformation pathways. Our approach is not limited to one specific data model or query language, and would be useful in any data transformation/integration framework based on sequences of primitive schema transformations.作者: jeopardize 時(shí)間: 2025-3-26 03:42
Masaki Oshita,Akifumi Makinouchi(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).作者: Insubordinate 時(shí)間: 2025-3-26 08:04
Computer Animation and Simulation ’96. 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.作者: Myelin 時(shí)間: 2025-3-26 08:54
Computer Animation and Simulation 2000an index configuration composed by the indexes providing the best profit. These models evaluate the cost of accessing data using bitmap join indexes, and the cost of updating and storing these indexes.作者: Glaci冰 時(shí)間: 2025-3-26 12:41
Dominique Bechmann,Mehdi Elkouhenarameterized to fulfill data warehouse design needs. However, two levels of parameterization keep it relatively easy to tune. Finally, DWEB is implemented as a Java free software that can be interfaced with most existing relational database management systems. A sample usage of DWEB is also provided in this paper.作者: 樸素 時(shí)間: 2025-3-26 16:51 作者: 隼鷹 時(shí)間: 2025-3-27 00:54 作者: MENT 時(shí)間: 2025-3-27 02:53 作者: 喃喃訴苦 時(shí)間: 2025-3-27 08:25
https://doi.org/10.1007/978-3-7091-9435-5 transformation rules, edge-elimination, query-splitting and query-joining, to selectively materialize spatial views. We present a greedy algorithm for materialized view selection so that the local cost optimality can be achieved.作者: PIZZA 時(shí)間: 2025-3-27 12:55 作者: 一個(gè)攪動(dòng)不安 時(shí)間: 2025-3-27 16:04 作者: consent 時(shí)間: 2025-3-27 19:49
A Set of Quality Indicators and Their Corresponding Metrics for Conceptual Models of Data Warehouses design metrics in which each metric is part of a quality indicator we wish to measure. In this way, our method allows us to define metrics (theoretically validated) that are valid and perfectly measure our goals as they are defined together a set of well defined quality indicators.作者: 疏遠(yuǎn)天際 時(shí)間: 2025-3-27 23:01
Data Mapper: An Operator for Expressing One-to-Many Data Transformationss the optimization of data transformation expressions that combine filters expressed as standard relational operators with mappers. Furthermore, we identify the two main factors that influence the expected optimization gains.作者: 開始從未 時(shí)間: 2025-3-28 06:07 作者: 粘連 時(shí)間: 2025-3-28 07:41
Selective View Materialization in a Spatial Data Warehouse transformation rules, edge-elimination, query-splitting and query-joining, to selectively materialize spatial views. We present a greedy algorithm for materialized view selection so that the local cost optimality can be achieved.作者: 流出 時(shí)間: 2025-3-28 10:45
Data Warehousing and Knowledge Discovery978-3-540-31732-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 開始發(fā)作 時(shí)間: 2025-3-28 14:42
Sunil Hadap,Nadia Magnenat-Thalmannhe business processes transparent. In this paper, we extend a business process modeling diagram, namely the UML 2 activity diagram with a UML profile, which allows to make this relationship explicit. The model is tested with example business processes.作者: 手術(shù)刀 時(shí)間: 2025-3-28 21:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263201.jpg作者: 浪費(fèi)時(shí)間 時(shí)間: 2025-3-29 02:13
Christopher Pramerdorfer,Martin Kampeladapt it for the particularities of multidimensional data structures and extend it with a module for detection of node renamings. The result of these algorithms are so called editscripts consisting of transformation operations which, when executed in sequence, transform the earlier version to the la作者: Colonoscopy 時(shí)間: 2025-3-29 05:18
TzeWei Yeoh,Hernán E. Aguirre,Kiyoshi Tanakapresent a novel approach to accomplish the conceptual design of data warehouses together with data mining association rules, allowing us to implement the association rules defined in the conceptual modeling phase. The great advantage of our approach is that the association rules are specified from t作者: Inkling 時(shí)間: 2025-3-29 08:28
https://doi.org/10.1007/978-1-4613-1553-7siness intelligence applications. The incoming information can be classified generally in two types, the state-snapshot data and the state-change or event data usually called transactional data, which contains information about the change processes applied on the instances of information objects. On作者: acolyte 時(shí)間: 2025-3-29 13:10 作者: 偽善 時(shí)間: 2025-3-29 18:27 作者: CLEFT 時(shí)間: 2025-3-29 20:10
Computer Animation and Simulation 2000 more prohibitive when queries access very large volumes of data. To improve response time, data warehouse administrators generally use indexing techniques such as star join indexes or bitmap join indexes. This task is nevertheless complex and fastidious. Our solution lies in the field of data wareh作者: 不能逃避 時(shí)間: 2025-3-30 03:45 作者: 磨碎 時(shí)間: 2025-3-30 04:29
Dominique Bechmann,Mehdi Elkouhenperformance of the designed data warehouse must be assessed. This is usually done with the help of benchmarks, which can either help system users comparing the performances of different systems, or help system engineers testing the effect of various design choices. While the TPC standard decision su作者: 放縱 時(shí)間: 2025-3-30 08:54
Nadia Magnenat-Thalmann,Daniel Thalmann.e. conceptual modelling), the more willing we are in achieving a data warehouse (DW) of a high quality. From our point of view, there is a lack of more objective indicators (metrics) to guide the designer in accomplishing an outstanding model that allows us to guarantee the quality of these data wa作者: 泥土謙卑 時(shí)間: 2025-3-30 12:28 作者: 讓步 時(shí)間: 2025-3-30 16:40
Antoine Leclercq,S. Akkouche,E. GalinThis challenge is due to the several choices of partitioning star or snowflake schemas. Data partitioning is beneficial if and only if the fact table is fragmented based on the partitioning schemas of dimension tables. This may increase the number of fragments of the fact tables dramatically and mak作者: 縮影 時(shí)間: 2025-3-30 21:41
Martijn Kragtwijk,Anton Nijholt,Job Zwierstegrate data from distributed, heterogeneous data sources. Incrementally maintaining the integrated data is one of the problems being addressed in data warehousing research. This paper presents an incremental view maintenance approach based on schema transformation pathways. Our approach is not limi作者: 重力 時(shí)間: 2025-3-31 02:55
Antoine Leclercq,S. Akkouche,E. Galinat aim at leveraging the optimization capabilities of most RDBMSs. However, relational query languages like SQL are not expressive enough to specify an important class of data transformations that produce several output tuples for a single input tuple. This class of data transformations is required 作者: Narcissist 時(shí)間: 2025-3-31 07:13 作者: 胖人手藝好 時(shí)間: 2025-3-31 10:56
https://doi.org/10.1007/978-3-7091-9435-5, when compared to the traditional data warehouses, the cost of view materialization is more expensive with respect to both computation and space. This is because the spatial data is typically larger in size, which leads to high maintenance cost, and the spatial operations are more expensive to proc作者: 表主動(dòng) 時(shí)間: 2025-3-31 15:15
General Animation and Simulation Platformis still a fully materialized data cube. In this paper, we present an improved structure PMC, which allow us to partially materialize cells in a QC-Trees. There is a sharp contrast between our partially materialization algorithm and other extensively studied materialized view selection algorithms. I作者: glowing 時(shí)間: 2025-3-31 19:50
Ronen Barzel,John R. Hughes,Daniel N. Woodnly restricted to such applications but are also very useful in OLAP applications. In this paper, we introduce . queries in OLAP data cubes motivated by an online advertisement tracking data warehouse application. These queries aggregate information over a specified range and then return the ranked 作者: CRUDE 時(shí)間: 2025-4-1 01:31
Computer Animation and Simulation ’96ggregate list contains aggregates, calculated from the data stored in the database. In our approach, once created, the aggregates are materialized for further use. The list structure contains a table divided into pages. We present three different page-filling algorithms used when the list is browsed作者: 改良 時(shí)間: 2025-4-1 02:42
Extending UML 2 Activity Diagrams with Business Intelligence Objectshe business processes transparent. In this paper, we extend a business process modeling diagram, namely the UML 2 activity diagram with a UML profile, which allows to make this relationship explicit. The model is tested with example business processes.作者: 機(jī)密 時(shí)間: 2025-4-1 07:29 作者: 昏暗 時(shí)間: 2025-4-1 13:49 作者: 徹底明白 時(shí)間: 2025-4-1 17:04
A Tree Comparison Approach to Detect Changes in Data Warehouse Structuresadapt it for the particularities of multidimensional data structures and extend it with a module for detection of node renamings. The result of these algorithms are so called editscripts consisting of transformation operations which, when executed in sequence, transform the earlier version to the la
