Professional Documents
Culture Documents
The Cost of Query Execu&on in Tradi&onal Databases
The Cost of Query Execu&on in Tradi&onal Databases
Databases
• The
cost
of
query
execu&on
in
tradi&onal
databases
–
I/O
cost
– CPU
cost
– Combina&on
of
the
two
• AQP
approaches
simplify
this
concept
• To
minimize
the
number
of
tuples
in
the
sample
• The
sample
size
is
directly
related
to
the
cost
of
query
P2P
execu&on.
Databases
• The
cost
of
query
execu&on
in
P2P
Databases
– number
of
par&cipa&ng
peers
– the
bandwidth
consumed
– the
number
of
messages
exchanged
– the
latency
–
the
I/O
cost
–
the
CPU
cost
– Combina&on
of
some
or
all
the
above
• AQP
approaches
simplify
this
concept
• Concerned
with
latency
• The
sample
size
is
directly
related
to
the
cost
of
query
execu&on.
Goal
/
Crux
• Given
an
aggrega&on
query
and
a
desired
error
bound
at
a
query
node
peer,
compute
with
“minimum
cost”
an
approximate
answer
to
this
query
that
sa&sfied
the
error
bound.
Contribu&ons
The
contribu&ons
of
this
paper
are
summarized
as
follows:
• We
introduce
the
important
problem
of
AQP
in
P2P
databases,
which
is
likely
to
be
of
increasing
significance
in
the
future.
• The
problem
is
analyzed
in
detail,
and
its
unique
challenges
are
comprehensively
discussed.
• Hybrid
sampling
technique
maximizes
per-‐peer
in
network
computa&on
building
upon
the
Gossip
protocol.
• Adap&ve
two-‐phase
sampling-‐based
approaches
are
proposed
based
on
well-‐founded
theore&cal
principles.
EXISTING SOLUTIONS