Eljas Soisalon-Soininen

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 9

Top Topics

Complex Queries

Program Committee

Query Interface

Top Venues

J. Vis. Lang. Comput.

SIMPDA (Revised Selected Papers)

Publications

Amir El-Shaikh, Bernhard Seeger, Eljas Soisalon-Soininen
Lightweight Latches for B-Trees to Cope with High Contention. DEXA (2) (2024)
Sami El-Mahgary, Eljas Soisalon-Soininen, Pekka Orponen, Petri Rönnholm, Hannu Hyyppä
OVI-3: A NoSQL visual query system supporting efficient anti-joins. J. Intell. Inf. Syst. 60 (3) (2023)
Tuuli Klemetti, Reijo Salminen, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen
Extracting Service Process Models with Teams. SIMPDA (2017)
Mei Hsu, Alfons Kemper, Timos K. Sellis, Boris Novikov, Eljas Soisalon-Soininen
Message from the ICDE 2016 Program Committee and general chairs. ICDE (2016)
Ye Zhang, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen
Location-based Automated Process Modelling. SIMPDA (2016)
Riku Saikkonen, Eljas Soisalon-Soininen
Cache-Sensitive Memory Layout for Dynamic Binary Trees. Comput. J. 59 (5) (2016)
Ye Zhang, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen
Extracting Service Process Models from Location Data. SIMPDA (Revised Selected Papers) (2016)
Sami El-Mahgary, Eljas Soisalon-Soininen
A form-based query interface for complex queries. J. Vis. Lang. Comput. 29 (2015)
Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen
Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps. SEA (2015)
Seppo Sippu, Eljas Soisalon-Soininen
Online Matching of Multiple Regular Patterns with Gaps and Character Classes. LATA (2013)
Tuukka Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
On the Recovery of R-Trees. IEEE Trans. Knowl. Data Eng. 25 (1) (2013)
Riku Saikkonen, Eljas Soisalon-Soininen
A General Method for Improving Insertion-Based Adaptive Sorting. ISAAC (2012)
Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
Online Dictionary Matching with Variable-Length Gaps. SEA (2011)
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
Evaluating Linear XPath Expressions by Pattern-Matching Automata. J. Univers. Comput. Sci. 16 (5) (2010)
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
Online Dictionary Matching for Streams of XML Documents. IFIP TCS (2010)
Tuukka Haapasalo, Seppo Sippu, Ibrahim Jaluta, Eljas Soisalon-Soininen
Concurrent updating transactions on versioned data. IDEAS (2009)
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
Schema-conscious filtering of XML documents. EDBT (2009)
Riku Saikkonen, Eljas Soisalon-Soininen
Bulk-Insertion Sort: Towards Composite Measures of Presortedness. SEA (2009)
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
Processing Schema-Optimized XPath Filters by Deterministic Automata. SEDE (2009)
Tuukka Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen
-tree. EDBT (2009)
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
XML-document-filtering automaton. Proc. VLDB Endow. 1 (2) (2008)
Riku Saikkonen, Eljas Soisalon-Soininen
Cache-sensitive Memory Layout for Binary Trees. IFIP TCS (2008)
Tuukka K. Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
Concurrency control and recovery for multiversion database structures. PIKM (2008)
Sami El-Mahgary, Eljas Soisalon-Soininen
A Two-Phased Visual Query Interface for Relational Databases. DEXA (2007)
Timo Lilja, Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen
Online Bulk Deletion. ICDE (2007)
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
B-tree concurrency control and recovery in page-server database systems. ACM Trans. Database Syst. 31 (1) (2006)
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
Concurrency control and recovery for balanced B-link trees. VLDB J. 14 (2) (2005)
Kerttu Pollari-Malmi, Eljas Soisalon-Soininen
Concurrency Control and I/O-Optimality in Bulk Insertion.. SPIRE (2004)
Eljas Soisalon-Soininen, Tatu Ylönen
On Classification of Strings. SPIRE (2004)
Eljas Soisalon-Soininen, Peter Widmayer
Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Computer Science in Perspective (2003)
Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst. 36 (6) (2003)
Eljas Soisalon-Soininen, Peter Widmayer
Amortized Complexity of Bulk Updates in AVL-Trees. SWAT (2002)
Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer
Distributed Highly Available Search Trees. SIROCCO (2002)
Vesa Hirvisalo, Esko Nuutila, Eljas Soisalon-Soininen
Transitive closure algorithm MEMTC and its performance analysis. Discret. Appl. Math. 110 (1) (2001)
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
Relaxed Balance Using Standard Rotations. Algorithmica 31 (4) (2001)
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
Relaxed balance for search trees with local rebalancing. Acta Informatica 37 (10) (2001)
Seppo Sippu, Eljas Soisalon-Soininen
A Theory of Transactions on Recoverable Search Trees. ICDT (2001)
Sabine Hanke, Eljas Soisalon-Soininen
Group Updates for Red-Black Trees. CIAC (2000)
Kerttu Pollari-Malmi, Jarmo Ruuth, Eljas Soisalon-Soininen
Concurrency Control for B-Trees with Differential Indices. IDEAS (2000)
Eljas Soisalon-Soininen, Peter Widmayer
Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG (1999)
Lauri Malmi, Eljas Soisalon-Soininen
Group Updates for Relaxed Height-Balanced Trees. PODS (1999)
Eljas Soisalon-Soininen, Peter Widmayer
Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity (1997)
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
Relaxed Balance for Search Trees with Local Rebalancing. ESA (1997)
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
Relaxed Balance through Standard Rotations. WADS (1997)
Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen
Relaxed Balanced Red-Black Trees. CIAC (1997)
Kerttu Pollari-Malmi, Eljas Soisalon-Soininen, Tatu Ylönen
Concurrency Control in B-Trees with Batch Updates. IEEE Trans. Knowl. Data Eng. 8 (6) (1996)
Seppo Sippu, Eljas Soisalon-Soininen
An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries. J. ACM 43 (6) (1996)
Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood
Relaxed avl trees, main-memory databases and concurrency. Int. J. Comput. Math. 62 (1-2) (1996)
Otto Nurmi, Eljas Soisalon-Soininen
Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. Acta Informatica 33 (6) (1996)
Eljas Soisalon-Soininen, Tatu Ylönen
Partial Strictness in Two-Phase Locking. ICDT (1995)
Georg Lausen, Eljas Soisalon-Soininen
Safety by Uninterpreted Locks Inf. Comput. 117 (1) (1995)
Esko Nuutila, Eljas Soisalon-Soininen
On Finding the Strongly Connected Components in a Directed Graph. Inf. Process. Lett. 49 (1) (1994)
Seppo Sippu, Eljas Soisalon-Soininen
Avoiding Redundant Computations in Evaluating Linear Queries. Australasian Database Conference (1994)
Otto Nurmi, Eljas Soisalon-Soininen
Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. PODS (1991)
Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen
Efficient Evaluation for a Subset of Recursive Queries. J. Log. Program. 10 (3&4) (1991)
Seppo Sippu, Eljas Soisalon-Soininen
Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. ICDT (1990)
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
On the Power of Safe Locking. J. Comput. Syst. Sci. 40 (2) (1990)
Juhani Kuittinen, Otto Nurmi, Seppo Sippu, Eljas Soisalon-Soininen
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. VLDB (1990)
Georg Lausen, Eljas Soisalon-Soininen
Locling Policies and Predeclared Transactions. MFDBS (1989)
Seppo Sippu, Eljas Soisalon-Soininen
A Generalized Transitive Closure for Relational Queries. PODS (1988)
Eljas Soisalon-Soininen, Jorma Tarhio
Looping LR Parsers. Inf. Process. Lett. 26 (5) (1988)
Seppo Sippu, Eljas Soisalon-Soininen
An Optimization Strategy for Recursive Queries in Logic Databases. ICDE (1988)
Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood
Concurrency Control in Database Structures with Relaxed Balance. PODS (1987)
Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
Partitioning and separating sets of orthogonal polygons. Inf. Sci. 42 (1) (1987)
Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen
Efficient Evaluation for a Subset of Recursive Queries. PODS (1987)
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
Pre-analysis Locking Inf. Control. 70 (2/3) (1986)
Ivan Stojmenovic, Eljas Soisalon-Soininen
A Note on Approximate Convex Hulls. Inf. Process. Lett. 22 (2) (1986)
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
Towards Online Schedulers Based on Pre-Analysis Locking. ICDT (1986)
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB (1985)
Seppo Sippu, Eljas Soisalon-Soininen
On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). ICALP (1985)
Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
Maximal Concurrency by Locking. PODS (1984)
Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
The Complexity and Decidability of Separation. ICALP (1984)
Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
On the Definition and Computation of Rectlinear Convex Hulls. Inf. Sci. 33 (1984)
Eljas Soisalon-Soininen, Peter Widmayer
On the Complexity of Concurrency Control by Locking in Distributed Database Systems Inf. Control. 60 (1-3) (1984)
Eljas Soisalon-Soininen, Derick Wood
Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. J. Algorithms 5 (2) (1984)
Eljas Soisalon-Soininen
On Computing Approximate Convex Hulls. Inf. Process. Lett. 16 (3) (1983)
Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen
The Complexity of LALR(k) Testing J. ACM 30 (2) (1983)
Seppo Sippu, Eljas Soisalon-Soininen
On the Complexity of LL(k) Testing. J. Comput. Syst. Sci. 26 (2) (1983)
Seppo Sippu, Eljas Soisalon-Soininen
A Syntax-Error-Handling Technique and Its Experimental Analysis. ACM Trans. Program. Lang. Syst. 5 (4) (1983)
Eljas Soisalon-Soininen, Derick Wood
An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. PODS (1982)
Eljas Soisalon-Soininen
Inessential Error Entries and Their Use in LR Parser Optimization. ACM Trans. Program. Lang. Syst. 4 (2) (1982)
Eljas Soisalon-Soininen
Translations on a Subclass of LR(k) Grammars. BIT 22 (3) (1982)
Eljas Soisalon-Soininen, Derick Wood
On a Covering Relation for Context-Free Grammars. Acta Informatica 17 (1982)
Seppo Sippu, Eljas Soisalon-Soininen
Practical Error Recovery in LR Parsing. POPL (1982)
Seppo Sippu, Eljas Soisalon-Soininen
On LL(k) Parsing Inf. Control. 53 (3) (1982)
Seppo Sippu, Eljas Soisalon-Soininen
On LALR(1) Testing. ICALP (1981)
Eljas Soisalon-Soininen, Derick Wood
On Structural Similarity of Context-Free Grammars. MFCS (1981)
Esko Ukkonen, Eljas Soisalon-Soininen
LALR(k) Testing is PSPACE-Complete STOC (1981)
Eljas Soisalon-Soininen
On Comparing LL(k) and LR(k) Grammars. Math. Syst. Theory 13 (1980)
Seppo Sippu, Eljas Soisalon-Soininen
Characterizations of the LL(k) Property. ICALP (1980)
Eljas Soisalon-Soininen
Parsers. Acta Informatica 14 (1980)
Eljas Soisalon-Soininen, Esko Ukkonen
A Method for Transforming Grammars into LL(k) Form. Acta Informatica 12 (1979)
Anton Nijholt, Eljas Soisalon-Soininen
Ch(k) Grammars: A Characterization of LL(k) Languages. MFCS (1979)
Eljas Soisalon-Soininen
On the Covering Problem for Left-Recursive Grammars. Theor. Comput. Sci. 8 (1979)
Seppo Sippu, Eljas Soisalon-Soininen
Con Constructing LL(k) Parsers. ICALP (1979)
Seppo Sippu, Eljas Soisalon-Soininen
On Defining Error Recovery in Context-Free Parsing. ICALP (1977)
Eljas Soisalon-Soininen
Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions. POPL (1977)
Eljas Soisalon-Soininen, Esko Ukkonen
A Characterization of LL(k) Languages. ICALP (1976)