標(biāo)題: Titlebook: Database and Expert Systems Applications; 30th International C Sven Hartmann,Josef Küng,Ismail Khalil Conference proceedings 2019 Springer [打印本頁(yè)] 作者: 小費(fèi) 時(shí)間: 2025-3-21 18:26
書目名稱Database and Expert Systems Applications影響因子(影響力)
書目名稱Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度
書目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database and Expert Systems Applications被引頻次
書目名稱Database and Expert Systems Applications被引頻次學(xué)科排名
書目名稱Database and Expert Systems Applications年度引用
書目名稱Database and Expert Systems Applications年度引用學(xué)科排名
書目名稱Database and Expert Systems Applications讀者反饋
書目名稱Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: Anticonvulsants 時(shí)間: 2025-3-21 21:22
Contracting Under Incomplete Information study the use of a . for summarizing the completeness and validity of query answers. We describe an implementation and experiments with a real-world dataset to validate the effectiveness and the efficiency of our approach.作者: 擦試不掉 時(shí)間: 2025-3-22 02:11
Viewing Contracting Through a Different Lenspproach based on a fragmentation strategy that maps RDF data into multiple NoSQL databases. This workload-aware partitioning scheme provides, in turn, efficient processing of SPARQL queries over these NoSQL databases. Our experimental evaluation shows that the solution is promising, outperforming three recent baselines.作者: 得意人 時(shí)間: 2025-3-22 06:02
Debts and Pecuniary Obligations real SPARQL query from a given log, . stretches the query with real queries from different logs. To prune the research space, . proposes semantic summary to prune the query logs. Experimental results with real logs of DBpedia and SWDF demonstrate that . is able to prune drastically the logs and recommend plausible federated queries.作者: 縮影 時(shí)間: 2025-3-22 11:55 作者: MIME 時(shí)間: 2025-3-22 14:28
Viewing Contracting Through a Different Lensblems, the paper proposes a novel family of measures, called InfoRank, and a keyword search system, called QUIRA, for RDF graphs. Finally, this paper concludes with experiments showing that the proposed solution improves the quality of results in two keyword search benchmarks.作者: MIME 時(shí)間: 2025-3-22 20:48
An Experiment to Analyze the Use of Process Modeling Guidelines to Create High-Quality Process Modelre collected through a systematic literature review. From the results obtained with the experiment, it was observed that the subjects would be more receptive to the guidelines if they were easier to understand and use.作者: 壓倒 時(shí)間: 2025-3-22 21:48
Novel Node Importance Measures to Improve Keyword Search over RDF Graphsblems, the paper proposes a novel family of measures, called InfoRank, and a keyword search system, called QUIRA, for RDF graphs. Finally, this paper concludes with experiments showing that the proposed solution improves the quality of results in two keyword search benchmarks.作者: SSRIS 時(shí)間: 2025-3-23 05:24 作者: 施加 時(shí)間: 2025-3-23 08:30
Querying in a Workload-Aware Triplestore Based on NoSQL Databasespproach based on a fragmentation strategy that maps RDF data into multiple NoSQL databases. This workload-aware partitioning scheme provides, in turn, efficient processing of SPARQL queries over these NoSQL databases. Our experimental evaluation shows that the solution is promising, outperforming three recent baselines.作者: 內(nèi)向者 時(shí)間: 2025-3-23 10:35 作者: 迫擊炮 時(shí)間: 2025-3-23 15:45
Conference proceedings 2019ems Applications, DEXA 2019, held in Linz, Austria, in August 2019..The 32 full papers presented together with 34 short papers were carefully reviewed and selected from 157 submissions. The papers are organized in the following topical sections: ..Part I: Big data management and analytics; data stru作者: 小爭(zhēng)吵 時(shí)間: 2025-3-23 19:50 作者: Biguanides 時(shí)間: 2025-3-24 00:48 作者: 有斑點(diǎn) 時(shí)間: 2025-3-24 03:49 作者: Aura231 時(shí)間: 2025-3-24 10:00 作者: 裂隙 時(shí)間: 2025-3-24 11:57
https://doi.org/10.1007/978-3-319-71099-0, remodeling, project cancellation, resource procurement etc. The developed approach was validated based on a set of real processes of a public university through a cross-fold validation that reached 83% of accuracy.作者: 離開就切除 時(shí)間: 2025-3-24 17:23 作者: octogenarian 時(shí)間: 2025-3-24 22:06 作者: LAPSE 時(shí)間: 2025-3-24 23:30
TRR: Reducing Crowdsourcing Task Redundancyme to answer a task. TRR supports Boolean, classification, and rating task types taking into consideration both crowdsourcing task assignment schemes of anonymous workers task assignments and non-anonymous workers task assignments. The paper includes experimental results by performing simulating experiments on crowdsourced datasets.作者: epicondylitis 時(shí)間: 2025-3-25 03:30
Software Resource Recommendation for Process Execution Based on the Organization’s Profile, remodeling, project cancellation, resource procurement etc. The developed approach was validated based on a set of real processes of a public university through a cross-fold validation that reached 83% of accuracy.作者: 教義 時(shí)間: 2025-3-25 10:05 作者: PLUMP 時(shí)間: 2025-3-25 15:37
https://doi.org/10.1007/978-3-642-14200-0o achieve stable performance with lower memory utilization, and Glasstree-based Silo achieves a 20% higher throughput, latencies characterized by an 81% lower standard deviation, and 34% lower peak memory usage than Masstree-based Silo even under read-majority workloads.作者: 魯莽 時(shí)間: 2025-3-25 16:46 作者: invade 時(shí)間: 2025-3-25 22:46 作者: 動(dòng)物 時(shí)間: 2025-3-26 00:24 作者: Lucubrate 時(shí)間: 2025-3-26 05:15 作者: 認(rèn)為 時(shí)間: 2025-3-26 12:21 作者: 羅盤 時(shí)間: 2025-3-26 15:48
Looking into the Peak Memory Consumption of Epoch-Based Reclamation in Scalable in-Memory Database So achieve stable performance with lower memory utilization, and Glasstree-based Silo achieves a 20% higher throughput, latencies characterized by an 81% lower standard deviation, and 34% lower peak memory usage than Masstree-based Silo even under read-majority workloads.作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-26 17:03
Querying Knowledge Graphs with Natural Languageses, and generate pattern queries with “query focus”. (3) We develop efficient techniques to identify top-. matches of “query focus”. (4) We experimentally verify that our techniques for query understanding perform well, and our query algorithm is able to find diversified top-. matches efficiently.作者: cloture 時(shí)間: 2025-3-26 22:22 作者: esculent 時(shí)間: 2025-3-27 04:13
Extractive Document Summarization using Non-negative Matrix Factorizationhods is evaluated for four public data-sets using standard ROUGE tool..The proposed method is unsupervised, agnostic to the language of the document and does not use external knowledge. It is also generic, independent of domain and collection. These features of NMF based summarization along with add作者: 范例 時(shí)間: 2025-3-27 05:42 作者: Peristalsis 時(shí)間: 2025-3-27 11:47
Representing and Reasoning About Precise and Imprecise Time Points and Intervals in Semantic Web: Deta. (.) We extend the Allen’s interval algebra to reason about imprecise time intervals. Compared to related work, our extension is entirely based on crisp set theory. The resulting interval relations preserve many of the desirable properties of the original algebra. We adapt these relations to allo作者: Headstrong 時(shí)間: 2025-3-27 16:50 作者: Genteel 時(shí)間: 2025-3-27 18:41
Energy Efficient Data Placement and Buffer Management for Multiple Replicationmore storage capacity and disk I/O frequency that cause of increasing the power consumption of the storage systems. To address this issue, we propose two data placement policies, . and .. These data placement policies employ different data mapping between buffers (memory) and disk drives to control 作者: 尖牙 時(shí)間: 2025-3-28 01:15 作者: 保守黨 時(shí)間: 2025-3-28 05:38
Explaining Query Answer Completeness and Correctness with Partition Patternsing the completeness of data is crucial for determining the quality of the data itself, but also for verifying the validity of query answers over incomplete data. In this article, we tackle the issue of efficiently describing and inferring knowledge about data completeness w.r.t. to a complete . and作者: Ceramic 時(shí)間: 2025-3-28 10:18 作者: 率直 時(shí)間: 2025-3-28 12:14 作者: 偽造者 時(shí)間: 2025-3-28 15:48
Succinct BWT-Based Sequence Predictionams. Sequence prediction is a popular task, which consists of predicting the next symbol of a sequence, given a set of training sequences. Although numerous prediction models have been proposed, many have a low accuracy because they are lossy models (they discard information from training sequences 作者: adroit 時(shí)間: 2025-3-28 19:19
TRR: Reducing Crowdsourcing Task Redundancyd to accomplish a crowdsourcing task. Typical task assignment systems assign tasks to a fixed number of crowd workers, while tasks are varied in difficulty as being easy or hard tasks. Easy tasks need fewer task assignments than hard tasks. We present TRR, a task redundancy reducer that assigns task作者: 充滿裝飾 時(shí)間: 2025-3-29 01:50 作者: evasive 時(shí)間: 2025-3-29 04:01 作者: Feature 時(shí)間: 2025-3-29 07:51 作者: 恭維 時(shí)間: 2025-3-29 13:02
Querying in a Workload-Aware Triplestore Based on NoSQL DatabasesL querying has been the main issue for virtually all the recent RDF triplestores. This paper presents ., a middleware that addresses workload-adaptive management of large RDF graphs. Our middleware not only employs all the most used NoSQL data models but also provides a novel RDF data partitioning a作者: constitute 時(shí)間: 2025-3-29 16:57 作者: Vo2-Max 時(shí)間: 2025-3-29 20:02
PFed: Recommending Plausible Federated SPARQL Querieswing number of datasets is challenging. In this paper, we propose ., an approach to recommend plausible federated queries based on real query logs of different datasets. The problem is not to find similar federated queries, but plausible complementary queries over different datasets. Starting with a作者: FELON 時(shí)間: 2025-3-30 00:13
Representing and Reasoning About Precise and Imprecise Time Points and Intervals in Semantic Web: De number of approaches exist. However, they handle only precise temporal data and lack imprecise ones. In this paper, we propose a crisp-based approach for representing and reasoning about temporal data in term of quantitative (i.e., time points that can be dates and clocks, and time intervals) as we作者: diathermy 時(shí)間: 2025-3-30 04:47
Database and Expert Systems Applications978-3-030-27618-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Perigee 時(shí)間: 2025-3-30 08:16 作者: 背景 時(shí)間: 2025-3-30 15:45
https://doi.org/10.1007/978-3-030-27618-8artificial intelligence; data communication systems; data mining; data security; databases; information r作者: Kindle 時(shí)間: 2025-3-30 18:27 作者: Neonatal 時(shí)間: 2025-3-30 21:42 作者: blister 時(shí)間: 2025-3-31 02:19
https://doi.org/10.1007/978-981-99-5487-2more storage capacity and disk I/O frequency that cause of increasing the power consumption of the storage systems. To address this issue, we propose two data placement policies, . and .. These data placement policies employ different data mapping between buffers (memory) and disk drives to control 作者: 值得 時(shí)間: 2025-3-31 06:58
