Shenlu Wang

Shenlu Wang

Auto-generated profile, based on publicly available information

Shenlu Wang

School of Computer Science and Engineering, The University of New South Wales, Australia

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 January 2013 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
DLDongxi Liu
Dongxi Liu
SWShenlu Wang
Shenlu Wang

1 June 2012
Verified
Conference Paper
Closed access
DLDongxi Liu
Dongxi Liu
SWShenlu Wang
Shenlu Wang
The database services on cloud are appearing as an attractive way of outsourcing databases. When a database is deployed on a cloud database service, the data security and privacy becomes a big concern for users. A straightforward way to address this concern is to encrypt the database. However, an encrypted database cannot be easily queried. In this paper, we propose an order-preserving scheme for indexing encrypted data, which facilitates the range queries over encrypted databases. The scheme is secure since it randomizes each index with noises, such that the original data cannot be recovered from indexes. Moreover, our scheme allows the programmability of basic indexing expressions and thus the distribution of the original data can be hidden from the indexes.

1 May 2016
Verified
Conference Paper
Closed access
SWShenlu Wang
Shenlu Wang
MCMuhammad Aamir Cheema
Muhammad Aamir Cheema
XLXuemin Lin
Xuemin Lin
YZYing Zhang
Ying Zhang
DLDongxi Liu
Dongxi Liu
Given a set of facilities F, a set of users U and a query facility q, a reverse k furthest neighbors (RkFN) query retrieves every user u ∈ U for which q is one of its k-furthest facilities. RkFN query is the natural complement of reverse k-nearest neighbors (RkNN) query that returns every user u for which q is one of its k-nearest facilities. While RkNN query returns the users that are highly influenced by a query q, RkFN query aims at finding the users that are least influenced by a query q. RkFN query has many applications in location-based services, marketing, facility location, clustering, and recommendation systems etc. While there exist several algorithms that answer RkFN query for k = 1, we are the first to propose a solution for arbitrary value of k. Based on several interesting observations, we present an efficient algorithm to process the RkFN queries. We also present a rigorous theoretical analysis to study various important aspects of the problem and our algorithm. An extensive experimental study is conducted using both real and synthetic data sets, demonstrating that our algorithm outperforms the state-of-the-art algorithm even for k = 1. The accuracy of our theoretical analysis is also verified by the experiments.

16 October 2012
Verified
Conference Paper
Open access
PDF file
DLDongxi Liu
Dongxi Liu
SWShenlu Wang
Shenlu Wang
The cloud database services are attractive for managing outsourced databases. However, the data security and privacy is a big concern hampering the acceptance of cloud database services. A straightforward way to address this concern is to encrypt the database, but an encrypted database cannot be easily queried. In this demo paper, we demonstrate that aggregate SQL queries with range conditions can be performed efficiently over encrypted databases, without decrypting the databases first, by using our new homomorphic encryption scheme. The techniques in this paper can be applied to existing Database Management Systems (DBMSs). Moreover, the techniques do not need to predetermine the maximum sum and number of data in one database table column. These features make our technologies suitable to manage long-standing and large encrypted databases.

8 October 2013 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
SWShenlu Wang
Shenlu Wang
Muhammad Aamir CheemaMuhammad Aamir Cheema
Muhammad Aamir Cheema
XLXuemin Lin
Xuemin Lin
Given a set of clients C, a set of facilities F and a query q∈F, a reverse k-nearest neighbor (RkNN) query retrieves every client c∈C for which q is one of the k closest facilities. In the past few years, RkNN queries have received significant research attention due to their wide range of applications. In this paper, we study the problem of continuous monitoring of RkNN queries in road networks. The state-of-the-art technique is sensitive toward the movement of clients, e.g. whenever a client that is inside the so-called unpruned region changes its location, the existing technique requires expensive verification of whether the client is an RkNN of q or not. To address this problem, we utilize the novel concept of influence zone, which is a region in the network such that a client c is the RkNN if and only if it lies inside this zone. This significantly improves performance because the problem of continuously monitoring RkNN queries is reduced to the problem of continuously monitoring the clients that are inside this zone. Based on several non-trivial observations, we present an efficient algorithm to compute the influence zone. Our extensive experimental study demonstrates that our algorithm is more than an order of magnitude faster than the state-of-the-art algorithm.

31 May 2015
Verified
Conference Paper
Open access
SWShenlu Wang
Shenlu Wang
MCMuhammad Aamir Cheema
Muhammad Aamir Cheema
YZYing Zhang
Ying Zhang
XLXuemin Lin
Xuemin Lin
We say that an object o attracts a user u if o is one of the top-k objects according to the preference function defined by u. Given a set of objects (e.g., restaurants) and a set of users, in this paper, we study the problem of computing a set of representative objects considering two criteria: coverage and diversity. Coverage of a set S of objects is the distinct number of users that are attracted by the objects in S. Although a set of objects with high coverage attracts a large number of users, it is possible that all of these users have quite similar preferences. Consequently, the set of objects may be attractive only for a specific class of users with similar preference functions which may disappoint other users having widely different preferences. The diversity criterion addresses this issue by selecting a set S of objects such that the set of attracted users for each object in S is as different as possible from the sets of users attracted by the other objects in S. The existing work on representative objects considers only one of the coverage and diversity criteria. We are the first to consider both of the criteria where the importance of each criterion can be controlled using a parameter. Our algorithm has two phases. In the first phase, we prune the objects that cannot be among the representative objects and compute the set of attracted users (also called reverse top-k) for each of the remaining objects. In the second phase, the reverse top-k of these objects are used to compute the representative objects maximizing coverage and diversity. Since this problem is NP-hard, the second phase employs a greedy algorithm. For the sake of time and space efficiency, we adopt MinHash and KMV Synopses to assist the set operations. We prove that the proposed greedy algorithm is ϵ-approximate. Our extensive experimental study on real and synthetic data sets demonstrates the effectiveness of our proposed techniques.