Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets
We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 285 |
|---|---|
| container_issue | |
| container_start_page | 270 |
| container_title | |
| container_volume | 1651 |
| creator | Becker, Ludger Giesen, André Hinrichs, Klaus H. Vahrenhold, Jan |
| description | We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data. |
| doi_str_mv | 10.1007/3-540-48482-5_17 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1824385</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC6486148_218_268</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-22586f348075619e4f3e3cd56ecbaaab3570e7d0a10b16d41d858062829f9c743</originalsourceid><addsrcrecordid>eNqNkM1P3DAQxd3SVl3B3jn60GvA4_FXjohCWwQCCThbs4mzhGbj1A5I-9_jBdQzlkYjvTe_GfkxdgjiCISwx1hpJSrllJOV9mA_sWVtHRbxVROf2QIMQIWo6r3_njFSWfjCFgKFrGqr8Btb1NppKdGK72yZ86MoDyWUWrD7k2EdUz8_bDLvYuI3IZW26cc1v4nDdh1HGvgVTfz6OaSBtpzGlt9ONPdFv4j9yONY_Jz758B_0kz8Nsz5gH3taMhh-d732f352d3p7-ry-tef05PLqkFdz5WU2pkOlRNWG6iD6jBg02oTmhURrVBbEWwrCMQKTKugddoJI52su7opf9tnP972TpQbGrpEY9NnP6V-Q2nrwUmFTpexo7exXJxxHZJfxfg3exB-F7VHX5Lzr7H6XdQFUO97U_z3FPLsw45owjgnGpoHmuaQsjfKGVDOSyhlXMHwIxgKC7YclFgoiy815oxZ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3071740_23_267</pqid></control><display><type>book_chapter</type><title>Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets</title><source>Springer Books</source><creator>Becker, Ludger ; Giesen, André ; Hinrichs, Klaus H. ; Vahrenhold, Jan</creator><contributor>Goos, Gerhard ; Hartmanis, Juris ; van Leeuwen, Jan ; Papadias, Dimitris ; Güting, Ralf H ; Lochovsky, Fred ; Papadias, Dimitris ; Güting, Ralf Hartmut ; Lochovsky, Fred</contributor><creatorcontrib>Becker, Ludger ; Giesen, André ; Hinrichs, Klaus H. ; Vahrenhold, Jan ; Goos, Gerhard ; Hartmanis, Juris ; van Leeuwen, Jan ; Papadias, Dimitris ; Güting, Ralf H ; Lochovsky, Fred ; Papadias, Dimitris ; Güting, Ralf Hartmut ; Lochovsky, Fred</creatorcontrib><description>We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540662471</identifier><identifier>ISBN: 3540662472</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540484820</identifier><identifier>EISBN: 3540484825</identifier><identifier>DOI: 10.1007/3-540-48482-5_17</identifier><identifier>OCLC: 958522370</identifier><identifier>OCLC: 1245663679</identifier><identifier>LCCallNum: QA76.9.D35QA76.9.D3</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Active Segment ; Applied sciences ; Computer science; control theory; systems ; Event Point ; Exact sciences and technology ; Information systems. Data bases ; Intersection Event ; Intersection Point ; Memory organisation. Data processing ; Priority Queue ; Software</subject><ispartof>Advances in Spatial Databases, 1999, Vol.1651, p.270-285</ispartof><rights>Springer-Verlag Berlin Heidelberg 1999</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-22586f348075619e4f3e3cd56ecbaaab3570e7d0a10b16d41d858062829f9c743</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3071740-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-48482-5_17$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-48482-5_17$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4048,4049,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1824385$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Goos, Gerhard</contributor><contributor>Hartmanis, Juris</contributor><contributor>van Leeuwen, Jan</contributor><contributor>Papadias, Dimitris</contributor><contributor>Güting, Ralf H</contributor><contributor>Lochovsky, Fred</contributor><contributor>Papadias, Dimitris</contributor><contributor>Güting, Ralf Hartmut</contributor><contributor>Lochovsky, Fred</contributor><creatorcontrib>Becker, Ludger</creatorcontrib><creatorcontrib>Giesen, André</creatorcontrib><creatorcontrib>Hinrichs, Klaus H.</creatorcontrib><creatorcontrib>Vahrenhold, Jan</creatorcontrib><title>Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets</title><title>Advances in Spatial Databases</title><description>We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data.</description><subject>Active Segment</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Event Point</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Intersection Event</subject><subject>Intersection Point</subject><subject>Memory organisation. Data processing</subject><subject>Priority Queue</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540662471</isbn><isbn>3540662472</isbn><isbn>9783540484820</isbn><isbn>3540484825</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1999</creationdate><recordtype>book_chapter</recordtype><recordid>eNqNkM1P3DAQxd3SVl3B3jn60GvA4_FXjohCWwQCCThbs4mzhGbj1A5I-9_jBdQzlkYjvTe_GfkxdgjiCISwx1hpJSrllJOV9mA_sWVtHRbxVROf2QIMQIWo6r3_njFSWfjCFgKFrGqr8Btb1NppKdGK72yZ86MoDyWUWrD7k2EdUz8_bDLvYuI3IZW26cc1v4nDdh1HGvgVTfz6OaSBtpzGlt9ONPdFv4j9yONY_Jz758B_0kz8Nsz5gH3taMhh-d732f352d3p7-ry-tef05PLqkFdz5WU2pkOlRNWG6iD6jBg02oTmhURrVBbEWwrCMQKTKugddoJI52su7opf9tnP972TpQbGrpEY9NnP6V-Q2nrwUmFTpexo7exXJxxHZJfxfg3exB-F7VHX5Lzr7H6XdQFUO97U_z3FPLsw45owjgnGpoHmuaQsjfKGVDOSyhlXMHwIxgKC7YclFgoiy815oxZ</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Becker, Ludger</creator><creator>Giesen, André</creator><creator>Hinrichs, Klaus H.</creator><creator>Vahrenhold, Jan</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>1999</creationdate><title>Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets</title><author>Becker, Ludger ; Giesen, André ; Hinrichs, Klaus H. ; Vahrenhold, Jan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-22586f348075619e4f3e3cd56ecbaaab3570e7d0a10b16d41d858062829f9c743</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Active Segment</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Event Point</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Intersection Event</topic><topic>Intersection Point</topic><topic>Memory organisation. Data processing</topic><topic>Priority Queue</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Becker, Ludger</creatorcontrib><creatorcontrib>Giesen, André</creatorcontrib><creatorcontrib>Hinrichs, Klaus H.</creatorcontrib><creatorcontrib>Vahrenhold, Jan</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Becker, Ludger</au><au>Giesen, André</au><au>Hinrichs, Klaus H.</au><au>Vahrenhold, Jan</au><au>Goos, Gerhard</au><au>Hartmanis, Juris</au><au>van Leeuwen, Jan</au><au>Papadias, Dimitris</au><au>Güting, Ralf H</au><au>Lochovsky, Fred</au><au>Papadias, Dimitris</au><au>Güting, Ralf Hartmut</au><au>Lochovsky, Fred</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets</atitle><btitle>Advances in Spatial Databases</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1999</date><risdate>1999</risdate><volume>1651</volume><spage>270</spage><epage>285</epage><pages>270-285</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540662471</isbn><isbn>3540662472</isbn><eisbn>9783540484820</eisbn><eisbn>3540484825</eisbn><abstract>We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-48482-5_17</doi><oclcid>958522370</oclcid><oclcid>1245663679</oclcid><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Advances in Spatial Databases, 1999, Vol.1651, p.270-285 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1824385 |
| source | Springer Books |
| subjects | Active Segment Applied sciences Computer science control theory systems Event Point Exact sciences and technology Information systems. Data bases Intersection Event Intersection Point Memory organisation. Data processing Priority Queue Software |
| title | Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T17%3A23%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Algorithms%20for%20Performing%20Polygonal%20Map%20Overlay%20and%20Spatial%20Join%20on%20Massive%20Data%20Sets&rft.btitle=Advances%20in%20Spatial%20Databases&rft.au=Becker,%20Ludger&rft.date=1999&rft.volume=1651&rft.spage=270&rft.epage=285&rft.pages=270-285&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540662471&rft.isbn_list=3540662472&rft_id=info:doi/10.1007/3-540-48482-5_17&rft_dat=%3Cproquest_pasca%3EEBC6486148_218_268%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540484820&rft.eisbn_list=3540484825&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3071740_23_267&rft_id=info:pmid/&rfr_iscdi=true |