Peter Thanisch

  • University of Edinburgh, Scotland, UK

According to our database1, Peter Thanisch authored at least 45 papers between 1982 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:



Detecting measurement issues in SQL arithmetic expressions and aggregations.
Data Knowl. Eng., 2019

Energy Efficiency of a Web and Database Server System: Configuration and Bursting.
Int. J. Green Comput., 2014

Detecting summarizability in OLAP.
Data Knowl. Eng., 2014

Games and energy: profiling power usage during play.
Proceedings of the 18th International Academic MindTrek Conference: Media Business, 2014

Detecting Missing Requirements in Conceptual Models.
Proceedings of the Information and Software Technologies - 20th International Conference, 2014

Incompleteness in Conceptual Data Modelling.
Proceedings of the Information and Software Technologies - 19th International Conference, 2013

Cell-at-a-Time Approach to Lazy Evaluation of Dimensional Aggregations.
Proceedings of the Data Warehousing and Knowledge Discovery, 2013

Using the Entity-Attribute-Value Model for OLAP Cube Construction.
Proceedings of the Perspectives in Business Informatics Research, 2011

Timely Report Production from WWW Data Sources.
Proceedings of the Workshops on Business Informatics Research, 2011

Normalising OLAP cubes for controlling sparsity.
Data Knowl. Eng., 2003

Applying Grid Technologies to XML Based OLAP Cube Construction.
Proceedings of the Design and Management of Data Warehouses 2003, 2003

Constructing an OLAP cube from distributed XML data.
Proceedings of the DOLAP 2002, 2002

Constructing OLAP Cubes Based on Queries.
Proceedings of the 4th ACM International Workshop on Data Warehousing and OLAP (DOLAP 2001), 2001

Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation.
Proceedings of the 3rd Intl. Workshop on Design and Management of Data Warehouses, 2001

Atomic commit in concurrent computing.
IEEE Concurr., 2000

Games-Based Model Checking of Protocols: counting doesn't count.
Proceedings of the 2000 ICDCS Workshops, April 10, 2000, Taipei, Taiwan, ROC, 2000

Functional Dependencies in Controlling Sparsity of OLAP Cubes.
Proceedings of the Data Warehousing and Knowledge Discovery, 2000

Diluting ACID.
SIGMOD Rec., 1999

A Transactional Approach to Configuring Telecommunications Services.
Proceedings of the Databases in Telecommunications, 1999

Time, tense and aspect in natural language database interfaces.
Nat. Lang. Eng., 1998

A More Committed Quorum-Based Three Phase Commit Protocol.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Much Ado About Shared-Nothing.
SIGMOD Rec., 1996

A Framework for Natural Language Interfaces to Temporal Databases
CoRR, 1996

On the Complexity of Scheduling with Communication Delay and Contention.
Parallel Process. Lett., 1995

Natural language interfaces to databases - an introduction.
Nat. Lang. Eng., 1995

Experience Using TSQL2 in a Natural Language Interface
Proceedings of the Recent Advances in Temporal Databases, 1995

Strategies for Parallel Linear Recursive Query Processing.
Proceedings of the Rules in Database Systems, Second International Workshop, 1995

On the Scope of Applicability of the ETF Algorithm.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

Object-Oriented Database Technology Applied to Distributed Simulation.
Proceedings of the EUROSIM'96, 1995

There's Nothing Like Shared Nothing.
Proceedings of the Object Orientation with Parallelism and Persistence (the book grow out of a Dagstuhl Seminar in April 1995), 1995

Finding Compact Scheme Forests in Nested Normal Form is NP-Hard
Inf. Comput., April, 1994

Branching Transactions: A Transaction Model for Parallel Database Systems.
Proceedings of the Directions in Databases, 12th British National Conference on Databases, 1994

Models of Machines and Computation for Mapping in Multicomputers.
ACM Comput. Surv., 1993

Assigning dependency graphs onto processor networks.
Parallel Comput., 1991

Improved Recursion Handling Through Integrity Constraints.
Comput. J., 1991

Yet Another Note on Minimal Covers.
SIGMOD Rec., 1990

Conjectures and Refutations in Database Design and Dependency Theory.
Proceedings of the ICDT'90, 1990

Coping with Indefinite and Negative Data in Deductive Databases: A Survey.
Data Knowl. Eng., 1987

On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition.
BIT, 1987

Losslessness and Project-Join Constructibility in Relational Databases.
Acta Informatica, 1987

A Polynomial-Time Join Dependency Implication Algorithm for Multi-Valued Dependencies.
Proceedings of the ICDT'86, 1986

Linear time algorithm for finding a picture's connected components.
Image Vis. Comput., 1984

Do Embedded Dependencies Always Lead to a Wild Goose Chase?
Proceedings of the Third British National Conference on Databases (BNCOD 3), 1984

Testing a dependency-preserving decomposition for losslessness.
Inf. Syst., 1983

Enumerating the cycles of a digraph: A new preprocessing strategy.
Inf. Sci., 1982