Range and Nearest Neighbor Query Processing for Mobile Clients
Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1106 |
|---|---|
| container_issue | |
| container_start_page | 1097 |
| container_title | |
| container_volume | |
| creator | Park, KwangJin Song, MoonBae Kong, Ki-Sik Hwang, Chong-Sun Chung, Kwang-Sik Jung, SoonYoung |
| description | Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based spatial query processing algorithm for LBS. In this algorithm, we simply sort the data objects based on their locations, then the server broadcasts them sequentially to the mobile clients. The experimental results show that the proposed BBS scheme significantly reduces the Access latency. |
| doi_str_mv | 10.1007/11575863_132 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17344864</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17344864</sourcerecordid><originalsourceid>FETCH-LOGICAL-p220t-cbb94b29e2f804b785666706e5af1cfd5d43026c3f92ee4851b8bdca723fa5793</originalsourceid><addsrcrecordid>eNpNULlOAzEUNJdEEtLxAdvQIC0833aDhKJwSOEU1JbttcPCshvZocjf4ygUVDN6Mxq9GYROMVxgAHmJMZdcCWowJXtoTDkDSgon-2iEBcY1pUwfoKmWaqsRLamGQzQCCqTWktFjNM75EwCI1GSErl5tvwyV7ZvqMdgU8rpgu_xwQ6pefkLaVM9p8CHntl9WsRwfBtd2oZp1bejX-QQdRdvlMP3DCXq_mb_N7urF0-397HpRrwiBde2d08wRHUhUwJxUXAghQQRuI_ax4Q0r_wlPoyYhMMWxU67xVhIaLZeaTtDZLndls7ddTLb3bTar1H7btDFYUsaUYMV3vvPlIpViybhh-MoGg9nOZ_7PR38BFFhb6g</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Range and Nearest Neighbor Query Processing for Mobile Clients</title><source>Springer Books</source><creator>Park, KwangJin ; Song, MoonBae ; Kong, Ki-Sik ; Hwang, Chong-Sun ; Chung, Kwang-Sik ; Jung, SoonYoung</creator><contributor>Tari, Zahir ; Meersman, Robert ; Herrero, Pilar</contributor><creatorcontrib>Park, KwangJin ; Song, MoonBae ; Kong, Ki-Sik ; Hwang, Chong-Sun ; Chung, Kwang-Sik ; Jung, SoonYoung ; Tari, Zahir ; Meersman, Robert ; Herrero, Pilar</creatorcontrib><description>Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based spatial query processing algorithm for LBS. In this algorithm, we simply sort the data objects based on their locations, then the server broadcasts them sequentially to the mobile clients. The experimental results show that the proposed BBS scheme significantly reduces the Access latency.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540297390</identifier><identifier>ISBN: 3540297391</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540321322</identifier><identifier>EISBN: 9783540321323</identifier><identifier>DOI: 10.1007/11575863_132</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Software</subject><ispartof>Lecture notes in computer science, 2005, p.1097-1106</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2006 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/11575863_132$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11575863_132$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27930,38260,41447,42516</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17344864$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Tari, Zahir</contributor><contributor>Meersman, Robert</contributor><contributor>Herrero, Pilar</contributor><creatorcontrib>Park, KwangJin</creatorcontrib><creatorcontrib>Song, MoonBae</creatorcontrib><creatorcontrib>Kong, Ki-Sik</creatorcontrib><creatorcontrib>Hwang, Chong-Sun</creatorcontrib><creatorcontrib>Chung, Kwang-Sik</creatorcontrib><creatorcontrib>Jung, SoonYoung</creatorcontrib><title>Range and Nearest Neighbor Query Processing for Mobile Clients</title><title>Lecture notes in computer science</title><description>Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based spatial query processing algorithm for LBS. In this algorithm, we simply sort the data objects based on their locations, then the server broadcasts them sequentially to the mobile clients. The experimental results show that the proposed BBS scheme significantly reduces the Access latency.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540297390</isbn><isbn>3540297391</isbn><isbn>3540321322</isbn><isbn>9783540321323</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNULlOAzEUNJdEEtLxAdvQIC0833aDhKJwSOEU1JbttcPCshvZocjf4ygUVDN6Mxq9GYROMVxgAHmJMZdcCWowJXtoTDkDSgon-2iEBcY1pUwfoKmWaqsRLamGQzQCCqTWktFjNM75EwCI1GSErl5tvwyV7ZvqMdgU8rpgu_xwQ6pefkLaVM9p8CHntl9WsRwfBtd2oZp1bejX-QQdRdvlMP3DCXq_mb_N7urF0-397HpRrwiBde2d08wRHUhUwJxUXAghQQRuI_ax4Q0r_wlPoyYhMMWxU67xVhIaLZeaTtDZLndls7ddTLb3bTar1H7btDFYUsaUYMV3vvPlIpViybhh-MoGg9nOZ_7PR38BFFhb6g</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Park, KwangJin</creator><creator>Song, MoonBae</creator><creator>Kong, Ki-Sik</creator><creator>Hwang, Chong-Sun</creator><creator>Chung, Kwang-Sik</creator><creator>Jung, SoonYoung</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Range and Nearest Neighbor Query Processing for Mobile Clients</title><author>Park, KwangJin ; Song, MoonBae ; Kong, Ki-Sik ; Hwang, Chong-Sun ; Chung, Kwang-Sik ; Jung, SoonYoung</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p220t-cbb94b29e2f804b785666706e5af1cfd5d43026c3f92ee4851b8bdca723fa5793</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Park, KwangJin</creatorcontrib><creatorcontrib>Song, MoonBae</creatorcontrib><creatorcontrib>Kong, Ki-Sik</creatorcontrib><creatorcontrib>Hwang, Chong-Sun</creatorcontrib><creatorcontrib>Chung, Kwang-Sik</creatorcontrib><creatorcontrib>Jung, SoonYoung</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>Kong, Ki-Sik</au><au>Hwang, Chong-Sun</au><au>Chung, Kwang-Sik</au><au>Jung, SoonYoung</au><au>Tari, Zahir</au><au>Meersman, Robert</au><au>Herrero, Pilar</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Range and Nearest Neighbor Query Processing for Mobile Clients</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>1097</spage><epage>1106</epage><pages>1097-1106</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540297390</isbn><isbn>3540297391</isbn><eisbn>3540321322</eisbn><eisbn>9783540321323</eisbn><abstract>Indexing techniques have been developed for wireless data broadcast environments, in order to conserve the scarce power resources of the mobile clients. However, the use of interleaved index segments in a broadcast cycle increases the average access latency for the clients. In this paper, we present the broadcast-based spatial query processing algorithm for LBS. In this algorithm, we simply sort the data objects based on their locations, then the server broadcasts them sequentially to the mobile clients. The experimental results show that the proposed BBS scheme significantly reduces the Access latency.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11575863_132</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, p.1097-1106 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17344864 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Information systems. Data bases Memory organisation. Data processing Software |
| title | Range and Nearest Neighbor Query Processing 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=2024-12-15T22%3A56%3A02IST&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=Range%20and%20Nearest%20Neighbor%20Query%20Processing%20for%20Mobile%20Clients&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Park,%20KwangJin&rft.date=2005&rft.spage=1097&rft.epage=1106&rft.pages=1097-1106&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540297390&rft.isbn_list=3540297391&rft_id=info:doi/10.1007/11575863_132&rft_dat=%3Cpascalfrancis_sprin%3E17344864%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540321322&rft.eisbn_list=9783540321323&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |