標(biāo)題: Titlebook: Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn; 13th International C Stanis?aw Koziel [打印本頁] 作者: 召喚 時(shí)間: 2025-3-21 16:27
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn影響因子(影響力)
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn影響因子(影響力)學(xué)科排名
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn網(wǎng)絡(luò)公開度
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn被引頻次
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn被引頻次學(xué)科排名
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn年度引用
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn年度引用學(xué)科排名
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn讀者反饋
書目名稱Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Kn讀者反饋學(xué)科排名
作者: SLAY 時(shí)間: 2025-3-21 20:51 作者: Alveolar-Bone 時(shí)間: 2025-3-22 02:17 作者: 環(huán)形 時(shí)間: 2025-3-22 05:35 作者: 使害羞 時(shí)間: 2025-3-22 08:55
Integrating Map-Reduce and Stream-Processing for Efficiency (MRSP)se (Map-Reduce or not) to keep results available on the fly avoiding high query execution times, and, this way leaving the DW servers more available to process other heavy tasks (e.g. data mining)..In this work, we propose the integration of Stream Processing and Map-Reduce (MRSP) for better query a作者: Albinism 時(shí)間: 2025-3-22 15:32
Data Mining - A Tool for Migration Stock Prediction The second goal is to assess these models and to identify those aspects that have most influence in the decision-making process. The result is based on the data completed by more than 100 persons from Rennes.作者: monopoly 時(shí)間: 2025-3-22 18:17 作者: 填滿 時(shí)間: 2025-3-22 22:49 作者: gruelling 時(shí)間: 2025-3-23 03:17 作者: 摘要 時(shí)間: 2025-3-23 09:28
International Handbook of Educational Changeers offer a mechanism of auto scaling which dynamically adjusts the number of virtual server instances, on which given system is running, according to some basic resource-based metrics like CPU utilization. In this work, we propose a model of auto scaling which is based on timing statistics: a high 作者: fatuity 時(shí)間: 2025-3-23 12:05
Andy Hargreaves,Ann Lieberman,David Hopkinsrepresentation (FNOK). Two versions of formalization methods and, respectively, two Question Answering (QA) systems are developed. The first system uses grammars; it is written and implemented in Python. The second, improved system is based on storing text in relational databases without losing sema作者: Itinerant 時(shí)間: 2025-3-23 14:18
Thomas Kellaghan,Daniel L. Stufflebeaminfluence of different clustering parameters on the efficiency of the knowledge mining process for rules/rules clusters. In the course of the experiments, nine different objects similarity measures and four clusters similarity measures have been examined in order to verify their impact on the size o作者: 取之不竭 時(shí)間: 2025-3-23 19:03 作者: 常到 時(shí)間: 2025-3-23 22:35 作者: 上腭 時(shí)間: 2025-3-24 03:29 作者: 泥土謙卑 時(shí)間: 2025-3-24 07:52
https://doi.org/10.1007/978-94-009-1573-2l datatypes. Next we provide a categorization of spatiotemporal datatypes with the special emphasis on the spatial representation and diversity in temporal aspect. We conduct our deliberation focusing mainly on the complex spatiotemporal objects. In particular, we review algorithms for two problems 作者: flavonoids 時(shí)間: 2025-3-24 11:35
John Macbeath,Lejf Moos,Kathryn Riley a number of NoSql databases and big data platforms were built to address this problem. They usually lack transaction support which features atomicity, consistency, isolation, durability and at the same time they are distributed, scalable, and fault tolerant. In this paper, we present a novel transa作者: dendrites 時(shí)間: 2025-3-24 17:36 作者: 花費(fèi) 時(shí)間: 2025-3-24 19:37
https://doi.org/10.1007/978-94-007-6555-9n was created. The application supports three types of databases: SQL (it was tested with PostgreSQL), MongoDB and Apache Cassandra. For each database the applied data model was described. The aim of the analysis was to compare the performance of these selected databases in the context of data readi作者: Vasoconstrictor 時(shí)間: 2025-3-24 23:11
https://doi.org/10.1007/1-4020-3201-3n text should be indexed. The FM-index is a celebrated compressed data structure for full-text pattern searching. After the first wave of interest in its theoretical developments, we can observe a surge of interest in practical FM-index variants in the last few years. These enhancements are often re作者: BET 時(shí)間: 2025-3-25 07:04 作者: ANTH 時(shí)間: 2025-3-25 08:56 作者: 彎曲道理 時(shí)間: 2025-3-25 13:35
Stanis?aw Kozielski,Dariusz Mrozek,Daniel KostrzewIncludes supplementary material: .Includes supplementary material: 作者: Additive 時(shí)間: 2025-3-25 19:11 作者: travail 時(shí)間: 2025-3-25 23:22 作者: Orthodontics 時(shí)間: 2025-3-26 02:55 作者: arbiter 時(shí)間: 2025-3-26 04:23 作者: 營養(yǎng) 時(shí)間: 2025-3-26 10:48 作者: 小爭吵 時(shí)間: 2025-3-26 13:33 作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-3-26 19:21 作者: Irremediable 時(shí)間: 2025-3-26 21:31 作者: 前面 時(shí)間: 2025-3-27 01:55
John Macbeath,Lejf Moos,Kathryn Rileysupport in Cassandra, our algorithm can span multiple data partitions and provides tunable contention control. We verified correctness and efficiency both theoretically and by executing tests over different workloads. The results presented in this paper prove the usability and robustness of the designed system.作者: Complement 時(shí)間: 2025-3-27 05:31
Multi-partition Distributed Transactions over Cassandra-Like Database with Tunable Contention Controsupport in Cassandra, our algorithm can span multiple data partitions and provides tunable contention control. We verified correctness and efficiency both theoretically and by executing tests over different workloads. The results presented in this paper prove the usability and robustness of the designed system.作者: 不近人情 時(shí)間: 2025-3-27 11:50 作者: 厭煩 時(shí)間: 2025-3-27 16:05
https://doi.org/10.1007/978-1-4020-5281-1ttribute and namespace while predicates are not implemented in our prototype. We present our implemented system, data, measurements, tests, and results. The evaluated results support our belief that our method significantly decreases data transfers in the distributed system that occur during the query evaluation.作者: 蟄伏 時(shí)間: 2025-3-27 19:35 作者: 疏遠(yuǎn)天際 時(shí)間: 2025-3-28 00:34
Andy Hargreaves,Ann Lieberman,David Hopkinsnces. It received 88 questions from users and provided answers. After improving the formalization method, the second system was tested with the same set of sentences and questions. The paper presents the results of the testing, the comparison of answers received from both systems and the analysis of correctness of the answers received.作者: atopic 時(shí)間: 2025-3-28 02:48
Thomas Kellaghan,Daniel L. Stufflebeam used in the clustering process and future efficiency levels of the knowledge mined from such structures: some parameters guarantee to produce shorter/longer representatives of the created rules clusters as well as smaller/greater clusters’ sizes.作者: 職業(yè)拳擊手 時(shí)間: 2025-3-28 07:43 作者: Parley 時(shí)間: 2025-3-28 11:27
John Macbeath,Lejf Moos,Kathryn Rileyal model. Nowadays this idea becomes again up-to-date because of the growing popularity of NoSQL movement and polyglot persistence. This article attempts to show the state-of-the-art in multi-model databases area and possibilities of this reconditioned idea.作者: 是限制 時(shí)間: 2025-3-28 17:40
https://doi.org/10.1007/1-4020-3201-3entation of the rank primitive and advocate for a very simple architecture of the FM-index, which trades compression ratio for speed. Experimental results show that our variants are 2–3 times faster than the fastest known ones, for the price of using typically 1.5–5 times more space.作者: 借喻 時(shí)間: 2025-3-28 21:34 作者: 猛擊 時(shí)間: 2025-3-29 01:51
Evaluation of XPath Queries Over XML Documents Using SparkSQL Frameworkttribute and namespace while predicates are not implemented in our prototype. We present our implemented system, data, measurements, tests, and results. The evaluated results support our belief that our method significantly decreases data transfers in the distributed system that occur during the query evaluation.作者: Estrogen 時(shí)間: 2025-3-29 03:10
Metrics-Based Auto Scaling Module for Amazon Web Services Cloud Platforms to the model are user defined values of those custom metrics. We developed software module that controls a number of virtual server instances according to both auto scaling models and conducted experiments that show our model based on custom metrics can perform better, while it uses less instances and still maintains assumed time constraints.作者: 付出 時(shí)間: 2025-3-29 09:40
Comparison of Two Versions of Formalization Method for Text Expressed Knowledgences. It received 88 questions from users and provided answers. After improving the formalization method, the second system was tested with the same set of sentences and questions. The paper presents the results of the testing, the comparison of answers received from both systems and the analysis of correctness of the answers received.作者: Mendicant 時(shí)間: 2025-3-29 14:16 作者: offense 時(shí)間: 2025-3-29 18:26
A Survey on Data Mining Methods for Clustering Complex Spatiotemporal Dataatial objects. In addition to description of the problems mentioned above, we also attempt to provide a comprehensive references review and provide a general look on the different problems related to the clustering spatiotemporal data.作者: fiscal 時(shí)間: 2025-3-29 23:13 作者: 未完成 時(shí)間: 2025-3-30 02:56
FM-index for Dummiesentation of the rank primitive and advocate for a very simple architecture of the FM-index, which trades compression ratio for speed. Experimental results show that our variants are 2–3 times faster than the fastest known ones, for the price of using typically 1.5–5 times more space.作者: opportune 時(shí)間: 2025-3-30 04:15
https://doi.org/10.1007/978-94-007-6555-9ng and writing. Performance tests showed that MongoDB is the fastest when reading data and PostgreSQL is the fastest for writing. The test application is fully functional, however implementation occurred to be more challenging for Cassandra.作者: HALL 時(shí)間: 2025-3-30 11:23 作者: aqueduct 時(shí)間: 2025-3-30 13:51 作者: Robust 時(shí)間: 2025-3-30 18:27 作者: NUDGE 時(shí)間: 2025-3-31 00:03
Integrating Map-Reduce and Stream-Processing for Efficiency (MRSP) include information that is not yet stored into the DW) and at the same time to relax the DW processing load. Previous research works focus mainly on parallelization, for instance: adding more hardware resources; parallelizing operators, queries, and storage. A very known and studied approach is to作者: 2否定 時(shí)間: 2025-3-31 04:39 作者: 雜役 時(shí)間: 2025-3-31 05:52
