標(biāo)題: Titlebook: Database Systems for Advanced Applications; 14th International C Xiaofang Zhou,Haruo Yokota,Qing Liu Conference proceedings 2009 Springer-V [打印本頁] 作者: Prehypertension 時(shí)間: 2025-3-21 19:42
書目名稱Database Systems for Advanced Applications影響因子(影響力)
書目名稱Database Systems for Advanced Applications影響因子(影響力)學(xué)科排名
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度
書目名稱Database Systems for Advanced Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Systems for Advanced Applications被引頻次
書目名稱Database Systems for Advanced Applications被引頻次學(xué)科排名
書目名稱Database Systems for Advanced Applications年度引用
書目名稱Database Systems for Advanced Applications年度引用學(xué)科排名
書目名稱Database Systems for Advanced Applications讀者反饋
書目名稱Database Systems for Advanced Applications讀者反饋學(xué)科排名
作者: 膽大 時(shí)間: 2025-3-21 22:26 作者: LASH 時(shí)間: 2025-3-22 03:36
https://doi.org/10.1007/978-3-319-65043-2 queries). In this framework, our query re-evaluation algorithms take advantage of . and issue location probes only to the affected data objects. Simulation results confirm that the . concept improves scalability and efficiency over existing methods by reducing the number of updates.作者: Alcove 時(shí)間: 2025-3-22 07:24
Palgrave Studies in the History of Financemance of our proposed algorithms using standard datasets and evaluate the impact of removing constraints by comparing the performance of our algorithms with constrained algorithms: K-means and Star and unconstrained algorithm: Markov clustering.作者: APRON 時(shí)間: 2025-3-22 09:52
Governing Globality for Human Welfareining and analyzing the correlations of the monitored objects. Optimized data structures and imputation strategies are developed. Extensive simulated experiments have demonstrated the effectiveness of the proposed algorithms.作者: 少量 時(shí)間: 2025-3-22 16:24 作者: 少量 時(shí)間: 2025-3-22 19:30 作者: 碎石 時(shí)間: 2025-3-22 22:07
Adaptive Safe Regions for Continuous Spatial Queries over Moving Objects queries). In this framework, our query re-evaluation algorithms take advantage of . and issue location probes only to the affected data objects. Simulation results confirm that the . concept improves scalability and efficiency over existing methods by reducing the number of updates.作者: Heretical 時(shí)間: 2025-3-23 05:17 作者: EVICT 時(shí)間: 2025-3-23 08:07 作者: Cocker 時(shí)間: 2025-3-23 11:33
QoS-Oriented Multi-query Scheduling over Data Streams adapted in this new context. We show how these two problems can be related and propose a novel operator scheduling strategy inspired by job scheduling algorithms. The performance study demonstrates a promising result for our proposed strategy.作者: BRUNT 時(shí)間: 2025-3-23 17:49 作者: FUSC 時(shí)間: 2025-3-23 18:16 作者: placebo 時(shí)間: 2025-3-24 01:28
Recasting the Factories after the Warwith the challenge of integrating water data sets collected across Australia by over 250 organisations. In this paper, we look at how the Bureau is going about this task and at the suite of water information products that will arise from a coherent national water data set. ?作者: 長矛 時(shí)間: 2025-3-24 05:06
Conclusion: Looking at the Big Picturecertain data. We propose a lattice based fuzzy keyword search method to efficiently identify top-. answers. Extensive experiments on a real dataset show that our proposed algorithm achieves both high result quality and search efficiency.作者: dry-eye 時(shí)間: 2025-3-24 06:56
https://doi.org/10.1007/978-3-319-65043-2d communication energy consumption as a joint optimization problem. We prove that the problem is NP-hard if storage nodes have limited storage capacities. We proposed a solution based on Lagrangian relaxation interwoven with the subgradient method. Extensive simulations are conducted to evaluate the performance of the proposed solution.作者: 項(xiàng)目 時(shí)間: 2025-3-24 11:13 作者: 加入 時(shí)間: 2025-3-24 17:45 作者: –scent 時(shí)間: 2025-3-24 19:00
Integrating Australia’s Water Datawith the challenge of integrating water data sets collected across Australia by over 250 organisations. In this paper, we look at how the Bureau is going about this task and at the suite of water information products that will arise from a coherent national water data set. ?作者: hair-bulb 時(shí)間: 2025-3-25 02:29 作者: Leaven 時(shí)間: 2025-3-25 04:53 作者: pulmonary 時(shí)間: 2025-3-25 08:27
Query Allocation in Wireless Sensor Networks with Multiple Base Stationsery migration algorithms. Finally, extensive experiments are conducted to compare the proposed techniques with existing works. The experimental results show the effectiveness of our proposed query allocation schemes.作者: 排斥 時(shí)間: 2025-3-25 12:09 作者: 彎曲的人 時(shí)間: 2025-3-25 19:02 作者: VEIL 時(shí)間: 2025-3-25 21:24 作者: Antagonism 時(shí)間: 2025-3-26 03:31
Conference proceedings 2009n Brisbane, Australia, in April 2009. The 39 revised full papers and 22 revised short papers presented together with 3 invited keynote papers, 9 demonstration papers, 3 tutorial abstracts, and one panel abstract were carefully reviewed and selected from 186 submissions. The papers are organized in t作者: 沒花的是打擾 時(shí)間: 2025-3-26 06:14
https://doi.org/10.1057/9780230306318ted computations. We design two methods, rank-based and bitmap, to address these shortcomings. Experiment results indicate that the proposed methods are efficient and scalable, and consistent top-k queries are practical in real world applications.作者: 大雨 時(shí)間: 2025-3-26 09:48
https://doi.org/10.1007/978-3-030-83928-4ts the Expectation Maximization technique to address these challenges. SWEM is not only able to process the stream in an incremental manner, but also capable to adapt to changes happened in the underlying stream distribution.作者: 芳香一點(diǎn) 時(shí)間: 2025-3-26 16:15
Probabilistic Inverse Ranking Queries over Uncertain Dataertain data for other query types. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approaches over both real and synthetic data sets, under various experimental settings.作者: LUMEN 時(shí)間: 2025-3-26 19:44
An Effective and Efficient Method for Handling Transmission Failures in Sensor Networksd for recovering failed transmissions which can save energy consumption and recover failed values more accurately. The experimental evaluation shows the effectiveness of our approach. On the average, the energy consumption of our approach is about 39% less than that of a recent approach and the accu作者: Mirage 時(shí)間: 2025-3-26 23:18 作者: 向外 時(shí)間: 2025-3-27 03:08
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphsosed to the entire graph. (2)?We propose a heuristic algorithm to partition a given graph into subgraphs for indexing. (3)?We demonstrate how reachability queries are evaluated in the graph framework. Our preliminary experimental results showed that the framework yields a smaller total index size an作者: Flustered 時(shí)間: 2025-3-27 09:10
Top-K Correlation Sub-graph Search in Graph DatabasesP-CGSearch efficiently, we develop a .... algorithm (that is PG-search algorithm) and utilize graph indexing methods to speed up the mining task. Extensive experiment results evaluate the efficiency of our methods.作者: escalate 時(shí)間: 2025-3-27 09:38
A Reprocessing Model Based on Continuous Queries for Writing Data to RFID Tag Memorye tag stream continuously and finds unsure tags efficiently. We also discuss implementation issues for the proposed model. This shows that the reprocessing model processes unsuccessful operations completely and avoids inconsistent data, despite volatile characteristics in the RF communications.作者: Rotator-Cuff 時(shí)間: 2025-3-27 15:10
Recasting the Factories after the Warertain data for other query types. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approaches over both real and synthetic data sets, under various experimental settings.作者: 搖晃 時(shí)間: 2025-3-27 21:32 作者: 有毛就脫毛 時(shí)間: 2025-3-28 00:20 作者: Occipital-Lobe 時(shí)間: 2025-3-28 02:31
https://doi.org/10.1057/9781137089212osed to the entire graph. (2)?We propose a heuristic algorithm to partition a given graph into subgraphs for indexing. (3)?We demonstrate how reachability queries are evaluated in the graph framework. Our preliminary experimental results showed that the framework yields a smaller total index size an作者: 替代品 時(shí)間: 2025-3-28 09:05
Governing Globality for Market FreedomP-CGSearch efficiently, we develop a .... algorithm (that is PG-search algorithm) and utilize graph indexing methods to speed up the mining task. Extensive experiment results evaluate the efficiency of our methods.作者: interference 時(shí)間: 2025-3-28 12:00
Palgrave Advances in Behavioral Economicse tag stream continuously and finds unsure tags efficiently. We also discuss implementation issues for the proposed model. This shows that the reprocessing model processes unsuccessful operations completely and avoids inconsistent data, despite volatile characteristics in the RF communications.作者: Anticonvulsants 時(shí)間: 2025-3-28 15:56
Dependability, Abstraction, and Programming program needs to be “right” as well, solving the problem for which it was designed. This requires a program development infrastructure that can, by means of appropriate abstractions, permit the programmer to focus on his problem, and not be distracted by “systems issues” that arise when high availa作者: bile648 時(shí)間: 2025-3-28 19:01 作者: 莊嚴(yán) 時(shí)間: 2025-3-29 02:47
Integrating Australia’s Water Dataerventions. No matter what facet of water reform one is talking about, good intelligence on the country’s water resource base and how it is trending is a vital ingredient for good decision making. Though most individual water businesses and agencies have an adequate view of the water resources under作者: dictator 時(shí)間: 2025-3-29 04:02 作者: 無法治愈 時(shí)間: 2025-3-29 09:01
Consistent Top-k Queries over Timethat exhibit a certain degree of consistent behavior over time. We introduce a new class of queries called . to retrieve k objects that are always amongst the top at every time point over a specified time interval. Applying top-k methods at each time point leads to large intermediate results and was作者: 泛濫 時(shí)間: 2025-3-29 13:08
Effective Fuzzy Keyword Search over Uncertain Datase data. In this paper, we study the problem of effective keyword search over uncertain data. We allow approximate matching between input keywords and the strings in the underlying data, even in the presence of minor errors of input keywords. We formalize the problem of fuzzy keyword search over unc作者: 混合物 時(shí)間: 2025-3-29 17:49 作者: Resection 時(shí)間: 2025-3-29 23:18 作者: Vo2-Max 時(shí)間: 2025-3-30 02:49
An Effective and Efficient Method for Handling Transmission Failures in Sensor Networkssuppression are proposed to reduce energy consumption by transmitting data only if a certain condition is violated. Among these suppression schemes, spatio-temporal suppression is the most energy efficient than others because it combines the advantages of temporal suppression and spatial suppression作者: Amylase 時(shí)間: 2025-3-30 08:07 作者: Pessary 時(shí)間: 2025-3-30 08:41
GraphREL: A Decomposition-Based and Selectivity-Aware Relational Framework for Processing Sub-graph ted graphs containing a query graph from a large graph database is a key issue in many graph-based applications such as drug discovery and structural pattern recognition. Relational database management systems (RDBMSs) have repeatedly been shown to be able to efficiently host different types of data作者: 食品室 時(shí)間: 2025-3-30 16:13 作者: NADIR 時(shí)間: 2025-3-30 18:27 作者: 參考書目 時(shí)間: 2025-3-30 21:37 作者: Fsh238 時(shí)間: 2025-3-31 02:51
Efficient RFID Data Imputation by Analyzing the Correlations of Monitored Objectsommunity. However, the problem of missing readings restricts the application of RFID. Some RFID data cleaning algorithms have therefore been proposed to address this problem. Nevertheless, most of them fill up missing readings simply based on the historical readings of independent monitored objects.作者: Antecedent 時(shí)間: 2025-3-31 07:59
A Reprocessing Model Based on Continuous Queries for Writing Data to RFID Tag Memorylity of writing transactions in volatile RF communications. This study is motivated by the need to support persistent writing transactions of RFID tag data despite asynchronous and intermittent RF connections. The problem arises when the tag disappears from the interrogation area of the reader befor作者: arrogant 時(shí)間: 2025-3-31 09:22 作者: Constrain 時(shí)間: 2025-3-31 14:08
An EM-Based Algorithm for Clustering Data Streams in Sliding Windowsecomes more challenging since the data arrive at a mining system in one-pass manner. The problem is even more difficult when the clustering task is considered in a sliding window model which requiring the elimination of outdated data must be dealt with properly. We propose SWEM algorithm that exploi作者: CROAK 時(shí)間: 2025-3-31 18:36
Two-Dimensional Retrieval in Synchronized Media Streamsnized. The model exploits spatio-temporal arrangement of synchronized media streams during query evaluation phase. The output is a list of on-demand, dynamically integrated multimedia presentations satisfying a set of query keywords.作者: IRATE 時(shí)間: 2025-4-1 01:12
The Land Reform and its Effects program needs to be “right” as well, solving the problem for which it was designed. This requires a program development infrastructure that can, by means of appropriate abstractions, permit the programmer to focus on his problem, and not be distracted by “systems issues” that arise when high availa作者: 最高點(diǎn) 時(shí)間: 2025-4-1 05:43 作者: MAZE 時(shí)間: 2025-4-1 07:45
Recasting the Factories after the Warerventions. No matter what facet of water reform one is talking about, good intelligence on the country’s water resource base and how it is trending is a vital ingredient for good decision making. Though most individual water businesses and agencies have an adequate view of the water resources under作者: Oscillate 時(shí)間: 2025-4-1 11:58
Recasting the Factories after the Warfferent from handling precise data, the uncertain query processing needs to consider the data uncertainty and answer queries with confidence guarantees. In this paper, we formulate and tackle an important query, namely . (PIR) query, which retrieves possible ranks of a given query object in an uncer作者: 玷污 時(shí)間: 2025-4-1 15:50 作者: 戰(zhàn)役 時(shí)間: 2025-4-1 21:19 作者: NAG 時(shí)間: 2025-4-2 00:42 作者: delegate 時(shí)間: 2025-4-2 05:05
https://doi.org/10.1007/978-3-319-65043-2such as still images. However, new challenges have arisen due to the extra sensor capacity and various requirements of multimedia objects in-network processing. In this paper, we consider a large-scale WMSN comprising multiple storage nodes and many multimedia sensor nodes. In particular, we investi作者: 金桌活畫面 時(shí)間: 2025-4-2 07:48
https://doi.org/10.1007/978-3-319-65043-2suppression are proposed to reduce energy consumption by transmitting data only if a certain condition is violated. Among these suppression schemes, spatio-temporal suppression is the most energy efficient than others because it combines the advantages of temporal suppression and spatial suppression
