Sedick David Baker Effendi

Dr. Sedick David Baker Effendi

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
26 April 2020 in Future Internet
Verified
Journal Article
Open access
PDF file
SESedick David Baker Effendi
Sedick David Baker Effendi
BMBrink Van der Merwe
Brink Van der Merwe
Wolf-Tilo BalkeWolf-Tilo Balke
Wolf-Tilo Balke
Every day large quantities of spatio-temporal data are captured, whether by Web-based companies for social data mining or by other industries for a variety of applications ranging from disaster relief to marine data analysis. Making sense of all this data dramatically increases the need for intelligent backend systems to provide realtime query response times while scaling well (in terms of storage and performance) with increasing quantities of structured or semi-structured, multi-dimensional data. Currently, relational database solutions with spatial extensions such as PostGIS, seem to come to their limits. However, the use of graph database technology has been rising in popularity and has been found to handle graph-like spatio-temporal data much more effectively. Motivated by the need to effectively store multi-dimensional, interconnected data, this paper investigates whether or not graph database technology is better suited when compared to the extended relational approach. Three database technologies will be investigated using real world datasets namely: PostgreSQL, JanusGraph, and TigerGraph. The datasets used are the Yelp challenge dataset and an ambulance response simulation dataset, thus combining real world spatial data with realistic simulations offering more control over the dataset. Our extensive evaluation is based on how each database performs under practical data analysis scenarios similar to those found on enterprise level.

11 January 2024
Verified
Book Chapter
Closed access
PDF file
LSLukas Seidel
Lukas Seidel
SESedick David Baker Effendi
Sedick David Baker Effendi
XPXavier Pinho
Xavier Pinho
KRKonrad Rieck
Konrad Rieck
BMBrink van der Merwe
Brink van der Merwe
FYFabian Yamaguchi
Fabian Yamaguchi

13 June 2025
Verified
Conference Paper
Open access
SESedick David Baker Effendi
Sedick David Baker Effendi
XPXavier Pinho
Xavier Pinho
ADAndrei Michael Dreyer
Andrei Michael Dreyer
FYFabian Yamaguchi
Fabian Yamaguchi

4 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
LSLukas Seidel
Lukas Seidel
SESedick David Baker Effendi
Sedick David Baker Effendi
XPXavier Pinho
Xavier Pinho
KRKonrad Rieck
Konrad Rieck
BMBrink van der Merwe
Brink van der Merwe
FYFabian Yamaguchi
Fabian Yamaguchi
Statically analyzing dynamically-typed code is a challenging endeavor, as even seemingly trivial tasks such as determining the targets of procedure calls are non-trivial without knowing the types of objects at compile time. Addressing this challenge, gradual typing is increasingly added to dynamically-typed languages, a prominent example being TypeScript that introduces static typing to JavaScript. Gradual typing improves the developer's ability to verify program behavior, contributing to robust, secure and debuggable programs. In practice, however, users only sparsely annotate types directly. At the same time, conventional type inference faces performance-related challenges as program size grows. Statistical techniques based on machine learning offer faster inference, but although recent approaches demonstrate overall improved accuracy, they still perform significantly worse on user-defined types than on the most common built-in types. Limiting their real-world usefulness even more, they rarely integrate with user-facing applications. We propose CodeTIDAL5, a Transformer-based model trained to reliably predict type annotations. For effective result retrieval and re-integration, we extract usage slices from a program's code property graph. Comparing our approach against recent neural type inference systems, our model outperforms the current state-of-the-art by 7.85% on the ManyTypes4TypeScript benchmark, achieving 71.27% accuracy overall. Furthermore, we present JoernTI, an integration of our approach into Joern, an open source static analysis tool, and demonstrate that the analysis benefits from the additional type information. As our model allows for fast inference times even on commodity CPUs, making our system available through Joern leads to high accessibility and facilitates security research.

2 June 2026
Verified
Book Chapter
Open access
JSJoshua Charles Steytler
Joshua Charles Steytler
CICornelia Inggs
Cornelia Inggs
WBWillem Bester
Willem Bester
SESedick David Baker Effendi
Sedick David Baker Effendi
Plagiarism detection in programming education is critical for preserving academic integrity and supporting fair assessment. While established systems such as MOSS and JPlag effectively detect syntactic and token-level similarities, they often provide opaque outputs and can be evaded by modern obfuscation tools. This paper proposes a multimethod plagiarism detection framework that combines token fingerprinting, abstract syntax trees based structural comparison, rarity-weighted scoring, and semantic/graph-based analysis. The contribution is a design that emphasises multidimensional evidence, visual analytics for explainability, and robustness against evasion. We present the motivation, architecture, and evaluation plan positioning this work as a bridge between robust detection and educator-centred interpretability.