2019
DOI: 10.3390/ijgi8110512
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Construction Method of Hierarchical Spatio-Temporal Index for Vector Data under Peer-to-Peer Networks

Abstract: Spatio-temporal indexing is a key technique in spatio-temporal data storage and management. Indexing methods based on spatial filling curves are popular in research on the spatio-temporal indexing of vector data in the Not Relational (NoSQL) database. However, the existing methods mostly focus on spatial indexing, which makes it difficult to balance the efficiencies of time and space queries. In addition, for non-point elements (line and polygon elements), it remains difficult to determine the optimal index le… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…Within a partition, rows are organized together by the rest of the primary keys (e.g., the clustering key or sort key): Cassandra-specific partitioning keys and clustering keys. The cluster key structure can realize multigranularity and multilevel spatio-temporal indexing [82], which effectively promotes the search mechanism.…”
Section: A Key-column Databasementioning
confidence: 99%
“…Within a partition, rows are organized together by the rest of the primary keys (e.g., the clustering key or sort key): Cassandra-specific partitioning keys and clustering keys. The cluster key structure can realize multigranularity and multilevel spatio-temporal indexing [82], which effectively promotes the search mechanism.…”
Section: A Key-column Databasementioning
confidence: 99%
“…According to the different ways of spatial object organization, spatial index methods are generally divided into object mapping, object bounding, clipping and multiple layers [11]. We simply divide the spatio-temporal indexes into two categories: regularization and irregularization, The former has no overlapping spatio-temporal regions of nodes in the same layer, and the partition always runs through a subregion, such as quadtree tree [12], KD tree [13] and BD tree [14], and the latter such as BSP tree [15], MLS3 [16], R tree [17][18][19]. R-tree is actually a spatio-temporal index family.…”
Section: Spatio-temporal Indexmentioning
confidence: 99%
“…the experiment is to check the relative performance improvement of the reconstruction algorithm based on query distribution frequency. We set the architectural node number for[4,8,16,24,32,40,48,64,72,80,88,96] and carry out the above experiments. The experimental results are shown in Figure10.…”
mentioning
confidence: 99%
“…When it comes to spatial-partitioning models, S2Geometry [32] has been used for spatial data indexing. First, Li et al's work [33] proposed an adaptive multilevel index tree, termed MLS3, for indexing spatiotemporal data in P2P networks. The authors leveraged and extended S2 Geometry to encode spatiotemporal information in the row key of Apache Cassandra [34].…”
Section: Related Workmentioning
confidence: 99%