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

Huiqi Xu

dblp:21/9884 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 2 first-author

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
2 papers
Query processing and optimization · 53% Spatial and temporal data management · 27% Data mining · 20%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Spatial and temporal data management › spatial query processing › nearest neighbor query
k-nearest neighbor query
0.212014
Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation · IEEE Trans. Knowl. Data Eng. 2014
Query processing and optimization
range query
0.212014
Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation · IEEE Trans. Knowl. Data Eng. 2014
Query processing and optimization › secure query processing
secure kNN query
0.212014
Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation · IEEE Trans. Knowl. Data Eng. 2014
Data mining
clustering
0.112012
CloudVista: Interactive and Economical Visual Cluster Analysis for Big Data in the Cloud · Proc. VLDB Endow. 2012
Visualization and visual analytics › information visualization
large-scale data visualization
0.112012
CloudVista: Interactive and Economical Visual Cluster Analysis for Big Data in the Cloud · Proc. VLDB Endow. 2012
Cloud and datacenter computing › cloud data management
cloud query service
0.112014
Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation · IEEE Trans. Knowl. Data Eng. 2014
Cloud and datacenter computing
cloud data analytics
0.012012
CloudVista: Interactive and Economical Visual Cluster Analysis for Big Data in the Cloud · Proc. VLDB Endow. 2012

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

randgen · 0.4parallel visualization · 0.4random space perturbation · 0.4random projection · 0.4order-preserving encryption · 0.4dimensionality expansion · 0.4
YearPublicationVenuePosition
2014 Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation
abstract
With the wide deployment of public cloud computing infrastructures, using clouds to host data query services has become an appealing solution for the advantages on scalability and cost-saving. However, some data might be sensitive that the data owner does not want to move to the cloud unless the data confidentiality and query privacy are guaranteed. On the other hand, a secured query service should still provide efficient query processing and significantly reduce the in-house workload to fully realize the benefits of cloud computing. We propose the random space perturbation (RASP) data perturbation method to provide secure and efficient range query and kNN query services for protected data in the cloud. The RASP data perturbation method combines order preserving encryption, dimensionality expansion, random noise injection, and random projection, to provide strong resilience to attacks on the perturbed data and queries. It also preserves multidimensional ranges, which allows existing indexing techniques to be applied to speedup range query processing. The kNN-R algorithm is designed to work with the RASP range query algorithm to process the kNN queries. We have carefully analyzed the attacks on data and queries under a precisely defined threat model and realistic security assumptions. Extensive experiments have been conducted to show the advantages of this approach on efficiency and security.
Huiqi Xu, Shumin Guo, Keke Chen
IEEE Trans. Knowl. Data Eng.1
2012 CloudVista: Interactive and Economical Visual Cluster Analysis for Big Data in the Cloud
abstract
Analysis of big data has become an important problem for many business and scientific applications, among which clustering and visualizing clusters in big data raise some unique challenges. This demonstration presents the CloudVista prototype system to address the problems with big data caused by using existing data reduction approaches. It promotes a whole-big-data visualization approach that preserves the details of clustering structure. The prototype system has several merits. (1) Its visualization model is naturally parallel, which guarantees the scalability. (2) The visual frame structure minimizes the data transferred between the cloud and the client. (3) The RandGen algorithm is used to achieve a good balance between interactivity and batch processing. (4) This approach is also designed to minimize the financial cost of interactive exploration in the cloud. The demonstration will highlight the problems with existing approaches and show the advantages of the CloudVista approach. The viewers will have the chance to play with the CloudVista prototype system and compare the visualization results generated with different approaches.
Huiqi Xu, Shumin Guo, Keke Chen
Proc. VLDB Endow.1
2011 CloudVista: Visual Cluster Exploration for Extreme Scale Data in the Cloud
Keke Chen, Huiqi Xu, Fengguang Tian, Shumin Guo
SSDBM2