Romans Kasperovics

11 papers A 1B 2C 2Journal 3Unranked 3
YearRankTypeTitle / Venue / Authors
2020 J jnl
Efficient Compilation of Regular Path Queries.
Datenbank-Spektrum
Frank Tetzel, Wolfgang Lehner, Romans Kasperovics
2019 — conf
Graph Traversals for Regular Path Queries.
GRADES/NDA@SIGMOD/PODS
Frank Tetzel, Romans Kasperovics, Wolfgang Lehner
2018 C conf
Analysis of Data Structures Involved in RPQ Evaluation.
DATA
Frank Tetzel, Hannes Voigt, Marcus Paradies, Romans Kasperovics, Wolfgang Lehner
2017 — conf
GraphScript: implementing complex graph algorithms in SAP HANA.
DBPL
Marcus Paradies, Cornelia Kinder, Jan Bross, Thomas Fischer, Romans Kasperovics, Hinnerk Gildhoff
2015 J jnl
An efficient algorithm for updating regular expression indexes in RDF databases.
Int. J. Data Min. Bioinform.
Jinsoo Lee, Romans Kasperovics, Wook-Shin Han, Jeong-Hoon Lee, Min-Soo Kim, Hune Cho
2012 J jnl
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases.
Proc. VLDB Endow.
Jinsoo Lee, Wook-Shin Han, Romans Kasperovics, Jeong-Hoon Lee
2011 — conf
iGraph in action: performance analysis of disk-based graph indexing techniques.
SIGMOD Conference
Wook-Shin Han, Minh-Duc Pham, Jinsoo Lee, Romans Kasperovics, Jeffrey Xu Yu
2010 B conf
On the Efficient Construction of Multislices from Recurrences.
SSDBM
Romans Kasperovics, Michael H. Böhlen, Johann Gamper
2009 A conf
Evaluating Exceptions on Time Slices.
ER
Romans Kasperovics, Michael H. Böhlen, Johann Gamper
2008 C conf
Representing Public Transport Schedules as Repeating Trips.
TIME
Romans Kasperovics, Michael H. Böhlen, Johann Gamper
2006 B conf
Querying Multi-granular Compact Representations.
DASFAA
Romans Kasperovics, Michael H. Böhlen