Kristian Torp

Dr. Kristian Torp


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
4 November 2014 in GeoInformatica
Verified
Journal Article
Closed access
PDF file
CGChenjuan Guo
Chenjuan Guo
BYBin Yang
Bin Yang
OAOve Andersen
Ove Andersen
CJChristian S. Jensen
Christian S. Jensen
KTKristian Torp
Kristian Torp

30 June 2024 in ACM Transactions on Spatial Algorithms and Systems
Verified
Journal Article
Open access
MMMohamed Mokbel
Mohamed Mokbel
MSMahmoud Sakr
Mahmoud Sakr
LXLi Xiong
Li Xiong
AZAndreas Züfle
Andreas Züfle
JAJussara Almeida
Jussara Almeida
EZEsteban Zimanyi
Esteban Zimanyi
Mobility data captures the locations of moving objects such as humans, animals, and cars. With the availability of Global Positioning System (GPS)–equipped mobile devices and other inexpensive location-tracking technologies, mobility data is collected ubiquitously. In recent years, the use of mobility data has demonstrated a significant impact in various domains, including traffic management, urban planning, and health sciences. In this article, we present the domain of mobility data science. Towards a unified approach to mobility data science, we present a pipeline having the following components: mobility data collection, cleaning, analysis, management, and privacy. For each of these components, we explain how mobility data science differs from general data science, we survey the current state-of-the-art, and describe open challenges for the research community in the coming years.

31 October 2016
Verified
Conference Paper
Open access
PDF file
BKBenjamin Krogh
Benjamin Krogh
CJChristian S. Jensen
Christian S. Jensen
KTKristian Torp
Kristian Torp
With the decreasing cost and growing size of main memory, it is increasingly relevant to utilize main-memory indexing for efficient query processing. We propose SPNET, which we believe is the first in-memory index for network-constrained trajectory data. To exploit the main-memory setting SPNET exploits efficient shortest-path compression of trajectories to achieve a compact index structure. SPNET is capable of exploiting the parallel computing capabilities of modern machines and supports both intra- and inter-query parallelism. The former improves response time, and the latter improves throughput. By design, SPNET supports a wider range of query types than any single existing index. An experimental study in a real-world setting with 1.94 billion GPS records and nearly 4 million trajectories in a road network with 1.8 million edges indicates that SPNET typically offers performance improvements over the best existing indexes of 1.5 to 2 orders of magnitude.

5 November 2013
Verified
Conference Paper
Open access
KJKarsten Jakobsen
Karsten Jakobsen
SMSabrine C. H. Mouritsen
Sabrine C. H. Mouritsen
KTKristian Torp
Kristian Torp
Vehicles in the US use approximately 1.4 billion liters of fuel a day. This number can be reduced by driving more fuel efficiently. Several sources provide fuel saving eco-driving advice, but the advices are often quite This paper uses a large set of high-frequent GPS and Controller Area Network Bus (CANBus) data from four similar vehicles to evaluate the eco-driving advice. The CANBus data provides information such as the fuel consumption per second and rounds per minute of the engine. The vehicles are compared and evaluated on the drivers' ability to follow the eco-driving advice. This comparison shows that there is a 23% difference in the fuel efficiency. This difference is due to quite different speed and acceleration profiles of the drivers but also that stopping at a traffic light consumes double the fuel compared to not stopping. Overall it is shown that there is good potential for saving fuel by following the eco-driving advice. However, no single advice dominates, and multiple advices are found to have a positive effect on the fuel efficiency.

23 August 2023
Verified
Conference Paper
Open access
SWSong Wu
Song Wu
KTKristian Torp
Kristian Torp
MSMahmoud Sakr
Mahmoud Sakr
EZEsteban Zimanyi
Esteban Zimanyi

1 January 2005
Verified
Conference Paper
Closed access
SKS.U. Knudsen
S.U. Knudsen
TPT.B. Pedersen
T.B. Pedersen
CTChristian Thomsen
Christian Thomsen
KTKristian Torp
Kristian Torp
In modern enterprises, almost all data is stored in relational databases. Additionally, most enterprises increasingly collaborate with other enterprises in long-running read-write workflows, primarily through XML-based data exchange technologies such as Web services. However, bidirectional XML data exchange is cumbersome and must often be hand-coded, at considerable expense. This paper remedies the situation by proposing RELAXML, an automatic and effective approach to bidirectional XML-based exchange of relational data. RELAXML supports re-use through multiple inheritance, and handles both export of relational data to XML documents and (re-)import of XML documents with a large degree of flexibility in terms of the SQL statements and XML document structures supported. Import and export are formally defined so as to avoid semantic problems, and algorithms to implement both are given. A performance study shows that the approach has a reasonable overhead compared to hand-coded programs.