000 03470nam a22005175i 4500
001 978-1-4614-4918-8
003 DE-He213
005 20200421112225.0
007 cr nn 008mamaa
008 120904s2013 xxu| s |||| 0|eng d
020 _a9781461449188
_9978-1-4614-4918-8
024 7 _a10.1007/978-1-4614-4918-8
_2doi
050 4 _aQA76.9.D3
072 7 _aUN
_2bicssc
072 7 _aUMT
_2bicssc
072 7 _aCOM021000
_2bisacsh
082 0 4 _a005.74
_223
100 1 _aGeorge, Betsy.
_eauthor.
245 1 0 _aSpatio-temporal Networks
_h[electronic resource] :
_bModeling and Algorithms /
_cby Betsy George, Sangho Kim.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2013.
300 _aXII, 73 p. 47 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSpringerBriefs in Computer Science,
_x2191-5768
505 0 _aSpatio-temporal Networks: An Introduction -- Time Aggregated Graph - A model for Spatio-temporal Networks -- Shortest Path Algorithms for a Fixed Start Time -- Best Start Time Journeys -- Spatio-temporal Network Applications.
520 _aSpatio-temporal networks (STN)are spatial networks whose topology and/or attributes change with time. These are encountered in many critical areas of everyday life such as transportation networks, electric power distribution grids, and social networks of mobile users. STN modeling and computations raise significant challenges. The model must meet the conflicting requirements of simplicity and adequate support for efficient algorithms. Another challenge is to address the change in the semantics of common graph operations, such as, shortest path computation assuming different semantics, or when temporal dimension is added. Also paradigms (e.g. dynamic programming) used in algorithm design may be ineffective since their assumptions (e.g. stationary ranking of candidates) may be violated by the dynamic nature of STNs. In recent years, STNs have attracted attention in research. New representations have been proposed along with algorithms to perform key STN operations, while accounting for their time dependence. Designing a STN database would require the development of data models, query languages, and indexing methods to efficiently represent, query, store, and manage time-variant properties of the network. The purpose of Spatio-temporal Networks: Modeling and Algorithms is to explore this design at the conceptual, logical, and physical level. Models used to represent STNs are explored and analyzed. STN operations, with an emphasis on their altered semantics with the addition of temporal dimension, are also addressed.
650 0 _aComputer science.
650 0 _aDatabase management.
650 0 _aGeographical information systems.
650 0 _aGraph theory.
650 1 4 _aComputer Science.
650 2 4 _aDatabase Management.
650 2 4 _aGeographical Information Systems/Cartography.
650 2 4 _aGraph Theory.
700 1 _aKim, Sangho.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781461449171
830 0 _aSpringerBriefs in Computer Science,
_x2191-5768
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4614-4918-8
912 _aZDB-2-SCS
942 _cEBK
999 _c57640
_d57640