標(biāo)題: Titlebook: Data Warehousing and Knowledge Discovery; 10th International C Il-Yeol Song,Johann Eder,Tho Manh Nguyen Conference proceedings 2008 Springe [打印本頁] 作者: subcutaneous 時(shí)間: 2025-3-21 18:06
書目名稱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é)科排名
作者: 輪流 時(shí)間: 2025-3-21 22:24 作者: 正式演說 時(shí)間: 2025-3-22 03:27
Efficient Data Distribution for DWS DWS. The experimental results show that the effective loading of the nodes in a DWS system must consider complementary effects, minimizing the number of distinct keys of any large dimension in the fact tables in each node, as well as splitting correlated rows among the nodes.作者: BOAST 時(shí)間: 2025-3-22 06:17
Generalization-Based Privacy-Preserving Data CollectionP methods in experiments based on two UCI datasets and two utility measures. Preliminary results show that our method can better protect against the distribution attack and provide good balance between privacy and data utility.作者: GOAD 時(shí)間: 2025-3-22 12:16 作者: 一罵死割除 時(shí)間: 2025-3-22 12:58 作者: 一罵死割除 時(shí)間: 2025-3-22 18:29 作者: 微塵 時(shí)間: 2025-3-22 22:12 作者: Arthropathy 時(shí)間: 2025-3-23 04:58
A Hierarchical Space Indexing MethodP methods in experiments based on two UCI datasets and two utility measures. Preliminary results show that our method can better protect against the distribution attack and provide good balance between privacy and data utility.作者: fertilizer 時(shí)間: 2025-3-23 07:16 作者: 衰弱的心 時(shí)間: 2025-3-23 13:34 作者: Hyperalgesia 時(shí)間: 2025-3-23 17:25 作者: 彩色的蠟筆 時(shí)間: 2025-3-23 20:24 作者: 明智的人 時(shí)間: 2025-3-24 00:20
Graphical Output in a Research Establishmentsoft drinks). On the opposite, rules like . are said to be .. In this paper, we define the concepts related to this original method as well as the associated algorithms. The experiments which we carried out show the interest of our proposal.作者: 低位的人或事 時(shí)間: 2025-3-24 06:11 作者: Magisterial 時(shí)間: 2025-3-24 08:43 作者: 使成波狀 時(shí)間: 2025-3-24 10:43 作者: Negligible 時(shí)間: 2025-3-24 16:07 作者: judiciousness 時(shí)間: 2025-3-24 21:42 作者: detach 時(shí)間: 2025-3-25 01:02
Summarizing Distributed Data Streams for Storage in Data Warehousesrver. In this paper, we propose a generic tool for summarizing distributed data streams where the amount of data being collected from each sensor adapts to data characteristics. Experiments done on electric power consumption real data are reported and show the efficiency of the proposed approach.作者: 玩忽職守 時(shí)間: 2025-3-25 07:03
Top_Keyword: An Aggregation Function for Textual Document OLAPional databases as well as an adapted framework for their analysis. This paper presents a new aggregation function that aggregates textual data in an OLAP environment. The . function (. for short) represents a set of documents by their most significant terms using a weighing function from information retrieval: ....作者: overrule 時(shí)間: 2025-3-25 08:16
Jag Free Images on a Raster CRTrver. In this paper, we propose a generic tool for summarizing distributed data streams where the amount of data being collected from each sensor adapts to data characteristics. Experiments done on electric power consumption real data are reported and show the efficiency of the proposed approach.作者: 珊瑚 時(shí)間: 2025-3-25 12:59 作者: Antimicrobial 時(shí)間: 2025-3-25 16:48 作者: 規(guī)范就好 時(shí)間: 2025-3-25 21:14
Computer Games as a Sociocultural Phenomenoned on the use of activity diagrams enriched with object flows, aimed at expressing functional, dynamic, and static aspects in an integrated fashion. The paper is completed by examples taken from a real case study in the commercial area.作者: 蝕刻 時(shí)間: 2025-3-26 00:22
https://doi.org/10.1057/9780230583306in this paper, we describe how to obtain the data-cube metadata for “.n-.ine .nalytical .rocessing” (OLAP) tools. As a proof of concept, our approach has been implemented in the . development platform, thus showing its feasibility.作者: NOVA 時(shí)間: 2025-3-26 08:08 作者: barium-study 時(shí)間: 2025-3-26 08:43 作者: 使?jié)M足 時(shí)間: 2025-3-26 13:02 作者: 不在灌木叢中 時(shí)間: 2025-3-26 19:09
Kikuo Fujimura,Tosiyasu L. Kuniiue is compared with the one of the method ., the state-of-the-art privacy preserving OLAP perturbation-based technique, under several perspectives of analysis. The derived experimental results confirm to us the benefits deriving from adopting our proposed framework for the goal of preserving the privacy of OLAP data cubes.作者: GRIN 時(shí)間: 2025-3-26 22:06
ICONS and User-Interface Communicationlement 3 query processing strategies of very different nature on our experimental MOLAP system. Detailed experimental performance data are presented, using a real-life spatial database with 1/3 million of spatial objects.作者: endarterectomy 時(shí)間: 2025-3-27 01:29
https://doi.org/10.1007/978-1-4684-8586-8 asked. We verify our proposal experimentally by running our algorithm against the state-of-the-art database query optimizer. The results of conducted experiments show that our algorithm outperforms traditional cost-based query optimizer with respect to the accuracy of cardinality estimation for a wide range of queries.作者: 他去就結(jié)束 時(shí)間: 2025-3-27 07:43 作者: savage 時(shí)間: 2025-3-27 12:05 作者: Inkling 時(shí)間: 2025-3-27 13:55 作者: 災(zāi)禍 時(shí)間: 2025-3-27 21:02 作者: engrossed 時(shí)間: 2025-3-28 00:00 作者: Ostrich 時(shí)間: 2025-3-28 05:34 作者: amnesia 時(shí)間: 2025-3-28 07:27
A Robust Sampling-Based Framework for Privacy Preserving OLAPue is compared with the one of the method ., the state-of-the-art privacy preserving OLAP perturbation-based technique, under several perspectives of analysis. The derived experimental results confirm to us the benefits deriving from adopting our proposed framework for the goal of preserving the privacy of OLAP data cubes.作者: 量被毀壞 時(shí)間: 2025-3-28 11:06 作者: 不透明性 時(shí)間: 2025-3-28 17:06
Mining Conditional Cardinality Patterns for Data Warehouse Query Optimization asked. We verify our proposal experimentally by running our algorithm against the state-of-the-art database query optimizer. The results of conducted experiments show that our algorithm outperforms traditional cost-based query optimizer with respect to the accuracy of cardinality estimation for a wide range of queries.作者: 卷發(fā) 時(shí)間: 2025-3-28 20:59 作者: 方舟 時(shí)間: 2025-3-29 02:13 作者: FLING 時(shí)間: 2025-3-29 04:57 作者: indices 時(shí)間: 2025-3-29 10:21
https://doi.org/10.1057/9780230583306ase metadata for implementing the data- warehouse repository. Surprisingly, current approaches for multidimensional modelling overlook the necessity of generating additional data-cube metadata to allow end-user tools to query the data warehouse. To overcome this situation, we propose an approach bas作者: 有毛就脫毛 時(shí)間: 2025-3-29 13:56
https://doi.org/10.1057/9780230583306ial data warehouses (SDW). However, these approaches often fail in providing mechanisms to univocally and automatically derive a logical representation. Even more, the spatial data often generates complex hierarchies (i.e., many-to-many) that have to be mapped to large and non-intuitive logical stru作者: HERTZ 時(shí)間: 2025-3-29 18:40 作者: 吞吞吐吐 時(shí)間: 2025-3-29 20:51
https://doi.org/10.1007/978-3-211-39410-6. to ... In this paper, we are interested in borders for emerging cubes which optimize both storage space and computation time. Such borders also provide classification and cube navigation tools. Firstly we study the condensed representation through the classical borders ., then we propose the borde作者: 手銬 時(shí)間: 2025-3-30 03:00
S. Tokumasu,Y. Ohta,N. Nakajimaanalysis of numeric data. With the growing availability of digital documents, there is a need for incorporating text-rich documents within multidimensional databases as well as an adapted framework for their analysis. This paper presents a new aggregation function that aggregates textual data in an 作者: 酷熱 時(shí)間: 2025-3-30 04:48 作者: 信任 時(shí)間: 2025-3-30 10:54
https://doi.org/10.1007/978-3-642-85962-5the fact tables are distributed by an arbitrary number of low-cost computers and the queries are executed in parallel by all the computers, guarantying a nearly optimal speed up and scale up. Data loading in data warehouses is typically a heavy process that gets even more complex when considering di作者: 表狀態(tài) 時(shí)間: 2025-3-30 15:06 作者: MARS 時(shí)間: 2025-3-30 17:42
Kikuo Fujimura,Tosiyasu L. Kuniistic of the proposed framework consists in adopting an innovative ., which deals with the problem of preserving the privacy of OLAP aggregations rather than the one of data cube cells, like in conventional perturbation-based privacy preserving OLAP techniques. This results in a greater theoretical s作者: SCORE 時(shí)間: 2025-3-30 23:38 作者: Veneer 時(shí)間: 2025-3-31 00:51
ICONS and User-Interface Communicationa is to find the total amount of gas sold within a period of time, of certain type of gas, to a certain type of customers, by gas stations located within a query window on a map. A framework has been established in [8], which converts this query into a set of queries for a general-purpose ROLAP syst作者: 外科醫(yī)生 時(shí)間: 2025-3-31 07:55
Kikuo Fujimura,Tosiyasu L. Kuniiand change rate of biological data underscore the importance of capturing its evolution. To capture information about our database’s evolution, we incorporate a temporal dimension in our data model, which we implement by means of lifespan timestamps attached to every tuple in the warehouse. This tem作者: 擔(dān)憂 時(shí)間: 2025-3-31 11:07 作者: daredevil 時(shí)間: 2025-3-31 16:22 作者: 密切關(guān)系 時(shí)間: 2025-3-31 18:12 作者: 事先無準(zhǔn)備 時(shí)間: 2025-3-31 22:03 作者: 有危險(xiǎn) 時(shí)間: 2025-4-1 02:09
Isaac D. Scherson,Steven P. PunteProcedure (GRASP), for optimally clustering . objects into . clusters. The proposed algorithm is a two phase algorithm which combines a Multi-Swarm Constriction Particle Swarm Optimization algorithm for the solution of the feature selection problem and a GRASP algorithm for the solution of the clust作者: STAT 時(shí)間: 2025-4-1 06:56 作者: Anterior 時(shí)間: 2025-4-1 12:40 作者: 創(chuàng)作 時(shí)間: 2025-4-1 16:59
