Graph Processing for Spatial Network Queries

Abstract

Spatial network queries often have performance bound by the structure and size of the underlying network. This paper discusses methods of improving the performance of these queries, specifically those using network expansion algorithms, by creating a graph representation of the network and removing unnecessary nodes and edges. In addition, two methods of storing and accessing the graph are compared for speed and usefulness in different applications. A main memory approach to graph storage using a shared library is compared to a database storage approach. Though fast, the main memory approach has some limitations in its usefulness.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 14, 2005
Accession Number
ADA450865

Entities

People

  • Elias Ioup
  • John Sample
  • Kevin B. Shaw
  • Mahdi Abdelguerfi
  • Oliver Mansion

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Boundaries
  • Computer Programming
  • Computer Science
  • Computers
  • Data Sets
  • Database Management Systems
  • Databases
  • Graphs
  • Iterations
  • Language
  • Louisiana
  • Military Research
  • Programming Languages
  • Relational Database Management Systems
  • United States

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Modeling and Simulation
  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.