default search action
Peter Thanisch
Person information
- affiliation: University of Edinburgh, Scotland, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
- [j21]Peter Thanisch, Tapio Niemi, Jyrki Nummenmaa
, Marko Niinimäki:
Detecting measurement issues in SQL arithmetic expressions and aggregations. Data Knowl. Eng. 122: 116-129 (2019) - 2014
- [j20]Tapio Niemi, Marko Niinimäki
Detecting summarizability in OLAP. Data Knowl. Eng. 89: 1-20 (2014) - [j19]Jukka Kommeri, Felipe Abaunza, Marko Niinimäki, Peter Thanisch, Tapio Niemi:
Energy Efficiency of a Web and Database Server System: Configuration and Bursting. Int. J. Green Comput. 5(2): 29-48 (2014) - 2003
- [j18]Tapio Niemi, Jyrki Nummenmaa
Normalising OLAP cubes for controlling sparsity. Data Knowl. Eng. 46(3): 317-343 (2003) - 2000
- [j17]Peter Thanisch:
Atomic commit in concurrent computing. IEEE Concurr. 8(4): 34-41 (2000) - 1999
- [j16]Tim Kempster, Colin Stirling, Peter Thanisch:
Diluting ACID. SIGMOD Rec. 28(4): 17-23 (1999) - 1998
- [j15]Ion Androutsopoulos, Graeme D. Ritchie, Peter Thanisch:
Time, tense and aspect in natural language database interfaces. Nat. Lang. Eng. 4(3): 229-276 (1998) - 1996
- [j14]Michael G. Norman, Thomas Zurek, Peter Thanisch:
Much Ado About Shared-Nothing. SIGMOD Rec. 25(3): 16-21 (1996) - 1995
- [j13]Ion Androutsopoulos, Graeme D. Ritchie, Peter Thanisch:
Natural language interfaces to databases - an introduction. Nat. Lang. Eng. 1(1): 29-81 (1995) - [j12]Michael G. Norman, Susanna Pelagatti, Peter Thanisch:
On the Complexity of Scheduling with Communication Delay and Contention. Parallel Process. Lett. 5: 331-341 (1995) - 1994
- [j11]Peter Thanisch, George Loizou, Jyrki Nummenmaa:
Finding Compact Scheme Forests in Nested Normal Form is NP-Hard. Inf. Comput. 110(1): 19-41 (1994) - 1993
- [j10]Michael G. Norman, Peter Thanisch:
Models of Machines and Computation for Mapping in Multicomputers. ACM Comput. Surv. 25(3): 263-302 (1993) - 1991
- [j9]K. Wicovsky, Peter Thanisch, M. Howard Williams:
Improved Recursion Handling Through Integrity Constraints. Comput. J. 34(3): 282-285 (1991) - [j8]Sathiamoorthy Manoharan
Assigning dependency graphs onto processor networks. Parallel Comput. 17(1): 63-73 (1991) - 1990
- [j7]Jyrki Nummenmaa
Yet Another Note on Minimal Covers. SIGMOD Rec. 19(3): 30 (1990) - 1987
- [j6]George Loizou, Peter Thanisch:
Losslessness and Project-Join Constructibility in Relational Databases. Acta Informatica 24(2): 131-144 (1987) - [j5]George Loizou, Peter Thanisch:
On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition. BIT 27(2): 157-162 (1987) - [j4]P. Chisholm, G. Chen, D. Ferbrache, Peter Thanisch, M. Howard Williams:
Coping with Indefinite and Negative Data in Deductive Databases: A Survey. Data Knowl. Eng. 2: 259-284 (1987) - 1984
- [j3]Peter Thanisch, B. V. McNally, Annie Robin
Linear time algorithm for finding a picture's connected components. Image Vis. Comput. 2(4): 191-197 (1984) - 1983
- [j2]George Loizou, Peter Thanisch:
Testing a dependency-preserving decomposition for losslessness. Inf. Syst. 8(1): 25-27 (1983) - 1982
- [j1]George Loizou, Peter Thanisch:
Enumerating the cycles of a digraph: A new preprocessing strategy. Inf. Sci. 27(3): 163-182 (1982)
Conference and Workshop Papers
- 2014
- [c23]Zheying Zhang, Peter Thanisch, Jyrki Nummenmaa
Detecting Missing Requirements in Conceptual Models. ICIST 2014: 248-259 - [c22]Jussi-Matti Salmela, Peter Thanisch, Olli Sotamaa
Games and energy: profiling power usage during play. MindTrek 2014: 192-199 - 2013
- [c21]Peter Thanisch, Jyrki Nummenmaa
Cell-at-a-Time Approach to Lazy Evaluation of Dimensional Aggregations. DaWaK 2013: 349-358 - [c20]Peter Thanisch, Tapio Niemi, Jyrki Nummenmaa, Zheying Zhang
Incompleteness in Conceptual Data Modelling. ICIST 2013: 159-172 - 2011
- [c19]Peter Thanisch, Tapio Niemi, Marko Niinimäki, Jyrki Nummenmaa
Using the Entity-Attribute-Value Model for OLAP Cube Construction. BIR 2011: 59-72 - [c18]Marko Niinimäki, Tapio Niemi, Stephen Martin, Jyrki Nummenmaa
Timely Report Production from WWW Data Sources. BIR Workshops 2011: 184-195 - 2003
- [c17]Tapio Niemi, Marko Niinimäki, Jyrki Nummenmaa, Peter Thanisch:
Applying Grid Technologies to XML Based OLAP Cube Construction. DMDW 2003 - 2002
- [c16]Tapio Niemi, Marko Niinimäki, Jyrki Nummenmaa
Constructing an OLAP cube from distributed XML data. DOLAP 2002: 22-27 - 2001
- [c15]Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch:
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation. DMDW 2001: 7 - [c14]Tapio Niemi, Jyrki Nummenmaa
Constructing OLAP Cubes Based on Queries. DOLAP 2001: 9-15 - 2000
- [c13]Tapio Niemi, Jyrki Nummenmaa
Functional Dependencies in Controlling Sparsity of OLAP Cubes. DaWaK 2000: 199-209 - [c12]Tim Kempster, Colin Stirling, Peter Thanisch:
Games-Based Model Checking of Protocols: counting doesn't count. ICDCS Workshop on Distributed System Validation and Verification 2000: E111-E117 - 1999
- [c11]Tim Kempster, Gordon J. Brebner, Peter Thanisch:
A Transactional Approach to Configuring Telecommunications Services. Databases in Telecommunications 1999: 40-53 - 1998
- [c10]Tim Kempster, Colin Stirling, Peter Thanisch:
A More Committed Quorum-Based Three Phase Commit Protocol. DISC 1998: 246-257 - 1995
- [c9]Peter Thanisch, Michael G. Norman:
There's Nothing Like Shared Nothing. Object Orientation with Parallelism and Persistence 1995: 217-230 - [c8]Pat E. Heywood, G. MacKechnie, Rob Pooley, Peter Thanisch:
Object-Oriented Database Technology Applied to Distributed Simulation. EUROSIM 1995: 291-296 - [c7]Cristina Boeres, George Chochia, Peter Thanisch:
On the Scope of Applicability of the ETF Algorithm. IRREGULAR 1995: 159-164 - [c6]Thomas Zurek, Peter Thanisch:
Strategies for Parallel Linear Recursive Query Processing. Rules in Database Systems 1995: 213-229 - [c5]Ion Androutsopoulos, Graeme D. Ritchie, Peter Thanisch:
Experience Using TSQL2 in a Natural Language Interface. Temporal Databases 1995: 113-132 - 1994
- [c4]Albert G. Burger, Peter Thanisch:
Branching Transactions: A Transaction Model for Parallel Database Systems. BNCOD 1994: 121-136 - 1990
- [c3]Jyrki Nummenmaa
Conjectures and Refutations in Database Design and Dependency Theory. ICDT 1990: 215-228 - 1986
- [c2]Peter Thanisch, George Loizou:
A Polynomial-Time Join Dependency Implication Algorithm for Multi-Valued Dependencies. ICDT 1986: 397-408 - 1984
- [c1]George Loizou, Peter Thanisch:
Do Embedded Dependencies Always Lead to a Wild Goose Chase? BNCOD 1984: 41-56
Informal and Other Publications
- 1998
- [i3]Ion Androutsopoulos, Graeme D. Ritchie, Peter Thanisch:
Time, Tense and Aspect in Natural Language Database Interfaces. CoRR cmp-lg/9803002 (1998) - 1996
- [i2]Ion Androutsopoulos, Graeme D. Ritchie, Peter Thanisch:
A Framework for Natural Language Interfaces to Temporal Databases. CoRR cmp-lg/9611006 (1996) - 1995
- [i1]Ion Androutsopoulos, Graeme D. Ritchie, Peter Thanisch:
Natural Language Interfaces to Databases - An Introduction. CoRR cmp-lg/9503016 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: