Nils Grimsmo
About me
My name is Nils, and I live in Trondheim, a small city in the middle of Norway. Originally I come from Surnadal. I am doing a PhD at the Department of Computer and Information Icience (IDI) at the Norwegian University of Science and Technology (NTNU). Spring 2005 I finished my masters degree, on the updatability of substring indexes. My PhD focuses on algorithmic and implementational aspects of information retrieval and databases
|
|
Right now
- Going to the Australasian Database Conference (ADC 2010) in Brisbane in January.
- Getting "camera ready" for the International Conference on Advances in Databases, Knowledge, and Data Applications (DBKDA 2010) in Les Menuires in April.
- Finishing a paper on twig join algrithms.
Work
This section will hopefully grow in time...
- Nils Grimsmo and Truls Amundsen Bjørklund. Towards Unifying Advances in Twig Join Algorithms. Proceedings of the 21st Australasian Database Conference (ADC 2010). [pdf with errata]
- Nils Grimsmo, Truls Amundsen Bjørklund and Øystein Torbjørnsen. XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes. Proceedings of the Second International Conference on Advances in Databases, Knowledge, and Data Applications (DBKDA 2010). [pdf]
- Truls A. Bjørklund, Nils Grimsmo, Johannes Gehrke and Øystein Torbjørnsen. Inverted indexes vs. bitmap indexes in decision support systems. Proceeding of the 18th ACM conference on Information and knowledge management (CIKM 2009). [pdf bibtex]
- Nils Grimsmo. Faster Path Indexes for Search in XML Data. Proceeding of the Nineteenth Australasian Database Conference (ADC 2008). [pdf bibtex]
- Nils Grimsmo and Truls Amundsen Bjørklund. On the Size of Generalised Suffix Trees Extended with String ID Lists. Technical Report IDI-TR-2007-01, Norwegian University of Science and Technology, Trondheim, Norway, 2007. [pdf bibtex]
- Nils Grimsmo. On performance and cache effects in substring indexes. Technical Report IDI-TR-2007-04, Norwegian University of Science and Technology, Trondheim, Norway, 2007. [pdf bibtex]
- Nils Grimsmo. Dynamic indexes vs. static hierarchies for substring search. Master thesis, Norwegian University of Science and Technology, Trondheim, Norway, 2005. [pdf bibtex]
Programming
I am very interested in programming in general. I enjoy writing and reading beautiful little programs. This is why I have helped organise the Nordic Collegiate Programming Contest (NCPC), which is a part of the International Collegiate Programming Contest (ICPC).
Here is a funny little program you can try to guess what does:
def f(T):
A = {}
for t in T:
A[t] = sum(A.values()) + 1
return sum(A.values()) + 1