Michael Svendsen

dblp:98/5006 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2Software engineering, systems software and programming languages · 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
2 papers
Graph data management · 79% Data stream processing · 16% Web and social media mining · 5%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 67% Parallel and multicore computing · 33%

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

TopicWeightPapersLastEvidence papers
Graph data management
dynamic graph
0.412019
Incremental maintenance of maximal cliques in a dynamic graph · VLDB J. 2019
Graph data management › dynamic graph maintenance
maximal clique maintenance
0.412019
Incremental maintenance of maximal cliques in a dynamic graph · VLDB J. 2019
Algorithms and data structures › dynamic algorithms
incremental algorithms
0.412019
Incremental maintenance of maximal cliques in a dynamic graph · VLDB J. 2019
Graph data management
dense subgraph
0.212014
Dense subgraph maintenance under streaming edge weight updates for real-time story identification · VLDB J. 2014
Data stream processing
streaming graph
0.212014
Dense subgraph maintenance under streaming edge weight updates for real-time story identification · VLDB J. 2014
Web and social media mining › event detection
story identification
0.112014
Dense subgraph maintenance under streaming edge weight updates for real-time story identification · VLDB J. 2014
Cloud and datacenter computing › datacenter architecture
cluster-based network servers
0.011998
Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998
Parallel and multicore computing
load balancing
0.011998
Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998
Cloud and datacenter computing › datacenter services › online service systems
request routing
0.011998
Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998
Cellular and mobile networks › mobility management › network mobility
TCP connection handoff
0.011998
Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998

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

locality-aware request distribution · 0.0
YearPublicationVenuePosition
2019 Incremental maintenance of maximal cliques in a dynamic graph
Michael Svendsen, Srikanta Tirthapura
VLDB J.2
2015 Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes
Michael Svendsen, Arko Mukherjee, Srikanta Tirthapura
J. Parallel Distributed Comput.1
2014 Dense subgraph maintenance under streaming edge weight updates for real-time story identification
Albert Angel, Nick Koudas, Nikos Sarkas, Divesh Srivastava, Michael Svendsen, Srikanta Tirthapura
VLDB J.5
1998 Locality-Aware Request Distribution in Cluster-based Network Servers
abstract
We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information about the load on the back-end nodes, to choose which back-end will handle this request. Content-based request distribution can improve locality in the back-ends' main memory caches, increase secondary storage scalability by partitioning the server's database, and provide the ability to employ back-end nodes that are specialized for certain types of requests.As a specific policy for content-based request distribution, we introduce a simple, practical strategy for locality-aware request distribution (LARD). With LARD, the front-end distributes incoming requests in a manner that achieves high locality in the back-ends' main memory caches as well as load balancing. Locality is increased by dynamically subdividing the server's working set over the back-ends. Trace-based simulation results and measurements on a prototype implementation demonstrate substantial performance improvements over state-of-the-art approaches that use only load information to distribute requests. On workloads with working sets that do not fit in a single server node's main memory cache, the achieved throughput exceeds that of the state-of-the-art approach by a factor of two to four.With content-based distribution, incoming requests must be handed off to a back-end in a manner transparent to the client, after the front-end has inspected the content of the request. To this end, we introduce an efficient TCP handoflprotocol that can hand off an established TCP connection in a client-transparent manner.
Vivek S. Pai, Mohit Aron, Gaurav Banga, Michael Svendsen, Peter Druschel, Willy Zwaenepoel, Erich M. Nahum
ASPLOS4