標(biāo)題: Titlebook: Advances in Web-Age Information Management; 5th International Co Qing Li,Guoren Wang,Ling Feng Conference proceedings 2004 Springer-Verlag [打印本頁(yè)] 作者: 胃口 時(shí)間: 2025-3-21 18:42
書(shū)目名稱(chēng)Advances in Web-Age Information Management影響因子(影響力)
書(shū)目名稱(chēng)Advances in Web-Age Information Management影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Advances in Web-Age Information Management網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Advances in Web-Age Information Management網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Advances in Web-Age Information Management被引頻次
書(shū)目名稱(chēng)Advances in Web-Age Information Management被引頻次學(xué)科排名
書(shū)目名稱(chēng)Advances in Web-Age Information Management年度引用
書(shū)目名稱(chēng)Advances in Web-Age Information Management年度引用學(xué)科排名
書(shū)目名稱(chēng)Advances in Web-Age Information Management讀者反饋
書(shū)目名稱(chēng)Advances in Web-Age Information Management讀者反饋學(xué)科排名
作者: 外來(lái) 時(shí)間: 2025-3-21 22:32 作者: abreast 時(shí)間: 2025-3-22 00:59
Recent Advances in Histogram Construction Algorithmsations including, approximate querying, similarity searching and data mining in most application domains, rely on such accurate approximations. A very popular way in database theory and practice to approximate a data distribution is by means of a histogram..Histograms approximate a data distribution作者: 松果 時(shí)間: 2025-3-22 07:55
Dynamic Adjustment of Sliding Windows over Data StreamsIn this paper, we consider the problem of adjusting the buffer size of sliding windows dynamically when the rate of streaming data changes or when queries start or end. Based on the status of available memory resource and the requirement of queries for memory, we propose the corresponding algorithms作者: subordinate 時(shí)間: 2025-3-22 09:44
Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Streamfined as the most recent N data items. In this paper, we study the problem of estimating quantiles over other types of sliding windows. We present a uniform framework to process quantile queries for time constrained and filter based sliding windows. Our algorithm makes one pass on the data stream an作者: 使激動(dòng) 時(shí)間: 2025-3-22 14:20
The Dimension-Reduced Multi-scale Histogram: A New Method for Fast and Efficient Retrieval of Similaistograms. It is a faster and efficient way to pre-select time sequence in a database and leads to reduce the need of time sequence comparisons when answering similarity queries. A new metric distance function MD ( ) that consistently lower-bounds WED and also satisfies the triangular inequality is 作者: maculated 時(shí)間: 2025-3-22 19:31
Time Series Prediction Based on Gene Expression Programmingtion Method (GEP-SWPM) to mine the relationship between future and historical data directly. (2) GEP-Differential Equation Prediction Method (GEP-DEPM) to mine ordinary differential equations from training data, and predict future trends based on specified initial conditions. (3) A brand new equatio作者: Carcinogen 時(shí)間: 2025-3-22 22:17 作者: 長(zhǎng)矛 時(shí)間: 2025-3-23 03:48 作者: indigenous 時(shí)間: 2025-3-23 05:39 作者: FAWN 時(shí)間: 2025-3-23 12:37 作者: 談判 時(shí)間: 2025-3-23 16:21 作者: 招募 時(shí)間: 2025-3-23 20:48 作者: 駕駛 時(shí)間: 2025-3-24 00:55 作者: Sarcoma 時(shí)間: 2025-3-24 03:42
Spatio-temporal Database with Multi-granularitiesral data, those problems were not well solved yet. A new spatio-temporal granularity representation method which supports multiple granularities and uncertain spatio-temporal objects is put forward. Then this method is applied to a spatio-temporal database ASTD. By supporting multiple granularities 作者: Arable 時(shí)間: 2025-3-24 08:07 作者: PANIC 時(shí)間: 2025-3-24 11:33 作者: fallible 時(shí)間: 2025-3-24 16:15
CCAN: Cache-Based CAN Using the Small World Modelhich is based on the small world model. CCAN caches the long contact and takes a novel probabilistic cache replacing strategy. The probabilistic cache scheme proves to be a new approach to model the small world phenomenon. Experiments in both the static and the dynamic network show that CCAN can be 作者: 召集 時(shí)間: 2025-3-24 20:51
Performance Evaluations of Replacement Algorithms in Hierarchical Web Cachingb caching hierarchy. A major problem of the hierarchical caching is the poor performance due to the interference between upper-level and lower-level caches. This paper investigates the replacement algorithms applied in the network caching hierarchy through trace-driven simulation experiments to iden作者: Vertebra 時(shí)間: 2025-3-24 23:39
H. Preuschoft,W.-E. Reif,C. Loitsch,E. Tepe of adjustment with greedy method and dynamic programming method, which minimize the total error of queries or achieve low memory overhead. The analytical and experimental results show that our algorithms can be applied to the data stream systems efficiently.作者: ingenue 時(shí)間: 2025-3-25 04:55
H. Preuschoft,W.-E. Reif,C. Loitsch,E. Tepealso presented and based on it, we construct the Slim-tree index structure as the metric access method to answer similarity queries. We also extend it to subsequence matching and presented a MSST index structure.作者: 捏造 時(shí)間: 2025-3-25 07:46
Identities and Modernities in Europeand approximate region, ASTD can process the multiple level data together, perform the query in variant precision and handle uncertainty. Compared with similar systems, ASTD is more powerful in multiple granularities, uncertainty, object type and granularity operations.作者: 輪流 時(shí)間: 2025-3-25 14:10
https://doi.org/10.1057/9781403981066 we propose a dynamic materialized view management approach with a new hit prediction, which can predict the users’ interest in an ongoing fashion and adapt to changes if necessary. Extensive performance studies show that our approach achieves a high cache hit ratio and speeds up the response time or throughout for different kinds of OLAP queries.作者: Bureaucracy 時(shí)間: 2025-3-25 19:17 作者: 褪色 時(shí)間: 2025-3-25 20:03
Annalisa Baicchi,Cristiano Brocciasre is used for identity authentication, integrity verification, and undeniability. Analysis manifests the proposed protocol is feasible, secure with high integrity and it provides a new and reliable approach for DRM.作者: chemoprevention 時(shí)間: 2025-3-26 02:43 作者: Oligarchy 時(shí)間: 2025-3-26 05:35
An introductory example: ,(n,D),ul performance features of these algorithms and their combinations at different levels. Thus, our work may serve as a reference for the design and deployment of efficient replacement algorithms in the caching hierarchy for web engineering.作者: STEER 時(shí)間: 2025-3-26 08:50 作者: SSRIS 時(shí)間: 2025-3-26 15:10
Fail-Stop Authentication Protocol for Digital Rights Management in Adaptive Information Retrieval Syre is used for identity authentication, integrity verification, and undeniability. Analysis manifests the proposed protocol is feasible, secure with high integrity and it provides a new and reliable approach for DRM.作者: 束縛 時(shí)間: 2025-3-26 17:51 作者: 單調(diào)女 時(shí)間: 2025-3-26 23:49
Performance Evaluations of Replacement Algorithms in Hierarchical Web Cachingul performance features of these algorithms and their combinations at different levels. Thus, our work may serve as a reference for the design and deployment of efficient replacement algorithms in the caching hierarchy for web engineering.作者: infatuation 時(shí)間: 2025-3-27 04:45 作者: 戰(zhàn)役 時(shí)間: 2025-3-27 08:47
A Grid-Based Index Method for Time Warping Distanceact index file is constructed. By scanning the index file, we can get a very small candidate set, so that the number of page access is dramatically reduced. We demonstrate the effectiveness of our approach on real and synthetic datasets.作者: 一小塊 時(shí)間: 2025-3-27 11:43 作者: SOW 時(shí)間: 2025-3-27 14:44 作者: interlude 時(shí)間: 2025-3-27 17:57
https://doi.org/10.1057/9781137487537ady reserved resource by change of the mobility class of a mobile host. And the scheme can reserve resource for mobile host according to their mobility classes and hand off probabilities. The proposed model and scheme improved a connection blocking probability and a connection dropping probability efficiently.作者: Arbitrary 時(shí)間: 2025-3-28 01:38 作者: Assault 時(shí)間: 2025-3-28 04:42 作者: TEN 時(shí)間: 2025-3-28 09:16 作者: Ballerina 時(shí)間: 2025-3-28 12:15 作者: figment 時(shí)間: 2025-3-28 17:16
Dynamic Adjustment of Sliding Windows over Data Streams of adjustment with greedy method and dynamic programming method, which minimize the total error of queries or achieve low memory overhead. The analytical and experimental results show that our algorithms can be applied to the data stream systems efficiently.作者: Adenocarcinoma 時(shí)間: 2025-3-28 22:08
The Dimension-Reduced Multi-scale Histogram: A New Method for Fast and Efficient Retrieval of Similaalso presented and based on it, we construct the Slim-tree index structure as the metric access method to answer similarity queries. We also extend it to subsequence matching and presented a MSST index structure.作者: Expurgate 時(shí)間: 2025-3-29 01:58
Spatio-temporal Database with Multi-granularitiesand approximate region, ASTD can process the multiple level data together, perform the query in variant precision and handle uncertainty. Compared with similar systems, ASTD is more powerful in multiple granularities, uncertainty, object type and granularity operations.作者: angiography 時(shí)間: 2025-3-29 03:47
A Simple but Effective Dynamic Materialized View Caching we propose a dynamic materialized view management approach with a new hit prediction, which can predict the users’ interest in an ongoing fashion and adapt to changes if necessary. Extensive performance studies show that our approach achieves a high cache hit ratio and speeds up the response time or throughout for different kinds of OLAP queries.作者: BOAST 時(shí)間: 2025-3-29 10:43
https://doi.org/10.1007/978-3-642-76156-0eneralized constrained sliding window queries and proved that our technique is applicable for flexible window settings. Our performance study indicates that the space required in practice is much less than the given theoretical bound and the algorithm supports high speed data streams.作者: finite 時(shí)間: 2025-3-29 11:40
Annalisa Baicchi,Cristiano Brocciasact index file is constructed. By scanning the index file, we can get a very small candidate set, so that the number of page access is dramatically reduced. We demonstrate the effectiveness of our approach on real and synthetic datasets.作者: ungainly 時(shí)間: 2025-3-29 16:46
Identities and Modernities in EuropeCM which allow various client devices to communicate at their best acceptable QoS level through consistent and simple APIs. We present a preliminary prototype of GCM to illustrate its functionalities of communicating with heterogeneous mobile devices by using various communication protocols.作者: 失眠癥 時(shí)間: 2025-3-29 22:16
Advances in Web-Age Information Management978-3-540-27772-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: emulsify 時(shí)間: 2025-3-30 03:19 作者: 細(xì)查 時(shí)間: 2025-3-30 05:10 作者: Prognosis 時(shí)間: 2025-3-30 11:23 作者: 付出 時(shí)間: 2025-3-30 14:09 作者: Anticlimax 時(shí)間: 2025-3-30 20:20 作者: nutrients 時(shí)間: 2025-3-30 21:16 作者: 有花 時(shí)間: 2025-3-31 01:48 作者: 洞察力 時(shí)間: 2025-3-31 09:02 作者: commune 時(shí)間: 2025-3-31 09:49 作者: Flustered 時(shí)間: 2025-3-31 16:59
H. Preuschoft,W.-E. Reif,C. Loitsch,E. Tepeistograms. It is a faster and efficient way to pre-select time sequence in a database and leads to reduce the need of time sequence comparisons when answering similarity queries. A new metric distance function MD ( ) that consistently lower-bounds WED and also satisfies the triangular inequality is 作者: 豐滿中國(guó) 時(shí)間: 2025-3-31 17:59
https://doi.org/10.1007/978-981-99-1786-0tion Method (GEP-SWPM) to mine the relationship between future and historical data directly. (2) GEP-Differential Equation Prediction Method (GEP-DEPM) to mine ordinary differential equations from training data, and predict future trends based on specified initial conditions. (3) A brand new equatio作者: 迷住 時(shí)間: 2025-4-1 01:15 作者: Antarctic 時(shí)間: 2025-4-1 04:17 作者: 發(fā)炎 時(shí)間: 2025-4-1 08:12 作者: 西瓜 時(shí)間: 2025-4-1 10:26
