Efficient Processing of Reachability Queries with Meetings

No abstract is available for this paper.

• Publication year

  2017

• Venue

  SIGSPATIAL/GIS

• Publication date

  2017-11-07

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/3139958.3139982
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Reachability Querying: Can It Be Even Faster?

  2017cited by this paper
• Answering Location-Aware Graph Reachability Queries on GeoSocial Data

  2017cited by this paper
• RICC: Fast Reachability Query Processing on Large Spatiotemporal Datasets

  2015cited by this paper
• PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies

  2014cited by this paper
• Efficient temporal shortest path queries on evolving social graphs

  2014cited by this paper
• FERRARI: Flexible and efficient reachability range assignment for graph indexing

  2013cited by this paper
• SCARAB: scaling reachability computation on large graphs

  2012cited by this paper
• Efficient snapshot retrieval over historical graph data

  2012cited by this paper
• Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets

  2012influential reference
• Path-hop: efficiently indexing large graphs for reachability queries

  2010cited by this paper
• Querying trajectories using flexible patterns

  2010cited by this paper
• Spatio-Temporal Access Methods: Part 2 (2003 - 2010)

  2010cited by this paper
• Characterising temporal distance and reachability in mobile and online social networks

  2010cited by this paper
• 3-HOP: a high-compression indexing scheme for reachability query

  2009cited by this paper
• On-line discovery of flock patterns in spatio-temporal data

  2009cited by this paper
• ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects

  2008cited by this paper
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

  2008cited by this paper
• The Bdual-Tree: indexing moving objects by space filling curves in the dual space

  2008cited by this paper
• Discovery of convoys in trajectory databases

  2008cited by this paper
• Continuous Clustering of Moving Objects

  2007cited by this paper
• Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations

  2007cited by this paper
• Pointwise-Dense Region Queries in Spatio-temporal Databases

  2007cited by this paper
• Dual Labeling: Answering Graph Reachability Queries in Constant Time

  2006cited by this paper
• LUGrid: Update-tolerant Grid-based Indexing for Moving Objects

  2006cited by this paper
• Efficient trajectory joins using symbolic representations

  2005cited by this paper
• On Discovering Moving Clusters in Spatio-temporal Data

  2005cited by this paper
• STRIPES: an efficient index for predicted trajectories

  2004cited by this paper
• Indexing the Trajectories of Moving Objects in Networks*

  2004cited by this paper
• Indexing spatio-temporal trajectories with Chebyshev polynomials

  2004cited by this paper
• Performance evaluation of spatio-temporal selectivity estimation techniques

  2003cited by this paper
• The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries

  2003cited by this paper
• Generating Traffic Data

  2003cited by this paper
• Efficient Indexing of Spatiotemporal Objects

  2002cited by this paper
• Reachability and distance queries via 2-hop labels

  2002cited by this paper
• Novel Approaches in Query Processing for Moving Object Trajectories

  2000cited by this paper
• Indexing the positions of continuously moving objects

  2000cited by this paper
• On indexing mobile objects

  1999cited by this paper
• Dynamic Source Routing in Ad Hoc Wireless Networks

  1994cited by this paper
• Efficient management of transitive relationships in large data and knowledge bases

  1989cited by this paper

• FastReach: A system for privacy-preserving reachability queries over location data

  2023cites this paper
• Reachability and Top-k Reachability Queries with Transfer Decay

  2021influential citation
• GPU-based Real-time Contact Tracing at Scale

  2021cites this paper
• PCT-TEE: Trajectory-based Private Contact Tracing System with Trusted Execution Environment

  2020cites this paper
• Graph Reachability on Parallel Many-Core Architectures

  2020cites this paper
• Reach Me If You Can: Reachability Query in Uncertain Contact Networks

  2018cites this paper