66.query Planning For Continuous Aggregation

IEEE TRANSACTIONS ON JOURNAL KNOWLEDGE AND DATA ENGINEERING, MANUSCRIPT ID 1
Query Planning for Continuous Aggregation

Queries over a Network of Data Aggregators
Rajeev Gupta, and Krithi Ramamritham, Fellow IEEE
AbstractContinuous queries are used to monitor changes to time varying data and to provide results useful for online
decision making. Typically a user desires to obtain the value of some aggregation function over distributed data items, for
example, to know value of portfolio for a client; or the AVG of temperatures sensed by a set of sensors. In these queries a client
specifies a coherency requirement as part of the query. We present a low-cost, scalable technique to answer continuous
aggregation queries using a network of aggregators of dynamic data items. In such a network of data aggregators, each data
aggregator serves a set of data items at specific coherencies. Just as various fragments of a dynamic web-page are served by
one or more nodes of a content distribution network, our technique involves decomposing a client query into sub-queries and
executing sub-queries on judiciously chosen data aggregators with their individual sub-query incoherency bounds. We provide a
technique for getting the optimal set of sub-queries with their incoherency bounds which satisfies client querys coherency
requirement with least number of refresh messages sent from aggregators to the client. For estimating the number of refresh
messages, we build a query cost model which can be used to estimate the number of messages required to satisfy the client
specified incoherency bound. Performance results using real-world traces show that our cost based query planning leads to
queries being executed using less than one third the number of messages required by existing schemes.
Index TermsAlgorithms, Continuous queries, Distributed query processing, Data dissemination, Coherency, Performance.
~~~~~~~~~~ ~~~~~~~~~~
1 INTRODUCTION
ppIicalions such as auclions, peisonaI poilfoIio
vaIualions foi financiaI decisions, sensois lased
noniloiing, ioule pIanning lased on liaffic infoina-
lion, elc., nake exlensive use of dynanic dala. Ioi such
appIicalions, dala fion one oi noie independenl dala
souices nay le aggiegaled lo deleinine if sone aclion is
vaiianled. Civen lhe incieasing nunlei of such appIica-
lions lhal nake use of highIy dynanic dala, lheie is sig-
nificanl inleiesl in syslens lhal can efficienlIy deIivei lhe
ieIevanl updales aulonalicaIIy. As an exanpIe, considei
a usei vho vanls lo liack a poilfoIio of slocks in diffeienl
(liokeiage) accounls. Slock dala vaIues fion possilIy
diffeienl souices aie iequiied lo le aggiegaled lo salisfy
useis iequiienenl. These aggiegalion queiies aie Iong
iunning queiies as dala is conlinuousIy changing and lhe
usei is inleiesled in nolificalions vhen ceilain condilions
hoId. Thus, iesponses lo lhese queiies aie iefieshed con-
linuousIy. In lhese conlinuous queiy appIicalions, useis
aie IikeIy lo loIeiale sone inaccuiacy in lhe iesuIls. Thal
is, lhe exacl dala vaIues al lhe coiiesponding dala souices
need nol le iepoiled as Iong as lhe queiy iesuIls salisfy
usei specified accuiacy iequiienenls. Ioi inslance, a
poilfoIio liackei nay le happy vilh an accuiacy of $1O.
'DWD LQFRKHUHQF\: Dala accuiacy can le specified in
leins of inccncrcncq cf a da|a i|cn, dcfincd as |nc aosc|u|c
diffcrcncc in ta|uc cf |nc da|a i|cn a| |nc da|a scurcc and |nc
ta|uc |ncun |c a c|icn| cf |nc da|a. |c| ti(|) denole lhe vaIue
of lhe i
|n
dala ilen al lhe dala souice al line |, and Iel lhe
vaIue lhe dala ilen knovn lo lhe cIienl le ui(|). Then lhe
dala incoheiency al lhe cIienl is given ly [ti(|)-ui(|)[. Ioi
a dala ilen vhich needs lo le iefieshed al an incoheiency
lound C a dala iefiesh nessage is senl lo lhe cIienl as
soon as dala incoheiency exceeds C, i.e., [ti(|)-ui(|) [ > C.
1HWZRUN RI GDWD DJJUHJDWRUV: Dala iefiesh fion dala
souices lo cIienls can le done using pusn oi pu|| lased
nechanisns. In a push lased nechanisn dala souices
send updale nessages lo cIienls on lheii ovn vheieas in
puII lased nechanisn dala souices send nessages lo lhe
cIienl onIy vhen lhe cIienl nakes a iequesl. We assune
lhe push lased nechanisn foi dala liansfei lelveen dala
souices and cIienls. Ioi scaIalIe handIing of push lased
dala disseninalion, nelvoik of dala aggiegalois aie pio-
posed in lhe Iileialuie |5, 7, 22j. In such nelvoik of dala
aggiegalois, dala iefieshes occui fion dala souices lo lhe
cIienls lhiough one oi noie dala aggiegalois.
In lhis papei ve assune lhal each dala aggiegaloi
nainlains ils configuied incoheiency lounds foi vaiious
dala ilens. Iion a dala disseninalion capaliIily poinl of
viev, each dala aggiegaloi (DA) is chaiacleiized ly a sel
of (di, ci) paiis, vheie di is a dala ilen vhich lhe DA can
disseninale al an incoheiency lound ci. The configuied
incoheiency lound of a dala ilen al a dala aggiegaloi can
le nainlained using any of foIIoving nelhods: (a) The
dala souice iefieshes lhe dala vaIue of lhe DA vhenevei
DAs incoheiency lound is aloul lo gel vioIaled. This
nelhod has scaIaliIily piolIens. (l) Dala aggiegaloi(s)
vilh lighlei incoheiency lound heIp lhe DA lo nainlain
ils incoheiency lound in a scaIalIe nannei as expIained
in |5,7j.
xxxx-xxxx/0x/$xx.00 200x IEEE
A

Rajcct Gup|a is ui|n |8M Rcscarcn, Ncu Dc|ni. |-nai|.
grajcctin.ion.ccn.
Kri|ni Rananri|nan is ui|n |ndian |ns|i|u|c cf Tccnnc|cgq, Munoai. |-
nai|. |ri|nicsc.ii|o.ac.in.
Manuscrip| rcccitcd (Maq 05, 2010).
Digital Object Indentifier 10.1109/TKDE.2011.12 1041-4347/11/$26.00 2011 IEEE
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication.
2 IEEE TRANSACTIONS ON JOURNAL NAME, MANUSCRIPT ID

|xanp|c 1: In a nelvoik of dala aggiegalois nanaging
dala ilens d1-d4, vaiious aggiegalois can le chaiacleiized
as-
a1: |(d1, O.5), (d3, O.2)
a2: |(d1, 1.O), (d2, O.1), (d4, O.2)
Aggiegaloi a1 can seive vaIues of d1 vilh an
incoheiency lound giealei lhan oi equaI lo O.5 vheieas a2
can disseninale lhe sane dala ilen al a Ioosei
incoheiency lound of 1.O oi noie. In such a nelvoik of
aggiegalois of nuIlipIe dala ilens aII lhe nodes can le
consideied as peeis since a node ai can heIp anolhei node
a| lo nainlain incoheiency lound of lhe dala ilen d1
(incoheiency lound of d1 al ai is lighlei lhan lhal al a|) lul
lhe node ai gels vaIues of anolhei dala ilen d2 fion a|.
1.1 Aggregate Queries and their Execution
In lhis papei ve piesenl a nelhod foi execuling
conlinuous nuIli-dala aggiegalion queiies, using a
nelvoik of dala aggiegalois, vilh lhe oljeclive of
nininizing lhe nunlei of iefieshes fion dala
aggiegalois lo lhe cIienl. Iiisl ve give lvo nolivaling
scenaiios vheie lheie aie vaiious oplions foi execuling a
nuIli-dala aggiegalion queiy and one nusl seIecl a
pailicuIai oplion lo nininize lhe nunlei of nessages.
Sccnaric1: Considei a cIienl queiy Q = 5Od1 + 2OOd2 + 15Od3,
vheie d1, d2, d3 aie diffeienl slocks in a poilfoIio, vilh a
iequiied incoheiency lound of $8O. We vanl lo execule
lhis queiy ovei lhe dala aggiegalois given in |xanp|c1,
nininizing lhe nunlei of iefieshes.
Sccnaric2: In a sensoi nelvoik, considei an AVC queiy
ovei a |argc| sel of sensois (say, d1, d2 and d3) injecled al a
qucrq node. In-nelvoik aggiegalion is used foi eneigy
efficienl piopagalion of aggiegales |29j. Ioi consliucling
an aggiegalion liee, connecling lhe |argc| sensois and lhe
qucrq node, each node can seIecl a palh lo lhe queiy node
lased on ceilain prcfcrcncc fac|cr. We vanl lo seIecl lhe in-
nelvoik aggiegalion palh such lhal lhe aggiegalion
queiy gels execuled vilh lhe nininun nunlei of
nessages.
In lolh lhe cases a Iiniled nunlei of oplions aie
avaiIalIe foi execuling lhe aggiegalion queiy. In lhis
papei ve viII use Sccnaric1 as lhe iunning exanpIe lul
iesuIls ollained and concIusions diavn aie appIicalIe lo
lolh lhe scenaiios. SpecificaIIy ve ansvei lhe queslion:
Gitcn a c|icn| qucrq pcscd ctcr a nqpc|nc|ica| da|aoasc cf
nu||ip|c da|a scurccs, una| suo-qucrics sncu|d oc pcscd a|
taricus da|a aggrcga|crs sc |na| |nc nunocr cf rcfrcsncs frcn
|ncsc aggrcga|crs |c |nc c|icn| can oc nininizcd? We use
addilive aggiegalion queiies lo deveIop oui appioach in
delaiI and lovaids lhe end of lhe papei desciile hov
nax/nin queiies can le handIed.
Ioi ansveiing lhe nuIli-dala aggiegalion queiy in
Sccnaric1, lheie aie lhiee oplions foi lhe cIienl lo gel lhe
queiy iesuIls. IiislIy, lhe cIienl nay gel lhe dala ilens d1,
d2 and d3 sepaialeIy. The queiy incoheiency lound can le
divided anong dala ilens in vaiious vays ensuiing lhal
queiy incoheiency is leIov lhe incoheiency lound. In
lhis papei, ve shov lhal gelling dala ilens independ-
enlIy is a coslIy oplion. This slialegy ignoies lhe facl lhal
lhe cIienl is inleiesled onIy in lhe aggiegaled vaIue of lhe
dala ilens and vaiious aggiegalois can disseninale noie
lhan one dala ilen.
SecondIy, if a singIe DA can disseninale aII lhiee dala
ilens iequiied lo ansvei lhe cIienl queiy, lhe DA can
consliucl a conposile dala ilen coiiesponding lo lhe
cIienl queiy (dq=5O d1 + 2OO d2 + 15O d3) and disseninale
lhe iesuIl lo lhe cIienl so lhal lhe queiy incoheiency
lound is nol vioIaled. Il is olvious lhal if ve gel lhe
queiy iesuIl fion a singIe DA, lhe nunlei of iefieshes
viII le nininun (as dala ilen updales nay canceI oul
each olhei, lheiely nainlaining lhe queiy iesuIls vilhin
lhe incoheiency lound). As diffeienl dala aggiegalois
disseninale diffeienl sulsels of dala ilens, no dala
aggiegaloi nay have aII lhe dala ilens iequiied lo
execule lhe cIienl queiy vhich is indeed lhe case in
|xanp|c1. Iuilhei, even if an aggiegaloi can iefiesh aII
lhe dala ilens, il nay nol le alIe lo salisfy lhe queiy
coheiency iequiienenls. In such cases lhe queiy has lo le
execuled vilh dala fion nuIlipIe aggiegalois.
A lhiid oplion is lo divide lhe queiy inlo a nunlei of
sul-queiies and gel lheii vaIues fion individuaI DAs. In
lhal case, lhe cIienl queiy iesuIl is ollained ly conlining
lhe iesuIls of nuIlipIe sul-queiies. Ioi lhe DAs given in
|xanp|c1, lhe queiy Q can le divided in lvo aIleinalive
vays:
P|an1: ResuIl of sul-queiy 5O d1 + 15O d3 is seived ly a1
vheieas vaIue of d2 is seived ly a2.
P|an2: VaIue of d3 is seived ly a1 vheieas iesuIl of sul-
queiy 5O d1 + 2OO d2 is seived ly a2.
In lolh lhe pIans, conlining lhe sul-queiy vaIues al
lhe cIienl gives lhe queiy iesuIl. ul, seIecling lhe oplinaI
pIan anong vaiious oplions is nol-liiviaI. InluiliveIy, ve
shouId le seIecling lhe pIan vilh Iessei nunlei of sul-
queiies. ul lhal is nol guaianleed lo le lhe pIan vilh lhe
Ieasl nunlei of nessages. Iuilhei, ve shouId seIecl lhe
sul-queiies such lhal updales lo vaiious dala ilens ap-
peaiing in a sul-queiy have noie chances of canceIing
each olhei as lhal viII ieduce lhe need foi iefiesh lo lhe
cIienl. In lhe alove exanpIe, if updales lo d1 and d3 aie
such lhal vhen d1 incieases, d3 decieases, and vice-veisa,
lhen seIecling p|an1 nay le leneficiaI. We give a nelhod
lo seIecl lhe queiy pIan lased on lhese olseivalions.
WhiIe soIving lhe alove piolIen, ve ensuie lhal each
dala ilen foi a cIienl queiy is disseninaled ly one and
onIy one dala aggiegaloi. AIlhough a queiy can le di-
vided in such a vay lhal a singIe dala ilen is seived ly
nuIlipIe DAs (e.g., 5O d1 + 2OO d2 + 15O d3 is divided inlo
lvo sul-queiies 5O d1 + 13O d2 and 7O d2 + 15O d3), in doing
so lhe sane dala ilen is piocessed al nuIlipIe aggiega-
lois, incieasing lhe unnecessaiy piocessing Ioad (fuilhei,
in case of paid dala sulsciiplions il is nol piudenl lo gel
lhe sane dala ilen fion nuIlipIe souices). y dividing
lhe cIienl queiy inlo disjoinl sul-queiies ve ensuie lhal a
dala ilen updale is piocessed onIy once foi each queiy.
Sul-queiy incoheiency lounds aie iequiied lo le de-
iived using lhe queiy incoheiency lounds such lhal, le-
sides salisfying lhe cIienl coheiency iequiienenls, lhe
chosen DA (vheie lhe sul-queiy is lo le execuled) is ca-
palIe of salisfying lhe aIIocaled sul-queiy incoheiency
lound. Ioi exanpIe, in p|an1, incoheiency lound aIIo-
caled lo lhe sul-queiy 5Od1 + 15Od3 shouId le giealei lhan
GUPTA ET AL.: QUERY PLANNING FOR CONTINUOUS QUERIES IN DYNAMIC DATA DISSEMINATION NETWORKS 3

55 (=5O*O.5+15O*O.2) as lhal is lhe lighlesl incoheiency
lound vhich lhe aggiegaloi a1 can salisfy foi lhe sul-
queiy 5Od1 + 15Od3. We shov lhal lhe nunlei of iefieshes
aIso depends on lhe division of lhe queiy incoheiency
lounds anong sul-queiy incoheiency lounds. A siniIai
iesuIl vas iepoiled foi dala incoheiency lounds in |11j.
Nexl ve piesenl piolIen slalenenl foinaIIy and oui
conliilulions.
1.2 Problem Statement and Contributions
VaIue of a conlinuous veighled addilive aggiegalion
queiy, al line |, can le caIcuIaled as:
) ) ( ( ) (
1
=
=
q
n
i
qi qi q
w t v t V (1)
Vq is lhe vaIue of a cIienl queiy q invoIving nq dala ilens
vilh lhe veighl of lhe i
|n
dala ilen leing
qi
w , 1i nq. Such
a queiy enconpasses SQL aggiegalion opeialois SUM and
AVC lesides geneiaI veighled aggiegalion queiies such
as poilfoIio queiies, invoIving aggiegalion of slock piices,
veighled vilh nunlei of shaies of slocks in lhe poilfoIio.
Suppose lhe iesuIl foi lhe queiy given ly Lqualion (1)
needs lo le conlinuousIy piovided lo a usei al lhe queiy
incoheiency lound Cq. Then, lhe disseninalion nelvoik
has lo ensuie lhal:
q qi
n
i
qi qi
C w t u t v
q

=
| ) ) ( ) ( ( |
1
(2)
Whenevei dala vaIues al souices change such lhal
queiy incoheiency lound is vioIaled, lhe updaled vaIue
shouId le iefieshed lo lhe cIienl. If lhe nelvoik of aggie-
galois can ensuie lhal lhe i
|n
dala ilen has incoheiency
lound Cqi lhen lhe foIIoving condilion ensuies lhal lhe
queiy incoheiency lound Cq

is salisfied:

=
q
n
i
q qi qi
C w C
1
) ( (3)
The cIienl specified queiy incoheiency lound needs lo
le liansIaled inlo incoheiency lounds foi individuaI dala
ilens oi sul-queiies such lhal Lqualion (3) is salisfied. Il
shouId le noled lhal Lqualion (3) is a sufficienl condilion
foi salisfying lhe queiy incoheiency lound lul nol neces-
saiy. This vay of liansIaling lhe queiy incoheiency
lound inlo lhe sul-queiy incoheiency lounds is iequiied
if dala is liansfeiied lelveen vaiious nodes using onIy
push lased nechanisn.
:e need a nelhod foi (a) oplinaIIy dividing a cIienl
queiy inlo sul-queiies and (l) assigning incoheiency
lounds lo lhen such lhal (c) lhe deiived sul-queiies can
le execuled al chosen DAs and (d) lolaI queiy execulion
cosl, in leins of nunlei of iefieshes lo lhe cIienl, is
nininized.
:c prctc |na| |nc prco|cn cf cnccsing suo-qucrics uni|c
nininizing qucrq cxccu|icn ccs| is an NP-nard prco|cn. lc
gitc cfficicn| a|gcri|nns |c cnccsc |nc sc| cf suo-qucrics and
|ncir ccrrcspcnding inccncrcncq ocunds fcr a gitcn c|icn|
qucrq. In conliasl, aII ieIaled voik in lhis aiea |5,11,12j
piopose gelling individuaI dala ilens fion lhe aggiega-
lois vhich, as ve shov in lhis papei, Ieads lo Iaige nun-
lei of iefieshes. Ioi soIving lhe alove piolIen of opli-
naIIy dividing lhe cIienl queiy inlo sul-queiies, ve fiisl
need a nelhod lo eslinale lhe queiy execulion cosl foi
vaiious aIleinalive oplions. A nc|ncd fcr cs|ina|ing |nc
qucrq cxccu|icn ccs| is anc|ncr inpcr|an| ccn|riou|icn cf |nis
papcr. As ve divide lhe cIienl queiy inlo sul-queiies such
lhal each sul-queiy gels execuled al diffeienl aggiegaloi
nodes, lhe queiy execulion cosl (i.e., nunlei of iefieshes)
is lhe sun of lhe execulion cosls of ils consliluenl sul-
queiies. We nodeI lhe sul-queiy execulion cosl as a func-
lion of disseninalion cosls of lhe individuaI dala ilens
invoIved. The dala disseninalion cosl is dependenl on
dala dynanics and lhe incoheiency lound associaled
vilh lhe dala. We nodeI lhe dala dynanics using a dala
dynanics nodeI, and lhe effecl of lhe incoheiency lound
using an incoheiency lound nodeI. These lvo nodeIs
aie conlined lo gel lhe eslinale of lhe dala dissenina-
lion cosl.
To enpiiicaIIy evaIuale oui appioach, ve use ieaI-
voiId dala fion lhe sensoi and slock naikel donains |9j.
Sensoi nelvoik dala used veie lenpeialuie and vind
sensoi dala fion Ceoiges ank Ciuises AIlalioss Ship-
loaid |13j. Slock liaces of 45 slocks veie ollained ly pe-
iiodicaIIy poIIing n||p.//financc.qancc.ccn. We coIIecled
2OOOO sanpIes foi each dala ilen vilh a peiiod of 5 sec-
onds. Appendix A gives slalislicaI piopeilies of sone of
lhese slock liaces. In lhis papei ve piesenl iesuIls using
slock dala onIy lul siniIai iesuIls veie ollained foi sen-
soi dala as veII |8j. Oui sinuIalion sludies shov lhal foi
conlinuous aggiegalion queiies:
Our nc|ncd cf ditiding qucrq in|c suo-qucrics and cxccu|-
ing |ncn a| inditidua| DAs rcquircs |css |nan cnc |nird cf
|nc nunocr cf rcfrcsncs rcquircd in |nc cxis|ing scncncs.
Ioi ieducing lhe nunlei of iefieshes noie dynanic
dala ilens shouId le pail of sul-queiy invoIving Iai-
gei nunlei of dala ilens.
Our nc|ncd cf cxccu|ing qucrics ctcr a nc|ucr| cf da|a ag-
grcga|crs is prac|ica| since il can le inpIenenled using a
nechanisn siniIai lo URL-ieviiling |4j in conlenl dislii-
lulion nelvoiks (CDNs). }usl Iike in a CDN, lhe cIienl
sends ils queiy lo lhe cenliaI sile. Ioi gelling appiopiiale
aggiegalois (edge nodes) lo ansvei lhe cIienl queiy (vel
page), lhe cenliaI sile has lo fiisl deleinine vhich dala
aggiegalois have lhe dala ilens iequiied foi lhe cIienl
queiy. If lhe cIienl queiy can nol le ansveied ly a singIe
dala aggiegaloi, lhe queiy is divided inlo sul-queiies
(fiagnenls) and each sul-queiy is assigned lo a singIe
dala aggiegaloi. In case of a CDN, vel pages division
inlo fiagnenls is a page design issue, vheieas, foi con-
linuous aggiegalion queiies, lhis issue has lo le handIed
on pei-queiy lasis ly consideiing da|a disscnina|icn capa-
oi|i|ics of dala aggiegalois as expIained in |xanp|c 1.
We vouId Iike lo diffeienliale lhe cuiienl voik vilh
lhal of designing a nelvoik of dala aggiegalois foi a spe-
cific sel of cIienl queiies. Wheieas ve piopose a nelhod
lo ansvei a cIienl queiy using a given nelvoik of dala
aggiegalois, if lhe cIienl queiies aie fixed, one can use lhe
cIienl queiies lo oplinaIIy consliucl a nelvoik of
dala aggiegalois as in |5,7,22j. Oui ain of nininizing lhe
nunlei of nessages lelveen aggiegalois and cIienl
conpIinenls lhe voiks of |5,7,22j. Togelhei, lhey can le
used lo nininize lhe lolaI nunlei of nessages lelveen
dala souices and cIienls.

1.3 Outline of the Paper
The cosl nodeI foi dala disseninalion is deveIoped in
Seclion 2. In Seclion 3, ve piesenl lhe queiy cosl nodeI
foi lhe addilive aggiegalion queiies. Il uses lhe dala dis-
seninalion nodeI and a neasuie foi capluiing coiieIa-
lion lelveen dala dynanics. OplinaI queiy pIanning foi
addilive queiies is piesenled in Seclion 4. ResuIls of pei-
foinance evaIualions of aIgoiilhns desciiled in Seclion 4
aie piesenled in Seclion 5. Seclion 6 discusses oplinaI
queiy pIanning foi MAX queiies. Mosl concIusions diavn
foi lhis cIass of queiies aie siniIai lo lhal foi addilive
aggiegalion queiies. ReIaled voik is piesenled in Seclion
7. Discussion aloul vaiious aspecls of oui voik, concIu-
sions and fuluie voik aie piesenled in Seclion 8. TalIe 1
gives sunnaiy of vaiious synloIs used in lhe papei and
lheii desciiplions.
2 DATA DISSEMINATION COST MODEL
In lhis seclion ve piesenl lhe nodeI lo eslinale lhe nun-
lei of iefieshes iequiied lo disseninale a dala ilen vhiIe
nainlaining a ceilain incoheiency lound. Theie aie lvo
piinaiy faclois affecling lhe nunlei of nessages lhal aie
needed lo nainlain lhe coheiency iequiienenl: (a)lhe
coheiency iequiienenl ilseIf and (l)dynanics of lhe dala.
2.1 Incoherency Bound Model
Considei a dala ilen vhich needs lo le disseninaled al
an incoheiency lound C, i.e., nev vaIue of lhe dala ilen
viII le pushed if lhe vaIue deviales ly noie lhan C fion
lhe Iasl pushed vaIue. Thus lhe nunlei of disseninalion
nessages viII le piopoilionaI lo lhe piolaliIily of [t(|)-
u(|)[ giealei lhan C foi dala vaIue t(|) al lhe
souice/aggiegaloi and u(|) al lhe cIienl, al line |. A dala
ilen can le nodeIed as a disciele line iandon piocess
|1Oj vheie each slep is coiieIaled vilh ils pievious slep.
In push lased disseninalion, a dala souice can foIIov
one of lhe foIIoving schenes:
(a) Dala souice pushes lhe dala vaIue vhenevei il diffeis
fion lhe Iasl pushed vaIue ly an anounl noie lhan C.
(l) CIienl eslinales dala vaIue lased on seivei specified
paianeleis |12, 16j. The souice pushes lhe nev dala
vaIue vhenevei il diffeis fion lhe (cIienl) eslinaled vaIue
ly an anounl noie lhan C.
In lolh lhese cases, vaIue al lhe souice can le nodeIed
as a iandon piocess vilh aveiage as lhe vaIue knovn al
lhe cIienl. In case (l), lhe cIienl and lhe seivei eslinale
lhe dala vaIue as lhe nean of lhe nodeIed iandon pioc-
ess vheieas in case (a) devialion fion lhe Iasl pushed
vaIue can le nodeIed as zeio nean piocess. Using Che-
lyshevs inequaIily |1Oj:
2
/ 1 ) | ) ( ) ( | ( C C t u t v P > (4)
Thus, ve hypolhesize lhal lhe nunlei of dala iefiesh
nessages is inveiseIy piopoilionaI lo lhe squaie of lhe
incoheiency lound. A siniIai iesuIl vas iepoiled in |5j
vheie dala dynanics veie nodeIed as iandon-vaIks.
9DOLGDWLQJ WKH DQDO\WLFDO PRGHO: To coiioloiale lhe
alove anaIylicaI iesuIl ve sinuIaled dala souices ly
ieading vaIues fion lhe sensoi and slock dala liaces, de-
sciiled in Seclion 1.2, al peiiodic inslances. Ioi lhese ex-
peiinenls, each dala vaIue al lhe fiisl lick is senl lo lhe
cIienl. Dala souices nainlain Iasl senl vaIue foi each cIi-
enl. The souices iead nev vaIue fion lhe liace and send
lhe vaIue lo ils cIienls if and onIy if nol sending il viII
vioIale lhe cIienls incoheiency lound C. Ioi each dala
ilen lhe incoheiency lound vas vaiied and iefiesh nes-
sages, lo ensuie lhal incoheiency lound, veie counled.
Iiguie 1 shovs lhe cuives foi lhe nunlei of push nes-
sages, foi foui iepiesenlalive shaie piice dala ilens, as
lheii coiiesponding incoheiency lounds, and hence 1/C
2
,
aie vaiied. esides vaIidaling lhe anaIylicaI nodeI, lhese
iesuIls piovide one inpoilanl insighl inlo lhe dissenina-
lion nechanisn. As lhe incoheiency lound decieases, lhe
nunlei of nessages incieases as pei anaIylicaI nodeI,
lul lheie is a saluialion effecl foi veiy Iov vaIues of lhe
incoheiency lound (i.e., iighl pail of lhe cuive). This is
due lo lhe facl lhal lhe dala ilens have Iiniled nunlei of
disciele changes in lhe vaIue. Ioi exanpIe, if lhe sensiliv-
ily of a lenpeialuie sensoi is one degiee lhen nunlei of
disseninalion nessages viII nol inciease even if inco-
heiency lound is decieased leIov 1
o
.

Figure 1. Number of pushes vs. incoherency bounds
TalIe1: Inpoilanl synloIs and lheii neaning
Symbols Description
A Set of aggregators in the network.
N Number of data aggregators (DAs).
D Set of data items disseminated by the network.
C Incoherency bounds of data items.
ak k
th
data aggregator, 1kN
Dk Set of data items disseminated by the k
th
DA.
dkj j
th
data item disseminated by the k
th
DA.
tkj Incoherency bound which ak can ensure for dkj.
q Client query.
Cq Incoherency bound for q.
nq Number of data items in q.
dqi i
th
data item of the query q.
vqi(t) Value of the i
th
data item of the query q at time t.
wqi Weight of the data item dqi for the query q.
Vq(t) Value of the query q at time t.
qk Sub-query of q to be executed at ak .
Cqk Incoherency bound of qk.
Rq Sumdiff of the query q.
Correlation measure between data items
Query satisfiability parameter

2.2 Data Dynamics Model
We consideied lvo possilIe oplions lo nodeI dala dy-
nanics. As a fiisl oplion, lhe dala dynanics can le quan-
lified lased on slandaid devialion of lhe dala ilen vaIues
|25j. We lake an exanpIe lo shov vhy slandaid devialion
is nol a good neasuie of dala dynanics in oui case: Sup-
pose dala vaIues in conseculive inslances foi a dala ilen
d1 aie |O, 4, O, 4, O, 4, O, 4 vheieas foi anolhei dala ilen d2
vaIues aie |O, O, O, O, 4, 4, 4, 4. Suppose lolh dala ilens
aie disseninaled vilh an incoheiency lound of 3. Il can
le seen lhal lhe nunlei of nessages iequiied foi nain-
laining lhe incoheiency lound viII le 7 and 1 foi dala
ilens d1 and d2 iespecliveIy vheieas lolh dala ilens have
lhe sane slandaid devialion (=2.138). Thus ve need a
neasuie vhich capluies dala changes aIong vilh ils len-
poiaI piopeilies. This nolivales us lo exanine lhe second
neasuie.
As a second oplion ve consideied Iasl Iouiiei Tians-
foin (IIT) vhich is used in lhe digilaI signaI piocessing
donain lo chaiacleiize a digilaI signaI. IIT capluies nun-
lei of changes in dala vaIue, anounl of changes, and,
lheii linings. Thus IIT can le used lo nodeI dala dynan-
ics lul il has a piolIen. To eslinale lhe nunlei of ie-
fieshes iequiied lo disseninale a dala ilen ve need a
funclion ovei IIT coefficienls vhich can ieluin a scaIai
vaIue. The nunlei of IIT coefficienls can le as high as lhe
nunlei of changes in lhe dala vaIue. Anong IIT coeffi-
cienls, O
lh
oidei coefficienl idenlifies aveiage vaIue of lhe
dala ilen vheieas highei oidei coefficienls iepiesenl
liansienl changes in lhe vaIue of dala ilen. We hypolhe-
size lhal lhe cosl of dala disseninalion foi a dala ilen can
le appioxinaled ly a funclion of lhe 1
sl
IIT coefficienl.
SpecificaIIy, lhe cosl of dala disseninalion foi a dala ilen
viII le piopoilionaI lo dala sundiff defined as:

=
i
i i s
s s R | |
1
(5)
vheie si and si-1 aie lhe sanpIed vaIues of a dala ilen S al
i
lh
and (i-1)
lh
line inslances (i.e., conseculive licks). In
piaclice, sundiff vaIue foi a dala ilen can le caIcuIaled al
lhe dala souice ly laking iunning aveiage of diffeience
lelveen dala vaIues foi conseculive licks. Ioi oui ex-
peiinenls, ve caIcuIaled lhe sundiff vaIues using expo-
nenliaI vindov noving aveiage vilh each vindov hav-
ing 1OO sanpIes and giving 3O veighl lo lhe nosl iecenl
vindov.
9DOLGDWLQJ WKH K\SRWKHVLV We did sinuIalions vilh
diffeienl slocks leing disseninaled vilh incoheiency
lound vaIues of $ O.OO1, O.O1 and O.1. This iange is O.1 lo
1O lines lhe aveiage slandaid devialion of lhe shaie piice
vaIues. Nunlei of iefiesh nessages is pIolled vilh dala
sundiff (in $) in Iiguie 2. The Iineai ieIalionship appeais
lo exisl foi aII incoheiency lound vaIues. To quanlify lhe
neasuie of Iineaiily ve used Ieaison pioducl nonenl
coiieIalion coefficienl (IIMCC) |19j, a videIy used neas-
uie of associalion, neasuiing lhe degiee of Iineaiily le-
lveen lvo vaiialIes. Il is caIcuIaled ly sunning up lhe
pioducls of lhe devialions of lhe dala ilen vaIues fion
lheii nean. IIMCC vaiies lelveen -1 and 1 vilh highei
(alsoIule) vaIues signifying lhal dala poinls can le con-
sideied Iineai vilh noie confidence. Ioi lhiee vaIues of
incoheiency lounds O.OO1, O.O1, and O.1, IIMCC vaIues
veie O.94, O.96 and O.9O iespecliveIy i.e., aveiage devia-
lion fion Iineaiily vas in lhe iange of 5 foi Iov vaIues
of C and 1O foi high vaIues of C. Thus, ve can concIude
lhal, foi Iovei vaIues of lhe incoheiency lounds, Iineai
ieIalionship lelveen dala sundiff and lhe nunlei of ie-
fiesh nessages can le assuned vilh noie confidence. A
Iaigei eiioi foi Iaigei vaIues of C can le expIained as foI-
Iovs:
As pei lhe hypolhesis, a Iaigei vaIue of dala sundiff
shouId iesuIl in noie iefieshes. ul lhal nay nol le liue
vhen eilhei (1) lheie aie Iov anpIilude changes in lhe
conseculive dala vaIues, snaIIei lhan lhe incoheiency
lound, vhich incieases lhe dala sundiff vaIue vilhoul
iequiiing lhe disseninalion of nessages, oi (2) lheie aie
high spikes such lhal lhey aie nuch highei conpaied lo
lhe incoheiency lound Ieading lo noie lhan piopoilionaI
inciease in lhe dala sundiff. The fiisl case viII le noie
pievaIenl foi high vaIues of lhe incoheiency lound
vheieas lhe second case viII le noie pionounced foi Iov
vaIues of lhe incoheiency lound. Thus lhe Iineai ieIalion-
ship lelveen lhe dala sundiff and nunlei of iefieshes
has noie eiioi foi veiy Iov vaIues and veiy high vaIues
of incoheiency lounds. As Iov anpIilude peiluilalions
aie noie pievaIenl lhan high anpIilude spikes in nosl
dala ilens, lhe Iineai ieIalionship is noie accuiale foi
Iovei vaIues of incoheiency lounds.
2.3 Combining Data Dissemination Models
Nunlei of iefiesh nessages is piopoilionaI lo dala sun-
diff Rs and inveiseIy piopoilionaI lo squaie of lhe inco-
heiency lound (C
2
). Iuilhei, ve can see lhal ve need nol
disseninale any nessage vhen eilhei dala vaIue is nol
changing (Rs = O) oi incoheiency lound is unIiniled
(1/C
2
=O). Thus, foi a given dala ilen S, disseninaled

(a) C=0.001 (b) C=0.01 (c) C=0.1
Figure 2. Number of pushes vs. data sumdiff

vilh an incoheiency lound C, lhe dala disseninalion cosl
is piopoilionaI lo Rs/C
2
. In lhe nexl seclion, ve use lhis
dala disseninalion cosl nodeI foi deveIoping cosl nodeI
foi addilive aggiegalion queiies.
3 COST MODEL FOR ADDITIVE AGGREGATION
QUERIES
Considei an addilive queiy ovei lvo dala ilens P and Q
vilh veighls up and uq iespecliveIy, and ve vanl lo es-
linale ils disseninalion cosl. If dala ilens aie disseni-
naled sepaialeIy, lhe queiy sundiff viII le:
| | | |
1 1
+ = + =
i i q i i p q q p p data
q q w p p w R w R w R (6)
Inslead, if lhe aggiegaloi uses lhe infoinalion lhal cIienl
is inleiesled in a queiy ovei P and Q (ialhei lhan lheii
individuaI vaIues), il cieales and pushes a conposile dala
ilen (upp+uqq) lhen lhe queiy sundiff viII le:
| ) ( ) ( |
1 1
+ =
i i q i i p query
q q w p p w R (7)
Rqucrq is cIeaiIy Iess lhan oi equaI conpaied lo Rda|a. Thus
ve need lo eslinale lhe sundiff of an aggiegalion queiy
(i.e., Rqucrq) given lhe sundiff vaIues of individuaI dala
ilens (i.e., Rp and Rq). OnIy dala aggiegalois aie in a posi-
lion lo caIcuIale Rqucrq as diffeienl dala ilens nay le dis-
seninaled fion diffeienl souices. We deveIop lhe queiy
cosl nodeI in lvo slages.
3.1 Modeling Correlation between Data Dynamics
Iion Lqualions (6) and (7) ve can see lhal if lvo dala
ilens aie coiieIaled such lhal as lhe vaIue of one dala
ilen incieases lhal of lhe olhei dala ilen aIso incieases,
lhen Rqucrq viII le cIosei lo Rda|a. On lhe olhei hand if lhe
dala ilens aie inveiseIy coiieIaled lhen Rqucrq viII le Iess
conpaied lo Rda|a. Thus, inluiliveIy, ve can iepiesenl lhe
ieIalionship lelveen Rqucrq and sundiff vaIues of lhe indi-
viduaI dala ilens using a coiieIalion neasuie associaled
vilh lhe paii of dala ilens. SpecificaIIy, if is lhe ccrrc|a-
|icn ncasurc lhen Rqucrq can le viillen as:
) 2 (
2 2 2 2 2
q q p p q q p p query
R w R w R w R w R + + (8)
The ccrrc|a|icn ncasurc is defined such lhal -1 +1.
So, Rqucrq viII aIvays le Iess lhan |upRp+uqRq|(as ex-
pIained eaiIiei) and aIvays le noie lhan |upRp-uqRq|.
The alove ieIalion can le lellei undeislood fion ils sini-
Iaiily vilh lhe slandaid devialion of lhe sun of lvo ian-
don vaiialIes |1Oj. Ioi dala ilens P and Q, can le caI-
cuIaled as:
) ) ( ) ( /( ) ) )( ( (
2
1
2
1 1 1
=
i i i i i i i i
q q p p q q p p (9)
In Appendix , ve discuss a nelhod foi efficienlIy caI-
cuIaling .
3.2 Query based Normalization
Suppose ve vanl lo conpaie lhe cosl of lvo queiies: a
SUM queiy invoIving lvo dala ilens and an AVC queiy
invoIving lhe sane sel of dala ilens. Lel lhe queiy inco-
heiency lound foi lhe SUM and lhe AVC queiies le C1=2C
and C2=C, iespecliveIy. Iion Lqualion (8), sundiff of lhe
SUM queiy viII le doulIe lhal of lhe AVC queiy. Hence,
queiy evaIualion cosl (as pei R/C
2
) of lhe SUM queiy viII
le haIf lhal of lhe AVC queiy. ul, inluiliveIy, disseninal-
ing lhe AVC of lvo dala ilens al a given incoheiency
lound shouId iequiie lhe sane nunlei of iefiesh nes-
sages as lheii SUM vilh doulIe lhe incoheiency lound.
Thus, lheie is a need lo ncrna|izc queiy cosls. Iion a
queiy execulion cosl poinl of viev, a queiy vilh veighls
ui and incoheiency lound C is lhe sane as queiy vilh
veighls ui and incoheiency lound C. So, vhiIe noi-
naIizing ve need lo ensuie lhal lolh, queiy veighls and
incoheiency lounds, aie nuIlipIied ly lhe sane facloi.
NoinaIized queiy sundiff is given ly:
) 2 /( ) 2 (
2 2 2 2 2 2 2
q p q p q q p p q q p p query
w w w w R w R w R w R w R + + + + = (1O)
i.e., lhe vaIue of lhe noinaIizing facloi foi Rqucrq shouId le
q p q p
w w w w 2 / 1
2 2
+ + . The vaIue of lhe incoheiency lound
has lo le adjusled ly lhe sane facloi. NoinaIizalion en-
suies lhal queiies vilh aililiaiy vaIues of veighls can le
conpaied foi execulion cosl eslinales. Lqualion (1O) can
le exlended lo gel queiy sundiff foi any geneiaI veighled
aggiegalion queiy given ly Lqualion (1) as:
+
+
=
= = =
= = =
q q q
q q q
n
i
n
i
n
i j j
qj qi ij qi
n
i
n
i j j
j i qj qi ij
n
i
i qi
Q
w w w
R R w w R w
R
1 1 , 1
2
1 , 1 1
2 2
2
(11)

3.3 Validating the Query Cost Model
To vaIidale lhe queiy cosl nodeI ve peifoined sinuIa-
lions ly consliucling 5O veighled aggiegalion queiies
using lhe slock dala vilh each queiy consisling of 3-7
dala ilens vilh dala veighls unifoinIy disliiluled le-
lveen 1 and 1O. Ioi each queiy lhe nunlei of iefieshes
vas counled foi vaiious incoheiency lounds such lhal
lheii noinaIized vaIues (using noinaIizalion facloi as in
Lqualion (11)) aie lelveen O.O1 and O.5. Iiguie 3(a) shovs
lhal lhe nunlei of nessages is piopoilionaI lo lhe noi-
naIized queiy sundiff as caIcuIaled using Lqualion (11) if
lheii noinaIized incoheiency lounds aie lhe sane. In lhis
case IIMCC vaIue is found lo le 95. Sini-
IaiIy, Iiguie 3 (l) shovs lhe dependence of
lhe nunlei of iefieshes on 1/C
2
lo iIIusliale
lhal lhe ieIalionship lhal hoIds lelveen
lhen foi singIe dala ilen aIso hoIds foi a
queiy vilh nuIlipIe dala ilens. We use lhis
queiy cosl nodeI foi queiy pIanning vhich
is piesenled nexl.
4 QUERY PLANNING FOR WEIGHTED
ADDITIVE AGGREGATION QUERIES
Ioi execuling an incoheiency lounded con-
Figure 3: Query cost validation with varying (a) Sumdiff (b) Incoherency bound

linuous queiy, a queiy pIan is iequiied. The queiy pIan-
ning piolIen can le slaled as:
lnuts: (1) A nelvoik of dala aggiegalois in lhe foin of a
ieIalion f (A, D, C) specifying lhe N dala aggiegalois a|
A (1|N), sel D| D of dala ilens disseninaled ly lhe
dala aggiegaloi a| and incoheiency lound
kj
t vhich lhe
aggiegaloi a| can ensuie foi each dala ilen
kj
d D|.
(2) CIienl queiy q and ils incoheiency lound Cq. An addi-
live aggiegalion queiy q can le iepiesenled as
qi qi
d w ,
vheie
qi
w is lhe veighl of lhe dala ilen
qi
d foi 1inq.
Oututs: (1) q| foi1|N, i.e., sul-queiy foi each dala ag-
giegaloi a|.
(2) Cq| foi 1|N, i.e., incoheiency lounds foi aII lhe sul-
queiies.
Thus, lo gel a queiy pIan ve need lo peifoin foIIoving
lasks:
1. Dc|crnining suo-qucrics: Ioi lhe cIienl queiy q gel sul-
queiies q|s foi each dala aggiegaloi.
2. Ditiding inccncrcncq ocund: Divide lhe queiy inco-
heiency lound Cq anong sul-queiies lo gel Cq| s.
Ioi oplinaI queiy pIanning, alove lasks aie lo le pei-
foined vilh lhe foIIoving oljeclive and consliainls:
Otlmltatlon ob]ectlte: Nunlei of iefiesh nessages is
nininized. In Seclion 3, ve have pioved lhal, foi a sul-
queiy q|, lhe eslinaled nunlei of iefiesh nessages is
given ly Rq|/
2
qk
C

vheie Rq| is lhe sundiff of lhe sul-
queiy q|, Cq| is lhe incoheiency lound assigned lo il and
, lhe piopoilionaIily facloi, is lhe sane foi aII sul-
queiies of a given queiy q. Thus lolaI nunlei of iefiesh
nessages is eslinaled as:
=
=
N
k
qk
qk
q
C
R
Z
1
2
(12)
Hence Zq needs lo le nininized foi nininizing lhe
nunlei of iefieshes.
Constralnt1 q| is cxccu|ao|c a| a|: Lach DA has lhe dala
ilens iequiied lo execule lhe sul-queiy aIIocaled lo il,
i.e., foi each dala ilen
qki
d iequiied foi lhe sul-queiy q|,
qki
d D|.
Constralnt2 Qucrq inccncrcncq ocund is sa|isficd: Queiy
incoheiency shouId le Iess lhan oi equaI lo lhe queiy in-
coheiency lound. Ioi addilive aggiegalion queiies, vaIue
of lhe cIienl queiy is lhe sun of sul-queiy vaIues. As dif-
feienl sul-queiies aie disseninaled ly diffeienl dala ag-
giegalois, ve need lo ensuie lhal sun of sul-queiy inco-
heiencies is Iess lhan oi equaI lo lhe queiy incoheiency
lound. Thus,

q qk
C C (13)
Constralnt3 Suo-qucrq inccncrcncq ocund is sa|isficd: Dala
incoheiency lounds al a| (
kj
t foi
kj
d D|) shouId le such
lhal lhe sul-queiy incoheiency lound Cq| can le salisfied
al lhal DA. The lighlesl incoheiency lound Tq|, vhich lhe
dala aggiegaloi a| can salisfy foi lhe given sul-queiy q|,
can le caIcuIaled as ) (
kj
n
qi qj qi qk
d d t w T
qk
= . Ioi salis-
fying lhis ccns|rain| ve ensuie
qk qk
T C .
IoIIoving is lhe oulIine of oui appioach foi soIving
lhis consliainl oplinizalion piolIen as delaiIed in lhe
iesl of lhis seclion: In Seclion 4.1, ve piove lhal deleinin-
ing sul-queiies vhiIe nininizing Zq, as given ly Lqua-
lion (12), is NP nard. In Seclion 4.2 ve shov lhal, if lhe sel
of sul-queiies (q|) is aIieady given, sul-queiy inco-
heiency lounds Cq|s can le oplinaIIy deleinined lo
nininize Zq. As oplinaIIy dividing lhe queiy inlo sul-
queiies is NP-nard and lheie is no knovn appioxinalion
aIgoiilhn, in Seclion 4.3, ve piesenl lvo heuiislics foi
dc|crnining suo-qucrics vhiIe salisfying as nany con-
sliainls as possilIe (Ccns|rain|1 and Ccns|rain|2 lo le pie-
cise). Then ve piesenl vaiialion of lhe lvo heuiislics foi
ensuiing lhal suo-qucrq inccncrcncq ocund is sa|isficd (Ccn-
s|rain|3). In pailicuIai, lo gel a soIulion of lhe queiy pIan-
ning piolIen, lhe heuiislics piesenled in Seclion 4.3 aie
used foi dc|crnining suo-qucrics. Then, using lhe sel of
sul-queiies, lhe nelhod oulIined in Seclion 4.2 is used foi
ditiding inccncrcncq ocund.
4.1 Finding Optimal Query Plan is NP-hard
Ioi pioving lhal lhe piolIen is NP-nard, ve use ieduc-
lion fion 3-dinensionaI nalching (3DM) piolIen |15j.
'03UREOHP: Civen lhiee sels X, Y and Z, each vilh
n eIenenls, and a sel M X Y Z, does lheie exisls a
sulsel MM such lhal eveiy eIenenl of sels X, Y and Z
occui in M once and onIy once` (The caidinaIily of M
viII le n if il does exisl).
We use a decision veision of lhe queiy pIanning piolIen
lo ieduce lhe 3DM piolIen. To soIve lhe 3DM piolIen
ve ieduce il lo a SUM queiy of 3n ilens, and incoheiency
lound n, as given in Appendix C. In lhe appendix, ve
piove lhal lhe lesl queiy pIan having queiy cosl of 3n
viII consisl of n sul-queiies each vilh 3 dala ilens and
sul-queiy incoheiency lound of 1. If ve can find such an
oplinaI pIan, lhiee dala ilens fion lhe chosen dala ag-
giegalois foin a liipIel foi lhe sel M vhiIe ensuiing lhal
each and eveiy eIenenl of sels X, Y and Z occuis once
and onIy once in M. ConveiseIy, lheie can le cases vhen:
(1) The sun queiy can nol le salisfied as no conlinalion
of dala aggiegaloi can disseninale aII lhe queiy dala
ilens. In lhis case, ve can easiIy see lhal lheie can nol le
any M M such lhal aII eIenenls of X, Y and Z le in M .
(2) Cosl of seIecled oplinaI pIan is noie lhan 3n. Thal
inpIies lhal lhe pIan has al-Ieasl one dala aggiegaloi dis-
seninaling sul-queiy vilh Iess lhan 3 dala ilens (see
Appendix C). Since ve gel M using aII lhe eIenenls of
lhe seIecled dala aggiegalois (slep 5 in lhe appendix),
sone eIenenls aie iepealed in M.
In lolh of lhese cases 3DM is ansveied in negalion. Thus,
using 3DM ve have pioved lhal oplinaI pIanning piol-
Ien is NP-haid. Ioi lhe puipose of lhe nexl sul-seclion
(4.2) ve assune lhal ve have aIieady dc|crnincd suo-
qucrics vhiIe salisfying Ccns|rain|1 and ve shov lhal in-
ccncrcncq ocund ditisicn can le peifoined oplinaIIy vhiIe
salisfying Ccns|rain|2 and Ccns|rain|3.
4.2 Optimal Allocation of Query Incoherency
Bound among Sub-queries
If ve knov lhe division of lhe cIienl queiy inlo sul-

queiies, using Lqualion (11) ve can caIcuIale sundiff vaI-
ues of aII lhe sul-queiies. Thus, ve need lo nininize Zq
given ly Lqualion (12) suljecl lo Ccns|ain|2 (qucrq incc-
ncrcncq ocund is sa|isficd) and Ccns|ain|3 (suo-qucrq incc-
ncrcncq ocund is sa|isficd). We can gel a cIose foin expies-
sion ly soIving Lqualion (12) vilh Lqualion (13) using
Lagiange MuIlipIiei schene (See Appendix D). In lhal
schene ve nininize +
= =
N
k
q qk
N
k
qk qk
C C C R
1 1
2
) ( ) / ( foi a
conslanl lo gel vaIues of
qk
C s as:
=
=
N
k
qk qk q qk
R R C C
1
3 / 1 3 / 1
) /( (14)
i.e., vilhoul lhe Ccns|ain|3, sul-queiy incoheiency
lounds shouId le aIIocaled in piopoilion lo
3 / 1
qk
R . In Sec-
lion 4.3, ve use lhis expiession lo deveIop heuiislics foi
oplinaIIy dividing lhe cIienl queiy inlo sul-queiies. If ve
aIso considei Ccns|ain|3 lhen, ve can nodeI lhe piolIen
of nininizalion of Zq (vhiIe salisfying Ccns|ain|2 and
Ccns|ain|3) as a (non-Iineai) convex oplinizalion piol-
Ien. The non-Iineai convex oplinizalion piolIen can le
soIved using vaiious convex oplinizalion lechniques
avaiIalIe in lhe Iileialuie such as giadienl descenl
nelhod, laiiiei nelhod elc. We used giadienl descenl
nelhod (fninccn funclion in MATLA) lo soIve lhis non-
Iineai oplinizalion piolIen lo gel lhe vaIues of individ-
uaI sul-queiy incoheiency lounds foi a given sel of sul-
queiies. In lhe nexl sul-seclion ve desciile lvo gieedy
heuiislics lo dc|crninc suo-qucrics vhiIe using lhe foinuIa-
lions deveIoped in lhis seclion.
4.3 Greedy Heuristics for Deriving the Sub-queries
Iiguie 4 gives lhe oulIine of gieedy aIgoiilhn foi deiiv-
ing sul-queiies. Iiisl, ve gel a sel of naxina| sul-queiies
(Mq) coiiesponding lo aII lhe dala aggiegalois in lhe nel-
voik. The naxina| sul-queiy foi a dala aggiegaloi is de-
fined as lhe Iaigesl pail of lhe queiy vhich can le dis-
seninaled ly lhe DA (i.e., lhe naxinaI sul-queiy has aII
lhe queiy dala ilens vhich lhe DA can disseninale). Ioi
exanpIe, considei a cIienl queiy 5Od1 +2OOd2+15Od3. Ioi
lhe dala aggiegalois a1 and a2 given in |xanp|c 1, lhe
naxinaI sul-queiy foi a1 viII le n1=5Od1 +15Od3, vheieas
foi a2 il viII le n2=5Od1 + 2OOd2. Ioi lhe given cIienl queiy
(q) and ieIalion consisling of dala aggiegalois, dala-ilens,
and dala incoheiency lounds (f(A, D, C)) naxinaI sul-
queiies can le ollained foi each dala aggiegaloi ly foin-
ing sul-queiy invoIving aII dala ilens in lhe inleiseclion
of queiy dala ilens and lhose leing disseninaled ly lhe
DA. This opeialion can le peifoined in O([q[.nax[D|[)
vheie [q[ is nunlei of dala ilens in lhe queiy, nax[D|[
is lhe naxinun nunlei of dala ilens disseninaled ly
any DA. Ioi each sul-queiy n Mq, ils sundiff Rn can le
caIcuIaled using Lqualion (11). Diffeienl ciileiia () can
le used lo seIecl a sul-queiy in each ileialion of vaiious
gieedy heuiislics. AII dala ilens coveied ly lhe seIecled
sul-queiy aie ienoved fion aII lhe ienaining sul-
queiies in Mq lefoie peifoining lhe nexl ileialion. Il
shouId le noled lhal sul-queiies foi DAs can le nuII.
Nov ve desciile lvo ciileiia () foi lhe gieedy heu-
iislics, 1) nin-ccs|: eslinale of queiy execulion cosl is
nininized, and 2) nax-gain: eslinaled gain due lo execul-
ing lhe queiy using sul-queiies is naxinized.
4.3.1 Minimum Cost Heuristic
As ve need lo nininize lhe queiy cosl, a sul-queiy vilh
nininun ccs| pcr da|a i|cn can le chosen in each ileialion
of lhe aIgoiilhn given ly Iiguie 4, i.e., ciileiion
nininize (Rn/Cn
2
[n[). ul fion Lqualion (14) ve can see
lhal lhe sul-queiy incoheiency lounds shouId le aIIo-
caled in piopoilion lo
3 / 1
k
R . Using Lqualions (12) and (14)
ve gel:
=
=
N
k
qk
q
q
R
C
Z
1
3 / 1
3 / 2
3 / 1
1
(15)
Iion Lqualion (15), il is cIeai lhal foi nininizing lhe
queiy execulion cosl ve shouId seIecl lhe sel of sul-
queiies so lhal
3 / 1
qk
R is nininized. We can do lhal ly
using ciileiion nininizc (
3 / 1
m
R /[n[) in lhe gieedy aIgo-
iilhn. Once ve gel lhe oplinaI sel of sul-queiies ve can
use Lqualion (15) and Ccns|rain|3 (
qk qk
T C ) lo oplinaIIy
aIIocale lhe queiy incoheiency lound anong lhen using
any of lhe convex oplinizalion lechniques as discussed in
Seclion 4.2. ul lhis nelhod of fiisl deiiving sul-queiies
and lhen aIIocaling lhe incoheiency lounds has a piol-
Ien vhich is desciiled nexl.
4.3.2 Satisfiability of sub-query incoherency bound
In lhe soIulion desciiled in lhe pievious seclion, ve seIecl
lhe sel of sul-queiies (and coiiesponding DAs) and lhen
aIIocale lhe incoheiency lound anong lhen using a con-
vex oplinizalion lechnique. ul lhe piolIen of inco-
heiency lound aIIocalion anong chosen DAs nay nol
have any feasilIe soIulion. Theie nay le silualions
vheie, aIlhough lhe given nelvoik of dala aggiegalois is
alIe lo salisfy lhe queiy coheiency iequiienenls lul once
lhe sel of sul-queiies is seIecled lhe incoheiency lound
aIIocalion is nol possilIe. Such a silualion can le iIIus-
lialed vilh lhe heIp of lhe nelvoik of dala aggiegalois
consisling of lvo DAs a1 and a2 as given in |xanp|c 1.
Considei a cIienl queiy Q=5Od1 + 2OOd2 + 15Od3 vilh an
incoheiency lound of 8O. As discussed in Seclion 1, lheie
aie (al-Ieasl) lvo possilIe queiy pIans (P|an1 and P|an2)
lo ansvei lhis queiy. As suggesled in lhe pievious sul-
seclion, ve seIecl sul-queiies having nininun
3 / 1
qk
R ,
lhus lased on dala dynanics il is possilIe lhal ve seIecl
rcsu|| ,
uni|c Mq
cnccsc a suo-qucrq ni Mq ui|n cri|cricn ,
rcsu|| rcsu|| ni, Mq Mq -; ni ),
fcr cacn da|a i|cn d ni
fcr cacn nj Mq
nj nj -;d),
if nj = Mq Mq -; nj ),
c|sc ca|cu|a|c sundiff fcr ncdificd nj,
rc|urn rcsu||
Figure 4: Greedy algorithm for query plan selection

p|an2 as lhe oplinaI pIan. ul fion lhe specificalion of
aggiegalois a1 and a2 in |xanp|c1, ve see lhal il is nol
possilIe foi p|an2 lo salisfy lhe cIienl specified inco-
heiency lound as lighlesl incoheiency lound lhal can le
salisfied ly lhe seIecled aggiegalois (Tp|an2=5O*1 +2OO*O.1
+15O*O.2 =1OO) is giealei lhan lhe queiy incoheiency
lound (=8O). Thus aIlhough lheie exisls a pIan (Tp|an1=
5O*O.5+ 2OO*O.1+ 15O*O.2=75) vhich can salisfy lhe cIienl
queiy incoheiency lound, vhiIe nininizing lhe queiy
execulion cosl lhe alove nelhod cannol ensuie lhal such
a pIan viII le seIecled. Whal ve need is a conpionise
lelveen queiy salisfialiIily and peifoinance. Inslead of
seIecling lhe sul-queiies vilhoul consideiing lhe dala
incoheiency lounds foi lhe seIecled dala aggiegalois, ve
seIecl sul-queiies using ) (
3 / 1
3 / 1
m q
m
m
R C
T
R

+ as cxpandcd co-
jcc|itc func|icn. The second lein ensuies lhal vhiIe seIecl-
ing lhe oplinaI pIan ve prcfcr dala aggiegalois having
lighlei dala incoheiency lounds (Iovei vaIues of Tn) lhus
highei chances of salisfying lhe queiy. The luning pa-
ianelei () can le used lo laIance lhe oljeclives of nini-
nizing queiy execulion cosl lhiough sul-queiy seIeclion
and neeling lhe queiy coheiency iequiienenls. We
use
3 / 1
/
m q m
R C T in lhe second lein as, accoiding lo Lqua-
lion (14), oplinaI incoheiency lound aIIocalion is IikeIy
lo le done piopoilionaI lo
3 / 1
m q
R C . In Seclion 5.2, ve
neasuie lhe effecls of lhe luning paianelei on lhe
queiy salisfialiIily.
4.3.3 Maximum Gain Heuristic
Nov ve piesenl an aIgoiilhn vhich inslead of nini-
nizing lhe eslinaled queiy execulion cosl naxinizes lhe
eslinaled gains of execuling lhe cIienl queiy using sul-
queiies. In lhis aIgoiilhn, foi each sul-queiy, ve caIcu-
Iale lhe rc|a|itc gain of execuling il ly finding lhe sundiff
diffeience lelveen cases vhen each dala ilen is ollained
sepaialeIy and vhen aII lhe dala ilens aie aggiegaled as
a singIe sul-queiy (i.e., naxinaI sul-queiy). Thus, lhe
ieIalive gain foi a sul-queiy
i i
d w can le viillen as:
1
2 2
=
i j i
j i j i ij i i
i
i i
m
R R w w R w
R w
G
(16)
vheie Ri is sundiff of lhe dala ilen di. This aIgoiilhn can
le inpIenenled ly using ciileiion naxinizc (Gn/[n[)
lo gel lhe sel of sul-queiies and coiiesponding DAs.
Then ve use lhe convex oplinizalion nelhod oulIined in
Seclion 4.2 lo aIIocale incoheiency lounds anong sul-
queiies. To lackIe lhe queiy salisfialiIily issue lhe queiy
gain Lqualion (16) is nodified lo:
3 / 1
'
) (
m q
i
i i
m m
R C
T w
G G
(17)
vheie Ti is lighlesl incoheiency lound lhal can le salis-
fied foi lhe dala ilen di and Rn is lhe sul-queiy sundiff.
Reasons foi seIecling lhe pailicuIai cx|cndcd cojcc|itc func-
|icn aie sane as ones oulIined foi lhe nin-ccs| heuiislic.
To sunnaiize, foi a given cIienl queiy and a nelvoik
of dala aggiegalois, fiisl ve gel lhe naxinaI sul-queiies
foi aII dala aggiegalois. We use heuiislics desciiled in
lhis seclion lo deiive sul-queiies. In lhese heuiislics ex-
lended oljeclive funclions aie used lo have lhe desiied
IeveI of queiy salisfialiIily. Then, lhe lechnique expIained
in Seclion 4.2 is used lo aIIocale lhe queiy incoheiency
lound anong lhe deiived sul-queiies.
5 PERFORMANCE EVALUATION
Ioi peifoinance evaIualion ve sinuIaled a nelvoik of
dala aggiegalois of 2OO slock dala ilens ovei 1OO aggie-
galoi nodes such lhal each aggiegaloi can disseninale
conlinalions of 25 lo 5O dala ilens. Dala ilens veie as-
signed lo diffeienl aggiegalois using zipf disliilulion
(s|cu=1.O) assuning lhal sone popuIai dala ilens viII le
disseninaled ly noie DAs. Dala incoheiency lounds,
foi vaiious aggiegaloi dala ilens, veie chosen unifoinIy
lelveen $O.OO5 and O.O2. We ciealed 5OO poilfoIio queiies
such lhal each queiy has 1O lo 25 iandonIy (using zipf
disliilulion vilh lhe sane defauIl s|cu) seIecled dala
ilens vilh veighls vaiying lelveen 2 and 1O. These que-
iies veie execuled vilh incoheiency lounds lelveen 1.O
and 3.O (i.e., O.O2-O.O7 of lhe queiy vaIue). AIlhough
heie ve piesenl iesuIls foi slock liaces (nan-nade dala),
siniIai iesuIls veie ollained foi sensoi liaces (naluiaI
dala) as veII |8j. In lhe fiisl sel of expeiinenls, ve kepl
dala incoheiency lounds al lhe dala aggiegalois veiy Iov
so lhal queiy salisfialiIily can le ensuied vhiIe keeping
defauIl vaIue of as O.
5.1 Comparison of Algorithms
Ioi conpaiison vilh oui aIgoiilhns, piesenled in lhe
pievious seclion, ve considei vaiious olhei queiy pIan
oplions. Lach queiy can le execuled ly disseninaling
individuaI dala ilens oi ly gelling sul-queiy vaIues fion
DAs. Sel of sul-queiies can le seIecled using sundiff
lased appioaches oi any olhei iandon seIeclion. Sul-
queiy (oi dala) incoheiency lound can eilhei le pie-
decided oi oplinaIIy aIIocaled. Vaiious conlinalions of
lhese dinensions aie coveied in lhe foIIoving aIgoiilhns:
1. Nn sub-qucry, cqua! Incnhcrcncy bnund (QDwYH): In
lhis aIgoiilhn, lhe cIienl queiy is execuled vilh each dala
ilen leing disseninaled lo lhe cIienl independenl of
olhei dala ilens in lhe queiy. Incoheiency lound is di-
vided equaIIy anong lhe dala ilens. This aIgoiilhn acls
as a laseIine aIgoiilhn.
2. Nn sub-qucry, nptIma! Incnhcrcncy bnund (RSWF):
In lhis aIgoiilhn aIso dala ilens aie disseninaled inde-
pendenlIy lul incoheiency lound is divided anong dala
ilens (using Lqualion (14)) so lhal lolaI nunlei of ie-
fieshes can le nininized..
3. Randnm sub-qucry sc!cctInn (UDQGRP): In lhis case,
sul-queiies aie ollained ly iandonIy seIecling a DA in
lhe each ileialion of lhe gieedy aIgoiilhn (Iiguie 4). This
aIgoiilhn is designed lo see hov lhe iandon seIeclion
voiks in conpaiison lo lhe sundiff lased aIgoiilhns.
4. 5ub-qucry sc!cctInn whI!c mInImIzIng VXPGLII
(PLQFRVW): This aIgoiilhn is desciiled in Seclion 4.3.1.
5. 5ub-qucry sc!cctInn whI!c maxImIzIng gaIn (PD[

JDLQ: This aIgoiilhn is desciiled in Seclion 4.3.3.
Iiguie 5 shovs aveiage nunlei of iefieshes iequiied
foi queiy incoheiency lounds of $1-$3. The nave aIgo-
iilhn iequiies noie lhan five lines lhe nunlei of nes-
sages conpaied lo PLQFRVW and PD[JDLQ aIgoiilhns. Ioi
incoheiency lound of $3, each queiy, on aveiage, ie-
quiies 3311 nessages if il is execuled jusl ly oplinizing
incoheiency lound (RSWF) conpaied lo 487 vhen ve seIecl
lhe queiy pIan using lhe PD[JDLQ aIgoiilhn. The gains of
oui aIgoiilhns inciease fuilhei as nunlei of dala ilens
disseninaled ly dala aggiegalois inciease (nave iequiies
noie lhan 1O lines lhe nessages vhen each dala aggie-
gale disseninales 5O dala ilens). This happens as, vilh
noie dala ilens pei DA, sul-queiy lased aIgoiilhns ie-
suIl in Iaigei sul-queiies and ve seIecl sul-queiies inleI-
IigenlIy.
In lhe alove expeiinenl, foi ciealing queiies ve se-
Iecled lhe queiy dala ilens vilh lhe sane ]LSI disliilulion
(VNHZ=1.O) as ve used foi seIecling dala ilens lo le seived
ly DAs. ul if ve ieduce lhe skev (i.e., having queiies
vilh Iess popuIai dala ilens), ve found lhal lhe peifoin-
ance of sul-queiy lased aIgoiilhns suffei. This happens
lecause foi lellei peifoinance, sul-queiy lased aIgo-
iilhns depend on queiy dala ilens leing disseninaled
ly lhe sane DAs. Ioi queiies vilh Iess popuIai dala
ilens piolaliIily of lhis happening is Iess, hence, lhe infe-
iioi peifoinance.
Iuilhei, aIlhough lhe oplinizalion piolIen is siniIai
lo lhe coveiing a sel of dala ilens (queiy) using ils sul-
sels (sul-queiies) foi vhich lhe gieedyPLQFRVW aIgoiilhn
is consideied lo le nosl efficienl |28j, ve see lhal PD[
JDLQ aIgoiilhn iequiies 2O-25 Iess nessages conpaied
lo lhe PLQFRVW appioach. Reasons foi PD[JDLQ aIgoiilhn
peifoining lellei lhan olhei aIgoiilhns aie expIoied in
lhe nexl sel of expeiinenls.
5.2 Effects of Algorithmic Parameters
This sel of expeiinenls vas peifoined lo gel an insighl
inlo vaiious chaiacleiislics of oui sul-queiy seIeclion
nelhod vhich Iead il lo peifoin lellei conpaied lo olhei
oplions. We considei effecls of lhiee paianeleis on lhe
queiy peifoinance: dala dynanics, coiieIalion lelveen
dala dynanics and queiy salisfialiIily paianelei.
5.2.1 Effect of data dynamics
In lhis sel of expeiinenls, ve vanled lo see vhelhei lheie
is any definile ieIalionship lelveen dala dynanics and
lhe size of lhe sul-queiy in vhich lhal dala ilen appeais.
In lhis expeiinenl vilh 1O dala ilens, 45 DAs veie sinu-
Ialed such lhal each DA can disseninale a diffeienl sel of
2 dala ilens. Then 1OO queiies veie ciealed each vilh 3
iandonIy chosen dala ilens. In lhe oplinaI queiy pIan,
each queiy viII le execuled vilh lvo sul-queiies: one
consisling of 2 dala ilens and anolhei vilh singIe dala
ilen (pIan vilh lhiee one ilen sul-queiies viII le liivi-
aIIy inefficienl). As lhe queiy has onIy 3 dala ilens, onIy 3
such queiy pIans aie possilIe. We sinuIaled aII lhese op-
lions lo gel lhe lesl queiy pIan. Ioi lhese oplinaI queiy
pIans, Iiguie 6 (a) shovs vaiialion of aveiage sul-queiy
size in vhich a pailicuIai dala ilen appeais veisus VXP
GLII vaIue of lhe dala ilen. We can see lhal if a dala ilen is
noie dynanic, in lhe oplinaI pIan, il is noie IikeIy lo le
pail of Iaigei sul-queiy. This is an inpoilanl olseivalion
as il indicales lhal foi efficienl queiy evaIualion noie
dynanic dala ilens shouId le pail of a Iaigei sul-queiy.
This phenonenon can le expIained ly lhe facl lhal ly
execuling a queiy as a conlinalion of sul-queiies viII
aIvays le noie efficienl conpaied lo gelling lhe dala
ilens independenlIy. y conlining noie dynanic dala
ilens ve aie IikeIy lo gain noie. Ioi conpaiison ve aIso
shov lhe cuive foi lhe sul-queiy seIeclion lased on PD[
JDLQ aIgoiilhn. Il can le seen lhal ly using PD[JDLQ aIgo-
iilhn ve achieve oui oljeclive of incIuding noie dy-
nanic dala ilens as pail of Iaigei sul-queiies. In con-
paiison, foi lhe PLQFRVW aIgoiilhn nosl dynanic dala
ilen is noie IikeIy lo le disseninaled as singIe ilen
queiy. This happens lecause lhe VXPGLII vaIue of a noie
dynanic dala ilen viII le high lhus in each ileialion of
lhe gieedy aIgoiilhn (Iiguie 4), lheie is Iess chance of
seIecling a sul-queiy vilh noie dynanic dala ilen.
Thus, il is veiy IikeIy lhal lhe nosl dynanic dala ilen
viII le disseninaled as a singIe ilen sul-queiy iesuIling
in lad peifoinance of lhe cIienl queiy. Ioi lhe PD[JDLQ
and PLQFRVW aIgoiilhns, siniIai iesuIls veie ollained foi
Iaigei queiy sizes as veII as shovn in Iiguie 6(l). Ioi
geneialing iesuIls of Iiguie 6(l) ve sinuIaled 1OO dala
aggiegalois, each disseninaling 3 dala ilens, vhiIe each
queiy had 5 dala ilens.
5.2.2 Effect of correlation between data dynamics
To neasuie lhe effecls of coiieIalion lelveen dala dy-
nanics (as neasuied using FRUUHODWLRQ PHDVXUH) on lhe
queiy peifoinance, ve conpaied lhe queiy peifoinance
vilh lhe case vhen aII lhe dala ilens aie assuned lo le

Figure 5: Performance evaluation of algorithms

(a) Query size=3 (b) Query size=5
Figure 6: Effect of data sumdiff on sub-query size

independenl (i.e., = O). Ioi peifoining lhese expeii-
nenls ve consliucled 1O synlhelic dala liaces (each vilh
VXPGLII=1) so lhal vaIues of foi vaiious dala ilen paiis
veie disliiluled unifoinIy lelveen -1 and +1. Then 45
DAs veie sinuIaled so lhal each DA can disseninale 2
dala ilens. 1OO queiies veie geneialed, each vilh 4 dala
ilens. In lhis case, each queiy viII gel execuled vilh 2
sul-queiies of 2 dala ilens each. Conlinalion of sul-
queiies viII le decided lased on coiieIalion lelveen dala
ilens (VXPGLII vaIues of aII lhe dala ilens veie lhe sane).
We found lhal ly consideiing coiieIalion neasuie nun-
lei of iefieshes ieduce ly appioxinaleIy 1O-12. This
iesuIl indicales lhal foi oplinaI queiy pIanning dala dy-
nanics and incoheiency lound aIIocalion nay le noie
inpoilanl facloi lhan lhe FRUUHODWLRQPHDVXUH.
5.2.3 Effect of query satisfiability parameter
To sinuIale lhe silualion vheie seIecled aggiegalois nay
nol le alIe lo salisfy lhe queiy incoheiency lounds, ve
nodified lhe sinuIalion sel up used in Seclion 5.1 lo sel
lhe nininun dala incoheiency lounds vhich DAs can
salisfy lo le lelveen .O1 and O.O4. VaIue of vas vaiied
lelveen O and 2O. The case =O coiiesponds lo lhe aIgo-
iilhn vilhoul deaIing vilh lhe queiy salisfialiIily. Iiguie
7 shovs nunlei of unansveialIe queiies as lhe vaIue of
is vaiied. As shovn in lhe figuie as lhe vaIue of is
incieased, peicenlage of lhe unsalisfied queiies decieases
foi vaiious vaIues of queiy incoheiency lounds. Due lo
changed dala incoheiency lounds of DAs, ve found lhal
2O of queiies can nol le salisfied even ly lhe dala ag-
giegalois vilh lighlesl dala incoheiency lounds. Al lhe
queiy incoheiency lound of $2, 4O queiies can nol le
salisfied ly lhe oplinaIIy seIecled dala aggiegalois lul as
ve inciease lhe vaIue of lo 1O, onIy 2 queiies aie un-
ansveied.
The vaIue of can le chosen lo laIance lhe peifoin-
ance and salisfialiIily of queiies. Ioi exanpIe, a nelvoik
of dala aggiegalois nay ain al queiy salisfialiIily of 95
foi a given disliilulion of queiy incoheiency lounds. If al
any line queiy salisfialiIily is leIov lhe laigel, vaIue of
can le incieased vheieas in case of ovei achieving lhe
laigel, lhe vaIue of can le decieased lo inpiove lhe
queiy peifoinance.
5.3 Overheads of Query Planning
Nov ve iepoil lhe line oveiheads foi vaiious queiy
pIanning opeialions. We neasuied lhese cosls ly vaiying
lhe nunlei of dala ilens leing disseninaled ly lhe nel-
voik, lelveen 4O and 2OO. These expeiinenls veie done
on a WindovsXI nachine vilh 2.53 CHz InleI Coie-Duo
CIU and 3C RAM. Ioi vaiious VXPGLII lased aIgo-
iilhns, ve need lo nainlain lhe VXPGLII vaIues of vaiious
dala ilens (piopoilionaI lo lhe nunlei of dala ilens le-
ing disseninaled) and lhe coiieIalion neasuie foi each
paii of dala ilens (piopoilionaI lo lhe squaie of lhe nun-
lei of dala ilens), in addilion lo lhe queiy dependenl
pIanning cosl. Ioi a liace size of 1OOOO (foi each dala
ilen) lolh -- lhe cosl of nainlaining VXPGLII pei dala ilen
and lhe cosl of nainlaining FRUUHODWLRQ PHDVXUH foi each
paii of dala ilens -- veie found lo le in lhe iange of 5O-7O
nicioseconds. Queiy pIanning cosl (line iequiied lo de-
iive sul-queiies and lheii associaled incoheiency lounds)
foi QDwYH and RSWF aIgoiilhn vas found lo le appioxi-
naleIy 1 niciosecond pei queiy vheieas lhe sane foi lhe
UDQGRP, PLQ&RVW and PD[*DLQ aIgoiilhns vas found lo le
2.5, 2.2 and 1.7 niIIiseconds. Highei cosl of queiy pIan-
ning, foi WKH VXPGLII lased aIgoiilhns, is juslified ly lhe
savings ve achieve in leins of nunlei of nessages foi
lhe vhoIe duialion of lhe conlinuous queiy. The queiy
pIanning cosl of UDQGRP and PLQFRVW is highei as lhey ie-
quiie noie ileialions of lhe aIgoiilhn in Iiguie 4 (i.e.,
noie sul-queiies) conpaied lo lhe PD[*DLQ aIgoiilhn.
6 QUERY PLANNING FOR MAX QUERIES
In lhis seclion ve liiefIy desciile lhe oplinaI queiy
pIanning foi MAX queiies. MIN queiies can le handIed in
lhe siniIai nannei. A MAX queiy, vheie a cIienl vanls
lhe naxinun of a specified sel of dala ilen vaIues, can
le viillen as:
) 1 ), ( max( ) (
q qi q
n i t v t V = (18)
Ioi MAX queiies, ieIalionship lelveen lhe queiy inco-
heiency lound and iequiied dala incoheiency lounds is
discussed in lhe Iileialuie |11,24j. Accoiding lo one such
foinuIalion, if lhe nelvoik of aggiegalois can ensuie lhal
lhe L
WK
dala ilen has incoheiency lound &L lhen lhe foI-
Ioving condilion ensuies lhal lhe queiy incoheiency
lound &T
is salisfied:
q q i
n i i C C 1 , , (19)
In lhese queiies even if vaIues of one oi noie dala ilen
change (changing lheii individuaI incoheiencies) il is pos-
silIe lhal queiy incoheiency ienains unchanged. Thus,
foi a given MAX queiy, il is possilIe lo have an individuaI

(a) Comparison of algorithm (b) Effect of data dynamics order on performance
Figure 7: Effect of on query satisfiability Figure 8: Performance of MAX queries

dala (oi sul-queiy) incoheiency lound vhich is noie
lhan lhe queiy incoheiency lound. ul such an inco-
heiency lound viII depend on inslanlaneous vaIues of
dala ilens lhus changing veiy dynanicaIIy. In lhis papei
ve do nol considei such dala vaIue dependenl inco-
heiency lounds.
6.1 Query Cost Model
Lel us considei a queiy 4= MAX ($, %), vhich is used foi
disseninaling PD[ of dala ilens $ and % fion a dala ag-
giegaloi. Lel lhe VXPGLII vaIues of $ and % is 5D and 5E
iespecliveIy. Ioi a MAX queiy, lhe queiy iesuIl is lhe
naxinun of dala ilen vaIues. Thus lhe queiy dynanics
is decided as pei lhe dynanics of lhe dala ilen vilh lhe
naxinun vaIue. Hence, lhe queiy VXPGLII is nolhing lul
veighled aveiage of dala VXPGLIIV, veighled ly fiaclion of
line vhen lhe pailicuIai dala ilen is PD[LPXP:
>
= =
q q
n
i
n
i j j
q i j i i q
n i R x x p R R
1 , 1
) 1 | max( )) ( ( (2O)
vheie S([L > [M) is lhe piolaliIily lhal vaIue of L
lh
dala ilen
is noie lhan vaIue of M
lh
dala ilen. We have lhe vaIues of
dala ilen VXPGLIIV lul foi gelling lhe piolaliIilies ve
need lo have exacl vaIues of dala ilens. As queiy pIan
dependenl on individuaI dala vaIues (inslead of dala dy-
nanics) viII le loo voIaliIe, as a fiisl appioxinalion ve
use uppei lound of lhe expiession given ly Lqualion (2O)
as queiy VXPGLII. Appioxinalion used is lhe naxinun of
VXPGLIIs of dala ilens invoIved. Nov ve considei lhe op-
linized execulion of MAX queiies using lhe alove nen-
lioned queiy cosl nodeI.
6.2 Optimized Execution
To execule lhe MAX queiy using a nelvoik of dala aggie-
galois, ve assign sul-queiies lo diffeienl DAs. Lach sul-
queiy is a MAX queiy ovei a sul-sel of queiy dala ilens.
Ioi oplinaI pIanning ve need lo nininize lhe sun of
sul-queiy execulion cosls. As ve assign sane inco-
heiency lound lo aII lhe sul-queiies (equaIs lo lhe queiy
incoheiency lound as pei Lqualion (19)), ve jusl need lo
nininize sun of sul-queiy VXPGLII vaIues.
6.2.1 Optimal query planning problem is NP-hard
OplinaI queiy pIanning piolIen foi MAX queiies is 13
KDUG. This can le pioved ly napping lhe sel covei piol-
Ien lo lhis oplinaI queiy pIanning piolIen.
6HW FRYHU SUREOHP: Civen a univeise 8 and a faniIy 6 of
sulsels of 8, a covei is a sulsel (&RYHU6) of sels vhose
union is 8. In lhe sel coveiing oplinizalion piolIen lhe
lask is lo find a sel coveiing vhich uses lhe fevesl sels.
We can nap lhe sel covei piolIen lo oui queiy
pIanning piolIen. The MAX queiy, coiiesponding lo lhe
sel covei piolIen, viII le PD[ of aII lhe ilens in lhe uni-
veise 8 al an incoheiency lound 1. Ioi each sel V 6 ve
assune lhe exislence of a DA disseninaling aII lhe eIe-
nenls of V al an incoheiency lound of 1. Iuilhei, Iel aII
dala ilens have VXPGLII vaIue of 1. Iion Lqualion (2O), ve
can see lhal cosl of any sul-queiy viII le 1. Thus cosl of
lhe cIienl queiy, vhich is sun of cosl of ils sul-queiies,
viII le sane as lhe nunlei of sul-sels iequiied lo gel lhe
sel covei. Il is easy lo see lhal if ve can soIve lhe queiy
pIanning piolIen oplinaIIy ve can aIso soIve lhe sel
covei piolIen oplinaIIy. Thus, nov ve give gieedy heu-
iislics foi lhe sul-queiies seIeclion piolIen.
6.2.2 Greedy Heuristics
We use gieedy aIgoiilhn given in Iiguie 4 foi soIving lhe
queiy pIanning piolIen vilh diffeienl sel of sul-queiy
seIeclion ciileiia ( Iike lhe ones desciiled in Seclions
4.3.1 and 4.3.3. In lhe PLQFRVW heuiislic ve seIecl lhe sul-
queiy having nininun sul-queiy VXPGLII pei dala ilen.
Ioi lhe MAX queiy, sul-queiy VXPGLII is nolhing lul lhe
VXPGLII of lhe nosl dynanic dala ilen in lhe sul-queiy.
Thus, foi lhe PD[JDLQ heuiislic, lhe gain of each sul-
queiy is caIcuIaled as given in Lqualion (21):
=
qi
d
diq diq
R R G ) max( (21)
vheie 5GLT is VXPGLII of L
WK
dala ilen of lhe queiy T.
6.2.3 Simulation results
Iiguie 8(a) shovs sinuIalion iesuIls foi MAX queiy foi
vaiious aIgoiilhns oulIined in Seclion 5.1. We have nol
used RSWF aIgoiilhn heie as aII dala ilens have lo le
seived al lhe queiy incoheiency lound vilhoul any op-
linizalion in lhe incoheiency lound aIIocalion. Nave
aIgoiilhn iequiies noie lhan 1.5 lines nessages con-
paied lo olhei efficienl sul-queiy lased aIgoiilhns.
Olhei iesuIls aie quaIilaliveIy siniIai lo vhal ve ol-
lained foi lhe addilive queiies vilh one diffeience. Ioi
lolh lypes of queiies lhe PD[JDLQ aIgoiilhn voiks lellei
lhan lhe PLQFRVW aIgoiilhn lul, unIike in addilive que-
iies, in case of MAX queiies peifoinance of PLQFRVW aIgo-
iilhn is cIosei lo lhal of lhe UDQGRP aIgoiilhn conpaied
lo lhe PD[JDLQ aIgoiilhn. This is a suipiising iesuIl con-
sideiing lhal PLQFRVW is lhe nosl naluiaI candidale (foi VHW
FRYHUpiolIen) vilh appioxinalion guaianlee of ORJQT |6j.
Ioi MAX queiies, sul-queiy cosl depends on lhe nosl
dynanic dala ilen. Thus ve nodified lhe gieedy aIgo-
iilhns ly consideiing lhe dala ilens in lhe descending
oidei of VXPGLIIs. Ioi exanpIe, in lhe PD[JDLQ aIgoiilhn
ve fiisl caIcuIale gains of sul-queiies coveiing lhe dala
ilen having naxinun VXPGLII. We seIecl lhe one vilh
naxinun gain. We iepeal lhe slep foi lhe nexl nosl dy-
nanic dala ilen and so on. Iiguie 8(l) shovs vilh lhis
nodified gieedy appioach, peifoinance of PLQFRVW and
PD[JDLQ aIgoiilhns is aInosl lhe sane. This can le ex-
pIained as vilh lhe dala ilen oideiing enfoiced, in lhe
PLQFRVW heuiislic aIso, ve ensuie lhal lhe nosl dynanic
dala ilen is pail of Iovei cosl sul-queiy, Ieading lo lellei
queiy pIan.
7 RELATED WORK
We divide lhe ieIaled voik on scaIalIe ansveiing of ag-
giegalion queiies ovei a nelvoik of dala aggiegalois inlo
lvo inleiieIaled lopics.
$QVZHULQJ,QFRKHUHQF\%RXQGHG$JJUHJDWLRQ4XHULHV
Vaiious nechanisns foi efficienlIy ansveiing inco-
heiency lounded aggiegalion queiies ovei conlinuousIy
changing dala ilens aie pioposed in lhe Iileialuie |9, 11,
14, 16, 2Oj. Oui voik dislinguishes ilseIf ly enpIoying
sul-queiy lased queiy evaIualion lo nininize nunlei of

iefieshes. IuII lased dala disseninalion lechniques,
vheie cIienls oi dala aggiegalois puII dala ilens such
lhal queiy iequiienenls aie nel, aie desciiled in |9,16j.
Ioi nininizing lhe nunlei of puIIs, lolh piedicl dala
vaIues and puII inslances. In conpaiison, ve use push
lased nechanisn lo iefiesh sul-queiy vaIues al lhe cIi-
enl. In |11j, aulhois piopose push lased schene using
dala fiIleis al lhe souices. Accoiding lo lhal voik, foi an
aggiegalion queiy, lhe nunlei of iefiesh nessages can le
nininized ly peifoining incoheiency lound aIIocalion
lo individuaI dala ilens such lhal lhe nunlei of nes-
sages fion diffeienl dala souices is lhe sane. Inslead ve
execule noie dynanic dala ilens as pail of Iaigei sul-
queiies vhiIe oplinaIIy assigning incoheiency lounds.
WhiIe lhis nighl Iead lo diffeienl nessaging oveiheads
foi diffeienl DAs as opposed lo vhal is pioposed in |11j,
il does iesuIl in nininizing lhe lolaI nunlei of nessages
senl ly DAs. Like us, aulhois of |2Oj aIso assune lhal
disseninalion liee fion sensoi nodes (dala souices) lo
iool (cIienls) aIieady exisls, and lhey aIso inslaII eiioi
fiIleis on pailiaI aggiegales (siniIai lo incoheiency lound
assigned lo sul-queiies). ul, in oui voik, each dala ag-
giegaloi can onIy disseninale dala al sone pie-specified
incoheiency lound depending on ils capaliIily vheieas
such a consliainl does nol exisl foi |2Oj. Iuilhei, ve aIso
give a nelhod lo seIecl pailiaI aggiegales (sul-queiies) lo
le used foi ansveiing lhe queiy.
In |29j aulhois piopose cosl-lased nelhods lo cieale
in-nelvoik-aggiegalion liee consisling of lhe TXHU\ QRGH,
vheie an aggiegalion queiy is invoked leing lhe iool of
lhe aggiegalion liee, and sensois. Aulhois of |29j piopose
conlinalions of nunlei of hops and ienaining eneigy lo
seIecl a pailicuIai palh fion vaiious oplions avaiIalIe
lelveen any lvo nodes. Mapping lheii piolIen lo lhe
oplinaI queiy pIanning discussed in lhis papei, each
connunicaling node can voik as dala souice as veII as
dala aggiegaloi. Lach node can seIecl sul-queiies lased
on lheii VXPGLII vaIues using piincipIes oulIined in lhis
papei lo nininize lhe nunlei of nessage liansfeis in lhe
nelvoik.
In |27j, aulhois use dala hislogians lo oplinaIIy as-
sign IocaI lhieshoIds al noniloiing siles foi lhieshoId
noniloiing al a cenliaI sile. Mainlaining hislogian is a
ledious lask vilh noie space and line oveihead con-
paied lo lhe VXPGLII lased nechanisn. Aulhois of |25j
aIso use Chelyshevs inequaIily lo shov lhal expecled
connunicalion cosl is inveiseIy piopoilionaI lo squaie of
lhe eiioi-ludgel. ul, conpaied lo oui voik, lhey as-
sune lhal nunlei of iefiesh nessages is piopoilionaI lo
dala vaiiance. As ve have expIained in Seclion 2, oui
VXPGLII neasuie lakes lhe oidei of dala vaIue changes
inlo accounl vhich vaiiance does nol. SpaliaI and lenpo-
iaI coiieIalions lelveen sensoi dala aie used lo ieduce
dala iefieshes in |17,18j. We aIso considei coiieIalion in
leins of coiieIalion neasuie lelveen dala ilens, lul ve
use il foi dividing cIienl queiy inlo sul-queiies. A
nelhod of assigning cIienls dala queiies lo aggiegalois in
a conlenl disliilulion nelvoik is given in |12j. They do
foi individuaI dala ilens vhal ve do foi queiies consisl-
ing of nuIlipIe dala ilens.
&RQVWUXFWLRQ DQG 0DLQWHQDQFH RI 1HWZRUN RI 'DWD
$JJUHJDWRUV Aulhois of |5,7,22j desciile consliuclion
and nainlenance of hieiaichicaI nelvoik of dala aggiega-
lois foi pioviding scaIaliIily and fideIily in disseninaling
dynanic dala ilens lo a Iaige nunlei of cIienls. In lhese
voiks, fideIily is defined as fiaclion of line vhen lhe
cIienl coheiency iequiienenls aie nel. Lach dala aggie-
galoi is given cIienl iequiienenls in lhe foin of dala
ilens and lheii iespeclive incoheiency lounds. Inslead,
ve use such nelvoiks foi efficienlIy ansveiing cIienls
aggiegalion queiies. One can use cIienl queiies lo opli-
naIIy consliucl a nelvoik of dala aggiegalois vhiIe, on
lhe olhei hand, one can aIso use a given nelvoik of dala
aggiegalois lo efficienlIy ansvei cIienl queiies. Aulhois
of |5,7,22j deaI vilh lhe fiisl pail vheieas ve have slud-
ied lhe second pail. Changes in dala dynanics nay Iead
lo ieoiganizalion of lhe nelvoik of dala aggiegalois
vhich, in luin, nay necessilale changes in queiy pIans. Il
is a chicken and egg piolIen. Aggiegalois liee ieoigani-
zalion shouId le a Iongei lein phenonenon (i.e., each
inconing queiy shouId nol Iead lo liee ieoiganizalion)
vheieas queiy pIan can change noie oflen depending on
dala dynanics.
Inslead of oplinizing fideIily of dala ilens al dala ag-
giegalois, as pioposed in |7j, using oui voik, one can
oplinize fideIily aII lhe vay up lo cIienl queiies. IideIily
of a dala ilen can le appioxinaleIy caIcuIaled as nunlei
of disseninalion nessages nuIlipIied ly lhe lolaI deIay
in lhe nessage liansnission. Aulhois of |7j assune lhal
each cIienls dala iequiienenls aie fuIfiIIed ly a singIe
dala aggiegaloi. ul, in lhal case, dala aggiegalois nay
need lo disseninale a Iaige nunlei of dala ilens vhich
viII Iead lo piocessing Iaige nunlei of iefiesh nessages,
hence, inciease in deIay. Thus, each cIienl gelling aII ils
dala ilens fion a singIe dala aggiegaloi (using singIe
sul-queiy) is oplinaI fion nunlei of nessages poinl of
viev lul nol necessaiiIy fion lhe queiy fideIily poinl of
viev. y using oui voik, one can nodeI expecled nun-
lei of nessages foi lhe cIienl queiy. Thus, oui voik can
conpIenenl lhe voik of |7j foi end-lo-end (souices-lo-
cIienl) fideIily oplinizalion.
8 DISCUSSION & CONCLUSION
This papei piesenls a cosl lased appioach lo nininize
lhe nunlei of iefieshes iequiied lo execule an inco-
heiency lounded conlinuous queiy. We assune lhe exis-
lence of a nelvoik of dala aggiegalois, vheie each DA is
capalIe of disseninaling a sel of dala ilens al lheii pie-
specified incoheiency lounds. We deveIoped an inpoi-
lanl neasuie foi dala dynanics in lhe foin of VXPGLII
vhich, as ve discussed in Seclion 2, is a noie appiopiiale
neasuie conpaied lo lhe videIy used slandaid devialion
lased neasuies. Ioi oplinaI queiy execulion ve divide
lhe queiy inlo sul-queiies and evaIuale each sul-queiy al
a judiciousIy chosen dala aggiegaloi. Ieifoinance iesuIls
shov lhal ly oui nelhod lhe queiy can le execuled using
Iess lhan one lhiid lhe nessages iequiied foi exisling
schenes. We shoved lhal lhe foIIoving fealuies of lhe
queiy pIanning aIgoiilhns inpiove peifoinance:
o Dividing lhe queiy inlo sul-queiies (ialhei lhan dala

ilens) and execuling lhen al specificaIIy chosen dala
aggiegalois.
o Deciding lhe queiy pIan using VXPGLII lased necha-
nisn specificaIIy ly naxinizing sul-queiy gains.
o Lxeculing queiies such lhal noie dynanic dala ilens
aie pail of a Iaigei sul-queiy.
We shoved lhal lhe PD[JDLQ aIgoiilhn is veiy cIose lo
lhe oplinaI aIgoiilhn in seIecling sul-queiies lased on
dala dynanics (Iiguie 6). Queiy salisfialiIily paianelei
() is enpIoyed foi liade-off lelveen queiy salisfialiIily
and queiy peifoinance. Ioi any vaIue of lhe queiy salis-
fialiIily paianelei, lheie is aIvays non-zeio piolaliIily
lhal a queiy viII nol gel salisfied ly lhe nelvoik of dala
aggiegalois. UsuaIIy, dala aggiegalois disseninaling
sane dala ilen foin a hieiaichicaI nelvoik. In lhal case,
even if a dala aggiegaloi can nol salisfy ils assigned
queiy il can again appIy lhe piincipIes oulIined in lhis
papei lo send a sul-queiy of lhe assigned queiy lo ils
paienls (vhich can disseninale lhe dala ilen al a lighlei
incoheiency lound). Thal viII Iead lo pooiei peifoinance
oulIining lhe liadeoff lelveen lhe queiy salisfialiIily and
peifoinance. DeveIoping efficienl slialegies foi nuIlipIe
invocalions of oui aIgoiilhn, consideiing hieiaichy of
dala aggiegalois, is an aiea foi fuluie ieseaich.
Anolhei aiea foi fuluie ieseaich is changing a queiy
pIan as dala dynanics changes. We aie caIcuIaling dala
VXPGLII in dynanic nannei. If dala VXPGLII changes le-
yond a ceilain Iinil, lhe chosen queiy pIan nay nol ie-
nain efficienl. As a sinpIe schene, Iinils on changes lo
dala VXPGLII can le found foi vhich lhe seIecled queiy
pIan ienains oplinaI. Oui voik can aIso le used foi ex-
lending lhe voik pioposed in |7j foi consliuclion and
nainlenance of a nelvoik of dala aggiegalois so lhal
end-lo-end (souices-lo-cIienl) fideIily can le naxinized.
Oui queiy cosl nodeI can aIso le used foi olhei puiposes
such as Ioad laIancing vaiious aggiegalois, nuIli-queiy
execulion, iouling sensoi dala, elc. Using lhe cosl nodeI
foi lhese appIicalions and deveIoping lhe cosl nodeI foi
noie conpIex queiies is lhiid aiea of oui fuluie voik.
REFERENCES
|1j A. Davis, }. Iaiikh and W. WeihI, Ldge Conpuling: Lxlending Lnlei-
piise AppIicalions lo lhe Ldge of lhe Inleinel, WWW 2OO4.
|2j D. VandeiMeei, A. Dalla, K. Dulla, H. Thonas and K. Rananiilhan,
Iioxy-ased AcceIeialion of DynanicaIIy Ceneialed Conlenl on lhe
WoiId Wide Wel, ACM Tiansaclions on Dalalase Syslens (TODS)
VoI. 29, }une 2OO4.
|3j }. DiIIey, . Maggs, }. Iaiikh, H. Iiokop, R. Silaianan and . WeihI,
CIolaIIy Disliiluled Conlenl DeIiveiy, ILLL Inleinel Conpuling
Sepl 2OO2.
|4j S. Rangaiajan, S. Mukeijee and I. Rodiiguez, Usei Specific Requesl
Rediieclion in a Conlenl DeIiveiy Nelvoik, 8
lh
InlI. Woikshop on
Wel Conlenl Caching and Disliilulion (IWCW), 2OO3.
|5j S. Shah, K. Rananiilhan, and I. Shenoy, Mainlaining Coheiency of
Dynanic Dala in Coopeialing Reposiloiies, VLD 2OO2.
|6j T. H. Coinen, ChaiIes L. Leiseison, RonaId L. Rivesl, and CIiffoid
Slein. Inlioduclion lo AIgoiilhns. MIT Iiess and McCiav-HiII 2OO1.
|7j Y. Zhou, . Chin Ooi and Kian-Lean Tan, Disseninaling Slieaning
Dala in a Dynanic Lnviionnenl: An Adaplive and Cosl ased Ap-
pioach, The VLD }ouinaI, Issue 17, pg. 1465-1483, 2OO8.
[8] Query cost model validation for sensor data.
www.cse.iitb.ac.in/~grajeev/sumdiff/RaviVijay_BTP06.pdf.
|9j R. Cupla, A. Iuii, and K. Rananiilhan, Lxeculing Incoheiency
ounded Conlinuous Queiies al Wel Dala Aggiegalois, WWW 2OO5.
|1Oj IopuIis, A. IiolaliIily, Randon VaiialIe and Slochaslic Iiocess, Mc.
Ciav-HiII, 1991.
|11j C. OIslon, }. }iang, and }. Widon, Adaplive IiIlei foi Conlinuous Que-
iies ovei Disliiluled Dala Slieans, SICMOD 2OO3.
|12j S. Shah, K. Rananiilhan, and C. Ravishankai, CIienl Assignnenl in
Conlenl Disseninalion Nelvoiks foi Dynanic Dala, VLD 2OO5.
|13j NLISC Scienlific Conpulei Syslen
hllp://soIe.vh.vhoi.edu/~jnanning//ciuise/seive1.cgi
|14j S. Madden, M. }. IiankIin, }. HeIIeislein and W. Hong, TAC: a Tiny
Aggiegalion Seivice foi Ad-Hoc Sensoi Nelvoiks, Iioc. of 5
lh
Synpo-
siun on Opeialing Syslens Design and inpIenenlalion, 2OO2.
|15j DS }ohnson and MR Caiey, Conpuleis and InliaclaliIily: A Cuide lo
lhe lheoiy of NI-conpIeleness. San Iiancisco, CA: Iieenan, 1979.
|16j S. Zhu and C. Ravishankai, Slochaslic Consislency and ScaIalIe IuII-
ased Caching foi Liialic Dala Souices, VLD 2OO4.
|17j D. Chu, A. Deshpande, }. HeIIeislein, W. Hong, Appioxinale Dala
CoIIeclion in Sensoi Nelvoiks using IiolaliIislic ModeIs, ICDL 2OO6.
|18j A. Deshpande, C. Cuesliin, S. R. Madden, }. M. HeIIeislein, and W.
Hong, ModeI-Diiven Dala Acquisilion in Sensoi Nelvoiks, VLD
2OO4.
|19j Ieaison Iioducl nonenl coiieIalion coefficienl.
hllp://vvv.nyx.nel/~lnacfaiI/STAT_TUT/coiieIal.ssi /
|2Oj Anlonios DeIigiannakis, Yannis Kolidis, and Nick RoussopouIos,
Iiocessing Appioxinale Aggiegale Queiies in WiieIess Sensoi Nel-
voiks, Infoinalion Syslens voI. 31, Issue 8, Ig. 77O-792, 2OO6.
|21j C. Coinode and M. CaiofaIakis, Skelching Slieans lhiough lhe Nel:
Disliiluled Appioxinale Queiy Tiacking, VLD 2OO5.
|22j S. AgiavaI, K. Rananiilhan and S. Shah, Consliuclion of a TenpoiaI
Coheiency Iieseiving Dynanic Dala Disseninalion Nelvoik, RTSS
2OO4.
|23j iian alcock and Chiis OIslon, Disliiluled Top-K Moniloiing,
SICMOD 2OO3.
|24j Adan SiIleislein, Kanesh MunagaIa and }un Yang, Lneigy Lfficienl
Moniloiing of Lxliene VaIues in Sensoi Nelvoiks, SICMOD 2OO6.
|25j N. }ain, D. Kil, I. Mahajan, I. YaIaganduIa, M. DahIin and Y. Zhang,
STAR: SeIf-Tuning Aggiegalion foi ScaIalIe Moniloiing, VLD 2OO7.
|26j R. Cupla and K. Rananiilhan, Oplinized Queiy IIanning of Con-
linuous Aggiegalion Queiies in Dynanic Dala Disseninalion Nel-
voiks, WWW 2OO7.
|27j S. Kashyap, }. Rananiilhan, R. Raslogi and I. ShukIa, Lfficienl Con-
sliainl Moniloiing using Adaplive ThieshoIds, ICDL 2OO8.
|28j D. S. Hochlaun, Appioxinalion aIgoiilhns foi lhe sel coveiing and
veilex covei piolIens, SIAM }ouinaI on Conpuling, voI. 11 (3) 1982.
|29j I. Ldaia, A. Linaye and K. Rananiilhan, Asynchionous In-nelvoik
Iiediclion: Lfficienl Aggiegalion in Sensoi Nelvoiks, ACM Tiansac-
lions on Sensoi Nelvoiks, VoIune 4, Nunlei 4, Augusl 2OO8.

Rajeev Gupta got his BTech from Indian Institute of Technology (IIT)
Kharagpur, India in Electronics Engineering. He is currently pursuing
his PhD from IIT Mumbai, India in Computer Science. He is working
as Researcher at IBM Research, New Delhi, India for last 10 years.
Krithi Ramamritham received the PhD in Computer Science from
University of Utah and then joined the University of Massachusetts.
He is currently at IIT Bombay as Professor in the Department of
Computer Science. He is a fellow of IEEE and a fellow of ACM. He
has served on numerous program committees of conferences and
workshops. His editorial board contributions include IEEE Transac-
tions, the Real Time Systems Journal, and the VLDB Journal.

66.query Planning For Continuous Aggregation

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

66.query Planning For Continuous Aggregation

Hochgeladen von

Copyright:

Verfügbare Formate

IEEE TRANSACTIONS ON JOURNAL KNOWLEDGE AND DATA ENGINEERING, MANUSCRIPT ID 1

Query Planning for Continuous Aggregation

Das könnte Ihnen auch gefallen