Indexing the trajectories of moving objects in networks
The management of moving objects has been intensively studied in recent years. A wide and increasing range of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to efficiently store and query the positions...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 118 |
---|---|
container_issue | |
container_start_page | 115 |
container_title | |
container_volume | |
creator | de Almeida, V.T. Guting, R.H. |
description | The management of moving objects has been intensively studied in recent years. A wide and increasing range of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to efficiently store and query the positions of these objects. To achieve this goal, index structures are required. Most of the proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. The constrained movement is a special and a very important case of object movement. In this paper we propose a new index structure for moving objects in networks, the MON-Tree. We tested our proposal in an experimental evaluation with generated data sets. The MON-Tree showed good scalability when increasing the number of objects and time units in the index structure, and the query window and time interval in querying. |
doi_str_mv | 10.1109/SSDM.2004.1311200 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis_6IE</sourceid><recordid>TN_cdi_ieee_primary_1311200</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1311200</ieee_id><sourcerecordid>18597193</sourcerecordid><originalsourceid>FETCH-LOGICAL-i203t-81dc3aeac4c37fad41046ea9741ed044ead729416421f70a2e38205d5bd86ab63</originalsourceid><addsrcrecordid>eNpFkMtOwzAQRS0BEqX0AxAbb1gmePyI7SUqr0pFLArrahJPwKVNqjji8fekChJ3M6M5R7O4jF2AyAGEv16tbp9yKYTOQQEMyxE7E7bwRoIuxDGbDJLPlLJwymYpbcQQY5x1ZsLsogn0HZs33r8T7zvcUNW3XaTE25rv2s8DasvDNfHY8Ib6r7b7SOfspMZtotnfnLLX-7uX-WO2fH5YzG-WWZRC9ZmDUCkkrHSlbI1Bg9AFobcaKAitCYOVXkOhJdRWoCTlpDDBlMEVWBZqyq7Gv3tMFW7rDpsqpvW-izvsftbgjLfg1eBdjl4kon889qF-ATpaUyQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Indexing the trajectories of moving objects in networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>de Almeida, V.T. ; Guting, R.H.</creator><creatorcontrib>de Almeida, V.T. ; Guting, R.H.</creatorcontrib><description>The management of moving objects has been intensively studied in recent years. A wide and increasing range of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to efficiently store and query the positions of these objects. To achieve this goal, index structures are required. Most of the proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. The constrained movement is a special and a very important case of object movement. In this paper we propose a new index structure for moving objects in networks, the MON-Tree. We tested our proposal in an experimental evaluation with generated data sets. The MON-Tree showed good scalability when increasing the number of objects and time units in the index structure, and the query window and time interval in querying.</description><identifier>ISSN: 1099-3371</identifier><identifier>ISBN: 0769521460</identifier><identifier>ISBN: 9780769521466</identifier><identifier>DOI: 10.1109/SSDM.2004.1311200</identifier><language>eng</language><publisher>Los Alamitos CA: IEEE</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Conference management ; Database systems ; Exact sciences and technology ; Indexing ; Information systems. Data bases ; Intelligent networks ; Memory organisation. Data processing ; Proposals ; Relational databases ; Roads ; Scalability ; Software ; Spatial databases ; Testing</subject><ispartof>Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004, 2004, p.115-118</ispartof><rights>2007 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1311200$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1311200$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18597193$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>de Almeida, V.T.</creatorcontrib><creatorcontrib>Guting, R.H.</creatorcontrib><title>Indexing the trajectories of moving objects in networks</title><title>Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004</title><addtitle>SSDM</addtitle><description>The management of moving objects has been intensively studied in recent years. A wide and increasing range of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to efficiently store and query the positions of these objects. To achieve this goal, index structures are required. Most of the proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. The constrained movement is a special and a very important case of object movement. In this paper we propose a new index structure for moving objects in networks, the MON-Tree. We tested our proposal in an experimental evaluation with generated data sets. The MON-Tree showed good scalability when increasing the number of objects and time units in the index structure, and the query window and time interval in querying.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Conference management</subject><subject>Database systems</subject><subject>Exact sciences and technology</subject><subject>Indexing</subject><subject>Information systems. Data bases</subject><subject>Intelligent networks</subject><subject>Memory organisation. Data processing</subject><subject>Proposals</subject><subject>Relational databases</subject><subject>Roads</subject><subject>Scalability</subject><subject>Software</subject><subject>Spatial databases</subject><subject>Testing</subject><issn>1099-3371</issn><isbn>0769521460</isbn><isbn>9780769521466</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkMtOwzAQRS0BEqX0AxAbb1gmePyI7SUqr0pFLArrahJPwKVNqjji8fekChJ3M6M5R7O4jF2AyAGEv16tbp9yKYTOQQEMyxE7E7bwRoIuxDGbDJLPlLJwymYpbcQQY5x1ZsLsogn0HZs33r8T7zvcUNW3XaTE25rv2s8DasvDNfHY8Ib6r7b7SOfspMZtotnfnLLX-7uX-WO2fH5YzG-WWZRC9ZmDUCkkrHSlbI1Bg9AFobcaKAitCYOVXkOhJdRWoCTlpDDBlMEVWBZqyq7Gv3tMFW7rDpsqpvW-izvsftbgjLfg1eBdjl4kon889qF-ATpaUyQ</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>de Almeida, V.T.</creator><creator>Guting, R.H.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Indexing the trajectories of moving objects in networks</title><author>de Almeida, V.T. ; Guting, R.H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i203t-81dc3aeac4c37fad41046ea9741ed044ead729416421f70a2e38205d5bd86ab63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Conference management</topic><topic>Database systems</topic><topic>Exact sciences and technology</topic><topic>Indexing</topic><topic>Information systems. Data bases</topic><topic>Intelligent networks</topic><topic>Memory organisation. Data processing</topic><topic>Proposals</topic><topic>Relational databases</topic><topic>Roads</topic><topic>Scalability</topic><topic>Software</topic><topic>Spatial databases</topic><topic>Testing</topic><toplevel>online_resources</toplevel><creatorcontrib>de Almeida, V.T.</creatorcontrib><creatorcontrib>Guting, R.H.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>de Almeida, V.T.</au><au>Guting, R.H.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Indexing the trajectories of moving objects in networks</atitle><btitle>Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004</btitle><stitle>SSDM</stitle><date>2004</date><risdate>2004</risdate><spage>115</spage><epage>118</epage><pages>115-118</pages><issn>1099-3371</issn><isbn>0769521460</isbn><isbn>9780769521466</isbn><abstract>The management of moving objects has been intensively studied in recent years. A wide and increasing range of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to efficiently store and query the positions of these objects. To achieve this goal, index structures are required. Most of the proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. The constrained movement is a special and a very important case of object movement. In this paper we propose a new index structure for moving objects in networks, the MON-Tree. We tested our proposal in an experimental evaluation with generated data sets. The MON-Tree showed good scalability when increasing the number of objects and time units in the index structure, and the query window and time interval in querying.</abstract><cop>Los Alamitos CA</cop><pub>IEEE</pub><doi>10.1109/SSDM.2004.1311200</doi><tpages>4</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1099-3371 |
ispartof | Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004, 2004, p.115-118 |
issn | 1099-3371 |
language | eng |
recordid | cdi_ieee_primary_1311200 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Applied sciences Computer science control theory systems Conference management Database systems Exact sciences and technology Indexing Information systems. Data bases Intelligent networks Memory organisation. Data processing Proposals Relational databases Roads Scalability Software Spatial databases Testing |
title | Indexing the trajectories of moving objects in networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T09%3A54%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Indexing%20the%20trajectories%20of%20moving%20objects%20in%20networks&rft.btitle=Proceedings.%2016th%20International%20Conference%20on%20Scientific%20and%20Statistical%20Database%20Management,%202004&rft.au=de%20Almeida,%20V.T.&rft.date=2004&rft.spage=115&rft.epage=118&rft.pages=115-118&rft.issn=1099-3371&rft.isbn=0769521460&rft.isbn_list=9780769521466&rft_id=info:doi/10.1109/SSDM.2004.1311200&rft_dat=%3Cpascalfrancis_6IE%3E18597193%3C/pascalfrancis_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1311200&rfr_iscdi=true |