Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Utility based query dissemination in spatial data grid
KTH, School of Architecture and the Built Environment (ABE), Urban Planning and Environment, Geoinformatics (closed 20110301). Peking University,China.
Show others and affiliations
2007 (English)In: Proceedings of the 6th International Conference on Grid and Cooperative Computing, GCC 2007, IEEE Computer Society, 2007, 574-581 p.Conference paper, Published paper (Refereed)
Abstract [en]

Spatial Information Grid is an ideal infrastructure to handle the data-intensive and computing-intensive geo-spatial processing. In order that each agency could ad hoc connect to this computing environment and make autonomous decision, we build a Geospatial Data Grid in peer-to-peer way. The query processor module in each peer can decompose the user's query into sub-queries that executed in different nodes. One problem in the parallel spatial join query optimization is how to determine an appropriate node group to disseminate the sub-queries. Especially, if there is more than one node sharing the same area of interest, there is a dilemma: on the one hand, the task scheduler tends to decompose this query into sub-queries and disseminate them to as many as possible nodes so that they could process the user's query in parallel; on the other hand, recruiting too many nodes will also bring in overhead in repetitive computing, redundant data transmission, and the result merging. Based on the study of trade-off between increasing parallelism and reducing redundancy using the Utility Theory in economics, we put forward a fast node selection algorithm for the parallel spatial join query dissemination. The test in our system shows this strategy could balance the above two conflict demands and is appropriate for use in Data Grid.

Place, publisher, year, edition, pages
IEEE Computer Society, 2007. 574-581 p.
Keyword [en]
Computer systems, Data processing, Distributed computer systems, Economics, Large scale systems, Parallel algorithms
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-155290DOI: 10.1109/GCC.2007.125ISI: 000250479200079Scopus ID: 2-s2.0-46449108792ISBN: 0769528716 (print)ISBN: 978-076952871-7 OAI: oai:DiVA.org:kth-155290DiVA: diva2:760635
Conference
6th International Conference on Grid and Cooperative Computing, GCC 2007, 16 August 2007 through 18 August 2007, Urumchi, Xinjiang, China
Note

QC 20141104

Available from: 2014-11-04 Created: 2014-11-04 Last updated: 2014-11-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lin, Xin
By organisation
Geoinformatics (closed 20110301)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf