Advances in Web-Age Information Management: 5th by Tharam S. Dillon, Elizabeth Chang, Farookh Hussain (auth.),

By Tharam S. Dillon, Elizabeth Chang, Farookh Hussain (auth.), Qing Li, Guoren Wang, Ling Feng (eds.)

This publication constitutes the refereed court cases of the fifth overseas convention on Web-Age details administration, WAIM 2004, held in Dalian, China in July 2004.

The fifty seven revised complete papers and 23 revised brief and business papers provided including three invited contributions have been conscientiously reviewed and chosen from 291 submissions. The papers are prepared in topical sections on facts circulate processing, time sequence info processing, safety, cellular computing, cache administration, question assessment, net se's, XML, internet prone, category, and information mining.

Show description

Read or Download Advances in Web-Age Information Management: 5th International Conference, WAIM 2004, Dalian, China, July 15-17, 2004 PDF

Similar international conferences and symposiums books

Field Programmable Logic and Applications: 9th International Workshop, FPL’99, Glasgow, UK, August 30 - September 1, 1999. Proceedings

This e-book includes the papers provided on the ninth overseas Workshop on box ProgrammableLogic and functions (FPL’99), hosted by way of the college of Strathclyde in Glasgow, Scotland, August 30 – September 1, 1999. FPL’99 is the 9th within the sequence of annual FPL workshops. The FPL’99 programme committee has been lucky to have acquired a lot of fine quality papers addressing quite a lot of issues.

Logic Programming and Nonmonotonic Reasoning: 7th International Conference, LPNMR 2004 Fort Lauderdale, FL, USA, January 6-8, 2004 Proceedings

This publication constitutes the refereed complaints of the seventh overseas convention on good judgment Programming and Nonmonotonic Reasoning, LPNMR 2004, held in citadel Lauderdale, Florida, united states in January 2004. The 24 revised complete papers offered including eight procedure descriptions have been conscientiously reviewed and chosen for presentation.

Additional info for Advances in Web-Age Information Management: 5th International Conference, WAIM 2004, Dalian, China, July 15-17, 2004

Sample text

We should break out the assumption about fixing the buffer size in previous work, and adopt a feasible mechanism for adjusting the buffer size of sliding windows to support continuous queries more efficiently. In this paper, we propose the algorithms of adjusting the buffer size of sliding windows dynamically with greedy method and dynamic programming method, in order to support queries more efficiently with the limited available memory, minimize the total error of queries or achieve low memory overhead.

2 Continuous Query Following is an example of continuous queries like SQL. SELECT AVG (temperature) (2-2) FROM w1 [RANGE Now − 100, Now − 20] WHERE predicate ERROR (2%) EVERY (5) BEGIN (70) END (500) Let Q denote the set of continuous queries with the similar syntax with the query (2-2). Generally, ∀q∈Q, we can extract the metadata from the syntax structure of q. The querying-object of the query (2-2) is the sliding window w1. If the sliding window w is the querying-object of q, let U(w,q)=1. Otherwise, let U(w,q)=0.

The querying-object of the query (2-2) is the sliding window w1. If the sliding window w is the querying-object of q, let U(w,q)=1. Otherwise, let U(w,q)=0. We call the value of Now− (Now−100)=100 as querying-width of query (2-2), denoted by Qt(q). e. Max_T(w)= max{Qt(q)| q∈Q∧U(w,q)=1}. The tolerated error of q can be extract from the ERROR clause, which is either relative error or absolute error. In our work, by the mapping function fq, we assume that the tolerated error can be mapped into a value of window-width, denoted by Qe(q).

Download PDF sample

Rated 4.08 of 5 – based on 29 votes

Related posts