Scribd
Upload
498 views20 pages

Data Dissemination and Broadcasting Systems: Lesson 08 Indexing Techniques For Selective Tuning

Indexing is a technique in which each data bucket, record, or record block of interest is assigned an index at the previous bucket of interest. A disadvantage of using index is that it extends the broadcast cycle and hence increases taccess. An algorithm is used to adapt a value of m such that it minimizes access (caching) latency in a given wireless environment.

Uploaded by

sukanya
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
498 views20 pages

Data Dissemination and Broadcasting Systems: Lesson 08 Indexing Techniques For Selective Tuning

Indexing is a technique in which each data bucket, record, or record block of interest is assigned an index at the previous bucket of interest. A disadvantage of using index is that it extends the broadcast cycle and hence increases taccess. An algorithm is used to adapt a value of m such that it minimizes access (caching) latency in a given wireless environment.

Uploaded by

sukanya
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Data Dissemination and Broadcasting

Systems

Lesson 08
Indexing Techniques for Selective Tuning

© Oxford University Press 2007. All rights reserved. 1


Indexing

• A method for selective tuning


• Indexes temporally map the location of
the buckets

© Oxford University Press 2007. All rights reserved. 2


Index-Based Methods

• Index be first sent


• It specifies the location of the bucket or
record
• Consider a simple example. Let index
be 20 at the beginning of a broadcast
cycle. It specifies that 20th bucket is of
interest and is sent to the device in
response to previous subscription.
© Oxford University Press 2007. All rights reserved. 3
Indexing

• A technique in which each data bucket,


record, or record block of interest is
assigned an index at the previous data
bucket, record, or record block of interest
to enable the device to tune and cache
the bucket after the wait as per the offset
value

© Oxford University Press 2007. All rights reserved. 4


Indexing

• At each location, besides the bits for the


bucket in record of interest data, an
offset value may also be specified there
• While an index maps to the absolute
location from the beginning of a
broadcast cycle, an offset index is a
number which maps to the relative
location after the end of present bucket
of interest
© Oxford University Press 2007. All rights reserved. 5
Offset

• Offset means a value to be used by the


device along with the present location
and calculate the wait period for tuning to
the next bucket
• All buckets have an offset to the
beginning of the next indexed bucket or
item

© Oxford University Press 2007. All rights reserved. 6


Indexing

• The server transmits this index at the


beginning of a broadcast cycle as well as
with each bucket corresponding to data
of interest to the device.
• A disadvantage of using index is that it
extends the broadcast cycle and hence
increases taccess

© Oxford University Press 2007. All rights reserved. 7


Disadvantage of using index

• Extends the broadcast cycle and hence


increases taccess

© Oxford University Press 2007. All rights reserved. 8


(I, m) indexing

• An index I transmits m times during each


push of a record
• An algorithm is used to adapt a value of
m such that it minimizes access
(caching) latency in a given wireless
environment which may involve frequent
or less frequent loss of index or data

© Oxford University Press 2007. All rights reserved. 9


(I, m)

• Index format is adapted to with a suitable


m chosen as per the wireless
environment
• This decreases the probability of missing
I and hence the caching of the record of
interest
• If m is chosen small then the power
dissipated by device is less
© Oxford University Press 2007. All rights reserved. 10
(I, m)

• If m decreased, the chances that the


cache be missed go up and the data
access latency increases
• The value of m therefore needs to be
optimized which can be done by
employing an algorithm as stated earlier

© Oxford University Press 2007. All rights reserved. 11


Distributed Index-based Method

• When Index I is repeated m times, the


access latency increases significantly
even though the cache-miss probability
reduces drastically
• Distributed index-based method an
improvement on the (I, m) method

© Oxford University Press 2007. All rights reserved. 12


Distributed Index-based Method

• In this method, there is no need to repeat


the complete index again and again
• Instead of replicating the whole index m
times, each index segment in a bucket
describes only the offset I' of data items
which immediately follow
• Each index I is partitioned into two parts
I' and I″
© Oxford University Press 2007. All rights reserved. 13
Distributed Index-based Method

• I″ consists of unrepeated k levels (sub-


indexes), which do not repeat and I′
consists of top j repeated levels (sub-
indexes)

© Oxford University Press 2007. All rights reserved. 14


Flexible Indexing Method

• Provides dual use of the parameters (e.g.,


use of Iseg or Irec in an index segment to
tune to the record or buckets of interest) or
multi-parameter indexing (e.g., use of
Iseg, Irec, or Ib in an index segment to
tune to the bucket of interest)

© Oxford University Press 2007. All rights reserved. 15


Temporal Addressing

• A technique used for pushing in which


instead of repeating I several times, a
temporal value is repeated before a data
record is transmitted
• There can be effective synchronization of
tuning and caching of the record of
interest in case of non–uniform time
intervals between the successive bits

© Oxford University Press 2007. All rights reserved. 16


Broadcast Addressing

• A broadcast address similar to IP or


multicast address
• Each device or group of devices can be
assigned an address
• The devices cache the records which
have this address as the broadcasting
address in a broadcast cycle

© Oxford University Press 2007. All rights reserved. 17


Summary

• A technique in which each data bucket,


record, or record block of interest is
assigned an index at the previous data
bucket, record, or record block of interest
to enable the device to tune and cache
the bucket after the wait as per the offset
value
…

© Oxford University Press 2007. All rights reserved. 18


… Summary

• Index I based, (I, m) based, distributed


index based and flexible indexing
methods
• Temporal and broadcast address
methods in place of the index

© Oxford University Press 2007. All rights reserved. 19


End of Lesson 08
Indexing Techniques for Selective Tuning

© Oxford University Press 2007. All rights reserved. 20

You might also like