Linyao Feng

dblp:156/2002 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Spatial and temporal data management · 33% Indexing and storage engines · 33% Data mining · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Indexing and storage engines
data compression
0.212015
A Hierarchical Tensor-Based Approach to Compressing, Updating and Querying Geospatial Data · IEEE Trans. Knowl. Data Eng. 2015
Spatial and temporal data management
spatial databases
0.212015
A Hierarchical Tensor-Based Approach to Compressing, Updating and Querying Geospatial Data · IEEE Trans. Knowl. Data Eng. 2015
Data mining › data reduction
tensor compression
0.212015
A Hierarchical Tensor-Based Approach to Compressing, Updating and Querying Geospatial Data · IEEE Trans. Knowl. Data Eng. 2015

Methods — techniques the papers use, named apart from their topics

split and merge · 0.2hierarchical tensor representation · 0.2
YearPublicationVenuePosition
2015 A Hierarchical Tensor-Based Approach to Compressing, Updating and Querying Geospatial Data
abstract
With the rapid development of data observation and model simulation in geoscience, spatial-temporal data have become increasingly multidimensional, massive and are consistently being updated. As a result, the integrated maintenance of these data is becoming a challenge. This paper presents a blocked hierarchical tensor representation within the split-and-merge paradigm for the compressed storage, continuously updating and data querying of multidimensional geospatial field data. The original multidimensional geospatial field data are split into small blocks according to their spatial-temporal references. These blocks are represented and compressed hierarchically, and then combined into a single hierarchical tree as the representation of original data. With a buffered binary tree data structure and corresponding optimized operation algorithms, the original multidimensional geospatial field data can be continuously compressed, appended, and queried. Data from the 20th Century Reanalysis Monthly Mean Composites are used to evaluate the performance of this approach. Compared to traditional methods, the new approach is shown to retain the quality of the original data with much lower storage costs and faster computational performance. The result suggests that the blocked hierarchical tensor representation provides an effective structure for integrated storage, presentation and computation of multidimensional geospatial field data.
Linwang Yuan, Zhaoyuan Yu, Wen Luo 0004, Linyao Feng, A-Xing Zhu
IEEE Trans. Knowl. Data Eng.5