Location-Based Caching Scheme for Mobile Clients

The Voronoi Diagram(VD) is the most suitable mechanism to find the nearest neighbor(NN) for mobile clients. In NN query processing, it is important to reduce the query response time, since a late query response may contain out-of-date information. In this paper, we study the issue of location depend...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Park, KwangJin, Song, MoonBae, Hwang, Chong-Sun
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 244
container_issue
container_start_page 233
container_title
container_volume
creator Park, KwangJin
Song, MoonBae
Hwang, Chong-Sun
description The Voronoi Diagram(VD) is the most suitable mechanism to find the nearest neighbor(NN) for mobile clients. In NN query processing, it is important to reduce the query response time, since a late query response may contain out-of-date information. In this paper, we study the issue of location dependent information services(LDISs) using a VD. To begin our study, we first introduce a broadcast-based spatial query processing methods designed to support NN query processing. In further sections, we introduce a generic method for location-dependent sequential prefetching and caching. The performance of this scheme is studied in different simulated environments. The core contribution of this research, resides in our analytical proof and experimental results.
doi_str_mv 10.1007/11563952_21
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17265564</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17265564</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-8d3e26a84474b173a4b1c1be2b2507fc19d65b36f6278db7a5c9d2b1916dfc793</originalsourceid><addsrcrecordid>eNpNkDtPwzAUhc1LIpRO_IEsDAwB33v9iEeIeElFDMBs2Y7TBtKkirvw75uqDJzhnOE7OsNh7Ar4LXCu7wCkIiPRIhyxC5KCE_JS0zHLQAEURMKcsLnR5Z6hQdR4yjJOHAujBZ2zeUrffBKB4qXIGF8MwW3boS8eXIp1Xrmwavtl_hFWcR3zZhjzt8G3Xcyrro39Nl2ys8Z1Kc7_csa-nh4_q5di8f78Wt0vig2C2RZlTRGVK4XQwoMmN3kAH9Gj5LoJYGolPalGoS5rr50MpkYPBlTdBG1oxq4PuxuXguua0fWhTXYztms3_lrQqKRUYurdHHppQv0yjtYPw0-ywO3-MvvvMtoBD6lWZA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Location-Based Caching Scheme for Mobile Clients</title><source>Springer Books</source><creator>Park, KwangJin ; Song, MoonBae ; Hwang, Chong-Sun</creator><contributor>Yang, Jun ; Fan, Wenfei ; Wu, Zhaohui</contributor><creatorcontrib>Park, KwangJin ; Song, MoonBae ; Hwang, Chong-Sun ; Yang, Jun ; Fan, Wenfei ; Wu, Zhaohui</creatorcontrib><description>The Voronoi Diagram(VD) is the most suitable mechanism to find the nearest neighbor(NN) for mobile clients. In NN query processing, it is important to reduce the query response time, since a late query response may contain out-of-date information. In this paper, we study the issue of location dependent information services(LDISs) using a VD. To begin our study, we first introduce a broadcast-based spatial query processing methods designed to support NN query processing. In further sections, we introduce a generic method for location-dependent sequential prefetching and caching. The performance of this scheme is studied in different simulated environments. The core contribution of this research, resides in our analytical proof and experimental results.</description><edition>1ère éd</edition><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540292272</identifier><identifier>ISBN: 3540292276</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540320873</identifier><identifier>EISBN: 9783540320876</identifier><identifier>DOI: 10.1007/11563952_21</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Air index ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; mobile computing ; Software ; wireless data broadcasting</subject><ispartof>Advances in Web-Age Information Management, 2005, p.233-244</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11563952_21$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11563952_21$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4049,4050,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17265564$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Yang, Jun</contributor><contributor>Fan, Wenfei</contributor><contributor>Wu, Zhaohui</contributor><creatorcontrib>Park, KwangJin</creatorcontrib><creatorcontrib>Song, MoonBae</creatorcontrib><creatorcontrib>Hwang, Chong-Sun</creatorcontrib><title>Location-Based Caching Scheme for Mobile Clients</title><title>Advances in Web-Age Information Management</title><description>The Voronoi Diagram(VD) is the most suitable mechanism to find the nearest neighbor(NN) for mobile clients. In NN query processing, it is important to reduce the query response time, since a late query response may contain out-of-date information. In this paper, we study the issue of location dependent information services(LDISs) using a VD. To begin our study, we first introduce a broadcast-based spatial query processing methods designed to support NN query processing. In further sections, we introduce a generic method for location-dependent sequential prefetching and caching. The performance of this scheme is studied in different simulated environments. The core contribution of this research, resides in our analytical proof and experimental results.</description><subject>Air index</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>mobile computing</subject><subject>Software</subject><subject>wireless data broadcasting</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540292272</isbn><isbn>3540292276</isbn><isbn>3540320873</isbn><isbn>9783540320876</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkDtPwzAUhc1LIpRO_IEsDAwB33v9iEeIeElFDMBs2Y7TBtKkirvw75uqDJzhnOE7OsNh7Ar4LXCu7wCkIiPRIhyxC5KCE_JS0zHLQAEURMKcsLnR5Z6hQdR4yjJOHAujBZ2zeUrffBKB4qXIGF8MwW3boS8eXIp1Xrmwavtl_hFWcR3zZhjzt8G3Xcyrro39Nl2ys8Z1Kc7_csa-nh4_q5di8f78Wt0vig2C2RZlTRGVK4XQwoMmN3kAH9Gj5LoJYGolPalGoS5rr50MpkYPBlTdBG1oxq4PuxuXguua0fWhTXYztms3_lrQqKRUYurdHHppQv0yjtYPw0-ywO3-MvvvMtoBD6lWZA</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Park, KwangJin</creator><creator>Song, MoonBae</creator><creator>Hwang, Chong-Sun</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Location-Based Caching Scheme for Mobile Clients</title><author>Park, KwangJin ; Song, MoonBae ; Hwang, Chong-Sun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-8d3e26a84474b173a4b1c1be2b2507fc19d65b36f6278db7a5c9d2b1916dfc793</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Air index</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>mobile computing</topic><topic>Software</topic><topic>wireless data broadcasting</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Park, KwangJin</creatorcontrib><creatorcontrib>Song, MoonBae</creatorcontrib><creatorcontrib>Hwang, Chong-Sun</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Park, KwangJin</au><au>Song, MoonBae</au><au>Hwang, Chong-Sun</au><au>Yang, Jun</au><au>Fan, Wenfei</au><au>Wu, Zhaohui</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Location-Based Caching Scheme for Mobile Clients</atitle><btitle>Advances in Web-Age Information Management</btitle><date>2005</date><risdate>2005</risdate><spage>233</spage><epage>244</epage><pages>233-244</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540292272</isbn><isbn>3540292276</isbn><eisbn>3540320873</eisbn><eisbn>9783540320876</eisbn><abstract>The Voronoi Diagram(VD) is the most suitable mechanism to find the nearest neighbor(NN) for mobile clients. In NN query processing, it is important to reduce the query response time, since a late query response may contain out-of-date information. In this paper, we study the issue of location dependent information services(LDISs) using a VD. To begin our study, we first introduce a broadcast-based spatial query processing methods designed to support NN query processing. In further sections, we introduce a generic method for location-dependent sequential prefetching and caching. The performance of this scheme is studied in different simulated environments. The core contribution of this research, resides in our analytical proof and experimental results.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11563952_21</doi><tpages>12</tpages><edition>1ère éd</edition></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Advances in Web-Age Information Management, 2005, p.233-244
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_17265564
source Springer Books
subjects Air index
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Information systems. Data bases
Memory organisation. Data processing
mobile computing
Software
wireless data broadcasting
title Location-Based Caching Scheme for Mobile Clients
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T03%3A52%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Location-Based%20Caching%20Scheme%20for%20Mobile%20Clients&rft.btitle=Advances%20in%20Web-Age%20Information%20Management&rft.au=Park,%20KwangJin&rft.date=2005&rft.spage=233&rft.epage=244&rft.pages=233-244&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540292272&rft.isbn_list=3540292276&rft_id=info:doi/10.1007/11563952_21&rft_dat=%3Cpascalfrancis_sprin%3E17265564%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540320873&rft.eisbn_list=9783540320876&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true