Effective data placement for wireless broadcast

Yon Dohn Chung, Myoung H. Kim

Research output: Contribution to journalArticle

59 Citations (Scopus)

Abstract

This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD), which represents the coherence degree of data set accessed by a query. We show that the problem is NP-complete, and then propose an effective data placement method that constructs the broadcast schedule by appending each query's data set in greedy way. We show through performance experiments that the proposed method reduces the access time of mobile query.

Original languageEnglish
Pages (from-to)133-150
Number of pages18
JournalDistributed and Parallel Databases
Volume9
Issue number2
DOIs
Publication statusPublished - 2001 Mar 1
Externally publishedYes

Fingerprint

Data Placement
Broadcast
Query
Computational complexity
Air
Latency
Schedule
NP-complete problem
Experiments
Placement
Experiment

Keywords

  • Data broadcasting
  • Data clustering
  • Data placement
  • Mobile computing
  • Multi-point query

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this

Effective data placement for wireless broadcast. / Chung, Yon Dohn; Kim, Myoung H.

In: Distributed and Parallel Databases, Vol. 9, No. 2, 01.03.2001, p. 133-150.

Research output: Contribution to journalArticle

@article{309b13d238184bd6b13016e98ee068d2,
title = "Effective data placement for wireless broadcast",
abstract = "This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD), which represents the coherence degree of data set accessed by a query. We show that the problem is NP-complete, and then propose an effective data placement method that constructs the broadcast schedule by appending each query's data set in greedy way. We show through performance experiments that the proposed method reduces the access time of mobile query.",
keywords = "Data broadcasting, Data clustering, Data placement, Mobile computing, Multi-point query",
author = "Chung, {Yon Dohn} and Kim, {Myoung H.}",
year = "2001",
month = "3",
day = "1",
doi = "10.1023/A:1018992406195",
language = "English",
volume = "9",
pages = "133--150",
journal = "Distributed and Parallel Databases",
issn = "0926-8782",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Effective data placement for wireless broadcast

AU - Chung, Yon Dohn

AU - Kim, Myoung H.

PY - 2001/3/1

Y1 - 2001/3/1

N2 - This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD), which represents the coherence degree of data set accessed by a query. We show that the problem is NP-complete, and then propose an effective data placement method that constructs the broadcast schedule by appending each query's data set in greedy way. We show through performance experiments that the proposed method reduces the access time of mobile query.

AB - This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD), which represents the coherence degree of data set accessed by a query. We show that the problem is NP-complete, and then propose an effective data placement method that constructs the broadcast schedule by appending each query's data set in greedy way. We show through performance experiments that the proposed method reduces the access time of mobile query.

KW - Data broadcasting

KW - Data clustering

KW - Data placement

KW - Mobile computing

KW - Multi-point query

UR - http://www.scopus.com/inward/record.url?scp=0035276893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035276893&partnerID=8YFLogxK

U2 - 10.1023/A:1018992406195

DO - 10.1023/A:1018992406195

M3 - Article

VL - 9

SP - 133

EP - 150

JO - Distributed and Parallel Databases

JF - Distributed and Parallel Databases

SN - 0926-8782

IS - 2

ER -