Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huajie Ouyang

dblp:392/5480 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

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
Query processing and optimization · 50% Spatial and temporal data management · 50%
Network and information security
1 paper
Privacy and data protection · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Spatial and temporal data management › temporal databases
interval skyline query
0.912025
OblivTime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted Time-Series Data · IEEE Trans. Serv. Comput. 2025
Query processing and optimization › preference query
skyline query
0.912025
OblivTime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted Time-Series Data · IEEE Trans. Serv. Comput. 2025
Privacy and data protection › privacy-preserving computation
encrypted data processing
0.912025
OblivTime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted Time-Series Data · IEEE Trans. Serv. Comput. 2025
Privacy and data protection › privacy-preserving query processing
oblivious query processing
0.912025
OblivTime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted Time-Series Data · IEEE Trans. Serv. Comput. 2025

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

lightweight cryptography · 2.6GPU parallel computing · 2.6
YearPublicationVenuePosition
2025 OblivTime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted Time-Series Data
abstract
Time-series data is prevalent in many applications like smart homes, smart grids, and healthcare. And it is now increasingly common to store and query time-series data in the cloud. Despite the benefits, data privacy concerns in such outsourced services are pressing, making it imperative to embed privacy assurance mechanisms from the outset. Most existing related works have been focused on querying for different types of aggregate statistics. In this article, we instead focus on the secure support for advanced interval skyline queries, which allow to identify time series that are not dominated by any other time series within a query time interval. This is valuable for time-series data analytics in applications like remote health monitoring (e.g., identifying patients with high heart rates in a certain week). We present OblivTime, a new system framework for oblivious and efficient interval skyline query processing over encrypted time-series data. OblivTime is built from a synergy of time-series data analytics, lightweight cryptography, and GPU parallel computing, achieving stronger security guarantees and lower online query latency over the state-of-the-art prior work. Extensive experiments demonstrate that OblivTime can achieve up to$666\times$speedup in online query latency over the state-of-the-art prior work.
Huajie Ouyang, Yifeng Zheng 0001, Songlei Wang, Zhongyun Hua
IEEE Trans. Serv. Comput.1
2024 SARA: A Sparsity-Aware Efficient Oblivious Aggregation Service for Federated Matrix Factorization
Yifeng Zheng 0001, Tianchen Xiong, Huajie Ouyang, Songlei Wang, Zhongyun Hua, Yansong Gao 0001
WISE (2)3