• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Path Oracles for Spatial Networks (2009)

Cached

  • Download as a PDF

Download Links

  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.vldb.org]
  • [www.umiacs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jagan Sankaranarayanan , Hanan Samet , Houman Alborzi
Citations:26 - 8 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Sankaranarayanan09pathoracles,
    author = {Jagan Sankaranarayanan and Hanan Samet and Houman Alborzi},
    title = {Path Oracles for Spatial Networks },
    year = {2009}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

The advent of location-based services has led to an increased demand for performing operations on spatial networks in real time. The challenge lies in being able to cast operations on spatial networks in terms of relational operators so that they can be performed in the context of a database. A linear-sized construct termed a path oracle is introduced that compactly encodes the n2 shortest paths between every pair of vertices in a spatial network having n vertices thereby reducing each of the paths to a single tuple in a relational database and enables finding shortest paths by repeated application of a single SQL SELECT operator. The construction of the path oracle is based on the observed coherence between the spatial positions of both source and destination vertices and the shortest paths between them which facilitates the aggregation of source and destination vertices into groups that share common vertices or edges on the shortest paths between them. With the aid of the Well-Separated Pair (WSP) technique, which has been applied to spatial networks using the network distance measure, a path oracle is proposed that takes O(sdn) space, where s is empirically estimated to be around 12 for road networks, but that can retrieve an intermediate link in a shortest path in O(logn) time using a B-tree. An additional construct termed the path-distance oracle of size O(n · max(sd, 1 d ε)) (empirically (n · max(122, 2.5 2 ε))) is proposed that can retrieve an intermediate vertex as well as an ε-approximation of the network distances in O(logn) time using a B-tree. Experimental results indicate that the proposed oracles are linear in n which means that they are scalable and can enable complicated query processing scenarios on massive spatial network datasets.

Keyphrases

spatial network    path oracle    destination vertex    spatial position    additional construct    well-separated pair    single sql select operator    relational operator    linear-sized construct    observed coherence    road network    experimental result    path-distance oracle    network distance measure    massive spatial network datasets    intermediate link    complicated query processing scenario    share common vertex    repeated application    intermediate vertex    network distance    single tuple    location-based service    shortest path    relational database    real time   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University