Object organization on parallel broadcast channels in a global information sharing environment

Hurson, Ali R.; Chehadeh, Y.C.; Hannan, John

doi:10.1109/pccc.2000.830337

Cited by 25 publications

(16 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sun, et al, [18] proposed two algorithms to retrieve objects given the distribution of desired pages on parallel broadcast channels using a minimum number of passes and switches (in order of priority) between the channels. Hurson et al proposed two algorithms to distribute objects of different sizes onto parallel broadcast channels to achieve the minimum broadcast cycle length and to preserve the clustering property [8]. However, they assumed that a mobile client can only access one channel at any one time.…”

Section: Related Workmentioning

confidence: 99%

Processing transitive nearest-neighbor queries in multi-channel access environments

Zhang

Lee

Mitra

et al. 2008

Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology

View full text Add to dashboard Cite

Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs, can access only one channel at a time. In this paper, we consider a scenario of near future where a mobile device has the ability to process queries using information simultaneously received from multiple channels. We focus on the query processing of the transitive nearest neighbor (TNN) search [19]. Two TNN algorithms developed for a single broadcast channel environment are adapted to our new broadcast enviroment. Based on the obtained insights, we propose two new algorithms, namely Double-NN-Search and Hybrid-NN-Search algorithms. Further, we develop an optimization technique, called approximate-NN (ANN), to reduce the energy consumption in mobile devices. Finally, we conduct a comprehensive set of experiments to validate our proposals. The result shows that our new algorithms provide a better performance than the existing ones and the optimization technique efficiently reduces energy consumption.

show abstract

Section: Related Workmentioning

confidence: 99%

Processing transitive nearest-neighbor queries in multi-channel access environments

Zhang

Lee

Mitra

et al. 2008

Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology

View full text Add to dashboard Cite

show abstract

“…The allocation of objects modeled in an access graph to the broadcast channel was discussed in [3,9,16,19,23]. The use of relations or classes as broadcast objects was presented in [23], where the optimal allocation is found by a branch-and-bound searching algorithm.…”

Section: Related Workmentioning

confidence: 99%

Efficient index and data allocation for wireless broadcast services

Chen

2007

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…In [17], the concept of broadcast disks is used to allocate the data and index on multiple broadcast channels. In [13], the issue of allocating dependent data on multiple channels is discussed. A heuristic algorithm is proposed to cluster related data items to minimize the average access time.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels

Hsu

Lee²,

Chen³

2005

Distrib Parallel Databases

View full text Add to dashboard Cite

In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, a minimal expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the minimal expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches.The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.

show abstract

Object organization on parallel broadcast channels in a global information sharing environment

Cited by 25 publications

References 13 publications

Processing transitive nearest-neighbor queries in multi-channel access environments

Processing transitive nearest-neighbor queries in multi-channel access environments

Efficient index and data allocation for wireless broadcast services

An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels

Contact Info

Product

Resources

About