Efficient index structures for reachability and shortest path queries
Graphs are a fundamental data structure to represent objects and their relations in various domains, e.g., social science, citation analysis, web link analysis, and navigation systems. Reachability and shortest path queries are two types of primitive and well-studied graph queries. In this thesis, w...
Main Author: | Wang, Sibo |
---|---|
Other Authors: | Xiao Xiaokui |
Format: | Thesis |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/68898 |
Similar Items
-
Efficient visualization of XML query results
by: Ng, Pamela Hui Min.
Published: (2009) -
Efficient query processing on large graphs
by: Zhu, Diwen
Published: (2014) -
Efficient evaluation of frequently issued similar XPath queries
by: Ong, Chin Sin.
Published: (2009) -
Shortest path and distance queries on road networks : an experimental evaluation
by: Wu, Lingkun, et al.
Published: (2013) -
Enhancing XML structure visualization for fast query formulation
by: Qu, Xin.
Published: (2011)