Efficient data access to multi-channel broadcast programs

Yee, Wai Gen; Navathe, Shamkant B.

doi:10.1145/956892.956893

Cited by 16 publications

(29 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides, some researches began to study how to allocate dependent data on broadcast channels (see, e.g., [10,19,21,5,6]). With respect to index, many methods have been proposed to improve the search efficiency in data broadcast systems (see, e.g., [8,16,18,19,21]). …”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Porselvi¹,

Devi²

2015

IJCATR

View full text Add to dashboard Cite

Wireless data broadcast is an efficient way of disseminating data to users in the mobile computing environments. From the server's point of view, how to place the data items on channels is a crucial issue, with the objective of minimizing the average access time and tuning time. Similarly, how to schedule the data retrieval process for a given request at the client side such that all the requested items can be downloaded in a short time is also an important problem. In this paper, we investigate the multi-item data retrieval scheduling in the push-based multichannel broadcast environments. The most important issues in mobile computing are energy efficiency and query response efficiency. However, in data broadcast the objectives of reducing access latency and energy cost can be contradictive to each other. Consequently, we define a new problem named Minimum Cost Data Retrieval Problem (MCDR) and Large Number Data Retrieval (LNDR) Problem. We also develop a heuristic algorithm to download a large number of items efficiently. When there is no replicated item in a broadcast cycle, we show that an optimal retrieval schedule can be obtained in polynomial time.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In terms of data retrieval scheduling, Hurson et al proposed two heuristic algorithms for downloading multiple data items from multiple channels [7]. As both push-based and pull-based approaches have their own strengths and drawbacks [15,16], hybrid scheduling is regarded as a prospective approach to better scheduling.…”

Section: Related Workmentioning

confidence: 99%

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Porselvi¹,

Devi²

2015

IJCATR

View full text Add to dashboard Cite

show abstract

“…In their scheme, they use flatstructured indexes which have access and tuning times larger than the tree-structured indexes. Two different approaches have been studied on tree-structured indexing techniques for broadcast data over multichannel environments [5], [16], [17], [24]. One approach is to use multi channels such that data and index nodes are interleaved over each channel [5], [16], [24].…”

Section: Introductionmentioning

confidence: 99%

“…Two different approaches have been studied on tree-structured indexing techniques for broadcast data over multichannel environments [5], [16], [17], [24]. One approach is to use multi channels such that data and index nodes are interleaved over each channel [5], [16], [24]. The other approach is to partition the multichannels into dedicated data and index channels so that data (index) channels carry only data (index) nodes [17].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments

Jung

Lee

Pramanik

2005

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Abstract-Broadcast has often been used to disseminate frequently requested data efficiently to a large volume of mobile units over single or multiple channels. Since mobile units have limited battery power, the minimization of the access and tuning times for the broadcast data is an important problem. There have been many research efforts that focus on minimizing access and tuning times by providing indexes on the broadcast data. In this paper, we have studied an efficient index allocation method for broadcast data with skewed access frequencies over multiple physical channels which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques have one of two problems. The first problem is that they require equal size for both index and data. The second problem is that their performance degrades when the number of given physical channels is not enough. These two problems will result in an increased average access time for the broadcast data. To cope with these problems, we propose a tree-structured index allocation method. Our method minimizes the average access time by broadcasting the hot data and their indices more frequently than the less hot data and their indexes over the dedicated index and data channels. We present an in-depth experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decreases the average access and tuning times for the broadcast data over existing methods.

show abstract

Distributed AH-Tree Based Index Technology for Multi-channel Wireless Data Broadcast

Yang

Gao

Lü

et al. 2013

Database Systems for Advanced Applications

View full text Add to dashboard Cite

Efficient data access to multi-channel broadcast programs

Cited by 16 publications

References 0 publications

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

Heuristic Algorithm for Efficient Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments

A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments

Distributed AH-Tree Based Index Technology for Multi-channel Wireless Data Broadcast

Contact Info

Product

Resources

About