標(biāo)題: Titlebook: Data Warehousing and Knowledge Discovery; First International Mukesh Mohania,A Min Tjoa Conference proceedings 1999 Springer-Verlag Berlin [打印本頁] 作者: 復(fù)雜 時間: 2025-3-21 17:14
書目名稱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é)科排名
作者: 褲子 時間: 2025-3-21 22:31 作者: arrhythmic 時間: 2025-3-22 01:40
Compressed Datacubes for Fast OLAP Applicationsith expected value and variance) of range query answers and compare the accuracies of their estimations. We finally present a comparative analysis with other recently proposed techniques; the results confirm the effectiveness of our approach.作者: HAIL 時間: 2025-3-22 07:45 作者: countenance 時間: 2025-3-22 12:08 作者: 單調(diào)女 時間: 2025-3-22 13:03 作者: 單調(diào)女 時間: 2025-3-22 17:45 作者: Herbivorous 時間: 2025-3-22 23:27 作者: 一罵死割除 時間: 2025-3-23 02:41
Genetic Algorithm for Materialized View Selection in Data Warehouse Environmentsized is challenging. Several heuristic algorithms have been proposed in the past to tackle with this problem. In this paper, we propose a completely different approach, Genetic Algorithm, to choose materialized views and demonstrate that it is practical and effective compared with heuristic approaches.作者: 歡樂中國 時間: 2025-3-23 08:50 作者: 使厭惡 時間: 2025-3-23 11:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263343.jpg作者: Acetaminophen 時間: 2025-3-23 17:31 作者: 草率女 時間: 2025-3-23 19:50
978-3-540-66458-1Springer-Verlag Berlin Heidelberg 1999作者: 細(xì)查 時間: 2025-3-24 00:15 作者: aptitude 時間: 2025-3-24 03:26
https://doi.org/10.1007/978-1-4939-1705-1ot represent the semantics and operations of multi-dimensional data adequately. Due to the hidden semantics, it is difficult to efficiently address the problems of view design. Secondly, as we move up to higher levels of summary data (multiple complex aggregations), SQL queries do not portray the in作者: Foregery 時間: 2025-3-24 07:01
Complex Systems Studies and Terrorismreuse the code. By substituting some parts of wrapper modules, we can reuse the wrapper on a different information source. For each information source, we also deveIop a toolkit to generate a corresponding monitor. By the method, we can reduce much effort to code the monitor component. We also devel作者: 鬼魂 時間: 2025-3-24 11:18
https://doi.org/10.1007/978-1-349-19277-9ng) systems. While most data analysis operations can be executed on that basis from a functional point of view, the representation requirements of applications in the SSDB (Scientific&Statistical DataBase) area by far exceed the means typically provided by OLAP systems. In the first part of the pape作者: 知道 時間: 2025-3-24 17:58 作者: Neutropenia 時間: 2025-3-24 20:58 作者: 兇兆 時間: 2025-3-25 02:16 作者: amenity 時間: 2025-3-25 06:58 作者: RAGE 時間: 2025-3-25 09:45 作者: Gerontology 時間: 2025-3-25 15:26
The Outward Transit Pass Questionnsistent probing it is possible to have the power of SQL view queries with multiset semantics, and at the same time have available a spectrum of concurrency from none at all as in previously proposed solutions to the maximum concurrency obtained by issuing all probes in parallel. We then show how op作者: drusen 時間: 2025-3-25 16:48
The Outward Transit Pass Questionized is challenging. Several heuristic algorithms have been proposed in the past to tackle with this problem. In this paper, we propose a completely different approach, Genetic Algorithm, to choose materialized views and demonstrate that it is practical and effective compared with heuristic approach作者: 燈泡 時間: 2025-3-25 21:18
The Outward Transit Pass Questionhese collections usually define a series of views or temporary tables that constitute . to the question, and finally use an SQL query on those views/tables to get the final answer. We argue that this situation poses problems for traditional approaches to optimization. We show that many of these coll作者: Nebulizer 時間: 2025-3-26 00:33 作者: 食物 時間: 2025-3-26 05:24 作者: Dedication 時間: 2025-3-26 08:44
Nancy E. Bockstael,Kathleen Bellta mining. A similarity measure structures a data set in a general, but weak sense. If the elements are part of a high-dimensional host space (primary space), for instance a data warehouse cube, the resulting structure doesn’t necessarily reflect the real dimension of the embedded (secondary) space.作者: ostensible 時間: 2025-3-26 15:33
https://doi.org/10.1007/978-94-015-9200-0uirements in these dynamic application areas are subject to frequent changes. This implies frequent structural changes of the database schema. In this paper, we present a formal framework to describe evolutions of multidimensional schemas and their effects on the schema and on the instances. The fra作者: Devastate 時間: 2025-3-26 19:43 作者: 統(tǒng)治人類 時間: 2025-3-26 22:43 作者: 人類學(xué)家 時間: 2025-3-27 04:07
Data Warehousing and Knowledge Discovery978-3-540-48298-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 陳腐思想 時間: 2025-3-27 05:56
The Outward Transit Pass Questionized is challenging. Several heuristic algorithms have been proposed in the past to tackle with this problem. In this paper, we propose a completely different approach, Genetic Algorithm, to choose materialized views and demonstrate that it is practical and effective compared with heuristic approaches.作者: 沙草紙 時間: 2025-3-27 11:45
https://doi.org/10.1057/9781403938367In this work, we discuss issues about designing data in warehouses and make clear why meta objects are really important during designing data warehouse process. Our key ideas are . and .. We harmonize objects and meta objects seamlessly in the design process by these ideas.We discuss an experimental prototype system called . (HOME).作者: Vulnerary 時間: 2025-3-27 14:13 作者: 胖人手藝好 時間: 2025-3-27 18:56 作者: OVERT 時間: 2025-3-27 23:07
Dynamic Data Warehouse Design search problem. We design incremental algorithms for selecting a set of new views to additionally materialize in the DW that fits in the extra space, allows a complete rewriting of the new queries over the materialized views and minimizes the combined new query evaluation and new view maintenance cost.作者: 在駕駛 時間: 2025-3-28 05:32 作者: 豐滿中國 時間: 2025-3-28 08:46 作者: 憤怒事實(shí) 時間: 2025-3-28 14:05
On Schema Evolution in Multidimensional Databasesmework is based on a formal conceptual description of a multidimensional schema and a corresponding schema evolution algebra. Thus, the approach is independent of the actual implementation (e.g. MOLAP or ROLAP). We also describe how the algebra enables a tool supported environment for schema evolution.作者: obstinate 時間: 2025-3-28 14:41 作者: 怒目而視 時間: 2025-3-28 20:48 作者: Obedient 時間: 2025-3-29 02:10 作者: Lineage 時間: 2025-3-29 06:00 作者: 擁擠前 時間: 2025-3-29 10:20
Law and Public Order after the Restorationcalable and flexible profiling engine. We define profiles by probability distributions, and compute them using OLAP operations on multidimensional and multilevel data cubes. Our experience has revealed the simplicity and power of OLAP-based solutions to scalable profiling and pattern analysis.作者: Palpable 時間: 2025-3-29 14:06 作者: 舞蹈編排 時間: 2025-3-29 16:59
The Outward Transit Pass Questionrrency from none at all as in previously proposed solutions to the maximum concurrency obtained by issuing all probes in parallel. We then show how optimization of the probing process can be used to select various degrees of concurrency for the desired tradeoffs of concurrency against processing cost and message size.作者: climax 時間: 2025-3-29 23:42
Kenneth E. McConnell,Ivar E. Strand show that in the presence of hierarchies in a multidimensional environment an efficient algorithm can be given to construct - or to derive - an aggregate from one or more overlapping materialized aggregate partitions (.).作者: Accede 時間: 2025-3-30 01:47 作者: 總 時間: 2025-3-30 05:20 作者: inconceivable 時間: 2025-3-30 11:38
https://doi.org/10.1057/9780230596610ing is adopted to ensure that compression/decompression overheads are limited, and that data reorganisations are of controlled complexity and can be carried out incrementally. The basic architecture is described and experimental results on the TPC-D and other datasets show the performance of our system.作者: ureter 時間: 2025-3-30 14:34
Nancy E. Bockstael,Kathleen Belle. However, it helps to reduce storage and computing efforts. Additionally, the secondary space itself reveals much about the set’s structure and can facilitate data mining. We make a proposal for adding the property of a dimension to a metric and show how to determine the real (in general fractal) dimension of the underlying data set.作者: avulsion 時間: 2025-3-30 17:43
Solving Upstream-Downstream Problemsraction of a large rule set is computationally expensive, we propose an algorithm to perform an incremental recomputation of the output rule set. This algorithm is based on the detection of containment relationships between mining queries.作者: 含鐵 時間: 2025-3-30 23:56 作者: 受人支配 時間: 2025-3-31 01:25 作者: 向宇宙 時間: 2025-3-31 05:08
Incremental Refinement of Mining Queriesraction of a large rule set is computationally expensive, we propose an algorithm to perform an incremental recomputation of the output rule set. This algorithm is based on the detection of containment relationships between mining queries.作者: 等待 時間: 2025-3-31 10:43
The Design and Implementation of Modularized Wrappers/Monitors in a Data Warehouse, we also deveIop a toolkit to generate a corresponding monitor. By the method, we can reduce much effort to code the monitor component. We also develop a method to map the object-relational schema into relational one. The mapping method helps us make an uniform interface between a wrapper and an integrator.作者: 抗生素 時間: 2025-3-31 16:50
OLAP-based Scalable Profiling of Customer Behaviorcalable and flexible profiling engine. We define profiles by probability distributions, and compute them using OLAP operations on multidimensional and multilevel data cubes. Our experience has revealed the simplicity and power of OLAP-based solutions to scalable profiling and pattern analysis.作者: 反叛者 時間: 2025-3-31 18:15 作者: 行乞 時間: 2025-4-1 00:50 作者: 異端邪說下 時間: 2025-4-1 02:22 作者: 充足 時間: 2025-4-1 09:58
Lazy Aggregates for Real-Time OLAP called the tolerance invariant is proposed. Lazy aggregates are aggregates that are recalculated only when the tolerance invariant is violated, i.e., the error of the previously calculated aggregate exceeds the given tolerance. An industrial case study is presented. The prototype implementation is described, together with the performance results.作者: dissolution 時間: 2025-4-1 12:54 作者: 沉著 時間: 2025-4-1 15:26
The Outward Transit Pass Questionections of queries follow some . and argue that the class of queries covered by such patterns is relevant for practical purposes. We show a way to implement these collections in an efficient manner. We have carried out experiments with the TPC-D benchmark in order to test our approach.
