default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDT. H. Merrett
Refine list
refinements active!
zoomed in on 37 of 37 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2000 – 2009
- 2007
[j18]T. H. Merrett:
Aldat: A retrospective on a work in progress. Inf. Syst. 32(4): 505-544 (2007)- 2005
- [c18]T. H. Merrett:
CS++. IDEAS 2005: 287-288 - 2001
- [c17]T. H. Merrett:
Attribute Metadata for Relational OLAP and Data Mining. DBPL 2001: 97-118 - no results
1990 – 1999
- 1996
- [j17]Heping Shang, T. H. Merrett:
Tries for Approximate String Matching. IEEE Trans. Knowl. Data Eng. 8(4): 540-547 (1996) - [c16]T. H. Merrett, Heping Shang, Xiaoyan Zhao:
Database Structures, Based on Tries, for Text, Spatial, and General Data. CODAS 1996: 507-515 - 1993
- [c15]T. H. Merrett, Heping Shang:
Trie Methods for Representing Text. FODO 1993: 130-145 - 1992
- [c14]Ekow J. Otoo, Ron Lake, Wo-Shun Luk, T. H. Merrett, Hanan Samet:
Georgraphic Information Systems, A Challenge for the 90's (Panel). VLDB 1992: 263 - 1991
- [j16]T. H. Merrett:
Relixpert - An Expert System Shell Written in a Database Programming Language. Data Knowl. Eng. 6: 151-158 (1991) - [c13]T. H. Merrett, Heping Shang:
Unifying Programming Languages and Databases: Scoping, Metadata, and Process Communication. DBPL 1991: 139-148 - 1990
- [j15]T. H. Merrett:
Scoping is not Orthogonal to Completeness. Comput. J. 33(4): 381 (1990) - no results
1980 – 1989
- 1989
- [j14]A. Clouatre, Normand Laliberte, T. H. Merrett:
A General Implementation of Relational Recursion with Speedup Techniques for Programmers. Inf. Process. Lett. 32(5): 257-262 (1989) - [j13]T. H. Merrett, Normand Laliberte:
Including Scalars in a Programming Language Based on the Relational Algebra. IEEE Trans. Software Eng. 15(11): 1437-1443 (1989) - 1988
- [j12]T. H. Merrett, Louis Hamel:
Dynamic Multipaging in Even Less Space. SIGMOD Rec. 17(4): 56-61 (1988) - [c12]T. H. Merrett:
Experience with the Domain Algebra. JCDKB 1988: 335-346 - 1987
- [c11]T. H. Merrett:
Relix - First Steps to an Operating Language. POS 1987: 134-154 - 1986
- [j11]T. H. Merrett, Ted van Rossum:
A Functional Processor for the Relational Algebra on a Microcomputer. Softw. Pract. Exp. 16(11): 987-1002 (1986) - 1985
- [j10]T. H. Merrett, B. Düchting:
Relational storage and processing of two-dimensional diagrams. Comput. Graph. 9(3): 247-258 (1985) - [c10]T. H. Merrett:
Persistence and Aldat. Data Types and Persistence (Appin) 1985: 173-188 - [c9]T. H. Merrett, Brenda Fayerman:
Dynamic Patricia. FODO 1985: 19-29 - [i1]T. H. Merrett:
Persistence and Aldat. Data Types and Persistence (Appin), Informal Proceedings 1985: 35-48 - 1984
- [j9]T. H. Merrett:
Practical Hardware for Linear Execution of relational database Operations. SIGMOD Rec. 14(1): 39-44 (1984) - [j8]T. H. Merrett:
Extending the Relational Algebra to Capture Less Meaning. SIGMOD Rec. 14(3): 55-68 (1984) - [c8]Jack A. Orenstein, T. H. Merrett:
A Class of Data Structures for Associative Searching. PODS 1984: 181-190 - 1983
- [j7]Jack A. Orenstein, T. H. Merrett, Luc Devroye:
Linear Sorting with O(log n) Processors. BIT 23(2): 170-180 (1983) - [j6]Ekow J. Otoo, T. H. Merrett:
A storage scheme for extendible arrays. Computing 31(1): 1-9 (1983) - [j5]T. H. Merrett:
Why Sort-Merge Gives the Best Implementation of the Natural Join. SIGMOD Rec. 13(2): 39-51 (1983) - [c7]T. H. Merrett:
First Steps to Algebraic Processing of Text. ICOD-2 Workshop on New Applications of Data Bases 1983: 109-127 - 1982
- [j4]T. H. Merrett:
Comments on "Note on the Expected Size of a Join". SIGMOD Rec. 13(1): 13 (1982) - [c6]T. H. Merrett, Ekow J. Otoo:
Dynamic Multipaging: A Storage Structure for Large Shared Data Banks. JCDKB 1982: 237-255 - 1981
- [c5]T. H. Merrett, Yahiko Kambayashi:
Join Scheduling in a Paging Environment Using the Consecutive Retrieval Property. FODO 1981: 323-347 - [c4]T. H. Merrett, Yahiko Kambayashi, H. Yasuura:
Scheduling of Page-Fetches in Join Operations. VLDB 1981: 488-498 - no results
1970 – 1979
- 1979
- [c3]T. H. Merrett, Ekow J. Otoo:
Distribution Models of Relations. VLDB 1979: 418-425 - 1978
- [j3]T. H. Merrett:
QT Logic: Simpler and More Expressive Than Predicate Calculus. Inf. Process. Lett. 7(6): 251-255 (1978) - [c2]T. H. Merrett:
The Extended Relational Algebra, a Basis for Query Languages. JCDKB 1978: 99- - 1977
- [j2]T. H. Merrett:
Relations as Programming Language Elements. Inf. Process. Lett. 6(1): 29-33 (1977) - [c1]T. H. Merrett:
Database Cost Analysis: a Top-Down Approach. SIGMOD Conference 1977: 135-143 - 1971
- [j1]T. H. Merrett:
General Programs for Management Systems. Inf. Process. Lett. 1(1): 17-20 (1971) - no results
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.
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.
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.
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 2025-07-02 18:54 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:
