NDLI: Computing Isochrones in Multimodal Spatial Networks using Tile Regions

Please wait, while we are loading the content...

Managing Sensor Data Streams: Lessons Learned from the WeBike Project

Measuring Fairness in Ranked Outputs

SGVCut: A Vertex-Cut Partitioning Tool for Random Walks-based Computations over Social Network graphs

Incremental Discovery of Inclusion Dependencies

How the Passengers Flow in Complex Metro Networks?

VISOR: Visualizing Summaries of Ordered Data

Generating What-If Scenarios for Time Series Data

DualDB: An Efficient LSM-based Publish/Subscribe Storage System

Skluma: A Statistical Learning Pipeline for Taming Unkempt Data Repositories

Computing Influence of a Product through Uncertain Reverse Skyline

DistriPlan: An Optimized Join Execution Framework for Geo-Distributed Scientific Data

DataSynthesizer: Privacy-Preserving Synthetic Datasets

FlatFIT: Accelerated Incremental Sliding-Window Aggregation For Real-Time Analytics

Fides: Towards a Platform for Responsible Data Science

A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs

Challenges of Differentially Private Release of Data Under an Open-world Assumption

Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering

Mining Persistent and Discriminative Communities in Graph Ensembles

Dot-Product Join: Scalable In-Database Linear Algebra for Big Model Analytics

High-Definition Digital Elevation Model System Vision Paper

On-line Versioned Schema Inference for Large Semantic Web Data Sources

Discovering Partial Periodic Itemsets in Temporal Databases

Bi-Level Online Aggregation on Raw Data

Detecting Global Hyperparaboloid Correlated Clusters Based on Hough Transform

Tiling Strategies for Distributed Point Cloud Databases

Edge Labeling Schemes for Graph Data

Computing Isochrones in Multimodal Spatial Networks using Tile Regions

Class-based Conditional MaxRS Query in Spatial Data Streams

Location and Processing Aware Datacube Caching

Active Learning with Density-Initialized Decision Tree for Record Matching

MELT: Mapreduce-based Efficient Large-scale Trajectory Anonymization

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

PLI: Augmenting Live Databases with Custom Clustered Indexes

Multi-Hypothesis CSV Parsing

Improving Statistical Similarity Based Data Reduction for Non-Stationary Data

Fast Equi-Join Algorithms on GPUs: Design and Implementation

Dynamic Group Trip Planning Queries in Spatial Databases

Query Suggestion to allow Intuitive Interactive Search in Multidimensional Time Series

SHRec: Scalable Holistic Recommendation

A Unified Correlation-based Approach to Sampling Over Joins

Probabilistic k-Nearest Neighbor Monitoring of Moving Gaussians

Computing Isochrones in Multimodal Spatial Networks using Tile Regions

Content Provider	ACM Digital Library
Author	Gamper, Johann Krismer, Nikolaus Silbernagl, Doris Specht, Günther
Abstract	This paper describes a new method to compute isochrones in multimodal spatial networks, which aims at finding a good trade-off between memory usage and runtime. In the past, approaches based on Dijkstra's algorithm have been proposed. For small networks, the entire network is first loaded in main memory, where the network is expanded to determine the isochrone. For large networks that do not fit in main memory, approaches that load the network vertex-by-vertex during the expansion phase have been proposed. They keep the memory footprint minimal, but have to query the database for each node in the isochrone, which can be very time consuming. The method presented in this paper uses tiles (which are well known from interactive online maps) to realize chunk-loading of vertices by utilizing so-called tile regions. This approach significantly reduces the number of database requests, while keeping the memory usage low. Our method is able to compute isochrones even in large networks at a reasonable time. An experimental evaluation shows that the new algorithm clearly outperforms previous competitive approaches such as MINE and MINEX.
Starting Page	1
Ending Page	6
Page Count	6
File Format	PDF
ISBN	9781450352826
DOI	10.1145/3085504.3085538
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-06-27
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Algorithms Isochrone Spatial database
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Defining isochrones in multimodal spatial networks

Computing isochrones in multi-modal, schedule-based transport networks

Pre-main-sequence isochrones – III. The Cluster Collaboration isochrone server

The research on scheduling algorithms of grid spatial database

A memetic algorithm for computing multicriteria shortest paths in stochastic multimodal networks

An Online Corpus of Isochrone Maps

Analyzing the composition of cities using spatial clustering

Decentralized querying of topological relations between regions without using localization

Bifurcartions of limit cycles from hamiltonian isochrones: a (1999).

Computing Isochrones in Multimodal Spatial Networks using Tile Regions

Similar Documents

Defining isochrones in multimodal spatial networks

Computing isochrones in multi-modal, schedule-based transport networks

Pre-main-sequence isochrones – III. The Cluster Collaboration isochrone server

The research on scheduling algorithms of grid spatial database

A memetic algorithm for computing multicriteria shortest paths in stochastic multimodal networks

An Online Corpus of Isochrone Maps

Analyzing the composition of cities using spatial clustering

Decentralized querying of topological relations between regions without using localization

Bifurcartions of limit cycles from hamiltonian isochrones: a (1999).

Computing Isochrones in Multimodal Spatial Networks using Tile Regions