Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
T. H. Merrett
2000 – 2009
- 2007
[j18]- 2005
- [c19]
- 2001
- [c18]
1990 – 1999
- 1996
- [j17]Heping Shang, T. H. Merrett: Tries for Approximate String Matching. IEEE Trans. Knowl. Data Eng. 8(4): 540-547 (1996)
- [c17]T. H. Merrett, Heping Shang, Xiaoyan Zhao: Database Structures, Based on Tries, for Text, Spatial, and General Data. CODAS 1996: 507-515
- 1993
- [c16]
- 1992
- [c15]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)
- [c14]T. H. Merrett, Heping Shang: Unifying Programming Languages and Databases: Scoping, Metadata, and Process Communication. DBPL 1991: 139-148
- 1990
- [j15]
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 Record 17(4): 56-61 (1988)
- [c13]
- 1987
- [c12]
- 1986
- [j11]T. H. Merrett, Ted van Rossum: A Functional Processor for the Relational Algebra on a Microcomputer. Softw., Pract. Exper. 16(11): 987-1002 (1986)
- 1985
- [j10]T. H. Merrett, B. Düchting: Relational storage and processing of two-dimensional diagrams. Computers & Graphics 9(3): 247-258 (1985)
- [c11]
- [c10]
- [c9]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 Record 14(1): 39-44 (1984)
- [j8]T. H. Merrett: Extending the Relational Algebra to Capture Less Meaning. SIGMOD Record 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]
- [j5]T. H. Merrett: Why Sort-Merge Gives the Best Implementation of the Natural Join. SIGMOD Record 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]
- [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
1970 – 1979
- 1979
- [c3]
- 1978
- [j3]T. H. Merrett: QT Logic: Simpler and More Expressive Than Predicate Calculus. Inf. Process. Lett. 7(6): 251-255 (1978)
- [c2]
- 1977
- [j2]
- [c1]
- 1971
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:31 CET by the dblp team