Nikolaus Augsten, PhD
|
Current position: Assistant professor ("RTD") in the Database and Information Systems Group, Free University of Bozen-Bolzano, Italy. PhD: I received my PhD from Aalborg University, Denmark, in 2008.
Address |
Main Research Interests
My current research interests include data-centric applications in database and information systems with a particular focus on approximate matching techniques for complex data structures, efficient index structures for distance computations, and similarity search in massive data collections. My research is triggered by problems that arise in concrete applications, for example, e-government and XML search engines.
Publications
- N. Augsten, D. Barbosa, M. Böhlen, and
T. Palpanas. TASM: Top-k approximate subtree matching. In
Proceedings of the International Conference on Data Engineering
(ICDE-10), pages 353-364, Long Beach, California,
USA, March 2010. IEEE Computer Society.
[PDF][all downloads] (acceptance rate: 12.9%,
GRIN*: A)
ICDE 2010 Best Paper Award - N. Augsten, M. Böhlen, and J. Gamper. The pq-Gram Distance between Ordered Labeled Trees. In ACM Transactions on Database Systems (TODS), 35(1):1-36, 2010 [PDF][all downloads] (GRIN*: A)
- N. Augsten, M. Böhlen, C. Dyreson, and J. Gamper. Approximate Joins for Data Centric XML. In Proceedings of the International Conference on Data Engineering (ICDE-08), Cancún, Mexico, April 2008. IEEE Computer Society. [PDF][all downloads] (acceptance rate: 12.1%, GRIN*: A)
- N. Augsten, M. Böhlen, and J. Gamper. An incrementally maintainable index for approximate lookups in hierarchical data. In Proceedings of the 32th International Conference on Very Large Databases (VLDB-06), pages 247-258, Seoul, Korea, Sep. 2006. ACM Press. [PDF][all downloads] (acceptance rate: 13.2%, GRIN*: A)
- N. Augsten, M. Böhlen, and J. Gamper. Approximate matching of hierarchical data using pq-grams. In Proceedings of the 31th International Conference on Very Large Databases (VLDB-05), pages 141-152, Trondheim, Norway, Aug.-Sep. 2005. ACM Press. [PDF][all downloads] (acceptance rate: 16.5%, GRIN*: A)
- N. Augsten, M. Böhlen, and J. Gamper. Reducing the integration of public administration databases to approximate tree matching. In Proceedings of the Third International Conference on Electronic Government (EGOV-04), LNCS 3183, pages 102-107, Zaragoza, Spain, Aug. 30 - Sept. 3 2004. Springer-Verlag.
- J. Gamper and N. Augsten. The role of web services in digital government. In Proceedings of the Second International Conference on Electronic Government (EGOV-03), LNCS 2739, pages 161-166, Prague, Czech Republic, September 2003. Springer-Verlag.
*GRIN: Journal and conference ranking by the Italian Association of Computer Scientists.
Please feel free to download the source code of our implementations here.
Teaching
Courses
- Database Management and Tuning (SS2010)
-
This course will give an in-depth understanding of the features that
off-the-shelf database management systems offer, in particular with
respect to system performance. This knowledge is used to tune the
database system and its environment: dimension the hardware for the
database system, write efficient queries, set effective indexes,
communicate with the database efficiently, and diagnose performance
problems.
- Similarity Search (WS 2009)
- This course will discuss similarity search techniques for flat
strings and hierarchical data (for example, XML). Selected methods
will be presented, their effectiveness and efficiency will be
discussed. Filtering techniques to improve the efficiency will be
introduced. The students will implement similarity joins in a
relational database management system.
(Course Evaluation: WS 2009)
- Approximation: Theory and Algorithms (SS 2009) — old study plan; will not be held in 2010!
- This course will discuss
approximate matching techniques for flat strings and hierarchical
data. Selected methods will be presented, their effectiveness and
efficiency will be discussed. Filtering techniques to improve the
efficiency will be introduced. The students will implement approximate
matching techniques in a relational database management system.
(Course Evaluation: SS 2007, SS 2008, SS 2009)