Eljas Soisalon Soininen
Professor at Aalto University School of Business
Schools
- Aalto University School of Business
Links
Biography
Aalto University School of Business
Peer-reviewed scientific articles
Journal article-refereed, Original researchCache-Sensitive Memory Layout for Dynamic Binary Trees
Saikkonen, Riku; Soisalon-Soininen, Eljas2016 in COMPUTER JOURNAL (OXFORD UNIV PRESS)ISSN: 0010-4620A form-based query interface for complex queries
El-Mahgary, Sami; Soisalon-Soininen, Eljas2015 in JOURNAL OF VISUAL LANGUAGES AND COMPUTING (Academic Press Inc.)ISSN: 1045-926XOn the Recovery of R-Trees
Haapasalo, Tuukka; Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2013 in IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (IEEE Computer Society)ISSN: 1041-4347Arguments in Considering the Similarity of Allgorithms in Patenting
Oksanen, Kenneth; Virtanen, Perttu; Kemppinen, Jukka; Soisalon-Soininen, Eljas2011 in SCRIPT-ED (IEEE Computer Society)Evaluating Linear XPath Expressions by Pattern-Matching Automata
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2010 in JOURNAL OF UNIVERSAL COMPUTER SCIENCE (Springer Verlag)ISSN: 0948-695XB-Tree Concurrency Control and Recovery in Page-Server Database Systems
Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2006 in ACM Transactions on Database Systems (Association for Computing Machinery (ACM))ISSN: 0362-5915Concurrency control and recovery for balanced B-link trees
Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2005 in The VLDB Journal (Association for Computing Machinery (ACM))Recoverable B±trees in Centralized Database Management Systems
Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2003 in International Journal of Applied Science & Computations (Association for Computing Machinery (ACM))Distributed Search Trees: Fault Tolerance in an Asynchronous Environment
Schlude, Konrad; Soisalon-Soininen, Eljas; Widmayer, Peter2003 in Theory of Computer Systems (Association for Computing Machinery (ACM))Transitive closure algorithm MEMTC and its performance analysis
Hirvisalo, V.; Nuutila, E.; Soisalon-Soininen, E.2001 in DISCRETE APPLIED MATHEMATICS (Elsevier)Relaxed balance for search trees with local rebalancing
Larsen, Kim S.; Ottmann, Thomas; Soisalon-Soininen, Eljas2001 in ACTA INFORMATICA (Springer New York)Relaxed Balance Using Standard Rotations
Larsen, Kim S.; Soisalon-Soininen, Eljas; Widmayer, Peter2001 in ALGORITHMICA (Springer New York)Concurrency Control in B+ Trees with Batch Updates
Pollari-Malmi, K.; Soisalon-Soininen, E.; Ylönen, T.1996 in IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (IEEE Computer Society)Chromatic binary search trees: A structure for concurrent rebalancing.
Soisalon-Soininen, E.; Nurmi, O.1996 in ACTA INFORMATICA (Springer New York)An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries
Soisalon-Soininen, E.; Sippu, S.1996 in JOURNAL OF THE ACM (Association for Computing Machinery (ACM))Relaxed AVL trees, main-memory databases, and concurrency.
Soisalon-Soininen, E.; Nurmi, O.; Wood, D.1996 in INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS (Taylor and Francis Ltd.)Safety by Uninterpreted Locks
Soisalon-Soininen, E.; Lausen, G.1995 in INFORMATION AND COMPUTATION (Elsevier Inc.)Suurten relaatioiden transitiivisen sulkeuman laskeminen
Hirvisalo, V.; Nuutila, E.; Soisalon-Soininen, E.1994 in TIETOJENKÄSITTELYTIEDE (Elsevier Inc.)On Finding the Strongly Connected Components in a Directed Graph
Nuutila, E.; Soisalon-Soininen, E.1994 in INFORMATION PROCESSING LETTERS (Elsevier)Book section, Chapters in research booksSingle and Bulk Updates in Stratifield Trees: An Amortized and Worst-Case Analysis
Soisalon-Soininen, Eljas; Widmayer, Peter2003 Relaxed Balancing in Search Trees
Soisalon-Soininen, E.; Widmayer, P.1997 Conference proceedingsLocation-based Automated Process Modelling
Zhang, Ye; Martikainen, Olli; Saikkonen, Riku; Soisalon-Soininen, Eljas2016 in CEUR workshop proceedings (RWTH Aachen University)ISSN: 1613-0073Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps
Saikkonen, Riku; Sippu, Seppo; Soisalon-Soininen, Eljas2015 ISBN: 978-3-319-20085-9ISSN: 0302-9743Online Matching of Multiple Regular Patterns with Gaps and Character Classes
Sippu, Seppo; Soisalon-Soininen, Eljas2013 ISBN: 978-3-642-37064-9ISSN: 0302-9743A General Method for Improving Insertion-Based Adaptive Sorting
Saikkonen, Riku; Soisalon-Soininen, Eljas2012 ISBN: 978-3-642-35260-7ISSN: 0302-9743Online Dictionary Matching with Variable-Length Gaps
Haapasalo, Tuukka; Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2011 ISBN: 978-3-642-20661-0Online dictionary matching for streams of XML documents
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2010 ISSN: 1868-4238Concurrent Updating Transactions on Versioned Data
Haapasalo, Tuukka; Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-60558-402-7Transactions on the Multiversion B-Tree
Haapasalo, Tuukka; Jaluta, Ibrahim; Seeger, Bernhard; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-60558-422-5Bulk-Insertion Sort: Towards Composite Measures of Presortedness
Saikkonen, Riku; Soisalon-Soininen, Eljas2009 ISBN: 978-3-642-02010-0ISSN: 0302-9743Processing Schema-Optimized XPath Filters by Deterministic Automata
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-880843-71-0Schema-conscious filtering of XML documents
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-60558-422-5Concurrency Control and Recovery for Multiversion Database Structures
Haapasalo, Tuukka; Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2008 ISBN: 978-1-60558-257-3Cache-sensitive Memory Layout for Binary Trees
Saikkonen, Riku; Soisalon-Soininen, Eljas2008 ISBN: 978-0-387-09679-7ISSN: 1571-5736XML-document-filtering automaton
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2008 ISBN: 978-1-60558-305-1A Two-Phased Visual Query Interface for Relational Databases
El-Mahgary, Sami; Soisalon-Soininen, Eljas2007 ISBN: 978-3-540-74467-2ISSN: 0302-9743Online Bulk Deletion
Lilja, Timo; Saikkonen, Riku; Sippu, Seppo; Soisalon-Soininen, Eljas2007 ISBN: 1-4244-0803-2Concurrency Control and I/O-Optimality in Bulk Insertion
Pollari-Malmi, Kerttu; Soisalon-Soininen, E.2004 Classification of Strings
Soisalon-Soininen, Eljas; Ylönen, T.2004 Distributed Highly Available Search Trees
Schlude, K.; Soisalon-Soininen, E.; Widmayer, P.2002 Amortized Complexity of Bulk Updates in ALV-Trees
Soisalon-Soininen, E.; Widmayer, P.2002 A Theory of Transactions on Recoverable Search Trees
Soisalonsoininen, Eljas; Sippu, Seppo2001 Group updates for red-black trees
Hanke, S.; Soisalon-Soininen, Eljas2000 Concurrency Control for B-Trees with Differential Indices
Pollari-Malmi, K.; Ruuth, J.; Soisalon-Soininen, E.2000 Group updates for relaxed height-balanced trees
Malmi, L.; Soisalon-Soininen, E.1999 Concurrency and recovery in full-text indexing
Soisalon-Soininen, E.; Widmayer, P.1999 Transitive Closure Algorithm MEMTC and its Performance Analysis
Nuutila, E.; Hirvisalo, V.; Soisalon-Soininen, E.1998 Concurrency and recovery for search structures
Soisalon-Soininen, E.1998 Relaxed Balance through Standard Rotations
Larsen, S.; Soisalon-Soininen, Eljas; Widmayer, P.1997 Relaxed Balance for Search Trees with Local Rebalancing
Larsen, K.; Ottmann, Th.; Soisalon-Soininen, E.1997 Relaxed balanced red-black trees
Soisalon-Soininen, E.; Ottmann, T.; Hanke, S.1997 Partial Strictness in Two-Phase Locking
Soisalon-Soininen, E.; Ylönen, T.1995 Scientific books (monographs)
BookTransaction Processing - Management of the Logical Database and its Underlying Physical Structrure
Sippu, Seppo; Soisalon-Soininen, Eljas2014 ISBN: 978-3-319-12291-5Book (editor)A Different Kind of Dimension Aspects on Software Patents
Virtanen, Perttu; Oksanen, Kenneth; Kemppinen, Jukka; Soisalon-Soininen, Eljas; Lee, Nari2010 ISBN: 978-952-60-3372-3Publications intended for professional communities
Published development or research reportContent-based Filtering by Generalized Pattern Matching
Klaedtke, Felix; Soisalon-Soininen, Eljas; Widmayer, Peter2004 I/O-OPTIMAL BULK INSERTION
Soisalon-Soininen, Eljas; Pollari-Malmi, Kerttu2003 Transitive closure algorithm DISC_TC and its performance analysis
Hirvisalo, V.; Nuutila, E.; Soisalon-Soininen, E.1996 Batch Updates and Concurrency in B-trees
Pollari-Malmi, K.; Soisalon-Soininen, E.; Ylönen, T.1993 Message from the ICDE 2016 Program Committee and general chairs
Hsu, Mei; Kemper, Alfons; Sellis, Timos; Novikov, Boris; Soisalon-Soininen, Eljas2016 ISBN: 978-1-5090-2019-5
Cache-Sensitive Memory Layout for Dynamic Binary Trees
A form-based query interface for complex queries
On the Recovery of R-Trees
Arguments in Considering the Similarity of Allgorithms in Patenting
Evaluating Linear XPath Expressions by Pattern-Matching Automata
B-Tree Concurrency Control and Recovery in Page-Server Database Systems
Concurrency control and recovery for balanced B-link trees
Recoverable B±trees in Centralized Database Management Systems
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment
Transitive closure algorithm MEMTC and its performance analysis
Relaxed balance for search trees with local rebalancing
Relaxed Balance Using Standard Rotations
Concurrency Control in B+ Trees with Batch Updates
Chromatic binary search trees: A structure for concurrent rebalancing.
An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries
Relaxed AVL trees, main-memory databases, and concurrency.
Safety by Uninterpreted Locks
Suurten relaatioiden transitiivisen sulkeuman laskeminen
On Finding the Strongly Connected Components in a Directed Graph
Single and Bulk Updates in Stratifield Trees: An Amortized and Worst-Case Analysis
Relaxed Balancing in Search Trees
Conference proceedingsLocation-based Automated Process Modelling
Zhang, Ye; Martikainen, Olli; Saikkonen, Riku; Soisalon-Soininen, Eljas2016 in CEUR workshop proceedings (RWTH Aachen University)ISSN: 1613-0073Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps
Saikkonen, Riku; Sippu, Seppo; Soisalon-Soininen, Eljas2015 ISBN: 978-3-319-20085-9ISSN: 0302-9743Online Matching of Multiple Regular Patterns with Gaps and Character Classes
Sippu, Seppo; Soisalon-Soininen, Eljas2013 ISBN: 978-3-642-37064-9ISSN: 0302-9743A General Method for Improving Insertion-Based Adaptive Sorting
Saikkonen, Riku; Soisalon-Soininen, Eljas2012 ISBN: 978-3-642-35260-7ISSN: 0302-9743Online Dictionary Matching with Variable-Length Gaps
Haapasalo, Tuukka; Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2011 ISBN: 978-3-642-20661-0Online dictionary matching for streams of XML documents
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2010 ISSN: 1868-4238Concurrent Updating Transactions on Versioned Data
Haapasalo, Tuukka; Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-60558-402-7Transactions on the Multiversion B-Tree
Haapasalo, Tuukka; Jaluta, Ibrahim; Seeger, Bernhard; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-60558-422-5Bulk-Insertion Sort: Towards Composite Measures of Presortedness
Saikkonen, Riku; Soisalon-Soininen, Eljas2009 ISBN: 978-3-642-02010-0ISSN: 0302-9743Processing Schema-Optimized XPath Filters by Deterministic Automata
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-880843-71-0Schema-conscious filtering of XML documents
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2009 ISBN: 978-1-60558-422-5Concurrency Control and Recovery for Multiversion Database Structures
Haapasalo, Tuukka; Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas2008 ISBN: 978-1-60558-257-3Cache-sensitive Memory Layout for Binary Trees
Saikkonen, Riku; Soisalon-Soininen, Eljas2008 ISBN: 978-0-387-09679-7ISSN: 1571-5736XML-document-filtering automaton
Silvasti, Panu; Sippu, Seppo; Soisalon-Soininen, Eljas2008 ISBN: 978-1-60558-305-1A Two-Phased Visual Query Interface for Relational Databases
El-Mahgary, Sami; Soisalon-Soininen, Eljas2007 ISBN: 978-3-540-74467-2ISSN: 0302-9743Online Bulk Deletion
Lilja, Timo; Saikkonen, Riku; Sippu, Seppo; Soisalon-Soininen, Eljas2007 ISBN: 1-4244-0803-2Concurrency Control and I/O-Optimality in Bulk Insertion
Pollari-Malmi, Kerttu; Soisalon-Soininen, E.2004 Classification of Strings
Soisalon-Soininen, Eljas; Ylönen, T.2004 Distributed Highly Available Search Trees
Schlude, K.; Soisalon-Soininen, E.; Widmayer, P.2002 Amortized Complexity of Bulk Updates in ALV-Trees
Soisalon-Soininen, E.; Widmayer, P.2002 A Theory of Transactions on Recoverable Search Trees
Soisalonsoininen, Eljas; Sippu, Seppo2001 Group updates for red-black trees
Hanke, S.; Soisalon-Soininen, Eljas2000 Concurrency Control for B-Trees with Differential Indices
Pollari-Malmi, K.; Ruuth, J.; Soisalon-Soininen, E.2000 Group updates for relaxed height-balanced trees
Malmi, L.; Soisalon-Soininen, E.1999 Concurrency and recovery in full-text indexing
Soisalon-Soininen, E.; Widmayer, P.1999 Transitive Closure Algorithm MEMTC and its Performance Analysis
Nuutila, E.; Hirvisalo, V.; Soisalon-Soininen, E.1998 Concurrency and recovery for search structures
Soisalon-Soininen, E.1998 Relaxed Balance through Standard Rotations
Larsen, S.; Soisalon-Soininen, Eljas; Widmayer, P.1997 Relaxed Balance for Search Trees with Local Rebalancing
Larsen, K.; Ottmann, Th.; Soisalon-Soininen, E.1997 Relaxed balanced red-black trees
Soisalon-Soininen, E.; Ottmann, T.; Hanke, S.1997 Partial Strictness in Two-Phase Locking
Soisalon-Soininen, E.; Ylönen, T.1995 Scientific books (monographs)
BookTransaction Processing - Management of the Logical Database and its Underlying Physical Structrure
Sippu, Seppo; Soisalon-Soininen, Eljas2014 ISBN: 978-3-319-12291-5Book (editor)A Different Kind of Dimension Aspects on Software Patents
Virtanen, Perttu; Oksanen, Kenneth; Kemppinen, Jukka; Soisalon-Soininen, Eljas; Lee, Nari2010 ISBN: 978-952-60-3372-3Publications intended for professional communities
Published development or research reportContent-based Filtering by Generalized Pattern Matching
Klaedtke, Felix; Soisalon-Soininen, Eljas; Widmayer, Peter2004 I/O-OPTIMAL BULK INSERTION
Soisalon-Soininen, Eljas; Pollari-Malmi, Kerttu2003 Transitive closure algorithm DISC_TC and its performance analysis
Hirvisalo, V.; Nuutila, E.; Soisalon-Soininen, E.1996 Batch Updates and Concurrency in B-trees
Pollari-Malmi, K.; Soisalon-Soininen, E.; Ylönen, T.1993 Message from the ICDE 2016 Program Committee and general chairs
Hsu, Mei; Kemper, Alfons; Sellis, Timos; Novikov, Boris; Soisalon-Soininen, Eljas2016 ISBN: 978-1-5090-2019-5
Location-based Automated Process Modelling
Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps
Online Matching of Multiple Regular Patterns with Gaps and Character Classes
A General Method for Improving Insertion-Based Adaptive Sorting
Online Dictionary Matching with Variable-Length Gaps
Online dictionary matching for streams of XML documents
Concurrent Updating Transactions on Versioned Data
Transactions on the Multiversion B-Tree
Bulk-Insertion Sort: Towards Composite Measures of Presortedness
Processing Schema-Optimized XPath Filters by Deterministic Automata
Schema-conscious filtering of XML documents
Concurrency Control and Recovery for Multiversion Database Structures
Cache-sensitive Memory Layout for Binary Trees
XML-document-filtering automaton
A Two-Phased Visual Query Interface for Relational Databases
Online Bulk Deletion
Concurrency Control and I/O-Optimality in Bulk Insertion
Classification of Strings
Distributed Highly Available Search Trees
Amortized Complexity of Bulk Updates in ALV-Trees
A Theory of Transactions on Recoverable Search Trees
Group updates for red-black trees
Concurrency Control for B-Trees with Differential Indices
Group updates for relaxed height-balanced trees
Concurrency and recovery in full-text indexing
Transitive Closure Algorithm MEMTC and its Performance Analysis
Concurrency and recovery for search structures
Relaxed Balance through Standard Rotations
Relaxed Balance for Search Trees with Local Rebalancing
Relaxed balanced red-black trees
Partial Strictness in Two-Phase Locking
Transaction Processing - Management of the Logical Database and its Underlying Physical Structrure
Book (editor)A Different Kind of Dimension Aspects on Software Patents
Virtanen, Perttu; Oksanen, Kenneth; Kemppinen, Jukka; Soisalon-Soininen, Eljas; Lee, Nari2010 ISBN: 978-952-60-3372-3Publications intended for professional communities
Published development or research reportContent-based Filtering by Generalized Pattern Matching
Klaedtke, Felix; Soisalon-Soininen, Eljas; Widmayer, Peter2004 I/O-OPTIMAL BULK INSERTION
Soisalon-Soininen, Eljas; Pollari-Malmi, Kerttu2003 Transitive closure algorithm DISC_TC and its performance analysis
Hirvisalo, V.; Nuutila, E.; Soisalon-Soininen, E.1996 Batch Updates and Concurrency in B-trees
Pollari-Malmi, K.; Soisalon-Soininen, E.; Ylönen, T.1993 Message from the ICDE 2016 Program Committee and general chairs
Hsu, Mei; Kemper, Alfons; Sellis, Timos; Novikov, Boris; Soisalon-Soininen, Eljas2016 ISBN: 978-1-5090-2019-5
A Different Kind of Dimension Aspects on Software Patents
Content-based Filtering by Generalized Pattern Matching
I/O-OPTIMAL BULK INSERTION
Transitive closure algorithm DISC_TC and its performance analysis
Batch Updates and Concurrency in B-trees
Message from the ICDE 2016 Program Committee and general chairs
Hsu, Mei; Kemper, Alfons; Sellis, Timos; Novikov, Boris; Soisalon-Soininen, Eljas2016 ISBN: 978-1-5090-2019-5
Message from the ICDE 2016 Program Committee and general chairs
Read about executive education
Other experts
Soumitra Dutta
Soumitra Dutta is Peter Moores Dean and Professor of Management, Saïd Business School, University of Oxford, and a Fellow of Balliol College, Oxford. Before joining the School in 2022, he was Professor of Management and the former founding Dean of the Cornell SC Johnson College of Business at Co...
Amir Grinstein
ProfileEducation Post-Doctorate Fellow, the Marketing Department, Harvard Business School PhD in Marketing, The Hebrew University, Jerusalem, Israel MBA, specialization in Marketing, The Hebrew University, Jerusalem, Israel BA, Business and Economics, The Hebrew University, Jerusalem, Israel R...
Looking for an expert?
Contact us and we'll find the best option for you.