標(biāo)題: Titlebook: Database Systems for Advanced Applications; 11th International C Mong Lee,Kian-Lee Tan,Vilas Wuwongse Conference proceedings 2006 Springer- [打印本頁] 作者: Eschew 時(shí)間: 2025-3-21 20:10
書目名稱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é)科排名
作者: DEMUR 時(shí)間: 2025-3-21 21:08
978-3-540-33337-1Springer-Verlag Berlin Heidelberg 2006作者: Flu表流動(dòng) 時(shí)間: 2025-3-22 03:07 作者: addition 時(shí)間: 2025-3-22 05:06 作者: Kidnap 時(shí)間: 2025-3-22 11:39 作者: CRACY 時(shí)間: 2025-3-22 14:57 作者: CRACY 時(shí)間: 2025-3-22 19:38
https://doi.org/10.1057/9780230005846same time, the research community has also paid increasing attention to data management aspects of mobile services. This paper offers me an opportunity to characterize this research area and to describe some of their challenges and pitfalls, and it affords me an opportunity to look back and reflect 作者: 遵循的規(guī)范 時(shí)間: 2025-3-23 01:08 作者: CURB 時(shí)間: 2025-3-23 04:13 作者: 易達(dá)到 時(shí)間: 2025-3-23 07:28 作者: ENNUI 時(shí)間: 2025-3-23 10:47 作者: 無法破譯 時(shí)間: 2025-3-23 15:02
https://doi.org/10.1057/9781137473318s, and sensor network management. The key characteristic of stream data, that it continues to arrive, demands a new approach. This paper focuses on the problem of detecting, exactly, similar pairs of subsequences of arbitrary length in streaming fashion. We propose DAPSS (DAta stream Processing for 作者: 表主動(dòng) 時(shí)間: 2025-3-23 18:58 作者: 翻動(dòng) 時(shí)間: 2025-3-24 02:14 作者: 聲明 時(shí)間: 2025-3-24 02:41 作者: orthopedist 時(shí)間: 2025-3-24 07:39 作者: lanugo 時(shí)間: 2025-3-24 12:24
Didactical Variability in Teacher Educationction involves different types of databases such as spatial databases, time series databases, biomedical databases, etc. However, few of the existing studies have considered spatial networks where points reside on every edge. In this paper, we study the interesting problem of distance-based outliers作者: Palpable 時(shí)間: 2025-3-24 16:05 作者: 恫嚇 時(shí)間: 2025-3-24 23:05 作者: gout109 時(shí)間: 2025-3-25 01:55
Catherine Ulrich,Anderson Norton subtrees only when they exhibit identical structure. Even slight irregularities among subtrees dramatically reduce the performance of compression algorithms of this kind. Furthermore, when XML documents are large, the chance of having large number of identical subtrees is inherently low. In this pa作者: Tractable 時(shí)間: 2025-3-25 05:48
Anderson Norton,Martha W. Alibaliates the size of the data due to the repeated tags and structures. The data verbosity problem gives rise to many challenges of conventional distributed database technologies. In this paper, we study the XML dissemination problem over the Internet, where the speed of information delivery can be rathe作者: 瑣碎 時(shí)間: 2025-3-25 08:20
Subitizing: The Neglected Quantifierr’s queries can assist the indexer by highlighting the exact structure in which the user is interested. In this paper, adaptive index structure for XML documents is presented which captures the structure given by branching path expressions, a very important class of queries. By leveraging existing i作者: NATTY 時(shí)間: 2025-3-25 13:43 作者: HEED 時(shí)間: 2025-3-25 17:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263394.jpg作者: 讓步 時(shí)間: 2025-3-25 21:17 作者: Colonoscopy 時(shí)間: 2025-3-26 01:49
https://doi.org/10.1057/9780230294202come at a cost, each request for a dynamic page requires computation as well as communication across multiple components inside the data dissemination and information processing infrastructure..Consider the following scenario..A company involved in developing IT enabled services responds to Request 作者: Nonconformist 時(shí)間: 2025-3-26 04:28 作者: 誤傳 時(shí)間: 2025-3-26 08:33 作者: Mendicant 時(shí)間: 2025-3-26 14:10
Anderson Norton,Martha W. Alibali the results of XPath containment. Within our framework, we demonstrate that the loading of the server is reduced, the network bandwidth can be more efficiently used and, consequently, all clients as a whole can benefit due to savings of various costs.作者: CESS 時(shí)間: 2025-3-26 19:08 作者: LITHE 時(shí)間: 2025-3-27 00:39 作者: 聯(lián)想記憶 時(shí)間: 2025-3-27 04:42
Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databasesrformed in a target application and a set of window sizes for building multiple indexes, we devise a formula that estimates the overall cost of all the subsequence matchings. By using this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of ent作者: Musculoskeletal 時(shí)間: 2025-3-27 09:22 作者: Carbon-Monoxide 時(shí)間: 2025-3-27 13:23 作者: daredevil 時(shí)間: 2025-3-27 17:07
Subitizing: The Neglected QuantifierL documents is presented which captures the structure given by branching path expressions, a very important class of queries. By leveraging existing infrastructure, the structure can handle updates both to the underlying data, and to itself, with little additional cost.作者: Outwit 時(shí)間: 2025-3-27 21:07 作者: CLEFT 時(shí)間: 2025-3-28 00:38 作者: intoxicate 時(shí)間: 2025-3-28 02:39 作者: 青石板 時(shí)間: 2025-3-28 10:16 作者: 返老還童 時(shí)間: 2025-3-28 10:31
Jarmila Novotná,Bernard Sarrazypts of data and query enlargement are introduced for addressing inaccuracy. As proof of concepts of the benchmark, the paper covers the application of the benchmark to three spatio-temporal indexes—the TPR-, TPR*-, and B.-trees. Representative experimental results and consequent guidelines for the usage of these indexes are reported.作者: DIS 時(shí)間: 2025-3-28 15:41 作者: 破譯 時(shí)間: 2025-3-28 19:43 作者: 遺傳學(xué) 時(shí)間: 2025-3-29 00:30 作者: CHAFE 時(shí)間: 2025-3-29 04:05
Associated Load Shedding Strategies for Computing Multi-joins in Sensor Networkser. We also present the . and the . for improving the basic local associated shedding strategy. Experimental results show that the proposed strategies generate as many results as possible on multi-joins.作者: Hemiplegia 時(shí)間: 2025-3-29 09:51
An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patternse adopts two additional strategies for pruning the searching space in order to improve the mining efficiency. The experimental results show that RE-TFTRP-Mine outperforms TFTRP-Mine algorithm when . and . are small. In addition, more important and implicit repeating patterns could be found from real music objects by adopting fault tolerant mining.作者: subordinate 時(shí)間: 2025-3-29 13:15
The COST Benchmark—Comparison and Evaluation of Spatio-temporal Indexespts of data and query enlargement are introduced for addressing inaccuracy. As proof of concepts of the benchmark, the paper covers the application of the benchmark to three spatio-temporal indexes—the TPR-, TPR*-, and B.-trees. Representative experimental results and consequent guidelines for the usage of these indexes are reported.作者: certitude 時(shí)間: 2025-3-29 19:22
Mining Outliers in Spatial Networkst can be applied when the spatial network is updating points or the input parameters of outlier measures are changed. The experimental results verify the scalability and efficiency of our proposed methods.作者: Exposure 時(shí)間: 2025-3-29 21:42 作者: Cholesterol 時(shí)間: 2025-3-30 03:04
Document Decomposition for XML Compression: A Heuristic Approachression can be achieved by compressing the decomposed documents separately. Experimental results demonstrated that the ., for . real-world datasets, to our knowledge, fit comfortably into main memory of commodity computers nowadays. Preliminary results on querying compressed skeletons validate the effectiveness our approach.作者: Ingest 時(shí)間: 2025-3-30 06:44 作者: 我邪惡 時(shí)間: 2025-3-30 09:15 作者: CODA 時(shí)間: 2025-3-30 16:02
Chinese Wisdom and Chinese Approaches,pattern with negation. We show that .? can identify a large query class to guarantee the I/O optimality. Finally, we run extensive experiments that validate our algorithm and show the efficiency and effectiveness of .?.作者: GEM 時(shí)間: 2025-3-30 19:27
The Decline of ‘National Interests’mmonly used aggregation results in the sensor network. With MINVs, aggregated sensed results for some spatial regions are available and sharable to queries. Thus, the number of sensor accesses is greatly reduced. Through simulations, we validate the effectiveness of proposed strategies.作者: 表主動(dòng) 時(shí)間: 2025-3-30 20:46
Constructing Identities at Workenergy efficiency. In this paper, we propose a distributed scheme called DNN for in-network processing of nearest neighbor queries. A cost model is built to analyze the performance of DNN. Experimental results show that DNN outperforms the centralized scheme significantly in terms of energy consumption and network lifetime.作者: 談判 時(shí)間: 2025-3-31 04:31 作者: Salivary-Gland 時(shí)間: 2025-3-31 05:19 作者: 破譯 時(shí)間: 2025-3-31 09:53
Jarmila Novotná,Bernard Sarrazyrofiles and the support of frequent pattern can be estimated fairly accurately from a relative small number of profiles. Empirical studies show that our method can achieve compact and accurate summarization in real-life data and the support of frequent patterns can be restored much more accurately than the previous method.作者: definition 時(shí)間: 2025-3-31 13:36
Processing Multiple Aggregation Queries in Geo-Sensor Networksmmonly used aggregation results in the sensor network. With MINVs, aggregated sensed results for some spatial regions are available and sharable to queries. Thus, the number of sensor accesses is greatly reduced. Through simulations, we validate the effectiveness of proposed strategies.作者: 無節(jié)奏 時(shí)間: 2025-3-31 20:03
In-Network Processing of Nearest Neighbor Queries for Wireless Sensor Networksenergy efficiency. In this paper, we propose a distributed scheme called DNN for in-network processing of nearest neighbor queries. A cost model is built to analyze the performance of DNN. Experimental results show that DNN outperforms the centralized scheme significantly in terms of energy consumption and network lifetime.作者: 即席 時(shí)間: 2025-4-1 00:15
DAPSS: Exact Subsequence Matching for Data Streamse and (2) the compressed data of the original sequences in the disk space. Experiments on synthetic and real data sets show that DAPSS is significantly (up to 35 times) faster than the naive method while it guarantees the correctness of query results.作者: 食品室 時(shí)間: 2025-4-1 05:03
Querying Multi-granular Compact Representationsular compact representation PSets, based on periodical sets. We show experimentally how the performance of query evaluation can benefit from the compactness of a representation and from a special structure of GSequences.作者: 英寸 時(shí)間: 2025-4-1 09:47 作者: 聯(lián)想記憶 時(shí)間: 2025-4-1 12:13
Dataspaces: A New Abstraction for Information Managementnal DBMS, or into any other single data model or system. Instead, we see a set of loosely connected data sources, typically with the following recurring challenges:.– Users want be able to search the entire collection without having knowledge of individual sources, their schemas or interfaces. In so作者: FIG 時(shí)間: 2025-4-1 15:22 作者: Aids209 時(shí)間: 2025-4-1 19:11 作者: 懲罰 時(shí)間: 2025-4-2 00:59 作者: 配偶 時(shí)間: 2025-4-2 03:37
