東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

On Processing Spatial Queries in Gra...

Sun, Yuhan.

Linked to FindBook

Google Book

Amazon

博客來

On Processing Spatial Queries in Graph Database Management Systems.

Record Type:	Electronic resources : Monograph/item
Title/Author:	On Processing Spatial Queries in Graph Database Management Systems./
Author:	Sun, Yuhan.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
Description:	130 p.
Notes:	Source: Dissertations Abstracts International, Volume: 82-11, Section: B.
Contained By:	Dissertations Abstracts International82-11B.
Subject:	Computer science. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28411484
ISBN:	9798728267737

On Processing Spatial Queries in Graph Database Management Systems.
Sun, Yuhan.

On Processing Spatial Queries in Graph Database Management Systems. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 130 p.

Source: Dissertations Abstracts International, Volume: 82-11, Section: B.

Thesis (Ph.D.)--Arizona State University, 2021.

This item must not be sold to any third party vendors.

Spatial data is fundamental in many applications like map services, land resource management, etc. Meanwhile, spatial data inherently comes with abundant context information because spatial entities themselves possess different properties, e.g., graph or textual information, etc. Among all these compound spatial data, geospatial graph data is one of the most challenging for the complexity of graph data. Graph data is commonly used to model real scenarios and searching for the matching subgraphs is fundamental in retrieving and analyzing graph data. With the ubiquity of spatial data, vertexes or edges in graphs are enriched with spatial location attributes side by side with other non-spatial attributes. Graph-based applications integrate spatial data into the graph model and provide more spatial-aware services. The co-existence of the graph and spatial data in the same geospatial graph triggers some new applications. To solve new problems in these applications, existing solutions develop an integrated system that incorporates the graph database and spatial database engines. However, existing approaches suffer from the architecture where graph data and spatial data are isolated.In this dissertation, I will explain two indexing frameworks, GeoReach and RisoTree, which can significantly accelerate the queries in geospatial graphs. GeoReach includes a query operator that adds spatial data awareness to a graph database management system. In GeoReach, the neighborhood spatial information is summarized and stored on each vertex in the graph. The summarization includes three different structures according to the location distribution. These spatial summaries are utilized to terminate the graph search early. RisoTree is a hierarchical tree structure where each node is represented by a minimum bounding rectangle (MBR). The MBR of a node is a rectangle that encloses all its children. A key difference between RisoTree and RTree is that RisoTree contains pre-materialized subgraph information to each index node. The subgraph information is utilized during the spatial index search phase to prune search paths that cannot satisfy the query graph pattern. The RisoTree index reduces the search space when the spatial filtering phase is performed with relatively light cost.

ISBN: 9798728267737Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Database

On Processing Spatial Queries in Graph Database Management Systems.
LDR:03606nmm a2200433 4500 001 2282192
005 20211001100720.5
008 220723s2021 ||||||||||||||||| ||eng d
020 $a 9798728267737
035 $a (MiAaPQ)AAI28411484
035 $a AAI28411484
040 $a MiAaPQ $c MiAaPQ
100 1 $a Sun, Yuhan. $3 3560961
245 1 0 $a On Processing Spatial Queries in Graph Database Management Systems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 130 p.
500 $a Source: Dissertations Abstracts International, Volume: 82-11, Section: B.
500 $a Advisor: Sarwat, Mohamed.
502 $a Thesis (Ph.D.)--Arizona State University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Spatial data is fundamental in many applications like map services, land resource management, etc. Meanwhile, spatial data inherently comes with abundant context information because spatial entities themselves possess different properties, e.g., graph or textual information, etc. Among all these compound spatial data, geospatial graph data is one of the most challenging for the complexity of graph data. Graph data is commonly used to model real scenarios and searching for the matching subgraphs is fundamental in retrieving and analyzing graph data. With the ubiquity of spatial data, vertexes or edges in graphs are enriched with spatial location attributes side by side with other non-spatial attributes. Graph-based applications integrate spatial data into the graph model and provide more spatial-aware services. The co-existence of the graph and spatial data in the same geospatial graph triggers some new applications. To solve new problems in these applications, existing solutions develop an integrated system that incorporates the graph database and spatial database engines. However, existing approaches suffer from the architecture where graph data and spatial data are isolated.In this dissertation, I will explain two indexing frameworks, GeoReach and RisoTree, which can significantly accelerate the queries in geospatial graphs. GeoReach includes a query operator that adds spatial data awareness to a graph database management system. In GeoReach, the neighborhood spatial information is summarized and stored on each vertex in the graph. The summarization includes three different structures according to the location distribution. These spatial summaries are utilized to terminate the graph search early. RisoTree is a hierarchical tree structure where each node is represented by a minimum bounding rectangle (MBR). The MBR of a node is a rectangle that encloses all its children. A key difference between RisoTree and RTree is that RisoTree contains pre-materialized subgraph information to each index node. The subgraph information is utilized during the spatial index search phase to prune search paths that cannot satisfy the query graph pattern. The RisoTree index reduces the search space when the spatial filtering phase is performed with relatively light cost.
590 $a School code: 0010.
650 4 $a Computer science. $3 523869
650 4 $a Geographic information science. $3 3432445
650 4 $a Information science. $3 554358
653 $a Database
653 $a Graph data
653 $a Spatial index
653 $a Matching subgraphs
653 $a Query speed
653 $a Spatial data awareness
653 $a Hierarchical tree structure
653 $a Minimum bounding rectangle
653 $a Riso-Tree
653 $a GeoReach
690 $a 0984
690 $a 0723
690 $a 0370
710 2 $a Arizona State University. $b Computer Science. $3 1676136
773 0 $t Dissertations Abstracts International $g 82-11B.
790 $a 0010
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28411484