Jesper Møller

dblp:17/1189 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2015
0000-0002-0008-6890ORCID · corroborated

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

Computer networks · 1Databases, 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 · 88% Query processing and optimization · 12%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 6 heaviest of 6, 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.112011
Design and analysis of a ranking approach to private location-based services · ACM Trans. Database Syst. 2011
Spatial and temporal data management
spatial query processing
0.112011
Design and analysis of a ranking approach to private location-based services · ACM Trans. Database Syst. 2011
Privacy and data protection
location privacy
0.112011
Design and analysis of a ranking approach to private location-based services · ACM Trans. Database Syst. 2011
Privacy and data protection › location privacy
privacy-preserving location-based services
0.112011
Design and analysis of a ranking approach to private location-based services · ACM Trans. Database Syst. 2011
Query processing and optimization › incremental computation
incremental nearest-neighbor search
0.012011
Design and analysis of a ranking approach to private location-based services · ACM Trans. Database Syst. 2011
Spatial and temporal data management › spatial query processing
nearest neighbor query
0.012011
Design and analysis of a ranking approach to private location-based services · ACM Trans. Database Syst. 2011

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

ring ranking · 0.2delayed termination · 0.2SQL-based server-side processing · 0.2
YearPublicationVenuePosition
2015 On the Modeling and Analysis of Heterogeneous Radio Access Networks Using a Poisson Cluster Process
abstract
Future mobile networks are visualized as networks that consist of more than one type of base station to cope with rising user demands. Such networks are referred to as heterogeneous networks. There have been various attempts at modeling and optimization of such networks using spatial point processes, some of which are alluded to (later) in this paper. We model a heterogeneous network consisting of two types of base stations by using a particular Poisson cluster process model. The main contributions are two-fold. First, a complete description of the interference in heterogeneous networks is derived in the form of its Laplace functional. Second, using an asymptotic convergence result which was shown in our previous work, we derive the expressions for the mean and variance of the distribution to which the interference converges. The utility of this framework is discussed for both the contributions.
Vinay Suryaprakash, Jesper Møller, Gerhard P. Fettweis
IEEE Trans. Wirel. Commun.2
2011 Design and analysis of a ranking approach to private location-based services
abstract
Users of mobile services wish to retrieve nearby points of interest without disclosing their locations to the services. This article addresses the challenge of optimizing the query performance while satisfying given location privacy and query accuracy requirements. The article's proposal, SpaceTwist, aims to offer location privacy for k nearest neighbor ( k NN) queries at low communication cost without requiring a trusted anonymizer. The solution can be used with a conventional DBMS as well as with a server optimized for location-based services. In particular, we believe that this is the first solution that expresses the server-side functionality in a single SQL statement. In its basic form, SpaceTwist utilizes well-known incremental NN query processing on the server. When augmented with a server-side granular search technique, SpaceTwist is capable of exploiting relaxed query accuracy guarantees for obtaining better performance. We extend SpaceTwist with so-called ring ranking, which improves the communication cost, delayed termination, which improves the privacy afforded the user, and the ability to function in spatial networks in addition to Euclidean space. We report on analytical and empirical studies that offer insight into the properties of SpaceTwist and suggest that our proposal is indeed capable of offering privacy with very good performance in realistic settings.
Man Lung Yiu, Christian S. Jensen, Jesper Møller, Hua Lu 0001
ACM Trans. Database Syst.3