Seppo Sippu

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

Transaction Processing - Management of the Logical Database and its Underlying Physical Structure

[BibT_eX]

[DOI]

Data-Centric Systems and Applications, Springer, ISBN: 978-3-319-12292-2, 2014

2013

On the Recovery of R-Trees.

[BibT_eX]

[DOI]

Tuukka Haapasalo

IEEE Trans. Knowl. Data Eng., 2013

Online Matching of Multiple Regular Patterns with Gaps and Character Classes.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2013

2011

Online Dictionary Matching with Variable-Length Gaps.

[BibT_eX]

[DOI]

Tuukka Haapasalo

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010

Evaluating Linear XPath Expressions by Pattern-Matching Automata.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2010

Online Dictionary Matching for Streams of XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2010

2009

Processing Schema-Optimized XPath Filters by Deterministic Automata.

[BibT_eX]

Proceedings of the 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), 2009

Concurrent updating transactions on versioned data.

[BibT_eX]

[DOI]

Tuukka Haapasalo

Proceedings of the International Database Engineering and Applications Symposium (IDEAS 2009), 2009

Schema-conscious filtering of XML documents.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2009, 2009

Transactions on the multiversion B<sup>+</sup>-tree.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2009, 2009

2008

XML-document-filtering automaton.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Concurrency control and recovery for multiversion database structures.

[BibT_eX]

[DOI]

Tuukka K. Haapasalo

Proceedings of the Second Ph.D. Workshop in CIKM, 2008

2007

Online Bulk Deletion.

[BibT_eX]

[DOI]

Timo Lilja

Riku Saikkonen

Proceedings of the 23rd International Conference on Data Engineering, 2007

2006

B-tree concurrency control and recovery in page-server database systems.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2006

2005

Concurrency control and recovery for balanced B-link trees.

[BibT_eX]

[DOI]

VLDB J., 2005

2001

A Theory of Transactions on Recoverable Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2001

1996

An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries.

[BibT_eX]

[DOI]

J. ACM, 1996

1994

Avoiding Redundant Computations in Evaluating Linear Queries.

[BibT_eX]

Proceedings of the 5th Australasian Database Conference, 1994

1991

Efficient Evaluation for a Subset of Recursive Queries.

[BibT_eX]

[DOI]

Gösta Grahne

J. Log. Program., 1991

1990

Parsing Theory - Volume II: LR(k) and LL(k) Parsing

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 20, Springer, ISBN: 978-3-662-08424-3, 1990

Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries.

[BibT_eX]

[DOI]

Juhani Kuittinen

Otto Nurmi

Proceedings of the 16th International Conference on Very Large Data Bases, 1990

Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization.

[BibT_eX]

[DOI]

Proceedings of the ICDT'90, 1990

1988

Parsing Theory - Volume I: Languages and Parsing

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 15, Springer, ISBN: 0-387-13720-3, 1988

The Design of a Language Processor Generator.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1988

A Generalized Transitive Closure for Relational Queries.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

An Optimization Strategy for Recursive Queries in Logic Databases.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Data Engineering, 1988

1985

On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

1983

The Complexity of LALR(k) Testing

[BibT_eX]

[DOI]

Esko Ukkonen

J. ACM, April, 1983

A Syntax-Error-Handling Technique and Its Experimental Analysis.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1983

On the Complexity of LL(k) Testing.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

1982

On LL(k) Parsing

[BibT_eX]

[DOI]

Inf. Control., June, 1982

Derivational Complexity of Context-Free Grammars

[BibT_eX]

[DOI]

Inf. Control., 1982

Practical Error Recovery in LR Parsing.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

1981

On LALR(1) Testing.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

1980

Characterizations of the LL(k) Property.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Con Constructing LL(k) Parsers.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1979

1977

On Defining Error Recovery in Context-Free Parsing.

[BibT_eX]

[DOI]