2018
DOI: 10.1007/978-3-030-01168-0_13
|View full text |Cite
|
Sign up to set email alerts
|

The Application of Graph Theory and Adjacency Lists to Create Parallel Queries to Relational Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…To achieve TSMLD, the tree structure G must be traversed firstly. According to the structure characteristics of the tree structure G, the traversal methods can be divided into two ways: time-first storage (TFS) and channel-first storage (CFS) [26][27][28]. The TFS method preferentially stores the data collected by each channel at the same detection time, and the CFS method preferentially stores the data collected by each detection time at the same detection channel.…”
Section: Storage Of Tsmldmentioning
confidence: 99%
“…To achieve TSMLD, the tree structure G must be traversed firstly. According to the structure characteristics of the tree structure G, the traversal methods can be divided into two ways: time-first storage (TFS) and channel-first storage (CFS) [26][27][28]. The TFS method preferentially stores the data collected by each channel at the same detection time, and the CFS method preferentially stores the data collected by each detection time at the same detection channel.…”
Section: Storage Of Tsmldmentioning
confidence: 99%